Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem

Applegate, D., Bixby, R., Chvátal, V., Cook, W. (2001), "TSP cuts which do not conform to the template paradigm", in Jünger, M., Naddef, D., (Eds), Computational Combinatorial Optimization, Springer, London, pp. 261-303.10.1007/3-540-45586-8_7Search in Google Scholar

Bosman, P., Thierens, D. (1999), "On the modelling of evolutionary algorithms", in Postma, E., Gyssens, M. (Eds), Proceedings of the 11th Belgium-Netherlands Conference on Artificial Intelligence, BNAIC, Vaeshartelt, pp. 67-74.Search in Google Scholar

Djordjevic, M., Brodnik, A. (2011), "Quantitative analysis of separate and combined performance of local searcher and genetic algorithm", in Proceedings of the 33rd International Conference on Information Technology Interfaces, ITI2011, Faculty of Mathematics, Natural Sciences & Information Technologies, University of Primorska, Koper, pp. 515-520.Search in Google Scholar

Djordjevic, M., Tuba, M., Djordjevic, B. (2009), "Impact of Grafting a 2-opt Algorithm Based Local Searcher Into the Genetic Algorithm", in Proceedings of the 9th WSEAS international conference on Applied informatics and communications, World Scientific and Engineering Academy and Society (WSEAS), Stevens Point, pp. 485-490.Search in Google Scholar

Dorigo, M., Gambardella, L. M. (1997), "Ant colony system: A cooperative learning approach to the traveling salesman problem", IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp. 53-66.10.1109/4235.585892Search in Google Scholar

Engels, C., Manthey, B. (2009), "Average-case approximation ratio of the 2-opt algorithm for the TSP", Operations Research Letters, Vol. 37, No. 2, pp. 83-84.10.1016/j.orl.2008.12.002Search in Google Scholar

Freisleben, B., Merz, P. (1996), "New genetic local search operators for the traveling salesman problem", in Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, Springer, London, pp. 890-899.10.1007/3-540-61723-X_1052Search in Google Scholar

Garey, M. R., Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness, New York: WH Freeman & Co.Search in Google Scholar

Gutin, G., Punnen, A. P. (2002). The Traveling Salesman Problem and Its Variations, Dordrecht: Kluwer Academic Publishers.Search in Google Scholar

Hahsler, M., Hornik, K. (2007), "TSP-Infrastructure for the traveling salesperson problem", Journal of Statistical Software, Vol. 23, No. 2, pp. 1-21.10.18637/jss.v023.i02Search in Google Scholar

Haupt, R. L., Haupt, S. E. (2004). Practical Genetic Algorithms, 2nd ed., New York: John Wiley & Sons.Search in Google Scholar

Helsgaun, K. (2000), "An effective implementation of the Lin-Kernighan traveling salesman heuristic", European Journal of Operational Research, Vol. 126, No. 1, pp. 106-130.10.1016/S0377-2217(99)00284-2Search in Google Scholar

Holland, J. (1975). Adaptation in natural and artificial systems, Ann Arbor: The University of Michigan Press.Search in Google Scholar

Hoos, H. H., Stützle, T. (2005). Stochastic local search: Foundations and applications, Waltham: Morgan Kaufmann.Search in Google Scholar

Merz, P., Freisleben, B. (2001), "Memetic algorithms for the traveling salesman problem", Complex Systems, Vol. 13, No. 4, pp. 297-345.Search in Google Scholar

Reinelt, G. (1991), "TSPLIB - A traveling salesman problem library", ORSA Journal on Computing, Vol. 3, No. 4, pp. 376-384.10.1287/ijoc.3.4.376Search in Google Scholar

Sels, V., Vanhoucke, M. (2011), "A hybrid dual-population genetic algorithm for the single machine maximum lateness problem", in Merz, P., Hao, J. K., (Eds), Evolutionary Computation in Combinatorial Optimization, Springer, Berlin, pp. 14-25.10.1007/978-3-642-20364-0_2Search in Google Scholar