Variable neighborhood search for a dynamic rich vehicle routing problem with time windows

A Dynamic Rich Vehicle Routing Problem with Time Windows has been tackled as a real-world application, in which customers requests can be either known at the beginning of the planning horizon or dynamically revealed over the day. Several real constraints, such as heterogeneous fleet of vehicles, mul...

Descripción completa

Detalles Bibliográficos
Autores: De Armas, Jésica, Melián-Batista, Belén
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2015
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10230/59083
Acceso en línea:http://hdl.handle.net/10230/59083
http://dx.doi.org/10.1016/j.cie.2015.03.006
Access Level:acceso abierto
Palabra clave:Dynamic rich vehicle routing problem
Metaheuristics
id ES_7dfd46b4c24131e574b4cb3b28da1e38
oai_identifier_str oai:recercat.cat:10230/59083
network_acronym_str ES
network_name_str España
repository_id_str
spelling Variable neighborhood search for a dynamic rich vehicle routing problem with time windowsDe Armas, JésicaMelián-Batista, BelénDynamic rich vehicle routing problemMetaheuristicsA Dynamic Rich Vehicle Routing Problem with Time Windows has been tackled as a real-world application, in which customers requests can be either known at the beginning of the planning horizon or dynamically revealed over the day. Several real constraints, such as heterogeneous fleet of vehicles, multiple and soft time windows and customers priorities, are taken into consideration. Using exact methods is not a suitable solution for this kind of problems, given the fact that the arrival of a new request has to be followed by a quick re-optimization phase to include it into the solution at hand. Therefore, we have proposed a metaheuristic procedure based on Variable Neighborhood Search to solve this particular problem. The computational experiments reported in this work indicate that the proposed method is feasible to solve this real-world problem and competitive with the best results from the literature. Finally, it is worth mentioning that the software developed in this work has been inserted into the fleet management system of a company in Spain.Elsevier202420242015info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/10230/59083http://dx.doi.org/10.1016/j.cie.2015.03.006reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésComputers & Industrial Engineering. 2015 Jul;85:120-31© Elsevier http://dx.doi.org/10.1016/j.cie.2015.03.006info:eu-repo/semantics/openAccessoai:recercat.cat:10230/590832026-05-29T05:05:01Z
dc.title.none.fl_str_mv Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
title Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
spellingShingle Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
De Armas, Jésica
Dynamic rich vehicle routing problem
Metaheuristics
title_short Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
title_full Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
title_fullStr Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
title_full_unstemmed Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
title_sort Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
dc.creator.none.fl_str_mv De Armas, Jésica
Melián-Batista, Belén
author De Armas, Jésica
author_facet De Armas, Jésica
Melián-Batista, Belén
author_role author
author2 Melián-Batista, Belén
author2_role author
dc.subject.none.fl_str_mv Dynamic rich vehicle routing problem
Metaheuristics
topic Dynamic rich vehicle routing problem
Metaheuristics
description A Dynamic Rich Vehicle Routing Problem with Time Windows has been tackled as a real-world application, in which customers requests can be either known at the beginning of the planning horizon or dynamically revealed over the day. Several real constraints, such as heterogeneous fleet of vehicles, multiple and soft time windows and customers priorities, are taken into consideration. Using exact methods is not a suitable solution for this kind of problems, given the fact that the arrival of a new request has to be followed by a quick re-optimization phase to include it into the solution at hand. Therefore, we have proposed a metaheuristic procedure based on Variable Neighborhood Search to solve this particular problem. The computational experiments reported in this work indicate that the proposed method is feasible to solve this real-world problem and competitive with the best results from the literature. Finally, it is worth mentioning that the software developed in this work has been inserted into the fleet management system of a company in Spain.
publishDate 2015
dc.date.none.fl_str_mv 2015
2024
2024
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10230/59083
http://dx.doi.org/10.1016/j.cie.2015.03.006
url http://hdl.handle.net/10230/59083
http://dx.doi.org/10.1016/j.cie.2015.03.006
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computers & Industrial Engineering. 2015 Jul;85:120-31
dc.rights.none.fl_str_mv © Elsevier http://dx.doi.org/10.1016/j.cie.2015.03.006
info:eu-repo/semantics/openAccess
rights_invalid_str_mv © Elsevier http://dx.doi.org/10.1016/j.cie.2015.03.006
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411704309284864
score 15,811543

Similares en LA Referencia