Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets

The Quito local government aims to establish a low-emission zone in the city’s historic center. A key focus is the shift to eco-friendly transportation for last-mile logistics, including electric cargo bikes and other types of light electric vehicles (LEVs). Our research delves into integer prog...

Descripción completa

Detalles Bibliográficos
Autores principales: García, Emilio, Torres, Luis M, Miranda Bront, Juan José
Formato: Artículo publishedVersion
Lenguaje:Inglés
Publicado: Memorias de las JAIIO (ISSN 2451-7496) 2024
Materias:
Acceso en línea:https://repositorio.utdt.edu/handle/20.500.13098/13141
Aporte de:
id I57-R163-20.500.13098-13141
record_format dspace
spelling I57-R163-20.500.13098-131412024-11-09T07:00:23Z Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets García, Emilio Torres, Luis M Miranda Bront, Juan José Programación lineal entera Integer Linear Programming (ILP) Electric vehicle routing problem Steep Slope Multiple Paths The Quito local government aims to establish a low-emission zone in the city’s historic center. A key focus is the shift to eco-friendly transportation for last-mile logistics, including electric cargo bikes and other types of light electric vehicles (LEVs). Our research delves into integer programming models to optimize the vehicle routes. We address a variation of the electric vehicle routing problem (EVRP), factoring in vehicle load and street slope for battery consumption and travel times. Moreover, we consider the existence of multiple paths between each pair of customers, which vary in distance and slope, yielding different travel times and battery consumption values. For instance, some paths may have small travel times but require high battery consumption, while other paths may have longer travel times and require less battery consumption. The problem is formulated on a customer multigraph that has one node for each customer and depot, and where parallel arcs are used to represent efficient paths in the original network. Road selection is carried out as part of the vehicle routing. This talk highlights findings on modeling strategies and reports some computational results to examine the impact of some model parameters upon the optimal solutions. Este artículo se encuentra originalmente publicado en Memorias de las JAIIO (ISSN 2451-7496) 2024-11-08T18:24:14Z 2024-11-08T18:24:14Z 2024-08-29 info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion https://repositorio.utdt.edu/handle/20.500.13098/13141 eng Memorias de las JAIIO (ISSN 2451-7496) info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-sa/2.5/ar/ pp.426-429 application/pdf application/pdf Memorias de las JAIIO (ISSN 2451-7496)
institution Universidad Torcuato Di Tella
institution_str I-57
repository_str R-163
collection Repositorio Digital Universidad Torcuato Di Tella
language Inglés
orig_language_str_mv eng
topic Programación lineal entera
Integer Linear Programming (ILP)
Electric vehicle routing problem
Steep Slope
Multiple Paths
spellingShingle Programación lineal entera
Integer Linear Programming (ILP)
Electric vehicle routing problem
Steep Slope
Multiple Paths
García, Emilio
Torres, Luis M
Miranda Bront, Juan José
Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
topic_facet Programación lineal entera
Integer Linear Programming (ILP)
Electric vehicle routing problem
Steep Slope
Multiple Paths
description The Quito local government aims to establish a low-emission zone in the city’s historic center. A key focus is the shift to eco-friendly transportation for last-mile logistics, including electric cargo bikes and other types of light electric vehicles (LEVs). Our research delves into integer programming models to optimize the vehicle routes. We address a variation of the electric vehicle routing problem (EVRP), factoring in vehicle load and street slope for battery consumption and travel times. Moreover, we consider the existence of multiple paths between each pair of customers, which vary in distance and slope, yielding different travel times and battery consumption values. For instance, some paths may have small travel times but require high battery consumption, while other paths may have longer travel times and require less battery consumption. The problem is formulated on a customer multigraph that has one node for each customer and depot, and where parallel arcs are used to represent efficient paths in the original network. Road selection is carried out as part of the vehicle routing. This talk highlights findings on modeling strategies and reports some computational results to examine the impact of some model parameters upon the optimal solutions.
format Artículo
publishedVersion
author García, Emilio
Torres, Luis M
Miranda Bront, Juan José
author_facet García, Emilio
Torres, Luis M
Miranda Bront, Juan José
author_sort García, Emilio
title Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
title_short Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
title_full Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
title_fullStr Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
title_full_unstemmed Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
title_sort electric vehicle routing model for last-mile logistics in cities with steep streets
publisher Memorias de las JAIIO (ISSN 2451-7496)
publishDate 2024
url https://repositorio.utdt.edu/handle/20.500.13098/13141
work_keys_str_mv AT garciaemilio electricvehicleroutingmodelforlastmilelogisticsincitieswithsteepstreets
AT torresluism electricvehicleroutingmodelforlastmilelogisticsincitieswithsteepstreets
AT mirandabrontjuanjose electricvehicleroutingmodelforlastmilelogisticsincitieswithsteepstreets
_version_ 1823894524581117952