142. On two-stage stochastic optimization for cross-dock door platforms design
Invited abstract in session MC-17: Cross dock door platforms design, assigment and scheduling, stream Combinatorial Optimization.
Monday, 12:30-14:00Room: Esther Simpson 2.08
Authors (first author is the speaker)
| 1. | M. Araceli Garin
|
| Quantitative Methods, UPV/EHU | |
| 2. | Laureano F. Escudero
|
| Estadística e Investigación Operativa, Universidad Rey Juan Carlos | |
| 3. | Aitziber Unzueta
|
| Applied Mathematics, UPV/EHU |
Abstract
The Cross-dock Door Design Problem (CDDP) consists of deciding the strip and stack doors and nominal capacity of the cross-dock infrastructure under uncertainty. The CDDP is represented using a stochastic two-stage binary quadratic model. The first stage decisions are related to the infrastructure design and the second stage ones are related to the node-to-door’s assignments. The aim is to minimize the construction cost of the infrastructure and its exploitation expected cost in the scenarios. 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 effort. A broad study to validate the proposal gives solutions with a much smaller gap than the ones provided by a state-of-the-art general solver. In fact, the proposal provides solutions with a 1 to 5% optimality gap, while the solver does it with up to a 12% gap, if any, and requires a wall time two orders of magnitude higher.
Keywords
- Combinatorial Optimization
- Stochastic Optimization
- Warehouse Design, Planning, and Control
Status: accepted
Back to the list of papers