EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1399. Cross-dock Door Assignment Problem, CDAP, decomposition methodologies
Invited abstract in session MD-35: Cross-dock Door Problems, stream Stochastic, Robust and Distributionally Robust Optimization.
Monday, 14:30-16:00Room: 44 (building: 303A)
Authors (first author is the speaker)
| 1. | Aitziber Unzueta
|
| Applied Mathematics, UPV/EHU | |
| 2. | Laureano F. Escudero
|
| EstadÃstica e Investigación Operativa, Universidad Rey Juan Carlos | |
| 3. | M. Araceli Garin
|
| Quantitative Methods, UPV/EHU |
Abstract
The Cross-dock Door Assignment problem (CDAP) consists of using a distribution-docking terminal for helping on supply chain distribution. Given a set of commodities to deliver from origin nodes to destination ones, the products are unloaded using a set of inbound doors, handled in the terminal, and reloaded using a set of outbound doors. The goal is to minimize the transportation cost of the commodities to be handled at the cross-dock. A class of strong lower bounds on the solution value of a Linearized Integer Programming reformulation is introduced for the binary quadratic optimization model to assign origin and destination nodes to strip and stack doors, respectively, in a cross-dock infrastructure. Strip- and stack-related decomposition submodels are developed by taking benefit of the Integer Linearization Property that appears in the new model. A linear search heuristic is also provided for obtaining feasible solutions by exploiting the special structure of the problem. We present an extensive computational study on a testbed of 55 instances to show that the proposed joint scheme for lower bounding and feasible solution providing is very efficient.
Keywords
- Combinatorial Optimization
- Programming, Quadratic
Status: accepted
Back to the list of papers