The Multi-period Profit Collection Vehicle Routing Problem with Time Windows
This paper addresses a new variant of the vehicle routing problem with time windows that takes drivers’ working periods into consideration. In this problem, each vehicle is dispatched to perform one route in a multi-period planning horizon. At the end of each period, each vehicle is not required to return to the depot but must stay at one of vertices for recuperation. We propose a tabu search algorithm to solve 48 test instances generated from Solomon’s VRPTW instances. The computational results can serve as benchmarks for future researchers on the problem.
Keywordsvehicle routing problem multiple working periods tabu search
Unable to display preview. Download preview PDF.