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.

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Benoit Crevier, Jean-François Cordeau, Gilbert Laporte
• Keywords: Adaptative Memory Principle, EOR 2007, Multi-depot Vehicle, Tabu Search Method