Solving the vehicle routing problem with multiple trips by adaptive memory programming
by Alfredo Olivera, Omar Viera
International Journal of Logistics Systems and Management (IJLSM), Vol. 3, No. 4, 2007

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.

Online publication date: Thu, 12-Apr-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com