Advertisement

Packing Compaction Algorithm for Problems of Resource Placement Optimization

  • Vladislav A. ChekaninEmail author
  • Alexander V. Chekanin
Conference paper
Part of the Lecture Notes in Mechanical Engineering book series (LNME)

Abstract

The paper is devoted to a new heuristic packing compaction algorithm for the rectangular cutting and orthogonal packing problems. This algorithm is based on the idea of iterative local replacement of some objects placed in a container. Six selection rules for deleting placed objects and subsequent redistribution of them with the aim to obtain a packing with a better density are proposed. The effectiveness of the packing compaction algorithm has been investigated on the standard test instances of the rectangular cutting problem.

Keywords

Packing compaction algorithm Optimization Orthogonal packing problem Rectangular cutting problem Resource placement problem 

References

  1. 1.
    Wascher G, Haubner H, Schumann H (2007) An improved typology of cutting and packing problems. EJOR 183(3):1109–1130CrossRefGoogle Scholar
  2. 2.
    Bortfeldt A, Wascher G (2013) Constraints in container loading—a state-of-the-art review. EJOR 229(1):1–20MathSciNetCrossRefGoogle Scholar
  3. 3.
    Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. EJOR 141(2):241–252MathSciNetCrossRefGoogle Scholar
  4. 4.
    Goncalves JF, Resende MGC (2013) A biased random key genetic algorithm for 2D and 3D bin packing problems. Int J Prod Econ 145(2):500–510CrossRefGoogle Scholar
  5. 5.
    Motorin DE, Popov SG, Chuvatov MV, Kurochkin MA, Kurochkin LM (2017) A study of the evaluation function for the cost of transport operations in distribution of purpose in a group of robots. In: Proceedings of 2017 20th IEEE international conference on soft computing and measurements, SCM 2017, pp 536–538.  https://doi.org/10.1109/SCM.2017.7970642
  6. 6.
    Chekanin VA, Chekanin AV (2016) Implementation of packing methods for the orthogonal packing problems. J Theor Appl Inform Technol 88(3):421–430zbMATHGoogle Scholar
  7. 7.
    Kierkosz I, Luczak M (2014) A hybrid evolutionary algorithm for the two-dimensional packing problem. Cent Eur J Oper Res 22(4):729–753MathSciNetCrossRefGoogle Scholar
  8. 8.
    Boschetti MA (2004) New lower bounds for the finite three-dimensional bin packing problem. Discrete Appl Math 140:241–258MathSciNetCrossRefGoogle Scholar
  9. 9.
    Martinez MAA, Clautiaux F, Dell’Amico M, Iori M (2013) Exact algorithms for the bin packing problem with fragile objects. Discrete Optim 10(3):210–223MathSciNetCrossRefGoogle Scholar
  10. 10.
    Garey M, Johnson D (1979) Computers intractability: a guide to the theory of NP-completeness. W.H.Freeman, San Francisco, p 338zbMATHGoogle Scholar
  11. 11.
    Leung SCH, Zhang DF, Zhou CL, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39(1):64–73CrossRefGoogle Scholar
  12. 12.
    Gao YQ, Guan HB, Qi ZW, Hou Y, Liu L (2013) A multi-objective ant colony system algorithm for virtual machine placement in cloud computing. J Comput Syst Sci 79(8):1230–1242MathSciNetCrossRefGoogle Scholar
  13. 13.
    Chekanin VA, Chekanin AV (2018) Design of library of metaheuristic algorithms for solving the problems of discrete optimization. In: Evgrafov A (ed) Advances in mechanical engineering. Lecture notes in mechanical engineering., Springer, Cham, pp 25–32Google Scholar
  14. 14.
    Filippova AS (2006) Modeling of evolution algorithms for rectangular packing problems based on block structure technology. In: Inf Technol (Informacionnye Tehnologii). Appendix, 32 p (in Russian)Google Scholar
  15. 15.
    Chekanin VA, Chekanin AV (2016) Algorithms for management objects in orthogonal packing problems. ARPN J Eng Appl Sci 11(13):8436–8446zbMATHGoogle Scholar
  16. 16.
    Chekanin VA, Chekanin AV (2015) An efficient model for the orthogonal packing problem. Adv Mech Eng 22:33–38zbMATHGoogle Scholar
  17. 17.
    Chekanin VA, Chekanin AV (2014) Multilevel linked data structure for the multidimensional orthogonal packing problem. Appl Mech Mater 598:387–391CrossRefGoogle Scholar
  18. 18.
    Chekanin VA, Chekanin AV (2016) New effective data structure for multidimensional optimization orthogonal packing problems. In: Advances in mechanical engineering. Springer International Publishing, pp 87–92Google Scholar
  19. 19.
    Chekanin VA, Chekanin AV (2017) Deleting objects algorithm for the optimization of orthogonal packing problems. In: Advances in Mechanical Engineering. Springer International Publishing, pp 27–35Google Scholar
  20. 20.
    Berkey O, Wang P (1987) Two-dimensional finite bin-packing algorithms. J Oper Res Soc 38(5):423–429CrossRefGoogle Scholar
  21. 21.
    Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manage Sci 44:388–399CrossRefGoogle Scholar
  22. 22.
    Chekanin VA, Chekanin AV (2015) Development of optimization software to solve practical packing and cutting problems. In: Proceedings of the 2015 International Conference on Artificial Intelligence and Industrial Engineering (AIIE 2015). Advances in Intelligent Systems Research 123:379–382.  https://doi.org/10.2991/aiie-15.2015.104

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Vladislav A. Chekanin
    • 1
    Email author
  • Alexander V. Chekanin
    • 1
  1. 1.Moscow State University of Technology «STANKIN»MoscowRussia

Personalised recommendations