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

Mostrar todas las versiones(2)

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 programm...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: García, Emilio, Torres, Luis M., Miranda Bront, Juan José
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2024
Materias:
Ciencias Informáticas
Integer linear programming
Electric Vehicle Routing Problem
Steep Slope
Multiple Paths
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/177368
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-177368
record_format dspace
spelling I19-R120-10915-1773682025-05-08T17:41:52Z http://sedici.unlp.edu.ar/handle/10915/177368 Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets García, Emilio Torres, Luis M. Miranda Bront, Juan José 2024-08 2024 2025-03-13T16:53:46Z en Ciencias Informáticas Integer linear programming 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. Sociedad Argentina de Informática e Investigación Operativa Objeto de conferencia Objeto de conferencia http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) application/pdf 426-429
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Integer linear programming
Electric Vehicle Routing Problem
Steep Slope
Multiple Paths
spellingShingle Ciencias Informáticas
Integer linear programming
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 Ciencias Informáticas
Integer linear programming
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 Objeto de conferencia
Objeto de conferencia
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
publishDate 2024
url http://sedici.unlp.edu.ar/handle/10915/177368
work_keys_str_mv AT garciaemilio electricvehicleroutingmodelforlastmilelogisticsincitieswithsteepstreets
AT torresluism electricvehicleroutingmodelforlastmilelogisticsincitieswithsteepstreets
AT mirandabrontjuanjose electricvehicleroutingmodelforlastmilelogisticsincitieswithsteepstreets
_version_ 1847925362375262208

Ejemplares similares