Skip to Main content Skip to Navigation
Journal articles

Probabilistic Tabu Search for the Cross-Docking Assignment Problem

Abstract : The Cross-Docking Assignment Problem (CDAP) is a challenging optimization problem in supply chain management with important practical applications in the trucking industry. The goal is to assign incoming trucks (outgoing trucks) to inbound (outbound) doors to minimize the material handling cost within a cross-docking platform while respecting the capacity and assignment constraints. A capacity constraint is imposed on each inbound/outbound door and an associated assignment constraint is imposed on each incoming/outgoing truck requiring it to be assigned to only one inbound/outbound door. To solve this NP-hard optimization problem, we develop two novel heuristics based on Probabilistic Tabu Search utilizing a new neighborhood structure applicable both to CDAP and related problems. The proposed heuristics are evaluated on 99 benchmark instances from the literature, disclosing that our approaches outperform recent state-of-the-art approaches by reaching 45 previous best-known solutions and discovering 53 new best-known solutions while consuming significantly less CPU time.
Document type :
Journal articles
Complete list of metadata
Contributor : Julie Cagniard Connect in order to contact the contributor
Submitted on : Tuesday, February 15, 2022 - 10:06:18 AM
Last modification on : Tuesday, August 30, 2022 - 5:14:20 PM




Oualid Guemri, Placide Nduwayo, Raca Todosijević, Said Hanafi, Fred Glover. Probabilistic Tabu Search for the Cross-Docking Assignment Problem. European Journal of Operational Research, Elsevier, 2019, 277 (3), pp.875-885. ⟨10.1016/j.ejor.2019.03.030⟩. ⟨hal-03574369⟩



Record views