Adaptive memory programming for the vehicle routing problem with multiple trip

Abstract

The Vehicle Routing Problem with Multiple Trips is an extension of the classical Vehicle Routing Problem in which each vehicle may perform several routes in the same planning period. In this paper, an adaptive memory algorithm to solve this problem is proposed. The algorithm was run over a set of benchmark problem instances, consistently finding high-quality solutions.