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, mathematical formulation is given in which these assumptions relaxed. inherent complexity LRP makes it impossible to solve on larger scale, original divided into two sub-problems, i.e., location-allocation general vehicle routing respectively. Each sub-problem then solved sequential iterative manner by simulated annealing algorithm embedded framework problem-solving procedure. Test problems from literature newly created used test proposed method. The results indicate that performs well terms solution quality run time consumed. In addition, setting parameters throughout procedure obtaining quick favorable solutions also suggested.