Probabilistic tabu search for the cross-docking assignment problem

DOI10.1016/j.ejor.2019.03.030zbMath1430.90377OpenAlexW2922967100MaRDI QIDQ1740539

Fred Glover, Raca Todosijević, Placide Nduwayo, Saïd Hanafi, Oualid Guemri

Publication date: 30 April 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.03.030

zbMATH Keywords

combinatorial optimizationmetaheuristicsprobabilistic tabu searchcross-docking assignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (10)

Heuristics for cross-docking scheduling of truck arrivals, truck departures and shop-floor operations ⋮ Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange ⋮ Lagrangian relaxation algorithm for the truck scheduling problem with products time window constraint in multi-door cross-dock ⋮ An adaptive polyploid memetic algorithm for scheduling trucks at a cross-docking terminal ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ Tabu search exploiting local optimality in binary optimization ⋮ Cross-docking based factory logistics unitisation process: an approximate dynamic programming approach ⋮ Collaborative optimization of dock door assignment and vehicle scheduling in cross-docking ⋮ Tabu search tutorial. A graph drawing application ⋮ Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange

Cites Work

• Synchronization in cross-docking networks: a research classification and framework
• Three-stage hybrid-flowshop model for cross-docking
• Assignment problems: a golden anniversary survey
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
• A comparison of formulations and relaxations for cross-dock door assignment problems
• Future paths for integer programming and links to artificial intelligence
• The quadratic three-dimensional assignment problem: exact and approximate solution methods
• A path relinking approach with ejection chains for the generalized assignment problem

This page was built for publication: Probabilistic tabu search for the cross-docking assignment problem