IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i13p2798-d1176419.html
   My bibliography  Save this article

A Combinatorial Optimization Approach for Air Cargo Palletization and Aircraft Loading

Author

Listed:
  • Xiangling Zhao

    (The National Frontiers Science Center for Industrial Intelligence and Systems Optimization, Northeastern University, Shenyang 110819, China
    Department of Flight Operation, College of Air Traffic Management, Civil Aviation University of China, Tianjin 300300, China)

  • Yun Dong

    (The Key Laboratory of Data Analytics and Optimization for Smart Industry, Ministry of Education, Northeastern University, Shenyang 110819, China)

  • Lei Zuo

    (Department of Flight Operation, College of Air Traffic Management, Civil Aviation University of China, Tianjin 300300, China)

Abstract

The current air cargo loading plan handles the Air Cargo Palletization Problem (ACPP) and the Aircraft Weight and Balance Problem (WBP) separately, which has an impact on the optimization of the payload and the aircraft’s center of gravity (CG). Thanks to improvements in computer processing power, the joint combinatorial optimization of ACPP and WBP is now feasible. Three integer linear programming models are proposed: a Bi-objective Optimization Model (BOM), a Combinatorial Optimization Model (COM), and an Improved Combinatorial Optimization Model (IOM). The objectives of the models are the maximum loading capacity and the lowest CG deviation from a specified target CG. The models also consider a wide range of restrictions in the actual packing and stowage procedures, such as volume, weight, loading position, aircraft balance, and other aspects of aircraft and unit load devices. Four scenarios with various conditional metrics for three models are solved for the B777F aircraft using Gurobi. The results of the computations demonstrate that the BOM has the fastest solution speed, but the CG deviation is the largest, and in several cases the CG deviation results are unacceptable. The COM has the longest solution time, which is difficult to tolerate in practice. Despite taking a little longer to solve computationally than the BOM, the IOM offers the best optimization solution.

Suggested Citation

  • Xiangling Zhao & Yun Dong & Lei Zuo, 2023. "A Combinatorial Optimization Approach for Air Cargo Palletization and Aircraft Loading," Mathematics, MDPI, vol. 11(13), pages 1-16, June.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:13:p:2798-:d:1176419
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/13/2798/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/13/2798/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Brosh, Israel, 1981. "Optimal cargo allocation on board a plane: a sequential linear programming approach," European Journal of Operational Research, Elsevier, vol. 8(1), pages 40-46, September.
    2. Li, Yanzhi & Tao, Yi & Wang, Fan, 2009. "A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning," European Journal of Operational Research, Elsevier, vol. 199(2), pages 553-560, December.
    3. Clive Thomas & Kevin Campbell & Gail Hines & Michael Racer, 1998. "Airbus Packing at Federal Express," Interfaces, INFORMS, vol. 28(4), pages 21-30, August.
    4. Tang, Ching-Hui, 2011. "A scenario decomposition-genetic algorithm method for solving stochastic air cargo container loading problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(4), pages 520-531, July.
    5. Paquay, Célia & Limbourg, Sabine & Schyns, Michaël, 2018. "A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints," European Journal of Operational Research, Elsevier, vol. 267(1), pages 52-64.
    6. Lurkin, Virginie & Schyns, Michaël, 2015. "The Airline Container Loading Problem with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 244(3), pages 955-965.
    7. Célia Paquay & Sabine Limbourg & Michaël Schyns & José Fernando Oliveira, 2018. "MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 56(4), pages 1581-1592, February.
    8. Liu, D.S. & Tan, K.C. & Huang, S.Y. & Goh, C.K. & Ho, W.K., 2008. "On solving multiobjective bin packing problems using evolutionary particle swarm optimization," European Journal of Operational Research, Elsevier, vol. 190(2), pages 357-382, October.
    9. Manfred Padberg, 2000. "Packing small boxes into a big box," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(1), pages 1-21, September.
    10. Kurt R. Heidelberg & Gregory S. Parnell & James E. Ames, 1998. "Automated air load planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 751-768, December.
    11. Larsen, Ole & Mikkelsen, Gert, 1980. "An interactive system for the loading of cargo aircraft," European Journal of Operational Research, Elsevier, vol. 4(6), pages 367-373, June.
    12. Yan, Shangyao & Shih, Yu-Lin & Shiao, Fei-Yen, 2008. "Optimal cargo container loading plans under stochastic demands for air express carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(3), pages 555-575, May.
    13. Brandt, Felix & Nickel, Stefan, 2019. "The air cargo load planning problem - a consolidated problem definition and literature review on related problems," European Journal of Operational Research, Elsevier, vol. 275(2), pages 399-410.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brandt, Felix & Nickel, Stefan, 2019. "The air cargo load planning problem - a consolidated problem definition and literature review on related problems," European Journal of Operational Research, Elsevier, vol. 275(2), pages 399-410.
    2. Lurkin, Virginie & Schyns, Michaël, 2015. "The Airline Container Loading Problem with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 244(3), pages 955-965.
    3. Chao, Ching-Cheng & Li, Ru-Guo, 2017. "Effects of cargo types and load efficiency on airline cargo revenues," Journal of Air Transport Management, Elsevier, vol. 61(C), pages 26-33.
    4. Xianbo Xiang & Caoyang Yu & He Xu & Stuart X. Zhu, 2018. "Optimization of Heterogeneous Container Loading Problem with Adaptive Genetic Algorithm," Complexity, Hindawi, vol. 2018, pages 1-12, November.
    5. Erdem Agbas & Ali Osman Kusakci, 2021. "A simulation approach for aircraft cargo loading considering weight and balance constraints," International Journal of Business Ecosystem & Strategy (2687-2293), Bussecon International Academy, vol. 3(1), pages 21-31, January.
    6. Sam D. Allen & Edmund K. Burke, 2012. "Data Structures for Higher-Dimensional Rectilinear Packing," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 457-470, August.
    7. Tseremoglou, Iordanis & Bombelli, Alessandro & Santos, Bruno F., 2022. "A combined forecasting and packing model for air cargo loading: A risk-averse framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    8. Silva, Elsa & Ramos, António G. & Oliveira, José F., 2018. "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 62-75.
    9. Xinghan Chen & Weilin Tang & Yuzhilin Hai & Maoxiang Lang & Yuying Liu & Shiqi Li, 2024. "Optimization of Truck–Cargo Matching for the LTL Logistics Hub Based on Three-Dimensional Pallet Loading," Mathematics, MDPI, vol. 12(21), pages 1-28, October.
    10. Xiangling Zhao & Wenheng Xiao, 2024. "Uncertainty Analysis of Aircraft Center of Gravity Deviation and Passenger Seat Allocation Optimization," Mathematics, MDPI, vol. 12(10), pages 1-18, May.
    11. Jie Li & Mingkai Zou & Yaqiong Lv & Di Sun, 2024. "AGV Scheduling for Optimizing Irregular Air Cargo Containers Handling at Airport Transshipment Centers," Mathematics, MDPI, vol. 12(19), pages 1-20, September.
    12. Sándor P. Fekete & Jörg Schepers, 2004. "A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 353-368, May.
    13. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    14. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    15. Jie Fang & Yunqing Rao & Xusheng Zhao & Bing Du, 2023. "A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems," Mathematics, MDPI, vol. 11(2), pages 1-17, January.
    16. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    17. Manuel V. C. Vieira & Margarida Carvalho, 2023. "Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer," 4OR, Springer, vol. 21(3), pages 491-512, September.
    18. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Ekşioğlu, Sandra D. & Castillo-Villar, Krystel K., 2021. "Designing a reliable electric vehicle charging station expansion under uncertainty," International Journal of Production Economics, Elsevier, vol. 236(C).
    19. Li, Yanzhi & Tao, Yi & Wang, Fan, 2009. "A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning," European Journal of Operational Research, Elsevier, vol. 199(2), pages 553-560, December.
    20. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:13:p:2798-:d:1176419. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.