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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apte UM, Viswanathan S (2000) Effective cross-docking for improving distribution efficiencies. Int J Logist 3:291–302
Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation 4661–4667
Bartholdi JJ, Gue KR (2000) Reducing labor costs in an international cross-docking terminal. Oper Res 48:823–832
Chen F, Lee CY (2009) Minimizing the makespan in a two—machine cross-docking flow shop problem. Eur J Oper Res 193:59–72
Gumus M, Bookbinder JH (2004) Cross-docking and its implications in location-distribution systems. Journal of Business Logistics 25:199–228
Jayaraman V, Ross A (2003) A simulated annealing methodology to distribution network design and management. Eur J Oper Res 144:629–645
Mosheiov G (1998) Vehicle routing with pick-up and delivery: tour—partitioning heuristics. Comput Ind Eng 34:669–684
Lee YH, Jung JW, Lee KM (2006) Vehicle routing scheduling for cross-docking in supply chain. Comput Ind Eng 51:247–256
Park SH (1995) Robust design and analysis for quality engineering. Chapman &Hall, London
Ross A, Jayaramand J (2008) An evaluation of new heuristics for the location of cross-docks distribution centers in supply chain network design. Comput Ind Eng 55:64–79
Sung CS, Song SH (2003) Integrated service network design for a cross-docking supply chain network. J Oper Res Soc 54:1283–1295
Simchi-Livi D, Kaminsky P, Simchi-Livi E (2000) Designing and managing the supply chain concepts, strategies, and case studies. McGraw-Hill, Singapore
Waller MA, Cassady CR, Ozment J (2006) Impact of cross-docking on inventory in a decentralized retail supply chain. Transp Res E 42:359–382
Yu W (2002) Operational strategies for cross-docking systems. Dissertation, Iowa State University
Yu W, Egbelu PJ (2008) Scheduling of inbound and outbound tracks in cross-docking systems. Eur J Oper Res 184:377–396
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Forouharfard, S., Zandieh, M. An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems. Int J Adv Manuf Technol 51, 1179–1193 (2010). https://doi.org/10.1007/s00170-010-2676-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-010-2676-5