A GENETIC ALGORITHM FOR THE RECTANGULAR PACKING PROBLEM OF PLACEMENT FUNCTION
In view of the locating rule of rectangle packing, by introducing the method of attractive factors, this paper puts forward optimizing the calculation for each parameter of placement function by utilizing genetic algorithm. This algorithm sets the utilization ratio of the maximum area of capacity as the goal, optimizing the confirmation of each rectangle. When optimizing parameters by utilizing genetic algorithm, through combination of the principle of closed crossing avoidance and the principle of multiple crossover, which could enhance the searching efficiency of each generation of calculation method, generally, a satisfying outcome could be searched after the evolution of 5 to 10 generations. With formerly used the genetic algorithm optimization layout block the ordering rule to be different, the aim of this article is to optimize parameters in placement function by genetic algorithm, examples validate the rationality and efficiency of this algorithm.
genetic algorithm rectangle packing placement function parameters feasible region
WANG jinmin ZHU yanhua WANG baochun
Tianjin Key Laboratory of High Speed Cutting & Precision Machining. TUTE, P. R. China. ShanDong YingCai University, P. R. China
国际会议
International Technology and Innovation Conference 2009(2009技术与创新国际学术会议)
西安
英文
1-5
2009-10-12（万方平台首次上网日期，不代表论文的发表时间）