Article ID: | iaor20084441 |
Country: | Netherlands |
Volume: | 176 |
Issue: | 2 |
Start Page Number: | 756 |
End Page Number: | 773 |
Publication Date: | Jan 2007 |
Journal: | European Journal of Operational Research |
Authors: | Laporte Gilbert, Cordeau Jean-Franois, Crevier Benoit |
Keywords: | heuristics: tabu search, programming: integer |
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.