A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Computers and Operations Research

Volumn 30, Issue 5, 2003, Pages 773-786

  Choi, In Chan ^a   Kim, Seong In ^a   Kim, Hak Soo ^b  

^a Korea University   (South Korea)

^b Samsung SDI   (South Korea)

Author keywords

Asymmetric traveling salesman problems; Combinatorial optimization; Genetic algorithm; Heuristic procedure; Mixed region search

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

ASYMMETRIC PROBLEMS;

TRAVELING SALESMAN PROBLEM;

GENETIC ALGORITHM;

EID: 0037394108     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00050-3     Document Type: Article

References (29)

1. Laporte G. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 1992;59:345-58.
2. Chan D, Mercier D. IC insertion: an application of the traveling salesman problem. International Journal of Production Research 1989;27:1837-41.
3. Litke J. An improved solution to the traveling salesman problem with thousands of nodes. Communications of the ACM 1984;27:1227-36.
4. Lawler E, Lenstra J, Rinnooy Kan A, Shmoys D. The traveling salesman problem: a guided tour of combinatorial optimazation. New York: Wiley, 1985.
5. Lin S, Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operations Research 1973;21:498-516.
6. Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Evanston, IL: Northwestern University, 1976.
7. Knox J. Tabu search performance on the symmetric traveling salesman problem. Computers and Operations Research 1994;21:867-76.
8. Tsubakitani S, Evans J. Optimizing tabu list size for the traveling salesman problem. Computers and Operations Research 1998;25:91-7.
9. Bui T, Moon B. A new genetic approach for the traveling salesman problem. Proceedings of the First IEEE Conference on Evolution Computation 1994;2:7-13.
10. Poon P, Carter J. Genetic algorithm crossover operations for ordering applications. Computers and Operations Research 1995;22:135-47.
11. Potvin J. Genetic algorithm for the traveling salesman problem. Annals of Operations Research 1996;63:339-70.
12. Chatterjee S, Carrera C, Lynch L. Genetic algorithms and traveling salesman problems. European Journal of Operational Research 1996;93:490-510.
13. Schmitt L, Amini M. Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: an empirical study. European Journal of Operational Research 1998;108:551-70.
14. Choi I, Korkmaz O. Job shop scheduling with separable sequence-dependent setups. Annals of Operations Research 1997;70:155-70.
15. Brest J, Zerovnik J. An approximation algorithm for the asymmetric traveling salesman problem. Ricerca Operativa 1998;28:59-67.
16. Karp R. A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM Journal Computing 1979;8:561-73.
17. Little J, Murty K, Sweeney D, Karel C. An algorithm for the traveling salesman problem. Operations Research 1963;11:972-89.
18. Balas E, Toth P. Branch and bound methods. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB, editors. The traveling salesman problem. New York: Wiley, 1985. p. 361-402.
19. Miller D, Pekny J. Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Operations Research Letters 1989;8:129-35.
20. Fischetti M, Toth P. A polyhedral approach to the asymmetric traveling salesman problem. Management Science 1997;43:1520-36.
21. Gouveia L, Pires J. The asymmetric traveling salesman problem and a reformulation of the Miller-Tucker Zemlin constraints. European Journal of Operational Research 1999;112:134-46.
22. Chopra S, Rinaldi G. The graphical asymmetric traveling salesman polyhedron: symmetric inequalities. SIAM Journal on Discrete Mathematics 1996;9:602-24.
23. Righini G, Trubian M. A worst-case analysis of two approximate algorithms for the asymmetric traveling salesman problem. European Journal of Operational Research 1995;81:553-6.
24. Zhang W. A note on the complexity of the asymmetric traveling salesman problem. Operations Research Letters 1997;20:31-8.
25. Bellmore M, Malone J. Pathology of traveling-salesman subtour-elimination algorithms. Operations Research 1971;19:278-307.
26. TSPLIB, http://www.iwr.uni-heidelber.de/iwr/comopt/software/TSPLIB95/atsp
27. Bertsekas D. Linear network optimization: algorithms and codes. Cambridge: The MIT Press, 1991.
28. Carpaneto G, Dell'Amico M, Toth P. Algorithm 750; CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems. ACM Transactions on Mathematical Software 1995;21:410-5.
29. NETLIB, http://www.netlib.org/toms/750