Rares Alexandru Balan
A Heuristic for the Electric Vehicle Routing Problem with Time Windows and Stochastic Waiting Times.
Rel. Edoardo Fadda, Maurizio Bruglieri, Domenico Potena, Ornella Pisacane. Politecnico di Torino, Corso di laurea magistrale in Ict For Smart Societies (Ict Per La Società Del Futuro), 2024
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (992kB) | Preview |
Abstract
Logistics is one of the greatest sources of pollution. For this reason, electric vehicles for pick up and deliveries are starting to be common. In the last mile setting, the management of these vehicles is not a big challenge since batteries have enough charge to cover the entire day of usage. Nevertheless, in the mid-haul setting, the distances to be covered in a single working day are usually more than the vehicle's capability over a single charge, therefore a recharging stop is required. This paves the way for the application of optimization methods. In this context, we consider the Electric Vehicle Routing Problem for defining the planning of a series of pick-ups spatially distributed so that the vehicles may need a recharge at a station.
The proposed solution methodology uses an Adaptive Large Neighborhood Search in which the first stage aims at destroying and repairing the solution using the expected waiting time at the stations
Relatori
Anno Accademico
Tipo di pubblicazione
Numero di pagine
Corso di laurea
Classe di laurea
Aziende collaboratrici
URI
![]() |
Modifica (riservato agli operatori) |
