routing problem

traveling salesman problem

vehicle routing problem

neighborhood search

Journal of Cleaner Production

Vehicle routing problem (VRP) is one of the widely researched areas in transportation science, mainly due to the potential cost savings and service improvement opportunities which brings to organizations involved in physical distribution of goods. In this paper, we develop a multi-depot green vehicle routing problem (MDGVRP) by maximizing revenue and minimizing costs, time and emission, and then, apply an improved ant colony optimization (IACO) algorithm that aims to efficiently solve the problem. The IACO model developed in this research uses an innovative approach in updating the pheromone that results in better solutions. The results achieved through the IACO demonstrate satisfying performance, which have higher solution quality when compared to the conventional ACO. The IACO algorithm used in this paper demonstrated a good level of responsiveness and simplicity when solving MDGVRP with multiple objectives.

An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives