Abstract
The paper deals with the problem of 1.5 dimensional bin packing. As a data structure carrying information about packaging, a sequence of numbers of rectangles is used, representing the order of their packing. An essential role in obtaining the solution is played by a decoder, which performs the laying of rectangles according to the rules laid down in it. New methods for solving the packing problem are proposed, using mathematical methods in which the principles of natural decision-making mechanisms are laid. Unlike the canonical paradigm ant algorithm to find solutions to the graph G = (X, U) is constructed with a partition on the route of the formation and on the tops within each part, subgraphs whose edges are delayed pheromone. The structure of the solution search graph, the procedure for finding solutions on the graph, the methods of deposition and evaporation of pheromone are described. The time complexity of the algorithm, experimentally obtained, practically coincides with the theoretical studies and for the considered test problems is O(n2). In comparison with existing algorithms, the improvement of results is achieved by 2–3%.
This work was supported by the grant from the Russian Foundation for Basic Research the project № 17-07-00997.
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
Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141, 241–252 (2002)
Leung, S.C.H., Zhang, D., Sim, K.M.: A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur. J. Oper. Res. 215, 57–69 (2011)
Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. INFORMS J. Comput. 15, 310–319 (2003)
Duanbing, C., Wenqi, H.: Greedy algorithm for rectangle-packing problem. Comput. Eng. 33, 160–162 (2007)
Timofeeva, O.P., Sokolova, E.S., Milov, K.V.: Genetic algorithm in optimization of container packaging. In: Proceedings of NSTU, Informatics and Management Systems, vol. 4, no. 101, pp. 167–172 (2013)
Hifi, M., M’Hallah, R.: A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes. Int. Trans. Oper. Res. 10, 195–216 (2003)
De Zhang, F., ShuiHua, H., WeiGuo, Y.: A bricklaying heuristic algorithm for the orthogonal rectangular packing problem. Chin. J. Comput. 33, 509–515 (2008)
Leung, C.H., Zhang, D., Zhou, C., et al.: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput. Oper. Res. 39, 64–73 (2012)
Shi, W.: Solving rectangle packing problem based on heuristic dynamic decomposition algorithm. In: 2nd International Conference on Electrical and Electronics: Techniques and Applications, pp. 187–196 (2017)
Lebedev, O.B., Zorin, V.Yu.: Packaging on the basis of the method of the ant colony. Izvestiya Southern Federal University. Publishing House of TTI SFedU, no. 12, pp. 25–30 (2010)
Lebedev, V.B., Lebedev, O.B.: Swarm Intelligence on the basis of integration of models of adaptive behavior of ants and bee colony. Izvestiya Southern Federal University. Publishing House of TTI SFedU, no. 7, pp. 41–47 (2013)
Lebedev, B.K., Lebedev, V.B.: Optimization by the method of crystallization of placers of alternatives. Izvestiya Southern Federal University. Publishing House of TTI SfedU, no. 7, pp. 11–17 (2013)
Lebedev, B.K., Lebedev, O.B.: Modeling of the adaptive behavior of an ant colony in the search for solutions interpreted by trees. Izvestiya Southern Federal University. Publishing House of TTI SfedU, no. 7, pp. 27–35 (2012)
Dorigo, M., Stützle, T.: Ant Colony Optimization, p. 244. MIT Press, Cambridge (2004)
Lebedev, O.B.: Models of adaptive behavior of ant colony in the task of designing. Southern Federal University. Publishing House of SfedU, p. 199 (2013)
Acknowledgements
This research is supported by grants of the Russian Foundation for Basic Research of the Russian Federation, the project № 17-07-00997.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Lebedev, B.K., Lebedev, O.B., Lebedeva, E.O. (2019). Hybrid Bioinspired Algorithm of 1.5 Dimensional Bin-Packing. In: Abraham, A., Kovalev, S., Tarassov, V., Snasel, V., Sukhanov, A. (eds) Proceedings of the Third International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’18). IITI'18 2018. Advances in Intelligent Systems and Computing, vol 874. Springer, Cham. https://doi.org/10.1007/978-3-030-01818-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-01818-4_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01817-7
Online ISBN: 978-3-030-01818-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)