Development of Ant Colony Optimization Algorithm for Green Capacitated Vehicle Routing Problem

The high customer demand for a product will lead to increased distribution activity by the vehicles, causing an increase in the amount of gas emissions that pollute the air. Therefore, the common problem namely the Capacitated Vehicle Routing Problem should also seek a reduction of emissions that is known as the Green Capacitated Vehicle Routing Problem (GCVRP). This research was conducted in three steps. First, all nodes are divided into clusters. After that, the Ant Colony Optimization (ACO) algorithm is used to determine the route of each cluster so as to provide minimal emissions. In the final step, the results are corrected by using the Variable Neighborhood Search. Results of this research indicate a reduction of 38.53% of emission value.