Heuristic solutions to multi-depot location-routing problems

This paper presents a method for solving the multi-depot location-routing problem (MDLRP). Since several unrealistic assumptions, such as homogeneous fleet type and unlimited number of available vehicles, are typically made concerning this problem, a mathematical formulation is given in which these assumptions are relaxed. Since the inherent complexity of the LRP problem makes it impossible to solve the problem on a larger scale, the original problem is divided into two sub-problems, i.e., the location-allocation problem, and the general vehicle routing problem, respectively. Each sub-problem is then solved in a sequential and iterative manner by the simulated annealing algorithm embedded in the general framework for the problem-solving procedure. Test problems from the literature and newly created problems are used to test the proposed method. The results indicate that this method performs well in terms of the solution quality and run time consumed. In addition, the setting of parameters throughout the solution procedure for obtaining quick and favorable solutions is also suggested.

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

[2]  T. William Chien,et al.  Heuristic Procedures for Practical‐Sized Uncapacitated Location‐Capacitated Routing Problems* , 1993 .

[3]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

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

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

[6]  P.J.M. van Laarhoven,et al.  Theoretical and Computational Aspects of Simulated Annealing. , 1990 .

[7]  Jossef Perl,et al.  A unified warehouse location-routing analysis , 1983 .

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

[9]  Jean-Yves Potvin,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows , 1997, Transp. Sci..

[10]  W. C. Benton,et al.  The location-routing problem: Considerations in physical distribution system design , 1990, Comput. Oper. Res..

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

[12]  Gilbert Laporte,et al.  Models and exact solutions for a class of stochastic location-routing problems , 1987 .

[13]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[14]  L. Platzman,et al.  Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space , 1988 .

[15]  D. Balmer.  Theoretical and Computational Aspects of Simulated Annealing , 1991 .

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

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

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

[19]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

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

[21]  Paul H. Calamai,et al.  A projection method forlp norm location-allocation problems , 1994, Math. Program..

[22]  Said Salhi,et al.  Incorporating vehicle routing into the vehicle fleet composition problem , 1993 .

[23]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

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

[25]  Oli B.G. Madsen,et al.  A comparative study of heuristics for a two-level routing-location problem , 1980 .

[26]  M. H. J. Webb,et al.  Cost Functions in the Location of Depots for Multiple-Delivery Journeys , 1968 .

[27]  L. Cooper.  Location-Allocation Problems , 1963 .

[28]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

[30]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

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

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

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

[34]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[35]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

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

[37]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

[39]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[40]  G Laporte,et al.  LOCATION-ROUTING PROBLEMS. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .