Abstract
This paper presents a new GRASP for the TSP. Two versions utilizing two distinct implementations of the LK neighborhood are introduced. Those heuristics are hybridized with a path-relinking procedure. A distance metric, previously proposed to fitness analysis landscape is utilized to decide whether to apply path-relinking between a pair of solutions. A computational experiment is reported to support conclusions about efficiency of the proposed approach
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiex, RM., Binato, S., Resende, M.C.G., 2003, Parallel GRASP with path-relinking for job shop scheduling, Parallel Computing 29:393-430.
Aiex, RM., Resende, M.C.G., 2005, Parallel strategies for GRASP with path-relinking, in: Metaheuristics: Progress as Real Problem Solvers. T. Ibaraki, K. Nonobe and M. Yagiura, Eds., Springer, pp. 301-331.
Aiex, R.M., Resende, M.G.C., Pardalos, P.M. and Toraldo, G., 2005, GRASP with path relinking for the three-index assignment problem, INFORMS Journal on Computing 17(2): 224-247.
Applegate, D., Bixby, R., Chvatal, V., and Cook, W., 1999, Finding Tours in the TSP, Tech. Rep. TR99-05, Dept. Comput. Appl. Math., Rice University.
Applegate, D., Bixby, R. E., Chvatal, V., and Cook, W., 2001, TSP cuts which do not conform to the template paradigm, in: Computational Combinatorial Optimization, Junger, M., and Naddef, D., Eds., Springer, pp. 261-304.
Bellmore, M., and Nemhauser, G. L., 1968, The traveling salesman problem: A survey, Operations Research 16: 538–582.
Bland, R.G., and Shalcross, D.F., 1989, Large traveling salesman problems arising from experiments in x-ray crystallography: A preliminary report on computation, Operations Research Letters 8: 125-128.
Boese, K. D., 1995, Cost Versus Distance in the Traveling Salesman Problem, Technical Report TR 950018, UCLA CS Department, California.
Burkard, R. E., 2002, The traveling salesman problem, in: Handbook of Applied Optimization P. M. Pardalos and M. G. C. Resende, Eds, Oxford University Press, pp. 616-624.
Canuto, S.A., Resende, M.C.G., Ribeiro, C.C., 2001, Local search with perturbation for the prize collector Steiner tree problems in graphs, Networks 38:50-58.
Cook, W.J., Seymour, P., 2003, Tour merging via branch-decomposition, INFORMS Journal on Computing 15: 233-248.
Delorme, X., Gandibleux, X., and Rodriguez J., 2004, GRASP for set packing problems, European Journal of Operational Research 153(3): 564-580.
Feo, T.A., and Resende, M.G.C., 1989, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters 8: 67–71.
Festa, P., Pardalos, P. M., Pitsoulis, L. S., and Resende, M. G. C., 2005, GRASP with path-relinking for the weighted maximum satisfiability problem, Lecture Notes in Computer Science 3503: 367-379.
Flood, M.M., 1956, The traveling-salesman problem, Operations Research 4:61-75.
Glover, F., 1963, Parametric combinations of local job shop rules, Chapter IV, ONR Research Memorandum no. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA.
Glover, F., Laguna, M., and Martí, R., 2000, Fundamentals of scatter search and path relinking, Control and Cybernetics 29(3): 653-684.
Gomes, F. C., Pardalos, P. M., Oliveira, C. S., and Resende, M. G. C., 2001, Reactive GRASP with path relinking for channel assignment in mobile phone networks, Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM, 60-67.
Gonnet, G., Korotensky, C., and Benner, S., 2000, Evaluation measures of multiple sequence alignments, Journal of Computational Biology 7(1-2), 261-276.
Gupta, S. R., and Smith, J. S., 2005, Algorithms for single machine total tardiness scheduling with sequence dependent setups, European Journal of Operational Research, article in press.
Gutin, G., and Punnen, A.P., 2002, Traveling Salesman Problem and Its Variations, Kluwer Academic Publishers, Dordrecht.
Guyon, R., Lorentzen, T. D., Hitte, C., Kim, L., Cadieu, E., Parker, H. G.,Quignon, P., et al., 2003, A 1-Mb resolution radiation hybrid map of the canine genome, Proceedings of the National Academy of Sciences of the United States of America 100(9): 5296-5301.
Helsgaun, K., 2000, An effective implementation of the Lin-Kernighan traveling salesman heuristic, European Journal of Operational Research 126: 106–130.
Johnson, D. S., and McGeoh, L. A., 2002, Experimental analysis of heuristics for the STSP, in: The Traveling Salesman Problem and Its Variations, G. Guttin and A. Punnen, Eds, Kluwer Academic Publishers, Dordrecht, pp. 369-443.
Korte, B. H., 1989, Applications of combinatorial cptimization, in: Mathematical Programming: Recent Developments and Applications, M. Iri and K. Tanabe, Eds., Kluwer, Dordrecht, pp. 1-55.
Laguna, M., and Marti, R., 1999, GRASP and path relinking for 2-layer straight line crossing minimization, INFORMS Journal on Computing 11(1): 44-52.
Lin, S., Kernighan, B., 1973, An effective heuristic algorithm for the traveling-salesman problem, Operations Research 21: 498-516.
Marinakis, Y., Migdalas, A. ,and Pardalos, P. M., 2005, Expanding neighborhood GRASP for the traveling salesman problem, Computational Optimization and Applications 32: 231-257.
Piñana, E., Plana, I., Campos, V., and Marti, R., 2004, GRASP and path relinking for the matrix bandwidth minimization, European Journal of Operational Research 153(1): 200-210.
Resende, M.G.C., and Ribeiro, C.C., 2003XX, GRASP and path-relinking: Recent advances and applications, in: Proceedings of the Fifth Metaheuristics International Conference (MIC2003), T. Ibaraki and Y. Yoshitomi, Eds., T6–1 – T6–6.
Resende, M.G.C., and Ribeiro, C.C., 2003XX, Greedy randomized adaptive search procedures, in: Handbook of Metaheuristics, Glover, F. and Kochenberger, G., Eds., Kluwer Academic Publishers, pp. 219-249.
Resende M.G.C. and Werneck, R.F., 2005, A hybrid multistart heuristic for the uncapacitated facility location problem, European Journal of Operational Research, article in press.
Scaparra, M. P., and Church, R. L., 2005, A GRASP and path relinking heuristic for rural road network development, Journal of Heuristics 11(1): 89-108.
Souza, M.C., Duhamel, C., and Ribeiro, C.C., 2003, A GRASP with path-relinking heuristic for the capacitated minimum spanning tree problem, in: Metaheuristics: Computer Decision Making, Resende, M.G.C., and Souza, J., Eds., Kluwer Academic Publishers, pp.627–658.
Yajima, E., Hara, T., Tsukamoto, M., and Nishio, S., 2001, Scheduling and caching Strategies for correlated data in push-based information systems, ACM SIGAPP Applied Computing Review 9(1): 22-28.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gouvêa Goldbarg, E.F., Goldbarg, M.C., Farias, J.P. (2007). Grasp with Path-Relinking for the Tsp. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds) Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 39. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71921-4_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-71921-4_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71919-1
Online ISBN: 978-0-387-71921-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)