Skip to main content
SpringerLink
Log in

Loading Optimization of an Ordered Set of Aircraft

  • Published:
Mathematical Models and Computer Simulations Aims and scope

Abstract

The problem of calculating the optimal loading of the set of aircraft organized in accordance with the given system of priorities is considered. The formalization in the form of a mixed integer linear programming problem, which requires half as many binary variables for writing down the conditions under which the cargoes do not intersect in comparison with the approaches presented in the literature, is proposed for the specified problem. The technology of the exact solution of the specified problem is developed and implemented in the form of a public web service. The main features and practical significance of the proposed technology are described.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.

Similar content being viewed by others

REFERENCES

  1. E. E. Bischoff and M. S. W. Ratcliff, “Issues in the development of approaches to container loading,” Omega, Int. J. Manage. Sci. 23 (4), 377–390 (1995).

    Google Scholar 

  2. A. Bortfeldt and G. Wäscher, “Constraints in container loading—a state-of-the-art review,” Eur. J. Oper. Res. 229 (1), 1–20 (2013).

    Article  MathSciNet  Google Scholar 

  3. J. Egeblad, C. Garavelli, S. Lisi, and D. Pisinger, “Heuristics for container loading of furniture,” Eur. J. Oper. Res. 200 (3), 881–892 (2010).

    Article  Google Scholar 

  4. C. Paquay, M. Schyns, and S. Limbourg, “A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application,” Int. Trans. Oper. Res. 23 (1–2), 187–213 (2016).

    Article  MathSciNet  Google Scholar 

  5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, San Francisco, 1979).

    MATH  Google Scholar 

  6. V. V. Psiola, “On an approximate solution of the three-dimensional packing problem based on heuristics,” Intell. Sist. 11 (1–4), 83–100 (2007).

    Google Scholar 

  7. M. Eley “A bottleneck assignment approach to the multiple container loading problem,” OR Spectrum, 25, (1), 45–60 (2003).

    Article  MathSciNet  Google Scholar 

  8. A. Lim, H. Ma, J. Xu, and X. Zhang, “An iterated construction approach with dynamic prioritization for solving the container loading problems,” Expert Syst. Appl. 39 (4), 4292–4305 (2012).

    Article  Google Scholar 

  9. Z. Jin, T. Ito, and K. Ohno, “The three-dimensional bin packing problem and its practical algorithm,” JSME Int. J. Ser. C 46 (1), 60–66 (2003).

    Article  Google Scholar 

  10. C. H. Che, W. Huang, and A. Lim, “The multiple container loading cost minimization problem,” Eur. J. Oper. Res. 214 (3), 501–511 (2011).

    Article  Google Scholar 

  11. C. S. Chen, S. M. Lee, and Q. S. Shen, “An analytical model for the container loading problem,” Eur. J. Oper. Res. 80 (1), 68–76 (1995).

    Article  Google Scholar 

  12. M. Padberg, “Packing small boxes into a big box,” Math. Methods Oper. Res. 52 (1), 1–21 (2000).

    Article  MathSciNet  Google Scholar 

  13. H. T. Hong Ha and N. Nananukul, “Air cargo loading management system for logistics forwarders,” in Proceedings of 2016 International Conference on Urban Planning, Transport and Construction Engineering (ICUPTCE'16), Pattaya, Jan. 2–3, 2016 (2016), pp. 51–58.

  14. L. Junqueira, R. Morabito, and D. S. Yamashita, “Three-dimensional container loading models with cargo stability and load bearing constraints,” Comput. Oper. Res. 39 (1), 74–85 (2012).

    Article  MathSciNet  Google Scholar 

  15. V. P. Osipov and V. A. Sudakov, “A combined method for multi-criteria decision making support,” Prepr. Inst. Prikl. Mat. im. M. V. Keldysha, No. 30 (2015).

  16. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms (Springer, Berlin, 2006).

    MATH  Google Scholar 

  17. T. C. Hu, Integer Programming and Network Flows (Addison-Wesley, Reading, MA, 1970.

    Google Scholar 

  18. J. T. Linderoth and T. K. Ralphs, “Noncommercial software for mixed-integer linear programming,” in Integer Programming: Theory and Practice (CRC Press, 2005), pp. 253–303.

    Google Scholar 

  19. T. Achterberg, “SCIP: Solving constraint integer programs,” Math. Program. Comput. 1 (1), 1–41 (2009).

    Article  MathSciNet  Google Scholar 

  20. H. Pollaris, K. Braekers, A. Caris, G. K. Janssens, and S. Limbourg, “Vehicle routing problems with loading constraints: State-of-the-art and future directions,” OR Spectrum 37 (2), 297–330 (2015).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Moscow, Russia

    I. P. Bogdanov & V. A. Sudakov

  2. National Research Center Zhukovsky Institute, Moscow, Russia

    N. B. Toporov

Authors
  1. I. P. Bogdanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Sudakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. B. Toporov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to I. P. Bogdanov, V. A. Sudakov or N. B. Toporov.

Additional information

Translated by O. Pismenov

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bogdanov, I.P., Sudakov, V.A. & Toporov, N.B. Loading Optimization of an Ordered Set of Aircraft. Math Models Comput Simul 12, 950–957 (2020). https://doi.org/10.1134/S2070048220060034

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S2070048220060034

Keywords:

Search

Navigation