Abstract
Hybridization techniques are very effective for the solution of combinatorial optimization problems. This paper presents a genetic algorithm based on Expanding Neighborhood Search technique (Marinakis, Migdalas, and Pardalos, Computational Optimization and Applications, 2004) for the solution of the traveling salesman problem: The initial population of the algorithm is created not entirely at random but rather using a modified version of the Greedy Randomized Adaptive Search Procedure. Farther more a stopping criterion based on Lagrangean Relaxation is proposed. The combination of these different techniques produces high quality solutions. The proposed algorithm was tested on numerous benchmark problems from TSPLIB with very satisfactory results. Comparisons with the algorithms of the DIMACS Implementation Challenge are also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Applegate, R. Bixby, V. Chvatal, and W. Cook, “Chained Lin–Kernighan for large traveling salesman problems,” Informs Journal on Computing (to appear).
J.L. Bentley, “Fast algorithms for geometric traveling salesman problems,” ORSA J. Computing, vol. 4, pp. 387–411, 1992.
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.
R. Garfinkel and G. Nemhauser, Integer Programming, Wiley and Sons, 1972.
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.
M. Held and R.M. Karp, “The traveling salesman problem and minimum spanning trees,” Operations Research, vol. 18, pp. 1138–1162, 1970.
K. Helsgaum, “An effective implementation of the Lin–Kernigham traveling salesman heuristic,” European Journal of Operational Research, vol. 126, pp. 106–130, 2000.
D.S. Johnson, “Local optimization and the traveling salesman problem,” in Proc. 17th Colloq. Automata Languages Program Lect. Notes Comput. Sc., vol. 443, Springer-Verlag, 1990, pp. 446–461.
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.
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.
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.
S. Lin, “Computer solutions of the traveling salesman problem,” Bell System Technical Journal, vol. 44, pp. 2245–2269, 1965.
S. Lin and B.W. Kernigham, “An effective heuristic algorithm for the traveling salesman problem,” Operation Research, vol. 21, pp. 498–516, 1973.
Y. Marinakis, A. Migdalas, and P.M. Pardalos, “Expanding neighborhood GRASP for the traveling salesman problem,” Computational Optimization and Applications (in print), 2004.
D. Neto, Efficient cluster compensation for Lin–Kernighan heuristics. PhD thesis, Computer science university of Toronto, 1999.
J.Y. Potvin, “Genetic algorithms for the traveling salesman problem,” Annals of Operations Research, vol. 63, pp. 339–370, 1996.
C.R. Reeves, “Genetic algorithms,” in C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Optimization, MCGraw-Hill, 1995, pp. 151–196.
C.R. Reeves, “Genetic algorithms” in F. Glover and G.A. Kochenberger (eds.), Handbooks of Metaheuristics, Kluwer Academic Publishers Dordrecht, pp. 55–82, 2003.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Marinakis, Y., Migdalas, A. & Pardalos, P.M. A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem. J Comb Optim 10, 311–326 (2005). https://doi.org/10.1007/s10878-005-4921-7
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-4921-7