Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility

The multiperiod vehicle routing problem (MPVRP) is an extension of the vehicle routing problem in which customer demands have to be delivered in one of several consecutive time periods, for example, the days of a week. We introduce and explore a variant of the MPVRP in which the carrier offers a pri...

ver descrição completa

Detalhes bibliográficos
Autores: Estrada-Moreno, Alejandro|||0000-0001-9767-2177, Savelsbergh, M., Juan, Ángel A|||0000-0003-1392-1776, Panadero, Javier|||0000-0002-3793-3328
Tipo de documento: artigo
Data de publicação:2019
País:España
Recursos:Universitat Autònoma de Barcelona
Repositório:Dipòsit Digital de Documents de la UAB
Idioma:inglês
OAI Identifier:oai:ddd.uab.cat:294238
Acesso em linha:https://ddd.uab.cat/record/294238
https://dx.doi.org/urn:doi:10.1111/itor.12625
Access Level:Acceso aberto
Palavra-chave:Biased-randomized heuristics
Iterated local search
Multiperiod
Price discounts
Vehicle routing problem
id ES_6182b3285f5538d7d5b2298d4eac1d0e
oai_identifier_str oai:ddd.uab.cat:294238
network_acronym_str ES
network_name_str España
repository_id_str
spelling Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibilityEstrada-Moreno, Alejandro|||0000-0001-9767-2177Savelsbergh, M.Juan, Ángel A|||0000-0003-1392-1776Panadero, Javier|||0000-0002-3793-3328Biased-randomized heuristicsIterated local searchMultiperiodPrice discountsVehicle routing problemThe multiperiod vehicle routing problem (MPVRP) is an extension of the vehicle routing problem in which customer demands have to be delivered in one of several consecutive time periods, for example, the days of a week. We introduce and explore a variant of the MPVRP in which the carrier offers a price discount in exchange for delivery flexibility. The carrier's goal is to minimize total costs, which consist of the distribution costs and the discounts paid. A biased-randomized iterated local search algorithm is proposed for its solution. The two-stage algorithm first quickly generates a number of promising customer-to-period assignments, and then intensively explores a subset of these assignments. An extensive computational study demonstrates the efficacy of the proposed algorithm and highlights the benefit of pricing for delivery flexibility in different settings. 22019-01-0120192019-01-01Articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://ddd.uab.cat/record/294238https://dx.doi.org/urn:doi:10.1111/itor.12625reponame:Dipòsit Digital de Documents de la UABinstname:Universitat Autònoma de BarcelonaInglésengopen accesshttp://purl.org/coar/access_right/c_abf2Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.https://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:ddd.uab.cat:2942382026-06-06T12:50:31Z
dc.title.none.fl_str_mv Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
title Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
spellingShingle Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
Estrada-Moreno, Alejandro|||0000-0001-9767-2177
Biased-randomized heuristics
Iterated local search
Multiperiod
Price discounts
Vehicle routing problem
title_short Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
title_full Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
title_fullStr Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
title_full_unstemmed Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
title_sort Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
dc.creator.none.fl_str_mv Estrada-Moreno, Alejandro|||0000-0001-9767-2177
Savelsbergh, M.
Juan, Ángel A|||0000-0003-1392-1776
Panadero, Javier|||0000-0002-3793-3328
author Estrada-Moreno, Alejandro|||0000-0001-9767-2177
author_facet Estrada-Moreno, Alejandro|||0000-0001-9767-2177
Savelsbergh, M.
Juan, Ángel A|||0000-0003-1392-1776
Panadero, Javier|||0000-0002-3793-3328
author_role author
author2 Savelsbergh, M.
Juan, Ángel A|||0000-0003-1392-1776
Panadero, Javier|||0000-0002-3793-3328
author2_role author
author
author
dc.subject.none.fl_str_mv Biased-randomized heuristics
Iterated local search
Multiperiod
Price discounts
Vehicle routing problem
topic Biased-randomized heuristics
Iterated local search
Multiperiod
Price discounts
Vehicle routing problem
description The multiperiod vehicle routing problem (MPVRP) is an extension of the vehicle routing problem in which customer demands have to be delivered in one of several consecutive time periods, for example, the days of a week. We introduce and explore a variant of the MPVRP in which the carrier offers a price discount in exchange for delivery flexibility. The carrier's goal is to minimize total costs, which consist of the distribution costs and the discounts paid. A biased-randomized iterated local search algorithm is proposed for its solution. The two-stage algorithm first quickly generates a number of promising customer-to-period assignments, and then intensively explores a subset of these assignments. An extensive computational study demonstrates the efficacy of the proposed algorithm and highlights the benefit of pricing for delivery flexibility in different settings.
publishDate 2019
dc.date.none.fl_str_mv 2
2019-01-01
2019
2019-01-01
dc.type.none.fl_str_mv Article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://ddd.uab.cat/record/294238
https://dx.doi.org/urn:doi:10.1111/itor.12625
url https://ddd.uab.cat/record/294238
https://dx.doi.org/urn:doi:10.1111/itor.12625
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Dipòsit Digital de Documents de la UAB
instname:Universitat Autònoma de Barcelona
instname_str Universitat Autònoma de Barcelona
reponame_str Dipòsit Digital de Documents de la UAB
collection Dipòsit Digital de Documents de la UAB
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869409421909557249
score 15,812429

Registros relacionados