Arc routing problems with time-dependent service costs

Abstract This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the “timing” of each intervention is crucial. The exact problem-solving approach reported here first transforms the arc routing problem into an equivalent node routing problem. Then, a column generation scheme is used to solve the latter. The master problem is a classical set covering problem, while the subproblems are time-dependent shortest path problems with resource constraints. These subproblems are solved using an extension of a previously developed algorithm. Computational results are reported on problems derived from a set of classical instances of the vehicle routing problem with time windows.

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

[2]  Nicos Christofides.  The optimum traversal of a graph , 1973 .

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

[4]  Richard W. Eglese,et al.  An Interactive Algorithm for Vehicle Routeing for Winter — Gritting , 1996 .

[5]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[6]  Nacima Labadie,et al.  GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows , 2009, EvoWorkshops.

[7]  Gilbert Laporte,et al.  The capacitated arc routing problem with intermediate facilities , 2001, Networks.

[8]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[9]  Stefan Voß,et al.  Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees , 2000, Eur. J. Oper. Res..

[10]  Richard W. Eglese,et al.  Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..

[11]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[12]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[13]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[14]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[15]  Richard W. Eglese,et al.  Efficient Routeing for Winter Gritting , 1992 .

[16]  James F. Campbell,et al.  Roadway Snow and Ice Control , 2000 .

[17]  Philippe Lacomme,et al.  Evolutionary Algorithms for Stochastic Arc Routing Problems , 2004, EvoWorkshops.

[18]  Toshihide Ibaraki,et al.  Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints , 2005, Transp. Sci..

[19]  Philippe Lacomme.  Evolutionary Algorithms for Multiperiod Arc Routing Problems , 2002 .

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

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

[22]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[23]  T. Lotan,et al.  Winter gritting in the province of Antwerp - a combined location and routing problem , 1996 .

[24]  Lawrence Bodin,et al.  A Computer-Assisted System for the Routing and Scheduling of Street Sweepers , 1978, Oper. Res..

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

[26]  Philippe Lacomme,et al.  A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions , 2001, EvoWorkshops.

[27]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[28]  Gilbert Laporte,et al.  Modeling and Optimization of Vehicle Routing and Arc Routing Problems , 2006 .

[29]  G. Lapalme,et al.  A parallel insert method for the capacitated arc routing problem , 1984 .

[30]  Michel Gendreau,et al.  ARC ROUTING PROBLEMS. , 1994 .

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

[32]  Marcus Poggi de Aragão,et al.  Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..

[33]  Vittorio Maniezzo.  Algorithms for large directed CARP instances: urban solid waste collection operational support , 2004 .

[34]  Wen Lea Pearn,et al.  Approximate solutions for the capacitated arc routing problem , 1989, Comput. Oper. Res..

[35]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[36]  Bruce L. Golden,et al.  Chapter 5 Arc routing methods and applications , 1995 .

[37]  Roberto Baldacci,et al.  Exact methods based on node-routing formulations for undirected arc-routing problems , 2006 .

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

[39]  Wen Lea Pearn,et al.  Transforming arc routing into node routing problems , 1987, Comput. Oper. Res..

[40]  Luc Muyldermans,et al.  Districting for salt spreading operations , 2002, Eur. J. Oper. Res..

[41]  Sylvie Gélinas,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.

[42]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[43]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[44]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.