PRIORITY LOADING ALGORITHM AS THE PART OF AIRCRAFT LOAD OPTIMIZATION MODEL
DOI:
https://doi.org/10.18372/2306-1472.84.14952Keywords:
bin packing problem, aircraft load optimization, aircraft load planning algorithm, aircraft loading time, ULD (Unit Load Devices), priority loading criteriaAbstract
Purpose: development of a new load optimization algorithm in order to solve the aircraft load optimization problem with further implementation it to the innovated load optimization model. Methods: heuristics, formalized approach, computer modeling. Results: the innovated load optimization algorithm was designed, which implies the containers groups’ assignment with minimization of loading time. Discussion: Most of studied scientific works contain various descriptions of bin packing problem’s solutions, knapsack optimization models and also outline a term of “aircraft cargo loading” as a problem of container selection, packing and cargo loading into the aircraft compartment. These models are concentrated on separate features, whereas the real load optimization problem is inextricably linked with aircraft handling and operations. This innovated load optimization model consists in decomposing the loading problem and also implementation of a new priority load planning algorithm. The following algorithm refers the predefined Unit Load Devices’ assignment in the aircraft cargo compartment in priority order to unload them according to data’s documentation without exceeding weight and balance constraints and with loading time reduction and consequently cutting handling and operation costs.
References
International Air Transport Association. Unit load Devices. IATA definitions. Available at: https://www.iata.org/en/programs/cargo/unit-load-devices/ (accessed 08.08.2020).
Bischoff, E.E. & Marriott, M.D. (1990). A Comparative Evaluation of Heuristics for Container Loading. European Journal of Operational Research, 44, pp. 267-276. doi:10.1016/0377-2217(90)90362-F
Bischoff, E.E. (2006). Three - dimensional packing of items with limited load bearing strength. European Journal of Operational Research, vol. 168. pp. 952-966. doi: 10.1016/j.ejor.2004.04.037
Bortfeldt, A., & Gehring, H. (2001). A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research, 131, pp. 143–161. doi: 10.1016/S0377-2217(00)00055-2
Chen, C.S., Lee, S.M., & Shen, Q.S. (1995). An analytical model for the container loading problem. European Journal of Operational Research, vol. 80(1), pp. 68-76. doi: 10.1016/0377-2217(94)00002-T
Dyckho, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44, pp.145−159. doi: 10.1.1.87.4320
Laarhoven P.J.M. and Aarts E.H.L. (1987). Simulated Annealing: Theory and Applications. Kluwer Academic Publishers, Boston. pp. 55-70.
Loading of Aircraft with Cargo. Available at:
https://www.skybrary.aero/index.php/Loading_of_Aircraft_with_Cargo (accessed 15.07.2020).
Rukovodstvo letnoy ekspluatatsii Il76-T. Kniga 1, Izdaniye 2. Prilozhenie 3. Instruktsiya po tsentrovke i zagruzke. pp.2-12. (in Russian)
Sahun, Ye. (2019). Current status of aircraft load optimization problem. Proceedings of the National Aviation University, 1 (78), pp. 35−39.
Sahun, Ye (2020). Application of load planning algorithm in an aircraft load optimization process. Poster. International Computer Technologies in Education, Research and Industrial Applications, 06-10 October 2020, Kharkiv, Ukraine, 8 p.
Trivella, A., & Pisinger, D. (2017). Bin-packing problems with load balancing and stability constraints. Working paper. INFORMS
