Heuristic solutions to multi-depot location-routing problems

Heuristic solutions to multi-depot location-routing problems

0.00 Avg rating0 Votes
Article ID: iaor200386
Country: United Kingdom
Volume: 29
Issue: 10
Start Page Number: 1393
End Page Number: 1415
Publication Date: Sep 2002
Journal: Computers and Operations Research
Authors: , ,
Keywords: vehicle routing & scheduling, optimization: simulated annealing, heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.