Parallel Coevolutionary Algorithm for Three-Dimensional Bin Packing Problem
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.
KeywordsRotation Number Packing Problem Hybrid Genetic Algorithm Position List Total Weighted Completion Time
Unable to display preview. Download preview PDF.
- 4.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)Google Scholar
- 8.Hopper, E.: Two-dimensional Packing Utilising Evolutionary Algorithms and other Meta- Heuristic Methods, PhD Thesis, University of Wales (2000)Google Scholar