Variable neighborhood search algorithm for the green vehicle routing problem

Abstract

This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of a tour. We propose a variable neighborhood search to solve the problem. We tested and compared the performance of our algorithm intensively on datasets existing in the literature.

Keywords

• Green vehicle routing problem
• Refueling stations
• Variable neighborhood search
• Heuristics