Valid Inequalities for the Green Vehicle Routing Problem

• Matheus Diógenes Andrade UNICAMP http://orcid.org/0000-0003-2282-3238
• Fábio Luiz Usberti UNICAMP http://orcid.org/0000-0002-8972-080X

DOI: https://doi.org/10.5753/etc.2020.11086

Resumo

This work aims to investigate 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 be recharged at Alternative Fuel Stations (AFSs) to keep visiting customers. This research proposes MILP formulations, valid inequalities, and preprocessing conditions.

Palavras-chave: Roteamento de veículos, Problema de roteamento de veículos verdes, Formulação de programação linear inteira mista, Procedimentos de preprocessamento, Operação de frota de combustível alternativo

Referências

Erdoğan, S. and Miller-Hooks, E. (2012). A green vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 48(1):100 – 114. Select Papers from the 19th International Symposium on Transportation and Traffic Theory.

Leggieri, V. and Haouari, M. (2017). A practical solution approach for the green vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 104:97 – 112.

Wang, Y.-W., Lin, C.-C., and Lee, T.-J. (2018). Electric vehicle tour planning. Transportation Research Part D: Transport and Environment, 63:121–136.

Çağrı Koç and Karaoglan, I. (2016). The green vehicle routing problem: A heuristic based exact solution approach. Applied Soft Computing, 39:154 – 164.