nach oben

Erschienen in:

2019 | OriginalPaper | Buchkapitel

Packing Compaction Algorithm for Problems of Resource Placement Optimization

verfasst von : Vladislav A. Chekanin, Alexander V. Chekanin

Erschienen in: Advances in Mechanical Engineering

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Nächstes Kapitel Wave Processes in the Periodically Loaded Infinite Shell

Wascher G, Haubner H, Schumann H (2007) An improved typology of cutting and packing problems. EJOR 183(3):1109–1130CrossRef

Bortfeldt A, Wascher G (2013) Constraints in container loading—a state-of-the-art review. EJOR 229(1):1–20MathSciNetCrossRef

Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. EJOR 141(2):241–252MathSciNetCrossRef

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–510CrossRef

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

Chekanin VA, Chekanin AV (2016) Implementation of packing methods for the orthogonal packing problems. J Theor Appl Inform Technol 88(3):421–430MATH

Kierkosz I, Luczak M (2014) A hybrid evolutionary algorithm for the two-dimensional packing problem. Cent Eur J Oper Res 22(4):729–753MathSciNetCrossRef

Boschetti MA (2004) New lower bounds for the finite three-dimensional bin packing problem. Discrete Appl Math 140:241–258MathSciNetCrossRef

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–223MathSciNetCrossRef

10.

Garey M, Johnson D (1979) Computers intractability: a guide to the theory of NP-completeness. W.H.Freeman, San Francisco, p 338MATH

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–73CrossRef

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–1242MathSciNetCrossRef

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–32

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)

15.

Chekanin VA, Chekanin AV (2016) Algorithms for management objects in orthogonal packing problems. ARPN J Eng Appl Sci 11(13):8436–8446MATH

16.

Chekanin VA, Chekanin AV (2015) An efficient model for the orthogonal packing problem. Adv Mech Eng 22:33–38MATH

17.

Chekanin VA, Chekanin AV (2014) Multilevel linked data structure for the multidimensional orthogonal packing problem. Appl Mech Mater 598:387–391CrossRef

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–92

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–35

20.

Berkey O, Wang P (1987) Two-dimensional finite bin-packing algorithms. J Oper Res Soc 38(5):423–429CrossRef

21.

Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manage Sci 44:388–399CrossRef

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

Titel: Packing Compaction Algorithm for Problems of Resource Placement Optimization
verfasst von: Vladislav A. Chekanin
Alexander V. Chekanin
Verlag: Springer International Publishing
Buch: Advances in Mechanical Engineering
Print ISBN: 978-3-030-11980-5

Electronic ISBN: 978-3-030-11981-2

Copyright-Jahr: 2019
DOI: https://doi.org/10.1007/978-3-030-11981-2_1

Premium Partner

Marktübersichten

Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.

Zur Marktübersicht