A new memetic algorithm for the asymmetric traveling salesman problem

Journal of Heuristics

Volumn 10, Issue 5, 2004, Pages 483-506

  Buriol, Luciana ^a   França, Paulo M ^a   Moscato, Pablo ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Asymmetric traveling salesman problem; Local search; Memetic algorithms; Metaheuristics

Indexed keywords

ALGORITHMS; HAMILTONIANS; HEURISTIC METHODS; NEURAL NETWORKS; TOPOLOGY;

LOCAL SEARCH; MEMETIC ALGORITHMS; METAHEURISTICS;

TRAVELING SALESMAN PROBLEM;

EID: 6944232635     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:HEUR.0000045321.59202.52     Document Type: Article

References (45)

1. Balas, E. and P. Toth. (1985). "Branch-and Bound Methods," In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, and D.B. Shmoys (eds.), The Traveling Salesman Problem. John Wiley and Sons.
2. Bentley, J.L. (1990). "Experiments on Traveling Salesman Heuristics." In Proceedings of the First Annual ACM-SIAM Symposium on Computational Geometry, pp. 91-99.
3. Berretta, R. and P. Moscato. (1999). "The Number Partitioning Problem: An Open Challenge for Evolutionary Computation." In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, Chapter 17. McGraw-Hill.
4. Carpaneto, G., M. Dell'Amico, and P. Toth. (1995). "Exact Solution of Large-Scale Asymmetric Traveling Salesman Problems." ACM Transactions on Mathematical Software 21(4), 394-409.
5. Choi, I.-C., S.-I. Kim, and H.-S. Kim. (2003). "A Genetic Algorithm with a Mixed Region Search for the Asymmetric Traveling Salesman Problem." Computers & Operations Research 30(5), 773-786.
6. Cirasella, J., D.S. Johnson, L.A. McGeoch, and W. Zhang. (2001). "The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests." In A.L. Buchsbaum and J. Snoeyink, (eds.), Proceedings of ALENEX01, Springer Lecture Notes in Computer Science 2153, pp. 32-59.
7. Fiechter, C.-N. (1994). "A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems." Discrete Applied Mathematics 51, 243-267.
8. Fischetti, M. and P. Toth. (1997). "A Polyhedral Approach to the Asymmetric Traveling Salesman Problem." Management Science 43(11), 1520-1536.
9. Fischetti, M., P. Toth, and D. Vigo. (1994). "A Branch-and Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs." Operations Research 42, 846-859.
10. França, P.M., A.S. Mendes, and P. Moscato. (2001). "A Memetic Algorithm for the Total Tardiness Single Machine Scheduling Problem." European Journal of Operational Research 132, 224-242.
11. Freisleben, B. and P. Merz. (1996). "A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems." In Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 616-621.
12. Garey, M.R. and D.S. Jonhson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman.
13. Glover, F. (1996). "Finding a Best Traveling Salesman 4-opt Move in the Same Time as a Best 2-opt Move." J. Heuristics 2(2), 169-179.
14. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.
15. Gorges-Schleuter, M. (1989). "ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy." In J.D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms, pp. 422-427.
16. Gorges-Schleuter, M. (1997). "Asparagos96 and the Traveling Salesman Problem." In T. Baeck, Z. Michalewicz, and X. Yao (eds.), Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 171-174.
17. Gutin, G. and A.P. Punnen. (2002). The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers.
18. Helsgaun, K. (2000). "An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic." European Journal of Operational Research 126(1), 106-130.
19. Holstein, D. and P. Moscato. (1999). "Memetic Algorithms Using Guided Local Search: A Case Study." In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, Chapter 15 McGraw-Hill.
20. Johnson, D.S. and L.A. McGeoch. (1997). "The Traveling Salesman Problem: A Case Study." In E. Aarts and J. K. Lenstra (eds.), Local Search in Combinatorial Optimization. John Wiley & Sons.
21. Johnson, D.S., G. Gutin, L.A. McGeoch, A. Yeo, W. Zhang, and A. Zverovich. (2002). "The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators and Tests." In Gregory Gutin and Abraham P. Punnen (eds.), The Traveling Salesman Problem and its Variations, Chapter 10. Kluwer Academic Publishers, pp. 445-488.
22. Jünger, M., G. Reinelt, and G. Rinaldi. (1995). "The Traveling Salesman Problem." In M. Ball, T. Magnanti, C.L. Monma, and G.L. Nemhauser (eds.), Handbooks in Operations Research and Management Sciences: Networks. North-Holland.
23. Kanellakis, P.C. and C.H. Papadimitriou. (1980). "Local Search for the Asymmetric Traveling Salesman Problem." Operations Research 28(5), 1086-1099.
24. Karp, R.M. (1977). "Probabilistic Analysis of Partitioning Algorithms for the Traveling Salesman Problem in the Plane." Math. Operational Research 1, 209-224.
25. Karp, R.M. (1979). "A Patching Algorithm for the Nonsymmetric Traveling Salesman Problem." SIAM J. Comput. 8, 561-573.
26. Laporte, G. (1992). "The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms." European Journal of Operational Research 59(2), 231-247.
27. Lin, S. and B.W. Kernighan. (1973), "An Effective Heuristic Algorithm for the Traveling Salesman Problem." Operations Research 21(2), 498-516.
28. Mendes, A.S., F.M. Müller, P.M. França, and P. Moscato. (2002). "Comparing Metaheuristic Approaches for Parallel Machine Scheduling Problems with Sequence Dependent Setup Times." Production Planning & Control 13, 143-154.
29. Merz, P. and B. Freisieben. (1997). "Genetic Local Search for the TSP: New Results." In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 159-164.
30. Merz P. and B. Freisleben. (2001). "Memetic Algorithms for the Traveling Salesman Problem." Complex Systems 13(4), 297-345.
31. Miller, D.L. and J.F. Pekny. (1991). "Exact Solution of Large Asymmetric Traveling Salesman Problems." Science 251, 754-761.
32. Moscato, P. (1989). "On Evolution, Search, Optimization, Genetic Algorithms, and Martial Arts: Towards Memetic Algorithms." Technical Report, Caltech Concurrent Computation Program, C3P Report 826.
33. Moscato, P. and M.G. Norman. (1992). "A Memetic Approach for the Traveling Salesman Problem. Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems." In M. Valero, E. Onate, M. Jane, J.L. Larriba, and B. Suarez (eds.), Parallel Computing and Transputer Applications. IOS Press, pp. 187-194.
34. Moscato, P. and F. Tinetti. (1992). "Blending Heuristics with a Population-Based Approach: A Memetic Algorithm for the Traveling Salesman Problem." CeTAD, Report 92-12. Universidad National de La Plata, Argentina.
35. Moscato, P. (1993). "An Introduction to Population Approaches for Optimization and Hierarchical Objective Functions: A Discussion on the Role of Tabu Search." Annals of Operations Research 41, 85-121.
36. Moscato, P. (1999). "Memetic Algorithms: A Short Introduction. " In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. McGraw-Hill.
37. Nagata, Y. and S. Kobayashi. (1997). "Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem." In Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 450-457.
38. Paechter, B., A. Cumming, M.G. Norman, and H. Luchian. (1996). "Extensions to a Memetic Timetabling System." In E.K. Burke and P. Ross (eds.), The Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol. 1153. Springer Verlag, pp. 251-265.
39. Potvin, J.Y. (1993). "The Traveling Salesman Problem: A Neural Network Perspective." ORSA Journal on Computing 5, 328-348.
40. Reinelt, G. (1991). "TSPLIB - A Traveling Salesman Library." ORSA Journal on Computing 3, 376-384.
41. Stützle, T. and M. Dorigo. (1999). "ACO Algorithms for the Traveling Salesman Problem." In K. Miettinen, M. Makela, P. Neittaanmaki, J. Periauz (eds.). Evolutionary Algorithms in Engineering and Computer Science. Wiley.
42. Walters, T. (1998). "Repair and Brood Selection in the Traveling Salesman Problem." In A.E. Eiben, T. Bäch, M. Schoenauer, and H.P. Schwefel (eds.), Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature, pp. 813-822.
43. Whitley, D., T. Starkweather, and D. Shaner, (1991). "The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination." In L. Davis (ed.), Handbook of Genetic Algorithms, pp. 350-372.
44. Zhang, W. (1993). "Truncated Branch-and-Bound: A Case Study on the Asymmetric TSP." In Proceedings of Spring Symposium on AI and NP-Hard Problems, pp. 160-166.
45. Zhang, W. (2000). "Depth-First Branch-and-Bound versus Local Search: A Case Study." In Proceedings of 17th National Conf. on Artificial Intelligence (AAAI), pp. 930-935.