A new genetic algorithm for the asymmetric traveling salesman problem

Expert Systems with Applications

Volumn 39, Issue 10, 2012, Pages 8947-8953

  Nagata, Yuichi ^a   Soler, David ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Asymmetric traveling salesman problem; Crossover operator; Genetic algorithm; Metaheuristics

Indexed keywords

ASYMMETRIC TRAVELING SALESMAN PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; CROSSOVER OPERATOR; META HEURISTICS; OPTIMAL SOLUTIONS; REAL-WORLD PROBLEM;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; TRAVELING SALESMAN PROBLEM;

GENETIC ALGORITHMS;

EID: 84859209777     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2012.02.029     Document Type: Article

References (28)

1. M. Albayrak, and N. Allahverdi Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms Expert Systems with Applications 38 2011 1313 1320
2. J. Albiach, J.M. Sanchis, and D. Soler An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation European Journal of Operational Research 189 2008 789 802
3. R. Baldacci, E. Bartolini, and G. Laporte Some applications of the generalized vehicle routing problem Journal of the Operational Research Society 61 2010 1072 1077
4. D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, and A. Zverovitch Transformations of generalized ATSP into ATSP Operations Research Letters 31 2003 357 365
5. Bentley, J. L. (1990). Experiments on traveling salesman heuristics. In Proceedings of the first annual ACM-SIAM symposium on discrete algorithms (pp. 91-99).
6. M. Blais, and G. Laporte Exact solution of the generalized routing problem through graph transformations Journal of the Operational Research Society 54 2003 906 910
7. O. Bräysy, E. Martínez, Y. Nagata, and D. Soler The mixed capacitated general routing problem with turn penalties Expert Systems with Applications 30 2011 12954 12966
8. L. Buriol, P.M. Frana, and P. Moscato A new memetic algorithm for the asymmetric traveling salesman problem Journal of Heuristics 10 2004 483 506
9. S.M. Chen, and C.Y. Chien Parallelized genetic ant colony systems for solving the traveling salesman problem Expert Systems with Applications 38 2011 3873 3883
10. I.C. Choi, S.I. Kim, and H.S. Kim A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem Computers & Operations Research 30 2003 773 786
11. J. Clossey, G. Laporte, and P. Soriano Solving arc routing problems with turn penalties Journal of the Operational Research Society 52 2001 433 439
12. A. Corberán, R. Martí, E. Martínez, and D. Soler The rural postman problem on mixed graphs with turn penalties Computers & Operations Research 29 2002 887 903
13. A. Corberán, G. Mejía, and J.M. Sanchis New results on the mixed general routing problem Operations Research 53 2005 363 376
14. M. Fischetti, A. Lodi, and P. Toth Exact methods for the asymmetric traveling salesman problem G. Gutin, A.P. Punnen, The traveling salesman problem and its variations 2002 Kluwer Boston 168 205
15. P.C. Kanellakis, and C.H. Papadimitriou Local search for the asymmetric traveling salesman problem Operations Research 28 1980 1086 1099
16. G. Laporte Modeling and solving several classes of arc routing problems as traveling salesman problems Computers & Operations Research 24 1997 1057 1061
17. G. Laporte A concise guide to the traveling salesman problem Journal of the Operational Research Society 61 2010 35 40
18. J.C. Micó, and D. Soler The capacitated general windy routing problem with turn penalties Operations Research Letters 39 2011 265 271
19. Nagata, Y. (2004). The EAX algorithm considering diversity loss. In Proceedings of the 8th international conference on parallel problem solving from nature, Lecture Notes in Computer Science (Vol. 3242, pp. 332-341).
20. Nagata, Y. (2006a). Fast EAX algorithm considering population diversity for traveling salesman problems. In Proceedings of the 6th international conference on evolutionary computation in combinatorial optimization, Lecture Notes in Computer Science (Vol. 3906, pp. 171-182).
21. Nagata, Y. (2006b). New EAX crossover for large TSP instances. In Proceedings of the 9th international conference on parallel problem solving from nature, Lecture Notes in Computer Science (Vol. 4193, pp. 372-381).
22. Nagata, Y.; Kobayashi, S. (1997). Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In Proceedings of the 7th international conference on genetic algorithms (pp. 450-457).
23. C.E. Noon, and J.C. Bean An efficient transformation of the generalized traveling salesman problem INFOR 31 1993 39 44
24. T. Oncan, I.K. Altinel, and G. Laporte A comparative analysis of several asymmetric traveling salesman problem formulations Computers & Operations Research 36 2009 637 654
25. C. Rego, D. Gamboa, F. Glover, and C. Osterman Traveling salesman problem heuristics: Leadings methods, implementations and latest advances European Journal of Operational Research 211 2011 427 441
26. D. Soler, J. Albiach, and E. Martínez A way to optimally solve a time-dependent vehicle routing problem with time windows Operations Research Letters 37 2009 37 42
27. D. Soler, E. Martínez, and J.C. Micó A transformation for the mixed general routing problem with turn penalties Journal of the Operational Research Society 59 2008 540 547
28. L.N. Xing, Y.W. Chen, K.W. Yang, F. How, X.S. Shen, and H.P. Cai A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem Engineering Applications of Artificial Intelligence 21 2008 1370 1380