Solving the vehicle routing problem with multiple trips by adaptive memory programming

Solving the vehicle routing problem with multiple trips by adaptive memory programming

0.00 Avg rating0 Votes
Article ID: iaor2008234
Country: United Kingdom
Volume: 3
Issue: 4
Start Page Number: 440
End Page Number: 450
Publication Date: Jun 2007
Journal: International Journal of Logistics Systems and Management
Authors: ,
Keywords: heuristics
Abstract:

In the Vehicle Routing Problem with Multiple Trips (VRPMT), besides the classic Vehicle Routing Problem (VRP) constraints, each vehicle is allowed to perform several routes in the same planning period. In this paper we propose a heuristic based on the Adaptive Memory Procedure (AMP) to solve this problem. Good quality solutions were found over a set of benchmark problem instances.

Reviews

Required fields are marked *. Your email address will not be published.