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!
|
Similar Items: Adaptive memory programming for the vehicle routing problem with multiple trip
- Memorias adaptativas para el problema de ruteo de vehículos con múltiples viajes
- Split delivery vehicle routing problem : heuristic based algorithms
- Comparing assignment algorithms for the Multi-Depot VRP
- Adapted Clustering Algorithms for the Assignment Problem in the MDVRPTW
- Heurísticas para problemas de ruteo de vehículos
- Design, construction and manually or autonomously control of an unmanned aerial vehicle