A variable neighborhood search for the capacitated location-routing problem

In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.

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

[2]  Børge Obel,et al.  A heuristic solution to the warehouse location-routing problem , 1994 .

[3]  S. Salhi,et al.  A nested location-routing heuristic using route length estimation , 1996 .

[4]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

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

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[8]  Juan A. Díaz,et al.  A compact model and tight bounds for a combined location-routing problem , 2005, Comput. Oper. Res..

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

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

[11]  Said Salhi,et al.  An Intergrated Heuristic Approach for the Combined Location Vehicle Fleet Mix Problem , 1996 .

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

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

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

[15]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[16]  Philippe Lacomme,et al.  A GRASP×ELS approach for the capacitated location-routing problem , 2010, Comput. Oper. Res..

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

[18]  Christian Prins,et al.  A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem , 2006, EvoCOP.

[19]  Angel B. Ruiz,et al.  Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic , 2007, Transp. Sci..

[20]  Said Salhi,et al.  Nested Heuristic Methods for the Location-Routeing Problem , 1996 .

[21]  W. Baumol,et al.  A Warehouse-Location Problem , 1958 .

[22]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[23]  Said Salhi,et al.  The effect of ignoring routes when locating depots , 1989 .

[24]  Mark S. Daskin,et al.  A warehouse location-routing problem , 1985 .

[25]  G. Laporte,et al.  An exact algorithm for solving a capacitated location-routing problem , 1986 .

[26]  Bassem Jarboui,et al.  An Iterated Local Search for Solving A Location-Routing Problem , 2010, Electron. Notes Discret. Math..

[27]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.