Adaptive memory programming for the vehicle routing problem with multiple trip
Resumen:
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 benchmark problem instances, consistently finding high-quality solutions.
| 2004 | |
|
RUTEO DE VEHICULOS VEHICLE ROUTING MULTIPLE TRIPS ADAPTIVE MEMORY PROCEDURE |
|
| Universidad de la República | |
| COLIBRI | |
| http://hdl.handle.net/20.500.12008/3509 | |
| Acceso abierto | |
| Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) |
| Sumario: | 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 benchmark problem instances, consistently finding high-quality solutions. |
|---|
