A comparison of nature inspired heuristics on the traveling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1917, Issue , 2000, Pages 661-670

  Stiilzlc, Thomas ^a,b   Grün, Andreas ^a   Linke, Sebastian ^a   Riitiger, Marco ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BIOMIMETICS; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION);

ALGORITHMIC IDEAS; LOCAL SEARCH ALGORITHM; NATURE INSPIRED ALGORITHMS; STANDARD TESTS;

TRAVELING SALESMAN PROBLEM;

EID: 84888810778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_65     Document Type: Conference Paper

References (28)

1. E. H. L. Aarts and J. Korst. Simulated Annealing and Bollzman Machines. John Wiley & Sons, Chichester, 1989.
2. J. L. Bentley. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4(4):387-411, 1992.
3. II. Borsini, M. Dorigo, S. Lnngcrman, G. Scront, and L. Ganibardclla. Results of the first international contest on evolutionary optimisation. In Proc, oflCEC’96, pages 611-615, 1996.
4. M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11-32. McGraw Hill, 1999.
5. M. Dorigo and L. M. Gambardella. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Trans, on Evolutionary Computation, 1:53-66, 1997.
6. D. B. Fogel. Applying evolutionary programming to selected travelling salesman problems. Cybernetics and Systems, 24:27-36, 1993.
7. B. Freislebcn and P. Merz. New genetic local search operators for the traveling salesman problem. In Proc. ofPPSN-IV, volume 1141 of LNCS, pages 890-900. Springer, 1996.
8. M. Gorges-Schleuter. Asparagos96 and the travelling salesman problem. In Proc. of ICEC’97, pages 171-174, 1997.
9. H.H. Hoos and T. Stiitzle. Evaluating Las Vegas algorithms — pitfalls and remedies. In Proc. of the I4lh Conference on Uncertainty in Al, pages 238-245. Morgan Kaufmann, 1998.
10. J. J. Hoplicld and D. Tank. Neural computations of decisions in optimization problems. Biological Cybernetics, 52:141-152, 1985.
11. J. Houdayer and O. C. Martin. Renormalization for discrete optimization. Physical Review £i«erj, 83(5): 1030-1033, 1999.
12. D. S. Johnson and L. A. McGeoch. The travelling salesman problem: A case study in local optimization. In E.H.L. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215-310. John Wiley & Sons, Chichester, England, 1997.
13. K. Katayama and H. Narihisa. Iterated local search approach using genetic transformation to the traveling salesman problem. In Proc. of GECCO’99, pages 321-328. Morgan Kaufmann, 1999.
14. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
15. J. Lee and M. Y. Choi. Optimization by mullicanonical annealing and the traveling salesman problem. Physical Review E, 50(2):651-654, 1994.
16. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the travelling salesman problem. Operations Research, 21:49.8-516, 1973.
17. O. Martin and S. W. Otto. Combining simulated annealing with local search heuristics. Annals of Operations Research, 63:57-75, 1996.
18. O. Martin, S. W. Otto, and E. W. Fellen. Large-step Markov chains for the traveling salesman problem. Complex Systems, 5(3):299-326, 1991.
19. P. Merz and B Freislebcn. Genetic local search for the TSP: New results. In Proc. of ICEC’97, pages 159-164. IEEE Press, 1997.
20. P. Merz, and B. Freislebcn. Fitness landscapes and mcmctic algorithm design. In D. Come, M. Dorigo, and F.GIovcr, editors, New Ideas in Optimization, pages 244-260. McGraw Hill, 1999.
21. A. Möbius, B. Freislebcn, P. Merz, and M. Schreiber. Combinatorial optimization by iterative partial transcription. Physical Review E, 59(4):4667-4674, 1999.
22. Y. Nagata and S. Kobayashi. Edge assembly crossover: A higlvpower genetic algorithm for the traveling salesman problem. In Proc. of ICGA’97, pages 450-457. Morgan Kaufmann, 1997.
23. G. Rcinclt. The Traveling Salesman: Computational Solutions for TSP Applications, volume 840 of LNCS. Springer, 1994.
24. T. Stiitzle. Local Search Afgorithms for Combinatorial Problems— Analysis, Improvements, and New Applications. PhD thesis, Darmstadt University of Technology, Department of Computer Science, 1998.
25. T. Stiitzle and M. Dorigo. ACO algorithms for the traveling salesman problem. In K. Micttincn et al., editor, Evolutionary Algorithms in Engineering and Computer Science, pages 163-183. Wiley, 1999.
26. T. Stiitzle and H. H Hoos. Analyzing the run-time behaviour of iterated local search for the TSP. Technical Report IRÎJBJA-4-00, IRIDIA, Université Libre de Bruxelles, 2000.
27. T. Stiitzle and H. H Hoos. "MAX-MlAf Ant System. Future Generation Computer Systems, 16(8):889-914, 2000.
28. T. Walters. Repair and brodd selection in the traveling salesman problem. In Proc. of PPSN-V, volume 1498 of LNCS, pages 813-822. Springer, 1998.