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

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

Lahcene Guezouli, Mohamed Bensakhria, Samir Abdelhamid
Copyright: © 2018 |Pages: 16
DOI: 10.4018/IJAEC.2018010101
(Individual Articles)
No Current Special Offers


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.
Article Preview

2. Literature Survey

This section briefs the existing work related to MDVRPTW solutions by various heuristic methods. The available literature on MDVRPs is quite limited compared with the extensive literature on simple VRPs and their variants.

The Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) (Surekha, 2011) is considered for a practical description of transportation planning. The MDVRPTW describes the problem to deliver uniform goods to a set of customers from a set of depots with heterogeneous capacities vehicles. The delivery has to be done within a customer-specified time window and the vehicles need to return to the same depot where they have started. Each customer has to be delivered once.

Complete Article List

Search this Journal:
Volume 14: 1 Issue (2023): Forthcoming, Available for Pre-Order
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing