Abstract
In this paper we present a computational study of how different local search methods and the choice of an algorithm stage in which they are applied affect the performance of Memetic Algorithm (MA) solving Asymmetric Traveling Salesman Problem (ATSP). This study contains a comparison of quality of solutions obtained (both in terms of the value of the objective function and the performance time of the method) by sixteen variants of the Memetic Algorithm. Considerable amount of a given problem’s instance and Wilcoxon Signed-Rank Test were used to ensure the impartiality of gained results.
Author supplied keywords
Cite
CITATION STYLE
Szwarc, K., & Boryczka, U. (2017). A Comparative Study of Different Variants of a Memetic Algorithm for ATSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10449 LNAI, pp. 76–86). Springer Verlag. https://doi.org/10.1007/978-3-319-67077-5_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
