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.
Cite
CITATION STYLE
Bozejko, W., Kacprzak, Ł., & Wodecki, M. (2015). Parallel coevolutionary algorithm for three-dimensional bin packing problem. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 9119, pp. 319–328). Springer Verlag. https://doi.org/10.1007/978-3-319-19324-3_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
