期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：4
页码：471-475
出版社：Shri Pannalal Research Institute of Technolgy
摘要：The bin packing problem is a combinatorial NP-hard problem. In it, objects of different volumes must be packed into a finite number of bins of capacity V in a way that minimizes the number of bins used.Most of the previous approaches have dealt with one-dimensional cases, only a few with two-dimensional problems and it is very rare to find work on three-dimensional bin packing. In this paper a elitism based compact genetic algorithm is presented to solve three-dimensional container loading or bin packing problems. The three dimensional bin packing problem is the problem of orthogonally packing of set of boxes into a minimum of three dimensional bin. This algorithm uses a probability vector to represent the bit probability of 0 and 1 and model the distribution of generation.
