Vehicle routing scheduling using an enhanced hybrid optimization approach

  • Authors:

  • Behnam Vahdani;Reza Tavakkoli-Moghaddam;Mostafa Zandieh;Jafar Razmi

  • Affiliations:

  • Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran

  • Venue:
  • Journal of Intelligent Manufacturing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cross docking play an indispensable role in streamlining the efficiency and effectiveness of any supply chain operations. Owing to the need to reduce transportation lead time and increase coordination between other supply chain activities such as just-in-time, make-to-order, or merge-in-transit strategies, shortening the total transfer time at cross docking is increasing important. Thus, in this paper we propose a new hybrid metaheuristic for vehicle routing scheduling in cross-docking systems. This new hybrid algorithm incorporates the elements from Particle Swam Optimization, Simulated Annealing and Variable Neighborhood Search to enhance its search capabilities. On view of the fact that the performance of metaheuristic algorithms are considerably influenced by the proper tuning of their parameters, we take advantage of Taguchi's robust design method to come up with the best parameters of the before-mentioned algorithms. In order to measure the performance of our proposed algorithm, we compared it with the Tabu Search algorithm presented by Lee et al. (Comput Ind Eng 51:247---256, 2006). The computational evaluations clearly support the high performance of our proposed algorithm against other algorithm in the literature.