关键词: 布局问题, 启发式算法, 吸引子, 蜜蜂进化

Abstract: Three dimensional rectangular packing is a NP-hard problem, which is often solved by
heuristic algorithms. In this paper the sequencing rules is determined by the volume of packing items,
the positioning rules are determined by attractor function with the geometry feasible region of packing
items in packing space. Then the parameters in the attractor function are optimized by bee evolution
genetic algorithm (BEGA), the new packing genetic algorithm is formed. Finally, different benchmarks
are carried out, and the paper proves the validity of the algorithm by comparing with the traditional
packing genetic algorithm (SPGA) which chooses the standard proportional selection as its operator,
etc.

Key words: packing problem, heuristic algorithm, attractive factor, bee evolutionary