Abstract
Three dimensional bin packing problems arise in industrial applications like container ship loading, pallet loading, plane cargo management and warehouse management, etc. In this paper, a hybrid genetic algorithm (GA) is used for regular 3D strip packing. The Genetic Algorithm is hybridized with the presented Deepest Bottom Left with Fill (DBLF) method. Several heuristic methods have also been used for comparison with the hybrid GA.
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
Preview
Unable to display preview. Download preview PDF.
References
Hopper, E.: Two-dimensional Packing Utilising Evolutionary Algorithms and other Meta-Heuristic Methods, A Thesis submitted to University of Wales for the Degree of Doctor of Philosophy (2000)
Fowler, R.J., Paterson, M.S., Tatimoto, S.L.: Optimal Packing and Covering in the Plane Are NP-Complete. Information Processing Letters 12, 133–137 (1981)
Faroe, O., Pisinger, D., Zachariasen, M.: Guided Local Search for the Three-Dimensional Bin Packing Problem. INFORMS Journal on Computing (2002)
Corcoran III, A.L., Wainwrigth, R.L.: Genetic algorithm for packing in three dimensions. In: Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing SAC 1992, Kansas City, pp. 1021-1030 (1992)
Ikonen, I., Kumar, A.: A Genetic Algorithm for Packing Three-Dimensional Non-Convex Objects Having Cavities and Holes. In: Proceedings of the 7th International Conference on Genetic Algorithms, pp. 591–598 (1998)
Martello, S., Pisinger, D., Vigo, D.: The Three-Dimensional Bin Packing Problem. Operations Research 48, 256–267 (2000)
Raidl, G.R.: A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. In: SAC 1999, San Antonio (1999)
Beasley, D., Bull, D.R., Martin, R.R.: An Overview of Genetic Algorithms: Part 1, Fundamentals. University Computing 15(2), 58–69 (1993)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Schaffer, J.D., Selman, L.: Some Effects of Selection Procedures on Hyper plane sampling by Genetic Algorithms. Genetic Algorithms and Simulated Annealing (1987)
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Bram Verweij: Multiple Destination Bin Packing, Report (1996), http://citeseer.ist.psu.edu/verweij96multiple.html
Davis, L.: Applying adaptive search algorithms to epistatic domains. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, pp. 162–164 (1985)
Jakobs, S.: On Genetic Algorithms for the Packing of Polygons. European Journal of Operational Research 88, 165–181 (1996)
Raidl, G.R., Kodydek, G.: Genetic Algorithms for the Multiple Container Packing Problem. In: Proceedings of the 5th Int. Conference on Parallel Problem Solving from Nature, Amsterdam, The Netherlands, pp. 875–884 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karabulut, K., İnceoğlu, M.M. (2004). A Hybrid Genetic Algorithm for Packing in 3D with Deepest Bottom Left with Fill Method. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2004. Lecture Notes in Computer Science, vol 3261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30198-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-30198-1_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23478-4
Online ISBN: 978-3-540-30198-1
eBook Packages: Computer ScienceComputer Science (R0)