Abstract
This articles introduces a (μ + 1)-EA, which is proven to be an exact TSP problem solver for a population of exponential size. We will show non-trivial upper bounds on the runtime until an optimum solution has been found. To the best of our knowledge this is the first time it has been shown that an \(\mathcal{NP}\)-hard problem is solved exactly instead of approximated only by a black box algorithm.
This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center ”Computational Intelligence” (SFB 531).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Implementing the dantzig-fulkerson-johnson algorithm for large traveling salesman problems. Mathematical Programming 97, 91–153 (2003)
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (2007)
Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. In: GECCO 2008: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp. 539–546. ACM, New York (2008)
Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-opt algorithm for the TSP: extended abstract. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 1295–1304. SIAM, Philadelphia (2007)
Forrest, S.: Genetic algorithms. ACM Computing Surveys 28, 77–80 (1996)
Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. In: GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 797–804. ACM, New York (2007)
Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 415–426. Springer, Heidelberg (2003)
Giel, O., Wegener, I.: Maximum cardinality matchings on trees by randomized local search. In: GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pp. 539–546. ACM, New York (2006)
Goldbarg, E.F.G., de Souza, G.R., Goldbarg, M.C.: Particle swarm for the traveling salesman problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 99–110. Springer, Heidelberg (2006)
Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. In: Proceedings of the 1961 16th ACM national meeting, pp. 71.201–71.204. ACM Press, New York (1961)
Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization, pp. 215–310. Wiley, Chichester (1997)
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling-salesman problem. Operations Research 21, 498–516 (1973)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Nagata, Y.: Fast eax algorithm considering population diversity for traveling salesman problems. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 171–182. Springer, Heidelberg (2006)
Neumann, F., Reichel, J.: Approximating minimum multicuts by evolutionary multi-objective algorithms. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 72–81. Springer, Heidelberg (2008)
Neumann, F., Reichel, J., Skutella, M.: Computing minimum cuts by randomized search heuristics. In: Proc. of the 10th Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 779–786 (2008)
Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378(1), 32–40 (2007)
Reichel, J., Skutella, M.: Evolutionary algorithms and matroid optimization problems. In: Proc. of the 9th Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 947–954 (2007)
Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 349–366 (2004)
Wegener, I.: Randomized search heuristics as an alternative to exact optimization. In: Lenski, W. (ed.) Logic versus Approximation. LNCS, vol. 3075, pp. 138–149. Springer, Heidelberg (2004)
Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 44–56. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Theile, M. (2009). Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm. In: Cotta, C., Cowling, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2009. Lecture Notes in Computer Science, vol 5482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01009-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-01009-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01008-8
Online ISBN: 978-3-642-01009-5
eBook Packages: Computer ScienceComputer Science (R0)