Resumen
The vehicle routing problem is a classic optimization problem with many variants. One of the variants is given by the inclusion of the time windows constraint which requires the clients to be served within a delimited time frame. Because of its complexity, vehicle routing problems are usually solved by using heuristics without optimality guarantee. This paper describes two hyper-heuristics capable of producing results comparable to the ones obtained by the best-performing heuristics on different sets of benchmark instances.
Idioma original | Inglés |
---|---|
Título de la publicación alojada | GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference |
Editorial | Association for Computing Machinery, Inc |
Páginas | 139-140 |
Número de páginas | 2 |
ISBN (versión digital) | 9781450343237 |
DOI | |
Estado | Publicada - 20 jul. 2016 |
Evento | 2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion - Denver, Estados Unidos Duración: 20 jul. 2016 → 24 jul. 2016 |
Otros
Otros | 2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion |
---|---|
País/Territorio | Estados Unidos |
Ciudad | Denver |
Período | 20/07/16 → 24/07/16 |
Áreas temáticas de ASJC Scopus
- Software
- Informática aplicada
- Teoría computacional y matemáticas