Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows

David Espinoza-Nevárez, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Gustavo Gatica

Resultado de la investigación: Conference contribution

1 Cita (Scopus)

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 originalEnglish
Título de la publicación alojadaGECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference
EditorialAssociation for Computing Machinery, Inc
Páginas139-140
Número de páginas2
ISBN (versión digital)9781450343237
DOI
EstadoPublished - 20 jul 2016
Evento2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion - Denver, United States
Duración: 20 jul 201624 jul 2016

Other

Other2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion
PaísUnited States
CiudadDenver
Período20/07/1624/07/16

Huella dactilar

Vehicle routing

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computational Theory and Mathematics

Citar esto

Espinoza-Nevárez, D., Ortiz-Bayliss, J. C., Terashima-Marín, H., & Gatica, G. (2016). Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows. En GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference (pp. 139-140). Association for Computing Machinery, Inc. https://doi.org/10.1145/2908961.2909051
Espinoza-Nevárez, David ; Ortiz-Bayliss, José Carlos ; Terashima-Marín, Hugo ; Gatica, Gustavo. / Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows. GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc, 2016. pp. 139-140
@inproceedings{cb790925de54462b8d1a4951edd37f14,
title = "Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows",
abstract = "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.",
keywords = "Genetic algorithms, Genetic programming, Heuristics, Hyper-heuristics",
author = "David Espinoza-Nev{\'a}rez and Ortiz-Bayliss, {Jos{\'e} Carlos} and Hugo Terashima-Mar{\'i}n and Gustavo Gatica",
year = "2016",
month = "7",
day = "20",
doi = "10.1145/2908961.2909051",
language = "English",
pages = "139--140",
booktitle = "GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference",
publisher = "Association for Computing Machinery, Inc",

}

Espinoza-Nevárez, D, Ortiz-Bayliss, JC, Terashima-Marín, H & Gatica, G 2016, Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows. En GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc, pp. 139-140, 2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion, Denver, United States, 20/07/16. https://doi.org/10.1145/2908961.2909051

Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows. / Espinoza-Nevárez, David; Ortiz-Bayliss, José Carlos; Terashima-Marín, Hugo; Gatica, Gustavo.

GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc, 2016. p. 139-140.

Resultado de la investigación: Conference contribution

TY - GEN

T1 - Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows

AU - Espinoza-Nevárez, David

AU - Ortiz-Bayliss, José Carlos

AU - Terashima-Marín, Hugo

AU - Gatica, Gustavo

PY - 2016/7/20

Y1 - 2016/7/20

N2 - 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.

AB - 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.

KW - Genetic algorithms

KW - Genetic programming

KW - Heuristics

KW - Hyper-heuristics

UR - http://www.scopus.com/inward/record.url?scp=84986275929&partnerID=8YFLogxK

U2 - 10.1145/2908961.2909051

DO - 10.1145/2908961.2909051

M3 - Conference contribution

AN - SCOPUS:84986275929

SP - 139

EP - 140

BT - GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference

PB - Association for Computing Machinery, Inc

ER -

Espinoza-Nevárez D, Ortiz-Bayliss JC, Terashima-Marín H, Gatica G. Selection and generation hyper-heuristics for solving the vehicle routing problem with time windows. En GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc. 2016. p. 139-140 https://doi.org/10.1145/2908961.2909051