| Full text | |
| Author(s): |
Andrade, Matheus Diogenes
;
Usberti, Fabio Luiz
;
Ferreira, CE
;
Lee, O
;
Miyazawa, FK
Total Authors: 5
|
| Document type: | Journal article |
| Source: | PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM; v. 195, p. 11-pg., 2021-01-01. |
| Abstract | |
This work provides a theoretical study of 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 [3] and approached later by [4], and [5], all of which consider that consecutive AFSs visits are not allowed, i.e., a solution cannot have an edge between two AFSs. In this work, 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. This research proposes combinatorial properties and lower bounds which have the potential to strengthen the mathematical formulations for both G-VRP versions, thus improving exact solution methodologies. (C) 2021 The Authors. Published by Elsevier B.V. (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 |