A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows

Autores
Lera Romero, Gonzalo; Miranda Bront, Juan Jose; Soulignac, Francisco Juan
Año de publicación
2024
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The adoption of electric vehicles (EVs) within last-mile deliveries is considered one of the key transformations towards more sustainable logistics. The inclusion of EVs introduces new operational constraints to the models such as a restricted driving range and the possibility to perform recharges en route. The discharge of the typical batteries is complex and depends on several variables, including the vehicle travel speed, but most of the approaches assume that the energy consumption depends only on the distance traveled. This becomes relevant in different logistics contexts, such as last-mile distrubtion in large cities and mid-haul logistics in retail, where traffic congestion affects severely the travel speeds. In this paper, we introduce a general version of the Time-Dependent Electric Vehicle Routing Problem with Time Windows (TDEVRPTW), which incorporates the time-dependent nature of the transportation network both in terms of travel times and the energy consumption. We propose a unifying framework to integrate other critical variable times arising during the operations previously studied in the literature, such as the time-dependent waiting times and non-linear charging times. We propose a state of the art branch-cut-and-price (BCP) algorithm. Based on extensive computational experiments, we show that the approach is very effective solving instances with up to 100 customers with different time dependent configurations. From a managerial standpoint, our experiments indicate that neglecting the travel speeds can affect the quality of the solutions obtained, where up to 40 percent of the infeasibilities induced by neglecting the time dependency can be caused by exceeding the battery capacity.
Fil: Lera Romero, Gonzalo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Miranda Bront, Juan Jose. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Torcuato Di Tella; Argentina
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Materia
BRANCH CUT AND PRICE
ELECTRIC VEHICLE ROUTING PROBLEM
LABELING ALGORITHMS
ROUTING
TIME-DEPENDENT TIMES
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/218776
Acceder
id CONICETDig_a66c0544d8d8a5c01625a46416287112
oai_identifier_str oai:ri.conicet.gov.ar:11336/218776
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windowsLera Romero, GonzaloMiranda Bront, Juan JoseSoulignac, Francisco JuanBRANCH CUT AND PRICEELECTRIC VEHICLE ROUTING PROBLEMLABELING ALGORITHMSROUTINGTIME-DEPENDENT TIMEShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1The adoption of electric vehicles (EVs) within last-mile deliveries is considered one of the key transformations towards more sustainable logistics. The inclusion of EVs introduces new operational constraints to the models such as a restricted driving range and the possibility to perform recharges en route. The discharge of the typical batteries is complex and depends on several variables, including the vehicle travel speed, but most of the approaches assume that the energy consumption depends only on the distance traveled. This becomes relevant in different logistics contexts, such as last-mile distrubtion in large cities and mid-haul logistics in retail, where traffic congestion affects severely the travel speeds. In this paper, we introduce a general version of the Time-Dependent Electric Vehicle Routing Problem with Time Windows (TDEVRPTW), which incorporates the time-dependent nature of the transportation network both in terms of travel times and the energy consumption. We propose a unifying framework to integrate other critical variable times arising during the operations previously studied in the literature, such as the time-dependent waiting times and non-linear charging times. We propose a state of the art branch-cut-and-price (BCP) algorithm. Based on extensive computational experiments, we show that the approach is very effective solving instances with up to 100 customers with different time dependent configurations. From a managerial standpoint, our experiments indicate that neglecting the travel speeds can affect the quality of the solutions obtained, where up to 40 percent of the infeasibilities induced by neglecting the time dependency can be caused by exceeding the battery capacity.Fil: Lera Romero, Gonzalo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; ArgentinaFil: Miranda Bront, Juan Jose. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Torcuato Di Tella; ArgentinaFil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaElsevier Science2024-02info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/218776Lera Romero, Gonzalo; Miranda Bront, Juan Jose; Soulignac, Francisco Juan; A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows; Elsevier Science; European Journal of Operational Research; 312; 3; 2-2024; 978-9950377-2217CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejor.2023.06.037info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S037722172300509Xinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:31:35Zoai:ri.conicet.gov.ar:11336/218776instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:31:35.642CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
title A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
spellingShingle A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
Lera Romero, Gonzalo
BRANCH CUT AND PRICE
ELECTRIC VEHICLE ROUTING PROBLEM
LABELING ALGORITHMS
ROUTING
TIME-DEPENDENT TIMES
title_short A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
title_full A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
title_fullStr A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
title_full_unstemmed A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
title_sort A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
dc.creator.none.fl_str_mv Lera Romero, Gonzalo
Miranda Bront, Juan Jose
Soulignac, Francisco Juan
author Lera Romero, Gonzalo
author_facet Lera Romero, Gonzalo
Miranda Bront, Juan Jose
Soulignac, Francisco Juan
author_role author
author2 Miranda Bront, Juan Jose
Soulignac, Francisco Juan
author2_role author
author
dc.subject.none.fl_str_mv BRANCH CUT AND PRICE
ELECTRIC VEHICLE ROUTING PROBLEM
LABELING ALGORITHMS
ROUTING
TIME-DEPENDENT TIMES
topic BRANCH CUT AND PRICE
ELECTRIC VEHICLE ROUTING PROBLEM
LABELING ALGORITHMS
ROUTING
TIME-DEPENDENT TIMES
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The adoption of electric vehicles (EVs) within last-mile deliveries is considered one of the key transformations towards more sustainable logistics. The inclusion of EVs introduces new operational constraints to the models such as a restricted driving range and the possibility to perform recharges en route. The discharge of the typical batteries is complex and depends on several variables, including the vehicle travel speed, but most of the approaches assume that the energy consumption depends only on the distance traveled. This becomes relevant in different logistics contexts, such as last-mile distrubtion in large cities and mid-haul logistics in retail, where traffic congestion affects severely the travel speeds. In this paper, we introduce a general version of the Time-Dependent Electric Vehicle Routing Problem with Time Windows (TDEVRPTW), which incorporates the time-dependent nature of the transportation network both in terms of travel times and the energy consumption. We propose a unifying framework to integrate other critical variable times arising during the operations previously studied in the literature, such as the time-dependent waiting times and non-linear charging times. We propose a state of the art branch-cut-and-price (BCP) algorithm. Based on extensive computational experiments, we show that the approach is very effective solving instances with up to 100 customers with different time dependent configurations. From a managerial standpoint, our experiments indicate that neglecting the travel speeds can affect the quality of the solutions obtained, where up to 40 percent of the infeasibilities induced by neglecting the time dependency can be caused by exceeding the battery capacity.
Fil: Lera Romero, Gonzalo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Miranda Bront, Juan Jose. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Torcuato Di Tella; Argentina
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
description The adoption of electric vehicles (EVs) within last-mile deliveries is considered one of the key transformations towards more sustainable logistics. The inclusion of EVs introduces new operational constraints to the models such as a restricted driving range and the possibility to perform recharges en route. The discharge of the typical batteries is complex and depends on several variables, including the vehicle travel speed, but most of the approaches assume that the energy consumption depends only on the distance traveled. This becomes relevant in different logistics contexts, such as last-mile distrubtion in large cities and mid-haul logistics in retail, where traffic congestion affects severely the travel speeds. In this paper, we introduce a general version of the Time-Dependent Electric Vehicle Routing Problem with Time Windows (TDEVRPTW), which incorporates the time-dependent nature of the transportation network both in terms of travel times and the energy consumption. We propose a unifying framework to integrate other critical variable times arising during the operations previously studied in the literature, such as the time-dependent waiting times and non-linear charging times. We propose a state of the art branch-cut-and-price (BCP) algorithm. Based on extensive computational experiments, we show that the approach is very effective solving instances with up to 100 customers with different time dependent configurations. From a managerial standpoint, our experiments indicate that neglecting the travel speeds can affect the quality of the solutions obtained, where up to 40 percent of the infeasibilities induced by neglecting the time dependency can be caused by exceeding the battery capacity.
publishDate 2024
dc.date.none.fl_str_mv 2024-02
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/218776
Lera Romero, Gonzalo; Miranda Bront, Juan Jose; Soulignac, Francisco Juan; A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows; Elsevier Science; European Journal of Operational Research; 312; 3; 2-2024; 978-995
0377-2217
CONICET Digital
CONICET
url http://hdl.handle.net/11336/218776
identifier_str_mv Lera Romero, Gonzalo; Miranda Bront, Juan Jose; Soulignac, Francisco Juan; A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows; Elsevier Science; European Journal of Operational Research; 312; 3; 2-2024; 978-995
0377-2217
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejor.2023.06.037
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S037722172300509X
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844614326849110016
score 13.070432

Publicaciones similares