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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Industrial and Systems Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
