Multiple phase neighborhood Search-GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP

Journal of Combinatorial Optimization

Volumn 17, Issue 2, 2009, Pages 134-156

  Marinakis, Yannis ^a   Migdalas, Athanasios ^a   Pardalos, Panos M ^b  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b University of Florida   (United States)

Author keywords

ENS; GRASP; Lagrangean relaxation and subgradient optimization; Metaheuristics; TSP

Indexed keywords

OPTIMIZATION;

ENS; GRASP; LAGRANGEAN RELAXATION AND SUBGRADIENT OPTIMIZATION; METAHEURISTICS; TSP;

TRAVELING SALESMAN PROBLEM;

EID: 58349114279     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9104-2     Document Type: Article

References (23)

1. D Applegate R Bixby V Chvatal W Cook 2003 Chained Lin-Kernighan for large traveling salesman problems Informs J Comput 15 82 92
2. JL Bentley 1992 Fast algorithms for geometric traveling salesman problems ORSA J Comput 4 387 411
3. TA Feo MGC Resende 1995 Greedy randomized adaptive search procedure J Glob Optim 6 109 133
4. Garfinkel R, Nemhauser G (1972) Integer programming. Wiley, New York
5. Glover F, Konchenberger G (2003) Handbook of metaheuristics. Kluwer Academic, Dordrecht
6. Glover F, Laguna M, Marti R (2003) Scatter search and path relinking: advances and applications. In: Glover F, Konchenberger GA (eds) Handbook of metaheuristics. Kluwer Academic, Boston, pp 1-36
7. Gutin G, Punnen A (2002) The traveling salesman problem and its variations. Kluwer Academic, Dordrecht
8. P Hansen N Mladenovic 2001 Variable neighborhood search: principles and applications Eur J Oper Res 130 449 467
9. K Helsgaum 2000 An effective implementation of the Lin-Kernighan traveling salesman heuristic Eur J Oper Res 126 106 130
10. Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study. In: Aarts E, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, New York, pp 215-310
11. Johnson DS, McGeoch LA (2002) Experimental analysis of heuristics for the STSP. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer Academic, Dordrecht, pp 369-444
12. Johnson DS, Papadimitriou CH (1985) Computational complexity. In: Lawer EL, Lenstra JK, Rinnoy Kan AHD, Shmoys DB (eds) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, New York, pp 37-85
13. Johnson DS, Gutin G, McGeoch LA, Yeo A, Zhang W, Zverovitch A (2002) Experimental analysis of heuristics for the ATSP. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer Academic, Dordrecht, pp 445-487
14. G Laporte 1992 The traveling salesman problem: an overview of exact and approximate algorithms Eur J Oper Res 59 231 247
15. Lawer EL, Lenstra JK, Rinnoy Kan AHG, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, New York
16. S Lin 1965 Computer solutions of the traveling salesman problem Bell Syst Tech J 44 2245 2269
17. S Lin BW Kernighan 1973 An effective heuristic algorithm for the traveling salesman problem Oper Res 21 498 516
18. Y Marinakis M Marinaki 2006 A bilevel genetic algorithm for a real life location routing problem Int J Logist 10.1080/13675560701410144
19. Y Marinakis A Migdalas PM Pardalos 2005 Expanding neighborhood GRASP for the traveling salesman problem Comput Optim Appl 32 231 257
20. Y Marinakis A Migdalas PM Pardalos 2005 A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem J Comb Optim 10 311 326
21. Y Marinakis A Migdalas PM Pardalos 2007 A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm J Glob Optim 38 555 580
22. Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic, Boston, pp 219-249
23. Tarjan R (1983) Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia