A simheuristic algorithm for solving the arc-routing problem with stochastic demands

This paper proposes a simheuristic algorithm for solving the Arc-Routing Problem with Stochastic Demands. Our approach combines Monte Carlo Simulation (MCS) with the RandSHARP metaheuristic, which was originally designed for solving the Capacitated Arc-Routing Problem with deterministic demands (CARP). The RandSHARP metaheuristic is a biased-randomized version of a savings-based heuristic for the CARP, which allows it to obtain competitive results for this problem in low computational times. The RandSHARP is then combined with MCS to cope with the stochastic variant of the problem in a natural and efficient way. Our work is based on the use of a safety stock during the route-design stage. This safety stock can then be used during the delivery stage to satisfy unexpected demands. A reliability index is also defined to evaluate the robustness of each solution with respect to possible route failures caused by random demands. Some numerical experiments contribute to validate our approach and to illustrate its potential benefits.

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

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

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

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

[5]  Zuhaimy Ismail,et al.  Implementation weather-type models of capacitated arc routing problem via heuristics , 2011 .

[6]  André Langevin,et al.  Synchronized arc routing for snow plowing operations , 2012, Comput. Oper. Res..

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

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

[9]  Si Chen,et al.  Arc-Routing Models for Small-Package Local Routing , 2009, Transp. Sci..

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

[11]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

[12]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[13]  Moshe Dror,et al.  Routing electric meter readers , 1979, Comput. Oper. Res..

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

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

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

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

[18]  Jens Lysgaard,et al.  A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands , 2007, Oper. Res. Lett..

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

[20]  D. Bertsimas,et al.  Further results on the probabilistic traveling salesman problem , 1993 .

[21]  Rolf Drechsler,et al.  Applications of Evolutionary Computing , 2004, Lecture Notes in Computer Science.

[22]  Kenneth Sörensen,et al.  Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows , 2010, Comput. Oper. Res..

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

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

[25]  Angel A. Juan,et al.  The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem , 2008 .

[26]  Angel A. Juan,et al.  Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands , 2011 .

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

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

[29]  Angel A. Juan,et al.  Routing fleets with multiple driving ranges: Is it possible to use greener fleet configurations? , 2014, Appl. Soft Comput..

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

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

[32]  Angel A. Juan,et al.  SimILS: a simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization , 2016, J. Simulation.

[33]  Angel A. Juan,et al.  Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem , 2012, AI Commun..

[34]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[35]  Angel A. Juan,et al.  A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems , 2015 .

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

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

[38]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

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

[40]  G. Ulusoy.  The fleet size and mix problem for capacitated arc routing , 1985 .

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

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

[43]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[44]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

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

[46]  Gokhan Kirlik,et al.  Multi-robot sensor-based coverage path planning using capacitated arc routing approach , 2009, 2009 IEEE Control Applications, (CCA) & Intelligent Control, (ISIC).

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

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

[49]  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.

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

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

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

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

[54]  Philippe Lacomme,et al.  Robustness evaluation of solutions for the Capacitated Arc Routing Problem , 2002 .

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

[56]  Philippe Lacomme,et al.  First Competitive Ant Colony Scheme for the CARP , 2004, ANTS Workshop.

[57]  M. BelenguerJ.,et al.  The Capacitated Arc Routing Problem , 1998 .

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

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

[60]  Zaw Win,et al.  Contributions to routing problems , 1987 .

[61]  Lawrence Bodin,et al.  A detailed description of a computer system for the routing and scheduling of street sweepers , 1979, Comput. Oper. Res..

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