SOLUTION FOR THE GREEN VEHICLE ROUTING PROBLEM

Abstract

Current carbon dioxide (CO₂) emission trends are rising in the transportation department. Thus, the objective of this research is reducing fuel consumption rates and reducing CO₂ emissions for transportation. The vehicle routing problem is divided for comparison into the two following parts: The Capacitated Vehicle Routing Problem (CVRP) and the Green Vehicle Routing Problem (GVRP). The vehicle routing problem begins and ends at the same place, which is the depot, with limited of the vehicle capacity. The solving method is Nearest Neighbor Algorithm (NN) and the Clarke-Wright Savings Algorithm (CWS). The Clarke-Wright Savings Algorithm can reduce fuel consumption in addition to reducing CO₂ emission better than Nearest Neighbor Algorithm (on average) of 26.48%.