A two echelon location-routing model with considering Value-at-Risk measure

Abstract In this paper, we present a distribution network design problem in supply chain system which optimizes location, and routing decisions. We propose a two-stage supply chain model which involves determining simultaneously the best sites for the distribution centers and determining capacity for distribution centers and the best strategy for distributing the product from the suppliers to the distribution centers and from distribution centers to the customers and the routes of the vehicles. Each customer’s demand is uncertain and follows a normal distribution. For the first time in the location-routing problem, we introduce a new solution methodology that adopts from the finance literature, to optimize the Value-at-Risk (VaR) measure in our problem. A heuristic method is developed for solving the problem. The heuristic method is decomposed into two phases: distribution center location-allocation phase, and routing phase. First of all, an initial solution is determined, then a Tabu search algorithm is used to improve the initial solution for each phase separately and alternatively.

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

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

[3]  Walter Ukovich,et al.  Dynamic routing-and-inventory problems: a review , 1998 .

[4]  S. C. Liu,et al.  A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration , 2003 .

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

[6]  Alexander Pott,et al.  The Hamiltonian p-Median Problem , 2000, Electron. J. Comb..

[7]  G. Laporte,et al.  An exact algorithm for minimizing routing and operating costs in depot location , 1981 .

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

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

[10]  Kathrin Fischer,et al.  Combined location-routing problems—a neural network approach , 2009, Ann. Oper. Res..

[11]  G. Laporte,et al.  Hamiltonian location problems , 1983 .

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

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

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

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

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

[17]  Rajan Batta,et al.  The Traveling Repairperson Home Base Location Problem , 1994, Transp. Sci..

[18]  W. Pierskalla,et al.  A Transportation Location-Allocation Model for Regional Blood Banking , 1979 .

[19]  Meng Wu,et al.  DBLAR: A distance-based location-aided routing for MANET , 2009 .

[20]  C. K. Y. Lin,et al.  A location-routing-loading problem for bill delivery services , 2002 .

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

[22]  Christopher C. Skiscim,et al.  Optimization by simulated annealing: A preliminary computational study for the TSP , 1983, WSC '83.

[23]  G Nagy,et al.  LOCATION–ROUTING, ISSUES, MODELS, AND METHODS: A REVIEW , 2007 .