GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows

A greedy randomized adaptive search procedure with path relinking is presented for the capacitated arc routing problem with time windows. Contrary to the vehicle routing problem with time windows, this problem received little attention. Numerical experiments indicate that the proposed metaheuristic is competitive with the best published algorithms: on a set of 24 instances, it reaches the optimum 17 times and improves the best-known solution 5 times, including 4 new optima.

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

[2]  Vicente Campos,et al.  Scatter Search vs. Genetic Algorithms , 2002 .

[3]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[4]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[5]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..

[6]  Richard W. Eglese,et al.  A deterministic tabu search algorithm for the capacitated arc routing problem , 2008, Comput. Oper. Res..

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  P. A. Mullaseril,et al.  Capacitated rural postman problem with time windows and split delivery , 1997 .

[9]  Wen Lea Pearn,et al.  Augment-insert algorithms for the capacitated arc routing problem , 1991, Comput. Oper. Res..

[10]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[11]  Michel Gendreau,et al.  Arc routing problems with time-dependent service costs , 2007, Eur. J. Oper. Res..

[12]  Michel Gendreau,et al.  Path relinking for the vehicle routing problem , 2004, J. Heuristics.

[13]  Luc Muyldermans,et al.  A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..

[14]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[15]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[16]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[17]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[18]  Joaquín A. Pacheco,et al.  Tabu search for a multi-objective routing problem , 2006, J. Oper. Res. Soc..

[19]  Vicente Campos,et al.  Scatter Search vs. Genetic Algorithms , 2005 .

[20]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[21]  Sanne Wøhlk,et al.  Contributions to Arc Routing , 2005 .

[22]  Jonathan F. Bard,et al.  Flight Scheduling and Maintenance Base Planning , 1989 .

[23]  Bahram Alidaee,et al.  Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (Operations Research/Computer Science Interfaces Series) , 2005 .

[24]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[25]  Toshihide Ibaraki,et al.  Metaheuristics : progress as real problem solvers , 2005 .