A new hybrid algorithm for multi-depot vehicle routing problem with time windows and split delivery (original) (raw)

2012, International Journal of Industrial and Systems Engineering

Effective coordination of distribution operations of a manufacturing organization is paramount since it represents the major cost component of the logistic supply chain. In order to deal with high demand of orders with shorter lead time, distributed warehouse concept is introduced and this is currently being practiced. Furthermore, due to inherent deficiencies in VRP, rules have been extended to accommodate large scale orders by splitting the delivery. Artificial Intelligences (AI) based approaches 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 Vehicle Routing Problem with Time Windows and Split Delivery (MDVRPTWSD). The simulation results reveal that SATS outperform in solution quality and the computational time.

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact