Int. J. of Industrial and Systems Engineering   »   2012 Vol.11, No.1/2

 

 

Title: A new hybrid algorithm for multi-depot vehicle routing problem with time windows and split delivery

 

Authors: U.S.S. Dharmapriya; S.B. Siyambalapitiya; A.K. Kulatunga

 

Addresses:
Faculty of Engineering, Department of Engineering Mathematics, University of Peradeniya, Peradeniya 20400, Sri Lanka
Faculty of Engineering, Department of Engineering Mathematics, University of Peradeniya, Peradeniya 20400, Sri Lanka
Faculty of Engineering, Department of Production Engineering, University of Peradeniya, Peradeniya 20400, Sri Lanka

 

Abstract: Effective coordination of distribution operations of a manufacturing organisation is paramount since it represents the major cost component of the logistic supply chain. To deal with high demand of orders with shorter lead time, distributed warehouse concept is introduced, and this is currently being practised. Furthermore, due to inherent deficiencies in vehicle routing problem (VRP), rules have been extended to accommodate large-scale orders by splitting the delivery. Time-constrained routing is relevant in an application where timely scheduled productions occur. Artificial intelligences based approaches are widely used in the literature to solve VRP problems with extensions. In this research, hybrid algorithm (SATS) is developed based on simulated annealing (SA) and Tabu search (TS) techniques to improve the solution quality of the complex multi-depot VRP with time windows and split delivery. The simulation results reveal that SATS outperforms in solution quality when it is compared with the result of Cordeau et al. (2001). Results reveal SATS gives best results for more than 50% instances.

 

Keywords: artificial intelligence; simulated annealing; Tabu search; multi-depot vehicle routing; time windows; split delivery; distributed warehousing.

 

DOI: 10.1504/IJISE.2012.046658

 

Int. J. of Industrial and Systems Engineering, 2012 Vol.11, No.1/2, pp.110 - 121

 

Available online: 17 Apr 2012

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article