GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Computers and Operations Research

Volumn 40, Issue 12, 2013, Pages 3218-3229

  Mestria, Mário ^a   Satoru Ochi, Luiz ^a   De Lima Martins, Simone ^a  

^a Instituto de Computacao   (Brazil)

Author keywords

Clustered Traveling Salesman Problem; Combinatorial optimization; GRASP; Heuristics; Path relinking

Indexed keywords

CLUSTERED TRAVELING SALESMAN PROBLEMS; COMPUTATIONAL EXECUTION TIME; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; GRASP; HAMILTONIAN CYCLE; HEURISTICS; PATH RELINKING;

COMBINATORIAL OPTIMIZATION; HAMILTONIANS;

TRAVELING SALESMAN PROBLEM;

EID: 84885955728     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.10.001     Document Type: Article

References (34)

1. J.A. Chisman The clustered traveling salesman problem Computers and Operations Research 2 2 1975 115 119
2. A. Weintraub, J. Aboud, C. Fernandez, G. Laporte, and E. Ramirez An emergency vehicle dispatching system for an electric utility in Chile Journal of the Operations Research Society 50 1999 690 696
3. F.C.J. Lokin Procedures for travelling salesman problems with additional constraints European Journal of Operational Research 3 2 1979 135 141
4. G. Laporte, and U. Palekar Some applications of the clustered travelling salesman problem Journal of the Operations Research Society 53 9 2002 972 976 (Pubitemid 34964222)
5. H. Ghaziri, and I.H. Osman A neural network for the traveling salesman problem with backhauls Computers & Industrial Engineering 44 2 2003 267 281
6. S. Anily, J. Bramel, and A. Hertz A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems Operations Research Letters 24 1-2 1999 29 35
7. Gendreau M, Laporte G, Potvin JY. Heuristics for the clustered traveling salesman problem. Technical Report CRT-94-54, Centre de recherche sur les transports, Universidade de Montreal, Montreal, Canada; 1994.
8. G. Laporte, J.-Y. Potvin, and F. Quilleret A tabu search heuristic using genetic diversification for the clustered traveling salesman problem Journal of Heuristics 2 3 1996 187 200
9. Potvin J-Y, Guertin F. A genetic algorithm for the clustered traveling salesman problem with an a priori order on the clusters. Technical Report CRT-95-06, Centre de recherche sur les transports, Université de Montréal, Canada; 1995.
10. E.M. Arkin, R. Hassin, and L. Klein Restricted delivery problems on a network Networks 29 4 1997 205 216
11. M. Gendreau, G. Laporte, and A. Hertz An approximation algorithm for the traveling salesman problem with backhauls Operations Research 45 4 1997 639 641 (Pubitemid 127684737)
12. N. Guttmann-Beck, R. Hassin, S. Khuller, and B. Raghavachari Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem Algorithmica 28 4 2000 422 437
13. Christofides N. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University; 1976.
14. J.A. Hoogeveen Analysis of Christofides' heuristic some paths are more difficult than cycles. Operations Research Letters 10 5 1991 291 295
15. K. Jongens, and T. Volgenant The symmetric clustered traveling salesman problem European Journal of Operational Research 19 1 1985 68 75 (Pubitemid 15458555)
16. J-.Y. Potvin, and F. Guertin The clustered traveling salesman problem a genetic approach I.H. Osman, J. Kelly, Meta-heuristics: Theory & applications 1996 Kluwer Academic Publishers Norwell, MA, USA 619 631
17. C. Ding, Y. Cheng, and M. He Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs Tsinghua Science and Technology 12 4 2007 459 465 (Pubitemid 47095389)
18. P. Festa, and M. Resende An annotated bibliography of GRASP, part I algorithms. International Transactions in Operational Research 16 2009 1 24
19. P. Festa, and M. Resende An annotated bibliography of GRASP, part II applications. International Transactions in Operational Research 16 2009 131 172
20. M. Resende, and C. Ribeiro Greedy randomized adaptive search procedures F. Glover, G. Kochenberger, Handbook of metaheuristics. 2002 Kluwer Academic Publishers 219 249
21. R. Martí, M. Laguna, and F. Glover Principles of scatter search European Journal of Operational Research 169 2 2006 359 372 (Pubitemid 41375696)
22. M.G. Resende, R. Martí, M. Gallego, and A. Duarte GRASP and path relinking for the max-min diversity problem Computers and Operations Research 37 3 2010 498 508
23. Reinelt G. TSPLIB. Universitt Heidelberg, Institut für Informatik, Heidelberg, Alemanha, 2007, accessed 17 September 2007. URL 〈 http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95 〉.
24. C.E. Miller, A.W. Tucker, and R.A. Zemlin Integer programming formulation of traveling salesman problems Journal of the ACM 7 4 1960 326 329
25. T. Feo, and M. Resende Greedy randomized adaptive search procedures Journal of Global Optimization 6 2 1995 109 133
26. D.S. Johnson, and L.A. McGeoch The traveling salesman problem a case study in local optimization E.H.L. Aarts, J.K. Lenstra, Local search in combinatorial optimization 1997 John Wiley and Sons Londres. 215 310
27. M. Prais, and C. Ribeiro Reactive GRASP an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12 2000 164 176
28. M. Laguna, and R. Martí GRASP and path relinking for 2-layer straight line crossing minimization INFORMS Journal on Computing 11 1 1999 44 52
29. M. Resende, and C. Ribeiro GRASP with path-relinking recent advances and applications T. Ibaraki, K. Nonobe, M. Yagiura, Metaheuristics: Progress as real problem solvers 2005 Springer Verlag 29 63
30. D.S. Johnson, and L.A. McGeoch Experimental analysis of heuristics for the STSP G. Gutin, A. Punnen, The traveling salesman problem and its variations 2002 Kluwer Academic Publishers Dordrecht, Holanda 369 443
31. Applegate D, Bixby R, Chvátal V, Cook W. Concorde TSP solver. William Cook, School of Industrial and Systems Engineering, Georgia Tech., 2007, accessed 22 December 2007. 〈 http://www.tsp.gatech.edu/concorde/index.html 〉.
32. CPLEX, ILOG CPLEX 11.2 User's manual and reference manual, 2009, ILOG S.A., 2009, accessed 06 January 2009. 〈 http://www.ilog.com 〉.
33. R. Aiex, M. Resende, and C. Ribeiro TTT plots a perl program to create time-to-target plots. Optics Letters 1 4 2007 355 366 (Pubitemid 47519609)
34. Cheng Y, Ding C. Private communication.