Genetic algorithms for the traveling salesman problem

Annals of Operations Research

Volumn 63, Issue , 1996, Pages 339-370

  Potvin, Jean Yves ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Genetic algorithms; Stochastic search; Traveling salesman problem

Indexed keywords

EID: 21344432074     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/bf02125403     Document Type: Article

References (32)

1. E.H.L. Aarts, J.H.M. Korst and P.J.M. van Laarhoven, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem, J. Statist. Phys. 50(1988) 189-206.
2. J.D. Bagley, The behavior of adaptive systems which employ genetic and correlation algorithms, Doctoral Dissertation, University of Michigan, Dissertation Abstracts International 28(12), 5106B (1967).
3. J. Bentley, Fast algorithms for geometric salesman problems, ORSA J. Comp. 4(1992)387-411.
4. J.L. Blanton and R.L. Wainwright, Multiple vehicle routing with time and capacity constraints using genetic algorithms, in: Proc. 5th Int. Conf. on Genetic Algorithms (ICGA '93), University of Illinois at Urbana-Champaign, Champaign, IL (1993) pp. 452-459.
5. L. Bodin, B.L. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews: The state of the art, Comp. Oper. Res. 10(1983)63-211.
6. R.M. Brady, Optimization strategies gleaned from biological evolution, Nature 317(1985) 804-806.
7. H. Braun, On solving travelling salesman problems by genetic algorithms, in: Parallel Problem-Solving from Nature, ed. H.P. Schwefel and R. Manner, Lecture Notes in Computer Science 496 (Springer) pp. 129-133.
8. V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, J. Optim. Theory Appl. 45(1985)41-55.
9. L. Davis, Applying adaptive algorithms to epistactic domains, in: Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI '85), Los Angeles, CA (1985) pp. 162-164.
10. K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, Doctoral Dissertation, University of Michigan, Dissertation Abstracts International 36(10), 5140B (1975).
11. C.N. Fiechter, A parallel tabu search algorithm for large scale traveling salesman problems, Working paper 90/1, Department of Mathematics, Ecole Polytechnique Fédérale de Lausanne, Switzerland (1990).
12. L.J. Fogel, A.J. Owens and M.J. Walsh, Artificial Intelligence through Simulated Evolution (Wiley, 1966).
13. B.R. Fox and M.B. McMahon, Genetic operators for sequencing problems, in: Foundations of Genetic Algorithms, ed. J.E. Rawlins (Morgan Kaufmann, 1991) pp. 284-300.
14. P.S. Gabbert, D.E. Brown, C.L. Huntley, B.P. Markowitz and D.E. Sappington, A system for learning routes and schedules with genetic algorithms, in: Proc. 4th Int. Conf. on Genetic Algorithms (ICGA '91), University of California at San Diego, San Diego, CA (1991) pp. 430-436.
15. M. Gendreau, A. Hertz and G. Laporte, New insertion and post-optimization procedures for the traveling salesman problem, Oper. Res. 40(1992)1086-1094.
16. F. Glover, Tabu search, Part I, ORSA J. Comp. 1(1989)190-206.
17. F. Glover, Tabu Search, Part II, ORSA J. Comp. 2(1990)4-32.
18. D.E. Goldberg and R. Lingle, Alleles, loci and the traveling salesman problem, in: Proc. 1st Int. Conf. on Genetic Algorithms (ICGA '55), Carnegie-Mellon University, Pittsburg, PA (1985) pp. 154-159.
19. B.L. Golden and W.R. Stewart, Empirical analysis of heuristics, in: The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, ed. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (Wiley, 1985).
20. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, 1989).
21. M. Gorges-Schleuter, ASPARAGUS: An asynchronous parallel genetic optimization strategy, in: Proc. 3rd Int. Conf. on Genetic Algorithms (ICGA '89), George Mason University, Fairfax, VA (1989) pp. 422-427.
22. J. Grefenstette, R. Gopal, B.J. Rosmaita and D.V. Gucht, Genetic algorithms for the traveling salesman problem, in: Proc. 1st. Int. Conf. on Genetic Algorithms (ICGA '85), Carnegie-Mellon University, Pittsburgh, PA (1985) pp. 160-168.
23. J. Grefenstette, Incorporating problem specific knowledge into genetic algorithms, in: Genetic Algorithms and Simulated Annealing, ed. L. Davis (Morgan Kaufmann, 1987) pp. 42-60.
24. M. Grötschel and O. Holland, Solution of large-scale symmetric traveling salesman problems, Report 73, Institut für Mathematik, Universität Augsburg (1988).
25. M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees, Oper. Res. 18(1970)1138-1162.
26. J.H. Holland, Adaptation in Natural and Artificial Systems (The University of Michigan Press, Ann Arbor, 1975); reprinted by MIT Press, 1992.
27. A. Homaifar, S. Guan and G. Liepins, A new approach to the traveling salesman problem by genetic algorithms, in: Proc. 5th Int. Conf. on Genetic Algorithms (ICGA '93), University of Illinois at Urbana-Champaign, Champaign, IL (1993) pp. 460-466.
28. J.J. Hopfield and D.W. Tank, Neural computation of decisions in optimization problems, Biol. Cybern. 52(1985)141-152.
29. P. Jog, J.Y. Suh and D.V. Gucht, The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem, in: Proc. 3rd Int. Conf. on Genetic Algorithms (ICGA '89), George Mason University, Fairfax, VA (1989) pp. 110-115.
30. D.S. Johnson, Local optimization and the traveling salesman problem, in: Automata, Languages and Programming, ed. G. Goos and J. Hartmanis, Lecture Notes in Computer Science 443 (Springer, 1990) pp. 446-461.
31. R.L. Karg and G.L. Thompson, A heuristic approach to solving traveling salesman problems, Manag. Sci. 10(1964)225-248.
32. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671-680.