Rich vehicle routing problems: models and algorithms for deterministic and stochastic variants
In the past few years, the development of computer technology together with methodological advances in Operations Research has motivated the investigation of more complex variants of the Vehicle Routing Problem. These variants are often inspired by real-world applications and they often include challenging objective functions and constraints. In the literature, such problems are referred to as Rich Vehicle Routing Problems (RVRPs).
The interest on RVRPs has recently increased and especially focused on deterministic variants, although most realistic applications are typically characterized by a high level of uncertainty. Indeed, logistics managers must be prepared to make complex decisions without complete information. On the other hand, taking uncertainties into account adds more challenges to modeling and solving the involved problems. This research project aims at studying RVRPs that arise on commercial and humanitarian logistics, under deterministic and stochastic perspectives.
We intend to develop new mathematical formulations and exact, heuristic and hybrid methods for RVRPs that capture real-world features and are computationally efficient to aid decision making in practice. This project has the potential of estaablishing and consolidating a collaboration between research groups from the states of Paraı́ba and São Paulo, in an effort to effectively address challenging practical problems, with scientific and technological outcomes for both states.
- Universidade Federal de São Carlos (UFSCar)
- Universidade Federal de Pernambuco (UFPE)
- Anand Subramanian (UFPB – LASER)
- Bruno Petrato Bruck (UFPB – LASER)
- Teobaldo Leite Bulhões Junior (UFPB – LASER)
- Pedro Munari (UFSCar)
- Walton Pereira Coutinho (UFPE)