Full text
| |
| Author(s): |
Matheus Diógenes Andrade
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Instituto de Computação |
| Defense date: | 2020-10-19 |
| Examining board members: |
Rafael Crivellari Saliba Schouery;
Christiano Lyra Filho
|
| Advisor: | Fábio Luiz Usberti |
| Abstract | |
This dissertation investigates the Green Vehicle Routing Problem (G-VRP), which is an NP-hard problem that generalizes the Vehicle Routing Problem (VRP) and integrates it with the green logistics. In the G-VRP, electric vehicles with limited autonomy can recharge at Alternative Fuel Stations (AFSs) to keep visiting customers. This problem was introduced by Erdogan and Miller-Hooks [11] and approached later by Çagri Koç and Karaoglan [41], and Leggieri and Haouari [19], considers that consecutive AFSs visits are not allowed, i.e., a solution cannot have an edge between two AFSs. In this dissertation, two G-VRP versions are investigated, (i) where consecutive AFSs visits are not allowed, and (ii) where consecutive AFSs visits are allowed, i.e., a solution may have an edge between two AFSs. Two new benchmark instances sets are proposed. This research proposes combinatorial properties, valid inequalities, MILP formulations, preprocessing conditions and lower bounds which have the potential to strengthen the mathematical formulations for both G-VRP versions, thus improving their exact solution. The proposed lower bounds, valid inequalities, and preprocessing conditions applied to the proposed formulations were evaluated with extensive computational experiments. The results are analyzed and discussed, and conclusions on the benefits of the contributions are presented (AU) | |
| FAPESP's process: | 18/25950-5 - An algorithm for the electrical vehicle routin problem |
| Grantee: | Matheus Diógenes Andrade |
| Support Opportunities: | Scholarships in Brazil - Master |