Mostrar el registro sencillo del ítem
dc.contributor.author
Lera Romero, Gonzalo
dc.contributor.author
Miranda Bront, Juan Jose
dc.contributor.author
Soulignac, Francisco Juan
dc.date.available
2023-11-29T12:45:13Z
dc.date.issued
2024-02
dc.identifier.citation
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
dc.identifier.issn
0377-2217
dc.identifier.uri
http://hdl.handle.net/11336/218776
dc.description.abstract
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.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
Elsevier Science
dc.rights
info:eu-repo/semantics/openAccess
dc.rights.uri
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.subject
BRANCH CUT AND PRICE
dc.subject
ELECTRIC VEHICLE ROUTING PROBLEM
dc.subject
LABELING ALGORITHMS
dc.subject
ROUTING
dc.subject
TIME-DEPENDENT TIMES
dc.subject.classification
Otras Ciencias de la Computación e Información
dc.subject.classification
Ciencias de la Computación e Información
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.title
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
dc.type
info:eu-repo/semantics/article
dc.type
info:ar-repo/semantics/artículo
dc.type
info:eu-repo/semantics/publishedVersion
dc.date.updated
2023-11-28T14:33:20Z
dc.journal.volume
312
dc.journal.number
3
dc.journal.pagination
978-995
dc.journal.pais
Países Bajos
dc.journal.ciudad
Amsterdam
dc.description.fil
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
dc.description.fil
Fil: Miranda Bront, Juan Jose. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Torcuato Di Tella; Argentina
dc.description.fil
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
dc.journal.title
European Journal of Operational Research
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.ejor.2023.06.037
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S037722172300509X
Archivos asociados