A variable neighborhood search to reduce carbon dioxide emissions in the capacitated vehicle routing problem

摘要

Optimizing vehicle routing problem was based for a long time on an economic approach aiming to reduce the economic distribution costs. Nowadays, with the dramatic effects of the pollution, companies are led to integrate environmental objectives in their optimizing distribution schemes. In that regard, Green Vehicle Routing Problem (GVRP) has emerged to deal with sustainable transportation. This paper tackles one of the Green Vehicle Routing Problems which consists in minimizing the carbon dioxide emissions (CO₂) for the capacitated vehicle routing problem. A new variable neighborhood search algorithm is proposed to solve it. Experimental results conducted on several instances in the literature show the competitiveness of our approach.