An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

The capacitated arc-routing problem with stochastic demands (CARPSD) is an extension of the well-known capacitated arc-routing problem (CARP) in which demands are stochastic. This leads to the possibility of route failures whenever the realized demand exceeds the vehicle capacity. This paper presents the CARPSD in the context of garbage collection. It describes an adaptive large-scale neighbourhood search heuristic for the problem. Computational results show the superiority of this algorithm over an alternative solution approach.

[1]  José-Manuel Belenguer,et al.  A cutting plane algorithm for the capacitated arc routing problem , 2003, Comput. Oper. Res..

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

[3]  Dino Ahr,et al.  Contributions to Multiple Postmen Problems , 2004 .

[4]  Adam N. Letchford,et al.  Polyhedral Theory for Arc Routing Problems , 2000 .

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

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

[7]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

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

[9]  G. Dueck.  New optimization heuristics , 1993 .

[10]  Ryuichi Hirabayashi,et al.  NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM , 1992 .

[11]  Stefan Voß,et al.  A hierarchical relaxations lower bound for the capacitated arc routing problem , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[12]  Bruce L. Golden,et al.  A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

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

[14]  Patrick Jaillet,et al.  A Priori Optimization , 1990, Oper. Res..

[15]  Wen Lea Pearn,et al.  New lower bounds for the Capacitated Arc Routing Problem , 1988, Networks.

[16]  Sanne Wøhlk.  A Decade of Capacitated Arc Routing , 2008 .

[17]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[18]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

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

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

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

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

[23]  Lawrence Bodin,et al.  Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles , 2006, Ann. Oper. Res..

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

[25]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[26]  Richard F. Hartl,et al.  Applying Ant Colony Optimization to the Capacitated Arc Routing Problem , 2004, ANTS Workshop.

[27]  Philippe Lacomme,et al.  Improving robustness of solutions to arc routing problems , 2005, J. Oper. Res. Soc..

[28]  Sanne Wøhlk.  New lower bound for the Capacitated Arc Routing Problem , 2006, Comput. Oper. Res..

[29]  Demetrio Laganà,et al.  A Branch-and-Cut Algorithm for the Undirected Capacitated Arc Routing Problem , 2007 .

[30]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

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

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

[33]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[34]  José-Manuel Belenguer,et al.  The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..

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

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

[37]  Adam N. Letchford,et al.  Exploiting sparsity in pricing routines for the capacitated arc routing problem , 2009, Comput. Oper. Res..

[38]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..