A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes

摘要

The multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is an extension to the classical Vehicle Routing Problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.