Split delivery vehicle routing problem : heuristic based algorithms
Resumen:
The Split Delivery Vehicle Routing Problem is a relaxation of the classical problem of combinatorial optimization Vehicle Routing Problem, where the restriction that each customer must be visited only once by a single vehicle is removed. In this report we present a summary of algorithms based on heuristics for the resolution of this problem
El Split Delivery Vehicle Routing Problem es una relajación del clásico problema de optimización combinatoria Vehicle Routing Problem, en el que se excluye la restricción de que cada cliente sea visitado solamente una vez por un único vehículo. En este reporte se presenta una recopilación de algoritmos basados en heurísticas para la resolución de este problema.
| 2007 | |
|
Split Delivery Vehicle Routing Problem Optimal Solutions Heuristics Metaheuristics |
|
| Universidad de la República | |
| COLIBRI | |
| http://hdl.handle.net/20.500.12008/3551 | |
| Acceso abierto | |
| Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) |
| Sumario: | The Split Delivery Vehicle Routing Problem is a relaxation of the classical problem of combinatorial optimization Vehicle Routing Problem, where the restriction that each customer must be visited only once by a single vehicle is removed. In this report we present a summary of algorithms based on heuristics for the resolution of this problem |
|---|
