19 out 2020
14:00 Master's Defense Fully distance
Theme
Formulations for the Green Vehicle Routing Problem
Student
Matheus Diógenes Andrade
Advisor / Teacher
Fabio Luiz Usberti
Brief summary
This work aims to investigate the Green Vehicle Routing Problem (G-VRP), or Green Vehicle Routing Problem, an NP-difficult problem that generalizes the Vehicle Routing Problem (VRP), or Vehicle Routing Problem, and integrates it with green logistics. At G-VRP, electric vehicles with limited autonomy can refuel at Alternative Fuel Stations (AFSs), or Alternative Fuel Stations, to visit customers. This version of the problem that was introduced by Erdoğan and Miller-Hooks (2012), and addressed by Koçe and Karaoglan (2016), and Leggieri and Haouari (2017), considers that consecutive visits to AFSs are not allowed, that is, a solution it cannot have an edge between two AFSs. In this work two versions of G-VRP are investigated, (i) where consecutive visits to AFSs are not allowed, and (ii) where consecutive visits to AFSs are allowed, that is, a solution can have an edge between two AFSs. As far as we know, this is the first work that addresses version (ii) of the problem. This research proposes combinatorial properties, valid inequalities, mixed integer linear programming formulations and pre-processing conditions for the two versions of G-VRP.
Examination Board
Headlines:
| Fábio Luiz Usberti | IC / UNICAMP |
| Christiano Lyra Filho | FEEC / UNICAMP |
| Rafael Crivellari Saliba Schouery | IC / UNICAMP |
Substitutes:
| Christiane Neme Campos | IC / UNICAMP |
| Pedro Henrique Del Bianco Hokama | IMC / UNIFEI |