Vehicle routing problems with multiple trips
Abstract
This paper presents a survey on the Multi-Trip Vehicle Routing Problem (MTVRP) and on
related routing problems where vehicles are allowed to perform multiple trips. The first part of
the paper focuses on the MTVRP. It gives an unified view on mathematical formulations and
surveys exact and heuristic approaches. The paper continues with variants of the MTVRP and
other families of routing problems where multiple trips are sometimes allowed. For the latter, it
specially insists on the motivations for having multiple trips and the algorithmic consequences.
The expected contribution of the survey is to give a comprehensive overview on a structural
property of routing problems that has seen a strongly growing interest in the last few years and
that has been investigated in very different areas of the routing literature.