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

Authors: Alfredo Olivera, Omar Viera

Addresses: Instituto de Computacion, Facultad de Ingenieria, Universidad de la Republica, Herrera y Reissig 525 Montevideo, Uruguay. ' Instituto de Computacion, Facultad de Ingenieria, Universidad de la Republica, Herrera y Reissig 525, Montevideo, Uruguay

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.

Keywords: vehicle routing; multiple trips; adaptive memory; industrial logistics.

DOI: 10.1504/IJLSM.2007.013213

International Journal of Logistics Systems and Management, 2007 Vol.3 No.4, pp.440 - 450

Published online: 12 Apr 2007 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article