Skip to main content
SpringerLink
Log in

Bi-objective heuristics for multi-item freights distribution planning problem in crossdocking networks

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Crossdocking is a distribution strategy in which distribution centers operate as transfer points to harmonize the continuous physical flow through supply chain with the least storage. The coordination of this system in a network of crossdocks with multitype and time-restricted pickups and deliveries requires a complex planning. This paper addresses the distribution planning problem of crossdocking network, considering transshipment possibility among crossdocks and tardiness permission for some pickups. The problem is formulated as a bi-objective integer-programming model minimizing total transportation and holding costs and total tardiness. An innovative heuristic procedure to construct an effective initial solution and three improving algorithms based on appropriate meta-heuristics (variable neighborhood search, tabu search, and simulated annealing) is developed to solve the problem. Experimental results demonstrate the potency of proposed algorithms achieving remarkable results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Zhao QH, Cheng TCE (2009) An analytical study of the modification ability of distribution centers. Eur J Oper Res 194:901–910. doi:10.1016/j.ejor.2008.01.008

    Article  MathSciNet  MATH  Google Scholar 

  2. Simchi-Levi D, Kaminsky P, Simchi-Levi E (2008) Designing and managing the supply chain—concepts. Strategies and Case Studies, McGraw-Hill, Singapore

    Google Scholar 

  3. Ballou RH (1999) Business logistics management planning, organizing and controlling the supply chain. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  4. Ross A, Jayaraman V (2008) An evaluation of new heuristics for the location of crossdocks distribution centers in supply chain network design. Comput Ind Eng 55(1):64–79. doi:10.1016/j.cie.2007.12.001

    Article  Google Scholar 

  5. Lee YH, Jung JW, Lee KM (2006) Vehicle routing scheduling for crossdocking in the supply chain. Comput Ind Eng 51:247–256. doi:10.1016/j.cie.2006.02.006

    Article  Google Scholar 

  6. Yu W, Egbelu PJ (2008) Scheduling of inbound and outbound trucks in crossdocking systems with temporary storage. Eur J Oper Res 184(1):377–396. doi:10.1016/j.ejor.2006.10.047

    Article  MATH  Google Scholar 

  7. Gue KR (2002) Crossdocking: just-in-time for distribution. Working paper. Naval Post-graduate School, Monterey, CA

  8. Agustina D, Lee CKM, Piplani R (2010) A review: mathematical models for crossdocking planning. Int J Eng Bus Manag 2(2):47–54

    Google Scholar 

  9. Bartholdi JJ, Gue KR (2000) Reducing labor costs in an LTL crossdocking terminal. Oper Res 48:823–832. doi:10.1287/opre.48.6.823.12397

    Article  Google Scholar 

  10. Bartholdi JJ, Gue KR (2004) The best shape for a crossdock. Transport Sci 38(2):235–244. doi:10.1287/trsc.1030.0077

    Article  Google Scholar 

  11. Vis IFA, Roodbergen KJ (2008) Positioning of goods in a crossdocking environment. Comput Ind Eng 54(3):677–689. doi:10.1016/j.cie.2007.10.004

    Article  Google Scholar 

  12. Oh Y, Hwang H, Cha CN, Lee S (2006) A dock-door assignment problem for the Korean mail distribution center. Comput Ind Eng 51:288–296. doi:10.1016/j.cie.2006.02.009

    Article  Google Scholar 

  13. Bozer YA, Carlo HJ (2008) Optimizing inbound and outbound door assignments in less-than-truckload crossdocks. IIE Trans 40:1007–1018. doi:10.1080/07408170802167688

    Article  Google Scholar 

  14. Miao Z, Lim A, Ma H (2009) Truck dock assignment problem with operational time constraint within crossdocks. Eur J Oper Res 199(1):105–115. doi:10.1016/j.ejor.2007.09.031

    Article  Google Scholar 

  15. Jayaraman V, Ross A (2003) A simulated annealing methodology to distribution network design and management. Eur J Oper Res 144(3):629–645. doi:10.1016/S0377-2217(02)00153-4

    Article  MathSciNet  MATH  Google Scholar 

  16. Sung CS, Song SH (2003) Integrated service network design for a crossdocking supply chain network. J Oper Res Soc 54:1283–1295. doi:10.1057/palgrave.jors.2601645

    Article  MATH  Google Scholar 

  17. Gümüs M, Bookbinder JH (2004) Crossdocking and its implications in location distribution systems. J Bus Logist 25(2):199–228

    Article  Google Scholar 

  18. Sung C, Yang W (2006) An exact algorithm for a crossdocking supply chain network design problem. J Oper Res Soc 59(1):119–136. doi:10.1057/palgrave.jors.2602328

    Article  Google Scholar 

  19. Boysen N, Fliedner M (2010) Crossdock scheduling: classification, literature review and research agenda. Omega 38:413–422. doi:10.1016/j.omega.2009.10.008

    Article  Google Scholar 

  20. Li ZP, Low MYH, Shakeri M, Lim YG (2009) Crossdocking planning and scheduling: problems and algorithms. SIMTech Tech rep 10(3):159–167

    Google Scholar 

  21. Li Y, Lim A, Rodrigues B (2004) Crossdocking: JIT scheduling with time windows. J Oper Res Soc 55(12):1342–1351. doi:10.1057palgrave.jors.2601812

    Article  MATH  Google Scholar 

  22. Chen R, Fan B, Tang G (2009) Scheduling problems in crossdocking. In: Du DZ, Hu X, Pardalos PM (eds) Combinatorial optimization and applications. LNCS, Springer, Berlin, pp 421–429, doi:10.1007/978-3-642-02026-1_40

    Chapter  Google Scholar 

  23. Chen F, Lee C-Y (2009) Minimizing the makespan in a two-machine crossdocking flow shop problem. Eur J Oper Res 193:59–72. doi:10.1016/j.ejor.2007.10.051

    Article  MathSciNet  MATH  Google Scholar 

  24. Chen F, Song K (2009) Minimizing makespan in two stage hybrid crossdocking scheduling problem. Comput Oper Res 36:2066–2073. doi:10.1016/j.cor.2008.07.003

    Article  MATH  Google Scholar 

  25. Larbi, R., Alpan, G., Penz, B. (2009) Scheduling transshipment operations in a multiple inbound and outbound door crossdock. Presented at 39th international conference on Computers and Industrial Engineering, Troyes, France. doi:10.1109/ICCIE.2009.5223927

  26. Alvarez-Perez G, Gonzalez-Velarde J, Fowler J (2009) Crossdocking—just in time scheduling: an alternative solution approach. J Oper Res Soc 60:554–564. doi:10.1057/palgrave.jors.2602590

    Article  MATH  Google Scholar 

  27. Boloori Arabani AR, Fatemi Ghomi SMT, Zandieh M (2010) A multi-criteria crossdocking scheduling with just-in-time approach. Int J Adv Manuf Technol 49:741–756. doi:10.1007/s00170-009-2429-5

    Article  Google Scholar 

  28. Maknoon MY, Baptiste P (2009) Crossdocking: increasing platform efficiency by sequencing incoming and outgoing semi-trailers. Int J Logist Res Appl 12(4):249–261. doi:10.1080/13675560903076081

    Article  Google Scholar 

  29. Vahdani B, Soltani R, Zandieh M (2010) Scheduling the truck holdover recurrent dock crossdock problem using robust meta-heuristics. Int J Adv Manuf Technol 46:769–783. doi:10.1007/s00170-009-2152-2

    Article  Google Scholar 

  30. Vahdani B, Zandieh M (2010) Scheduling trucks in crossdocking systems: Robust meta-heuristics. Comput Ind Eng 58:12–24. doi:10.1016/j.cie.2009.06.006

    Google Scholar 

  31. Soltani R, Sadjadi SJ (2010) Scheduling trucks in crossdocking systems: A robust meta-heuristics approach. Transp Res Part E 46:650–666. doi:10.1016/j.tre.2009.12.011

    Article  Google Scholar 

  32. Boysen N, Fliedner M, Scholl A (2010) Scheduling inbound and outbound trucks at crossdocking terminals. OR Spectrum 32:135–161. doi:10.1007/s00291-008-0139-2

    Article  MATH  Google Scholar 

  33. Boysen N (2010) Truck scheduling at zero-inventory crossdocking terminals. Comput Oper Res 37:32–41. doi:10.1016/j.cor.2009.03.010

    Article  MATH  Google Scholar 

  34. Waller MA, Cassady CR, Ozment J (2006) Impact of crossdocking on inventory in a decentralized retail supply chain. Transp Res Part E 42:359–382. doi:10.1016/j.tre.2005.01.002

    Article  Google Scholar 

  35. Yan H, Tang S-l (2009) Pre-distribution and post-distribution crossdocking operations. Transp Res Part E 45:843–859. doi:10.1016/j.tre.2009.05.005

    Article  Google Scholar 

  36. Tang S-L, Yan H (2010) Pre-distribution vs. post-distribution for crossdocking with transshipments. Omega 38:192–202. doi:10.1016/j.omega.2009.09.001

    Article  Google Scholar 

  37. Lim A, Miao Z, Rodrigues B, Xu Z (2005) Transshipment through Crossdocks with Inventory and Time Windows. Wiley Periodicals, Inc 2005:724–733. doi:10.1002/nav.20113

    MathSciNet  Google Scholar 

  38. Chen P, Guo Y, Lim A, Rodrigues B (2006) Multiple crossdocks with inventory and time windows. Comput Oper Res 33:43–63. doi:10.1016/j.cor.2004.06.002

    Article  MATH  Google Scholar 

  39. Liao C-J, Lin Y, Shih SC (2010) Vehicle routing with crossdocking in the supply chain. Expert Syst Appl 37:6868–6873. doi:10.1016/j.eswa.2010.03.035

    Article  Google Scholar 

  40. Wen M, Larsen J, Clausen J, Cordeau J-F, Laporte G (2009) Vehicle Routing with Crossdocking. J Oper Res Soc 60(12):1708–1718. doi:10.1057/jors.2008.108

    Article  MATH  Google Scholar 

  41. Musa R, Arnaout J-P, Jung H (2010) Ant colony optimization algorithm to solve for the transportation problem of crossdocking network. Computers & Industrial Engineering 59:85–92. doi:10.1016/j.cie.2010.03.002

    Article  Google Scholar 

  42. Angiulli F, Cesario E, Pizzuti C (2008) Random walk biclustering for microarray data. Inf Sci 178:1479–1497. doi:10.1016/j.ins.2007.11.007

    Article  MATH  Google Scholar 

  43. Busygin, S., Jacobsen, G., Krämer, E. (2002) Double conjugated clustering applied to leukemia microarray data. SIAM data miningworkshop on clustering high dimensional data and its applications.

  44. Hansen P, Mladenovic N (1999) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449–467. doi:10.1016/S0377-2217(00)00100-4

    Article  MathSciNet  Google Scholar 

  45. Hansen P, Mladenovic N (2002) Variable neighbourhood search. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, New York, pp 221–235

    Google Scholar 

  46. Glover F, Laguna M (1997) Tabu Search. Kluwer Academic Publishers, Norwell

    Book  MATH  Google Scholar 

  47. Ulungu LE, Teghem J, Ost C (1998) Efficiency of interactive multi-objective simulated annealing through a case study. J Oper Res Soc 49:1044–1050. doi:10.1057/palgrave.jors.2600569

    MATH  Google Scholar 

  48. Ulungu EL, Tegham J, Fortemps P (1995) Heuristics for multiobjective combinatorial optimization problems by simulated annealing. In: Gu J, Chen G, Wei Q, Wang S (eds) MCDM: Theory and Application. Sciences-Techniques, Beijing, pp 229–238

    Google Scholar 

  49. Altiparmak F, Gen M, Lin L, Paksoy T (2006) A genetic algorithm approach for multi-objective optimization of supply chain networks. Comput Ind Eng 51:196–215. doi:10.1016/j.cie.2006.07.011

    Article  Google Scholar 

  50. Zitzle E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms—a comparative case study. In Ebeling et al. (eds) Parallel problem solving from nature—PPSN V, LNCS vol. 2632/1998. Springer-Verlag, Heidelberg, pp 292–301. doi:10.1007/BFb0056872

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran

    Mohammad Reza Marjani, Seyyed Mohammad Moattar Husseini & Behrooz Karimi

Authors
  1. Mohammad Reza Marjani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyyed Mohammad Moattar Husseini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Behrooz Karimi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyyed Mohammad Moattar Husseini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marjani, M.R., Moattar Husseini, S.M. & Karimi, B. Bi-objective heuristics for multi-item freights distribution planning problem in crossdocking networks. Int J Adv Manuf Technol 58, 1201–1216 (2012). https://doi.org/10.1007/s00170-011-3444-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3444-x

Keywords

Search

Navigation