Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking

  • Amalia I. Nikolopoulou
  • Panagiotis P. Repoussis
  • Christos D. Tarantilis
  • Emmanouil E. Zachariadis
Original Paper

Abstract

This paper presents a new generalized vehicle routing problem with a cross-dock. Basic features of the examined problem are the many-to-many relationship between the suppliers and customers, and the use of different vehicle fleets for performing the inbound and outbound routes. An adaptive memory programming method has been developed coupled with a Tabu Search algorithm. For generating new provisional solutions, elite subroutes with varying lengths are identified from the reference solutions and are used as building blocks, while multiple strategies are applied to maintain an effective interplay between diversification and intensification. Various computational experiments are conducted on existing as well as on new data sets with diverse features, regarding the geographic distribution of the nodes and the density of supplier-customer links. Overall, the proposed method performed very well and new best solutions have been found. Lastly, new insights regarding the impact of split options are reported.

Keywords

Vehicle routing Distribution Pickup-and-delivery Cross-dock Heuristics 

References

  1. Bartholdi JJ III, Gue KR (2004) The best shape for a cross-dock. Transp Sci 38(2):235–244CrossRefGoogle Scholar
  2. Cardona-Valdés Y, Álvarez A, Pacheco J (2014) Metaheuristic procedure for a bi-objective supply chain design problem with uncertainty. Transp Res Part B Methodol 60(8):66–84CrossRefGoogle Scholar
  3. Clark PJ, Evans FC (1954) Distance to nearest neighbor as a measure of spatial relationships in populations. Ecology 35:445–453CrossRefGoogle Scholar
  4. Cohen Y, Keren B (2009) Trailer to door assignment in a synchronous cross-dock operation. Int J Logist Syst Manag 5(5):574–590CrossRefGoogle Scholar
  5. Dondo R, Mèndez CA, Cerdá J (2011) The multi-echelon vehicle routing problem with cross-docking in supply chain management. Comput Chem Eng 35(12):3002–3024CrossRefGoogle Scholar
  6. Enderer F (2014) Integrating dock-door assignment and vehicle routing in cross-docking. MSc Thesis, Concordia UniversityGoogle Scholar
  7. Glover F (1997) Tabu search and adaptive memory programming—advances, applications and challenges. In: Barr RS, Helgason RV, Kennington JL (eds) Interfaces in computer science and operation research: advances in metaheuristics. Kluwer, Boston, pp 1–75CrossRefGoogle Scholar
  8. Gounaris CE, Repoussis PP, Tarantilis CD, Wiesemann W, Floudas C (2014) An Adaptive memory programming framework for the robust capacitated vehicle routing problem. Transp Sci. doi:10.1287/trsc.2014.0559 Google Scholar
  9. Grangier P (2016) Résolution de problèmes de tournées avec synchronisation: applications au cas multi-échelons et au cross-docking. Dissertation, École nationale supérieure des Mines de NantesGoogle Scholar
  10. Guastaroba G, Speranza MG, Vigo D (2016) Intermediate facilities in freight transportation planning: a survey. Transp Sci 50(3):763–789CrossRefGoogle Scholar
  11. Lee YH, Jung JW, Lee KM (2006) Vehicle routing scheduling for cross-docking in the supply chain. Comput Ind Eng 51(2):247–256CrossRefGoogle Scholar
  12. Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: IEEE proceedings of the international conference on tools with artificial intelligence. pp 160–167Google Scholar
  13. Liao ChJ, Lin Y, Shih SC (2010) Vehicle routing with cross-docking in the supply chain. Expert Syst Appl 37:6868–6873CrossRefGoogle Scholar
  14. Ma H, Miao Z, Lim A, Rodriguez B (2011) Cross-docking distribution networks with setup cost and time window constraint. Omega 39:64–72CrossRefGoogle Scholar
  15. Morais VWC, Mateus GR, Noronha TF (2014) Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Syst Appl 41(16):7495–7506CrossRefGoogle Scholar
  16. Musa R, Arnaout JP, Jung H (2010) Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Comput Ind Eng 59(1):85–92CrossRefGoogle Scholar
  17. Nikolopoulou AI, Repoussis PP, Tarantilis CD, Zachariadis EE (2017) Moving products between location pairs: cross-docking versus direct-shipping. Eur J Oper Res 256(3):803–819Google Scholar
  18. Paraskevopoulos DC, Tarantilis CD, Ioannou G (2016) An adaptive memory programming framework for the resource-constrained project scheduling problem. Int J Prod Res 54(16):3938–4956CrossRefGoogle Scholar
  19. Petersen HL, Ropke S (2011) The pickup and delivery problem with cross-docking opportunity. In: Proceedings of international conference on computational logistics, Hamburg, Germany. pp 101–113Google Scholar
  20. Repoussis PP, Tarantilis CD (2010) Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transp Res Part C 18:695–712CrossRefGoogle Scholar
  21. Santos FA, Mateus GR, da Cunha AS (2013) The pickup and delivery problem with cross-docking. Comput Oper Res 40:1085–1093CrossRefGoogle Scholar
  22. Sung CS, Song SH (2003) Integrated service network design for a cross-docking supply chain network. J Oper Res Soc 54(12):1283–1295CrossRefGoogle Scholar
  23. Taillard ED, Gambardella LM, Gendreau M, Potvin JY (2001) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135(1):1–16CrossRefGoogle Scholar
  24. Tarantilis CD (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput Oper Res 32(9):2309–2327CrossRefGoogle Scholar
  25. Tarantilis CD (2013) Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking. Optim Lett 7(7):1583–1596CrossRefGoogle Scholar
  26. Tarantilis CD, Stauropoulou F, Repoussis PP (2011) A template-based tabu search algorithm for the consistent vehicle routing problem. Expert Syst Appl 39(4):4233–4239CrossRefGoogle Scholar
  27. Tarantilis CD, Anagnostopoulou A, Repoussis PP (2013) Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transp Sci 47:356–379CrossRefGoogle Scholar
  28. Tsui LY, Chang CH (1992) An optimal solution to a dock door assignment problem. Comput Ind Eng 23(1–4):283–286CrossRefGoogle Scholar
  29. Vis IF, Roodbergen KJ (2008) Positioning of goods in a cross-docking environment. Comput Ind Eng 54(3):677–689CrossRefGoogle Scholar
  30. Wen M, Larsen J, Clausen J, Cordeau JF, Laporte G (2009) Vehicle routing with cross-docking. J Oper Res Soc 60(12):1708–1718CrossRefGoogle Scholar
  31. Whittley IM, Smith GD (2004) The attribute based hill climber. J Math Model Algorithms 3(2):167–178CrossRefGoogle Scholar
  32. Zachariadis EE, Kiranoudis CT (2010) A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Comput Oper Res 37(12):2089–2105CrossRefGoogle Scholar
  33. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2015) The load-dependent vehicle routing problem and its pick-up and delivery extension. Transp Res Part B Methodol 71:158–181CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Amalia I. Nikolopoulou
    • 1
  • Panagiotis P. Repoussis
    • 2
    • 3
  • Christos D. Tarantilis
    • 1
  • Emmanouil E. Zachariadis
    • 1
  1. 1.Department of Management Science and Technology, School of BusinessAthens University of Economics and BusinessAthensGreece
  2. 2.Department of Marketing and Communication, School of BusinessAthens University of Economics and BusinessAthensGreece
  3. 3.School of BusinessStevens Institute of TechnologyHobokenUSA

Personalised recommendations