Efficient Pollution Control Vehicle Routing Protocol Design Using Genetic Algorithm

Abstract

This paper presents the Pollution-Routing Problem (PRP), which is an extension of the classical Vehicle Routing Problem (VRP) with a broader and comprehensive objective function that accounts not just for the travel distance, but also for the amount of greenhouse emissions(CO2), fuel, travelling time and their costs. Mathematical models are described for the PRP with or without time windows and computational experiments are performed on realistic instances. The paper sheds light on the tradeoffs between various parameters such as vehicle load, speed and total cost. The results suggest that, compared to the VRP, the PRP is significantly more difficult to solve to optimality but it yields savings in total cost.