Abstract
The work considers the problem of three-dimensional bin packaging (3D-BPP), where a load of maximum volume is put in a single container. To solve the above mentioned problem there was a coevolutionary parallel algorithm used basing on the separate evolution of cooperating subpopulations of possible solutions. Computational experiments were conducted in a neighbourhood of clusters and aimed to examine the impact of parallelization algorithm on the computation time and the quality of the obtained solutions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bischoff, E.E., Ratcliff, M.S.W.: Issues in the Development of Approaches to Container Loading. Omega, Int. J. Mgmt. Sci. 23(4), 377–390 (1995)
Bortfeld, A., Gehring, H.: A hybryd genetic algorithm for the container loading problem. European Journal of Operational Research 131, 143–161 (2001)
Bożejko, W., Wodecki, M.: Parallel genetic algorithm for minimizing total weighted completion time. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 400–405. Springer, Heidelberg (2004)
Bożejko, W., Wodecki, M.: Parallel Evolutionary Algorithm for the Traveling Salesman Problem. Journal of Numerical Analysis, Industrial and Applied Mathematics 2(3-4), 129–137 (2007)
Bożejko, W., Wodecki, M.: Solving Permutational Routing Problems by Population-Based Metaheuristics. Computers & Industrial Engineering 57, 269–276 (2009)
He, Y., Wu, Y., de Souza, R.: A global search framework for practical three-dimensional packing with variable carton orientations. Computers & Operations Research 39(2012), 2395–2414 (2012)
Goncalves, J.F., Resende, M.G.C.: A parallel multi-population biased random-key genetic algorithm for a container loading problem. Computers & Operations Research 39, 179–190 (2012)
Hopper, E.: Two-dimensional Packing Utilising Evolutionary Algorithms and other Meta- Heuristic Methods, PhD Thesis, University of Wales (2000)
Karabulut, K., İnceoğlu, M.M.: A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. In: Yakhno, T. (ed.) ADVIS 2004. LNCS, vol. 3261, pp. 441–450. Springer, Heidelberg (2004)
Kang, K., Moon, I., Wang, H.: A hybrid genetic algorithm with a n packing problem. Applied Mathematics and Computation 219, 1287–1299 (2012)
Liu, D.S., Tan, K.C., Huang, S.Y., Goh, C.K., Ho, W.K.: On solving multiobjective bin packing problems using evolutionary particle swarm optimization. European Journal of Operational Research 190, 357–382 (2008)
Stawowy, A.: Evolutionary based heuristic for bin packing problem. Computers & Industrial Engineering 55, 465–474 (2008)
Wu, Y., Li, W., Goh, M., de Souza, R.: Three-dimensional bin packing problem with variable bin height. European Journal of Operational Research 202, 347–355 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bożejko, W., Kacprzak, Ł., Wodecki, M. (2015). Parallel Coevolutionary Algorithm for Three-Dimensional Bin Packing Problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science(), vol 9119. Springer, Cham. https://doi.org/10.1007/978-3-319-19324-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-19324-3_29
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19323-6
Online ISBN: 978-3-319-19324-3
eBook Packages: Computer ScienceComputer Science (R0)