Landscape-Aware Hybrid Metaheuristic for Cross-Dock Door Assignment

References

• Archetti C, Boland N, Grazia Speranza M (2017) A matheuristic for the multivehicle inventory routing problem. INFORMS J. Comput. 29(3):377–387.Link, Google Scholar
• Bartholdi JJ, Gue KR (2004) The best shape for a crossdock. Transportation Sci. 38(2):235–244.Link, Google Scholar
• Boysen N, Fliedner M (2010) Cross dock scheduling: Classification, literature review and research agenda. Omega (Westport) 38(6):413–422.Crossref, Google Scholar
• Boysen N, Briskorn D, Tschöke M (2013) Truck scheduling in cross-docking terminals with fixed outbound departures. OR Spectrum 35(2):479–504.Crossref, Google Scholar
• Boysen N, De Koster R, Weidinger F (2019) Warehousing in the e-commerce era: A survey. Eur. J. Oper. Res. 277(2):396–411.Crossref, Google Scholar
• Buijs P, Vis IF, Carlo HJ (2014) Synchronization in cross-docking networks: A research classification and framework. Eur. J. Oper. Res. 239(3):593–608.Crossref, Google Scholar
• Cavero S, Pardo EG, Glover F, Martí R (2024) Strategic oscillation tabu search for improved hierarchical graph drawing. Expert Systems Appl. 243:122668.Crossref, Google Scholar
• Ćustić A, Sokol V, Punnen AP, Bhattacharya B (2017) The bilinear assignment problem: Complexity and polynomially solvable special cases. Math. Programming 166(1–2):185–205.Crossref, Google Scholar
• Escudero LF, Garín MA, Unzueta A (2024) On solving the cross-dock door assignment problem. Internat. J. Production Res. 62(4):1262–1276.Crossref, Google Scholar
• Gelareh S, Glover F, Guemri O, Hanafi S, Nduwayo P, Todosijević R (2020) A comparative study of formulations for a cross-dock door assignment problem. Omega 91:102015.Crossref, Google Scholar
• Glover F (2000) Multi-start and strategic oscillation methods—Principles to exploit adaptive memory: A tutorial on unexplored opportunities. Laguna M, González-Velarde JL, eds. Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Operations Research/Computer Science Interfaces Series, vol. 12 (Springer, Springer), 1–23.Crossref, Google Scholar
• Glover F, Laguna M (1998) Tabu Search (Springer US, Boston), 2093–2229.Google Scholar
• Guemri O, Nduwayo P, Todosijević R, Hanafi S, Glover F (2019) Probabilistic tabu search for the cross-docking assignment problem. Eur. J. Oper. Res. 277(3):875–885.Crossref, Google Scholar
• Guignard M (2020) Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints. Ann. Oper. Res. 286(1):173–200.Crossref, Google Scholar
• Guignard M, Hahn PM, Pessoa AA, da Silva DC (2012) Algorithms for the cross-dock door assignment problem. Ribeiro CC, ed. Proc. Fourth Internat. Workshop Model-Based Metaheuristics (SOBRAPO, Rio de Janeiro, Brazil), 145–162.Google Scholar
• Hahn PM, Kim BJ, Stuetzle T, Kanthak S, Hightower WL, Samra H, Ding Z, Guignard M (2008) The quadratic three-dimensional assignment problem: Exact and approximate solution methods. Eur. J. Oper. Res. 184(2):416–428.Crossref, Google Scholar
• Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1–2):83–97.Crossref, Google Scholar
• Ladier AL, Alpan G (2016) Cross-docking operations: Current research versus industry practice. Omega 62:145–162.Crossref, Google Scholar
• Lai X, Lin Z, Hao JK, Wu Q (2025) An efficient optimization model and tabu search–Based global optimization approach for the continuous p-dispersion problem. INFORMS J. Comput. 37(4):1018–1043.Link, Google Scholar
• Li M, Hao JK, Wu Q (2024) A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment. Eur. J. Oper. Res. 312(2):473–492.Crossref, Google Scholar
• López-Ibáñez M, Dubois-Lacoste J, Cáceres LP, Birattari M, Stützle T (2016) The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspectives 3:43–58.Crossref, Google Scholar
• Nassief W, Contreras I, As’ad R (2016) A mixed-integer programming formulation and Lagrangean relaxation for the cross-dock door assignment problem. Internat. J. Production Res. 54(2):494–508.Crossref, Google Scholar
• Nassief W, Contreras I, Jaumard B (2018) A comparison of formulations and relaxations for cross-dock door assignment problems. Comput. Oper. Res. 94:76–88.Crossref, Google Scholar
• Nguyen TTH (2017) Walmart’s successfully integrated supply chain and the necessity of establishing the triple-a supply chain in the 21st century. J. Econom. Management 29(3):102–117.Google Scholar
• Rijal A, Bijvank M, de Koster R (2019) Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors. Eur. J. Oper. Res. 278(3):752–771.Crossref, Google Scholar
• Sokol V, Ćustić A, Punnen AP, Bhattacharya B (2020) Bilinear assignment problem: Large neighborhoods and experimental analysis of algorithms. INFORMS J. Comput. 32(3):730–746.Link, Google Scholar
• Tarhini AA, Yunis MM, Chamseddine M (2016) Natural optimization algorithms for the cross-dock door assignment problem. IEEE Trans. Intelligent Transportation Systems 17(8):2324–2333.Crossref, Google Scholar
• Tsui LY, Chang CH (1990) A microcomputer based decision support tool for assigning dock doors in freight yards. Comput. Indust. Engrg. 19(1–4):309–312.Crossref, Google Scholar
• Tsui LY, Chang CH (1992) An optimal solution to a dock door assignment problem. Comput. Indust. Engrg. 23(1–4):283–286.Crossref, Google Scholar
• Van Belle J, Valckenaers P, Cattrysse D (2012) Cross-docking: State of the art. Omega (Westport) 40(6):827–846.Crossref, Google Scholar
• Yang W, Wang Y, Ćustić A, Punnen AP (2024) Experimental analysis of algorithms for the independent quadratic assignment problem. Comput. Oper. Res. 168:106704.Crossref, Google Scholar
• Yang W, Wang Y, Punnen AP, Martí R (2026) Landscape-aware hybrid metaheuristic for cross-dock door assignment. https://doi.org/10.1287/ijoc.2025.1233.cd, https://github.com/INFORMSJoC/2025.1233.Google Scholar
• Zhang YH, Gong YJ, Chen WN, Gu TL, Yuan HQ, Zhang J (2018) A dual-colony ant algorithm for the receiving and shipping door assignments in cross-docks. IEEE Trans. Intelligent Transportation Systems 20(7):2523–2539.Crossref, Google Scholar
• Zhu YR, Hahn PM, Liu Y, Guignard M (2009) New approach for the cross-dock door assignment problem. Proc. XLI Brazilian Sympos. Oper. Res. (SOBRAPO, Rio de Janeiro, Brazil), 1226–1236.Google Scholar