Abstract
A new multilevel linked data structure designed for fast construction of packing schemes during solving of orthogonal packing problems is considered in this paper. The computational experiments that were carried out demonstrate the high time efficiency of the proposed data structure compared to an ordered simple linked list that requires ordering of all its elements after placing a new object into a container.
This work was carried out with the financial support of the Ministry of Education and Science of Russian Federation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wascher G, Haubner H, Schumann H (2007) An improved typology of cutting and packing problems. EJOR 183(3):1109–1130
Bortfeldt A, Wascher G (2013) Constraints in container loading—A state-of-the-art review. EJOR 229(1):1–20
Chekanin AV, Chekanin VA (2013) Efficient algorithms for orthogonal packing problems. Comput Math Math Phys 53(10):1457–1465
Chekanin AV, Chekanin VA (2013) Improved packing representation model for the orthogonal packing problem. Appl Mech Mater 390:591–595
Chekanin VA, Chekanin AV (2013) Based on a multimethod technology algorithm for solving the orthogonal packing problems. Inf Technol (Informacionnye Tehnologii) 7:17–21 (in Russian)
Mukhacheva EA, Bukharbaeva LY, Filippov DV, Karipov UA (2008) Optimization problems of transport logistics: operating bin stowage for cargo transportation. Inf Technol (Informacionnye Tehnologii) 7:17–22 (in Russian)
Chekanin VA, Chekanin AV (2012) Effective models of representations of orthogonal resources in solving the packing problem. Inf Control Syst (Informatsionno-Upravlyayushchiye systemy) 5:29–32 (in Russian)
Chekanin VA, Chekanin AV (2012) Researching of genetic methods to optimize the allocation of rectangular resources In: Modern engineering: science and education: proceedings of 2nd International scientific conference. Izd-vo Politekhn. un-ta, SPb, pp 798–804 (in Russian)
Chekanin VA, Chekanin AV (2012) Optimization of the solution of the orthogonal packing problem. App Inf (Prikladnaya informatika) 4:55–62 (in Russian)
Crainic TG, Perboli G, Tadei R (2008) Extreme point-based heuristics for three-dimensional bin packing. INFORMS J Comput 20(3):368–384
Chekanin VA, Chekanin AV (2013) A model of managing free spaces of containers for the orthogonal packing problem In: Modern engineering: science and education: proceedings of 3th international scientific. Izd-vo Politekhn. un-ta, SPb, pp 1060–1065 (in Russian)
Fekete SP, Schepers J (1998) New classes of lower bounds for bin packing problems. Integer programming and computational optimization (IPCO 98). Lect Notes Comput Sci 1412:257–270
Weiss MA (2014) Data Structures and algorithm analysis in C++. Boston, Pearson Education, 656 p
Chekanin VA, Chekanin AV (2014) Improved data structure for the orthogonal packing problem. Adv Mater Res 945–949:3143–3146
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Chekanin, V.A., Chekanin, A.V. (2016). New Effective Data Structure for Multidimensional Optimization Orthogonal Packing Problems. In: Evgrafov, A. (eds) Advances in Mechanical Engineering. Lecture Notes in Mechanical Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-29579-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-29579-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29578-7
Online ISBN: 978-3-319-29579-4
eBook Packages: EngineeringEngineering (R0)