An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems

ORIGINAL ARTICLE

Abstract

Using cross-docking system is a new strategy to improve responding time to customers with transferring items directly from receiving trucks to shipping trucks without being held in storage at warehouse. This paper studies the scheduling of receiving and shipping trucks in cross-docking systems which have a temporary storage in front of shipping dock and items can be held temporarily in storage until the appropriate shipping truck comes. The objective is to find the best sequence of receiving and shipping trucks to minimize the total number of products that pass trough temporary storage because decreasing inventory or eliminating storage is the way to reduce costs. These kinds of problem are complex. Therefore, we develop an imperialistic competitive algorithm (ICA) approach to tackle complexity. The results of this algorithm are compared with the best known genetic algorithm (GA) results that are obtained in the same time. The results show that ICA outperformed GA.

Keywords

Cross-docking Distribution center Receiving truck Shipping truck Imperialistic competitive algorithms Genetic algorithm Taguchi method 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 2010

Authors and Affiliations

  1. 1.Department of Industrial EngineeringMazandaran University of Science and TechnologyBabolIran
  2. 2.Department of Industrial Management, Management and Accounting FacultyShahid Beheshti University, G.C.TehranIran

Personalised recommendations