Efficient Golden-Ball Algorithm Based Clustering to solve the Multi-Depot VRP With Time Windows

Abstract

In this article, the authors propose a decision support system which aims to optimize the classical Capacitated Vehicle Routing Problem by considering the existence of multiple available depots and a time window which must not be violated, that they call the Multi-Depot Vehicle Routing Problem with Time Window (MDVRPTW), and with respecting a set of criteria including: schedules requests from clients, the capacity of vehicles. The authors solve this problem by proposing a recently published technique based on soccer concepts, called Golden Ball (GB), with different solution representation from the original one, this technique was designed to solve combinatorial optimization problems, and by embedding a clustering algorithm. Computational results have shown that the approach produces acceptable quality solutions compared to the best previous results in similar problem in terms of generated solutions and processing time. Experimental results prove that the proposed Golden Ball algorithm is efficient and effective to solve the MDVRPTW problem.