The multi-depot vehicle routing problem with inter-depot routes

摘要

This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes 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. (c) 2005 Elsevier B.V. All rights reserved.