Valid Inequalities for the Green Vehicle Routing Problem

Abstract

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.