Location-arc routing problem: Heuristic approaches and test instances

Location-routing is a branch of locational analysis that takes into account distribution aspects. The location-arc routing problem (LARP) considers scenarios where the demand is on the edges rather than being on the nodes of a network (usually a road network is assumed). Examples of such scenarios include locating facilities for postal delivery, garbage collection, road maintenance, winter gritting and street sweeping. This paper presents some heuristic approaches to tackle the LARP, as well as some proposals for benchmark instances (and corresponding results). New constructive and improvement methods are presented and used within different metaheuristic frameworks. Test instances were obtained from the capacitated arc routing problem (CARP) literature and adapted to address the LARP.

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

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

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

[4]  Beatriz Sousa Santos,et al.  A taxonomical analysis, current methods and objectives on location-routing problems , 2013, Int. Trans. Oper. Res..

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

[6]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[7]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[8]  Alain Hertz,et al.  Guidelines for the use of meta-heuristics in combinatorial optimization , 2003, Eur. J. Oper. Res..

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

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

[11]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[12]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[13]  Gilbert Laporte,et al.  Location-Arc Routing Problems , 2001 .

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

[15]  Lawrence Bodin,et al.  The Arc Oriented Location Routing Problem , 1989 .

[16]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

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

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[19]  José Pinto Paixão,et al.  Using clustering analysis in a capacitated location-routing problem , 2007, Eur. J. Oper. Res..

[20]  André Langevin,et al.  The capacitated arc routing problem with refill points , 2007, Oper. Res. Lett..

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

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

[23]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

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

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

[26]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[27]  José-Manuel Belenguer,et al.  Lower and upper bounds for the mixed capacitated arc routing problem , 2006, Comput. Oper. Res..

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

[29]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[30]  Luc Muyldermans,et al.  Routing, districting and location for arc traversal problems , 2003, 4OR.

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

[32]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

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

[34]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[35]  Alberto Del Pia,et al.  A variable neighborhood descent algorithm for a real waste collection problem with mobile depots , 2006, Int. Trans. Oper. Res..

[36]  Gilbert Laporte,et al.  Eulerian location problems , 1999 .

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

[38]  R. D. Galvão,et al.  A tabu search heuristic for the concentrator location problem , 1998 .

[39]  Christian Prins,et al.  Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking , 2006, 4OR.