594. An Exact Method for Storage Space Assignment at Airport Cargo Terminal: A Temporal-spatial Packing Problem
Invited abstract in session TC-57: Air transportation I, stream Transportation.
Tuesday, 12:30-14:00Room: Liberty 1.12
Authors (first author is the speaker)
| 1. | Mengxue Yuan
|
| School of Management, Northwestern Polytechnical University | |
| 2. | Chenhao Zhou
|
| School of Management, Northwestern Polytechnical University | |
| 3. | Nuno Ribeiro
|
| Singapore University of Technology and Design |
Abstract
With the spiking volume of non-stackable cargos, such as cargo pallets or unit loading devices, to be transported by airplanes, the ground space at airport cargo terminals becomes tight and requires precise management regarding storage space assignment, making it a temporal-spatial packing problem. The problem is first formulated as a mixed-integer linear programming model, adhering to the Last-In-First-Out principle, to minimize wasted space and maximize the dispersion effectiveness of the assignment decisions, and subsequently, the logic-based Benders decomposition (LBBD) approach is proposed. Two enhancement methods are developed, where effective constraints and corresponding cuts are applied to the master problem, and the Lagrangian relaxation method is adopted in the subproblem, converting the original LBBD into a bi-level decomposition structure. An extensive analysis highlights the superiority of the bi-level LBBD approach, augmented with corresponding enhancement methods, over other decomposition-based approaches. Specifically, it demonstrates that our approach can successfully solve 90% of instances involving 200 cargos. Compared to an empirical approach, our approach is shown particularly effective in handling instances with 150 cargos, successfully placing all items within the storage space while also delivering superior dispersion performance.
Keywords
- Transportation
- Cutting and Packing
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers