Fabio Lauro
A Cost Function Approximation Approach to the Dynamic Stochastic Vehicle Routing Problem.
Rel. Paolo Brandimarte. Politecnico di Torino, Corso di laurea magistrale in Ingegneria Matematica, 2026
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (11MB) | Preview |
Abstract
The recent boom of online shopping caused a reshaping of the logistics industry: demand skyrocketed and new business models emerged, along with stronger concerns about environmental and energy impact. Therefore, the need for better service, possibly obtained through algorithmic decision-making, is as strong as ever. The Vehicle Routing Problem (VRP) deals with the optimization of service to clients characterized by their location through a fleet of trucks. In Dynamic Stochastic VRPs, the problem is defined in a sequence of time periods in which new information is revealed dynamically (like new clients, for example), and there are stochastic variables representing uncertainty on location or demand, among other things.
These problems are usually very hard to solve, due to their dimensionality, the need to account for uncertainty, the variety of constraints and the interaction between decision variables
Relatori
Anno Accademico
Tipo di pubblicazione
Numero di pagine
Corso di laurea
Classe di laurea
URI
![]() |
Modifica (riservato agli operatori) |
