A Green Vehicle Routing Problem

A Green Vehicle Routing Problem (G-VRP) is formulated and solution techniques are developed to aid organizations with alternative fuel-powered vehicle fleets in overcoming difficulties that exist as a result of limited vehicle driving range in conjunction with limited refueling infrastructure. The G-VRP is formulated as a mixed integer linear program. Two construction heuristics, the Modified Clarke and Wright Savings heuristic and the Density-Based Clustering Algorithm, and a customized improvement technique, are developed. Results of numerical experiments show that the heuristics perform well. Moreover, problem feasibility depends on customer and station location configurations. Implications of technology adoption on operations are discussed.

► Conceptualizes and formulates a Green Vehicle Routing Problem. ► Develops solution techniques for application on real-world problem instances. ► Tackles complexities of tracking fuel level as fuel is consumed and replenished. ► Incorporates optional visits to fueling stations to extend tour length limits. ► Studies station/customer geographic distribution impact on operational viability.