A. Unzueta, L. F. Escudero, M. A. GARIN MARTIN
Given a network with a set of supplying (i.e., origin) nodes and a set of receiver (i.e., destination) nodes of some products, a cross-dock entity may serve as a product consolidation point. The Cross-dock Door design problem consists of deciding on the number of doors and their reference capacity for receiving product pallets through the inbound doors from the origin nodes, consolidating the products in a collection of destination mixed pallets and, delivering them through the outbound doors to the destination nodes. The uncertainty lies in the set of origin and destination nodes, and the door capacity diminishing. Given the difficulty of solving this combinatorial problem, a mathematically equivalent MILP formulation is introduced. However, searching an optimal solution is still impractical for commercial solvers. Thus, a scenario cluster decomposition-based matheuristic algorithm is introduced to obtain feasible solutions with small optimality gap and reasonable computational time.
Keywords: Stochastic Models, Combinatorial Optimization, Logistics
Scheduled
Location (GELOCA3)
June 13, 2025 9:00 AM
Sala 3. Maria Rúbies Garrofé