A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem

Journal of Combinatorial Optimization

Volumn 10, Issue 4, 2005, Pages 311-326

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

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b University of Florida   (United States)

Author keywords

Genetic algorithms; Greedy randomized adaptive search procedure; Lagrangean Relaxation; Metaheuristics; Traveling salesman problem

Indexed keywords

LAGRANGE MULTIPLIERS; OPTIMIZATION; PROBLEM SOLVING; RELAXATION PROCESSES; TRAVELING SALESMAN PROBLEM;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; LAGRANGEAN RELAXATION; METAHEURISTICS;

GENETIC ALGORITHMS;

EID: 27844516526     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-005-4921-7     Document Type: Article

References (20)

1. D. Applegate, R. Bixby, V. Chvatal, and W. Cook, "Chained Lin-Kernighan for large traveling salesman problems," Informs Journal on Computing (to appear).
2. J.L. Bentley, "Fast algorithms for geometric traveling salesman problems," ORSA J. Computing, vol. 4, pp. 387-411, 1992.
3. G. Clarke and J.W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points," Operations Research, vol. 12, pp. 568-581, 1964.
4. R. Garfinkel and G. Nemhauser, Integer Programming, Wiley and Sons, 1972.
5. M. Gendreau, A. Hertz, and G. Laporte, "New insertion and postoptimization procedures for the traveling salesman problem," Operations Research, vol. 40, pp. 1086-1094, 1992.
6. M. Held and R.M. Karp, "The traveling salesman problem and minimum spanning trees," Operations Research, vol. 18, pp. 1138-1162, 1970.
7. K. Helsgaum, "An effective implementation of the Lin-Kernigham traveling salesman heuristic," European Journal of Operational. Research, vol. 126, pp. 106-130, 2000.
8. D.S. Johnson, "Local optimization and the traveling salesman problem," in Pwc, 17th Colloq, Automata Languages Program Lect. Notes Comput. Sc., vol. 443, Springer-Verlag, 1990, pp. 446-461.
9. D.S. Johnson and L.A. McGeoch, "The traveling salesman problem: A case study," in E. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley and Sons, 1997, pp. 215-310.
10. D.S. Johnson and L.A. McGeoch, "Experimental analysis of the STSP," in G. Gutin and A. Punnen (eds.), The Traveling Salesman Problem and Its Variations, Kluwer Academic Publishers Dordrecht, 2002, pp. 369-444.
11. E.L. Lawer, J.K. Lenstra, A.H.G. Rinnoy Kan, and D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley and Sons, 1985.
12. S. Lin, "Computer solutions of the traveling salesman problem," Bell System Technical Journal, vol. 44, pp. 2245-2269, 1965.
13. S. Lin and B.W. Kernigham, "An effective heuristic algorithm for the traveling salesman problem," Operation Research, vol. 21, pp. 498-516, 1973.
14. Y. Marinakis, A. Migdalas, and P.M. Pardalos, "Expanding neighborhood GRASP for the traveling salesman problem," Computational Optimization and Applications (in print), 2004. http://www.parallopt.tuc. grryamar/
15. D. Neto, Efficient cluster compensation for Lin-Kernighan heuristics. PhD thesis, Computer science university of Toronto, 1999.
16. J.Y. Potvin, "Genetic algorithms for the traveling salesman problem," Annals of Operations Research, vol. 63, pp. 339-370, 1996.
17. C.R. Reeves, "Genetic algorithms," in C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Optimization, MCGraw-Hill, 1995, pp. 151-196.
18. C.R. Reeves, "Genetic algorithms" in F. Glover and G.A. Kochenberger (eds.), Handbooks of Metaheuristics, Kluwer Academic Publishers Dordrecht, pp. 55-82, 2003.
19. M.G.C. Resende and C.C. Ribeiro, "Greedy randomized adaptive search procedures," in F. Glover and G.A. Kochenberger (eds.), Handbooks of Metaheuristics, Kluwer Academic Publishers Dordrecht, 2003, pp. 219-249.
20. M. Zachariasen and M. Dam, "Tabu Search on the Geometric Traveling Salesman Problem," in I.H. Osman and J.P. Kelly (eds.), Meta-heuristics: Theory and Applications, Kluwer Academic Publishers, Boston, 1996, pp. 571-587.