A Variable Neighborhood Search Algorithm for Continuous Location Routing Problem with Pickup and Delivery

Location Routing Problem (LRP) is combination of Facility location Problem and Vehicle Routing Problem. The classic LRP considers a discrete number of locations as possible candidates for facilities locations. However, the continuous location routing problem (CLRP) as an extension to the classic LRP allows any location for the facilities and thus the solution space is continuous. There is a very scarce literature available for CLRP. In this paper, the CLRP with pickup and delivery is first formulated and to solve the problem, a Variable Neighborhood Search algorithm is used considering different neighborhoods and acceptation levels. Problems from small to large size can be solved and the experimentation results are promising.

[1]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

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

[3]  Giovanni Righini,et al.  Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery , 2007, Comput. Oper. Res..

[4]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

[5]  Jan Dethloff,et al.  Solving a continuous location‐routing problem by use of a self‐organizing map , 2005 .

[6]  Laura I. Burke,et al.  A two-phase tabu search approach to the location routing problem , 1999, Eur. J. Oper. Res..

[7]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[8]  Said Salhi,et al.  Consistency and Robustness in Location-Routing , 1999 .

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

[10]  Pierre Hansen,et al.  First vs. best improvement: An empirical study , 1999, Discret. Appl. Math..

[11]  M. Jabalameli,et al.  Hybrid algorithms for the uncapacitated continuous location-allocation problem , 2008 .

[12]  Ivana Ljubic,et al.  A Hybrid VNS for Connected Facility Location , 2007, Hybrid Metaheuristics.

[13]  Andreas Fink,et al.  On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem , 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications.

[14]  Peter I. Cowling,et al.  Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem , 2001, EvoWorkshops.

[15]  Pierre Hansen,et al.  The maximum return-on-investment plant location problem with market share , 2005, J. Oper. Res. Soc..

[16]  J Brimberg,et al.  The multi-source Weber problem with constant opening cost , 2004, J. Oper. Res. Soc..

[17]  Saïd Salhi,et al.  Local improvement in planar facility location using vehicle routing , 2009, Ann. Oper. Res..

[18]  Pierre Hansen,et al.  Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem , 2003, INFORMS J. Comput..

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

[20]  É. Taillard,et al.  Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .

[21]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

[22]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

[23]  Pierre Hansen,et al.  Decomposition Strategies for Large Scale Continuous Location-Allocation Problems , 2004 .

[24]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[25]  Kerstin Dächert,et al.  Allocation search methods for a generalized class of location-allocation problems , 2009, Eur. J. Oper. Res..

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

[27]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[28]  Saïd Salhi,et al.  A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost , 2005, Ann. Oper. Res..

[29]  Pierre Hansen,et al.  Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..