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...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Estado: | Versión publicada |
| Fecha de publicación: | 2004 |
| País: | Uruguay |
| Institución: | Universidad de la República |
| Repositorio: | COLIBRI |
| OAI Identifier: | oai:colibri.udelar.edu.uy:20.500.12008/3509 |
| Acceso en línea: | http://hdl.handle.net/20.500.12008/3509 |
| Access Level: | acceso abierto |
| Palabra clave: | RUTEO DE VEHICULOS VEHICLE ROUTING MULTIPLE TRIPS ADAPTIVE MEMORY PROCEDURE |
| 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. |
|---|