The distribution of finished products from depots to customers is a challenging task in supply chain and logistics management. The general formulation of such problem is the vehicle routing problem (VRP). In cases where a logistics company has more than one depot, VRPs are not suitable, thus requiring multiple depots. This paper focuses on the Multi-depot Vehicle Routing Problem (MDVRP). In order to deal with the MDVRP efficiently and effectively, Artificial Bee Colony (ABC) is developed in this paper. The customers are grouped using the Clarke and Wright saving method and the routes are optimized using the ABC algorithm. A computational study is carried out to compare the algorithm with different problem sizes. Results proved that the proposed ABC outperformed genetic approaches in literature.

Login to Download PDF

Please login with your Paper ID and password to access the full PDF.

🔑 Login to Download