With the increasing demand for online shopping and home delivery services, optimizing the routing of electric delivery vehicles in urban areas is crucial to reduce environmental pollution and improve operational efficiency. To address this opportunity, we optimize the Steiner Traveling Salesman Problem (STSP) for electric vehicles (EVs) in urban areas by combining city graphs with topographic and traffic information. The STSP is a variant of the traditional Traveling Salesman Problem (TSP) where it is not mandatory to visit all the nodes present in the graph. We train an artificial neural network (ANN) model to estimate electric consumption between nodes in the route using synthetic data generated with historical traffic simulation and topographical data. This allows us to generate smaller-weighted graphs that transform the problem from an STSP to a normal TSP where the 2-opt optimization algorithm is used to solve it with a Nearest Neighbor (NN) initialization. Compared to the approach of optimizing routes based on distance, our proposed algorithm offers a fast solution to the STSP for EVs (EV-STSP) with routes that consume 17.34% less energy for the test instances generated.
This work has been the result of a students’s project in the subject Project III in the Data Science degree. It has been published in Algorithms:
Ahsini, Y.; Díaz-Masa, P.; Inglés, B.; Rubio, A.; Martínez, A.; Magraner, A.; Conejero, J.A. The Electric Vehicle Traveling Salesman Problem on Digital Elevation Models for Traffic-Aware Urban Logistics. Algorithms 2023, 16, 402. https://doi.org/10.3390/a16090402
