Grasp with Path-Relinking for the Tsp

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

[1]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[2]  Xavier Gandibleux,et al.  GRASP for set packing problems , 2004, Eur. J. Oper. Res..

[3]  Isaac Plana,et al.  GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..

[4]  G. Mahairas,et al.  A 1-Mb resolution radiation hybrid map of the canine genome , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Panos M. Pardalos,et al.  Reactive GRASP with path relinking for channel assignment in mobile phone networks , 2001, DIALM '01.

[6]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[7]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[8]  K. Tanabe,et al.  Mathematical Programming: Recent Developments and Applications. , 1990 .

[9]  Richard L. Church,et al.  A GRASP and Path Relinking Heuristic for Rural Road Network Development , 2005, J. Heuristics.

[10]  William J. Cook,et al.  Finding Tours in the TSP , 1999 .

[11]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[12]  Celso C. Ribeiro,et al.  A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy , 2004 .

[13]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[14]  Takahiro Hara,et al.  Scheduling and caching strategies for correlated data in push-based information systems , 2001, SIAP.

[15]  Jeffrey S. Smith,et al.  Algorithms for single machine total tardiness scheduling with sequence dependent setups , 2006, Eur. J. Oper. Res..

[16]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[17]  Mauricio G. C. Resende,et al.  A hybrid multistart heuristic for the uncapacitated facility location problem , 2006, Eur. J. Oper. Res..

[18]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[19]  Panos M. Pardalos,et al.  GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem , 2005, WEA.

[20]  Panos M. Pardalos,et al.  Expanding Neighborhood GRASP for the Traveling Salesman Problem , 2005, Comput. Optim. Appl..

[21]  Gaston H. Gonnet,et al.  Evaluation Measures of Multiple Sequence Alignments , 2000, J. Comput. Biol..

[22]  Renata M. Aiex,et al.  Parallel Strategies for Grasp with Path-Relinking , 2005 .

[23]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[24]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[25]  R. Bland,et al.  Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .

[26]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[27]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[28]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[29]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[30]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[31]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[32]  Paul D. Seymour,et al.  Tour Merging via Branch-Decomposition , 2003, INFORMS J. Comput..