Valid Inequalities for the Green Vehicle Routing Problem
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.
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.