Adaptive memory programming for the vehicle routing problem with multiple trip
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 be...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | report |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.12008/3509 |
| Tags: |
No Tags, Be the first to tag this record!
|