Non overlapped genetic algorithm for layout problem with behavioral constraints
ZHAI\ Jin gang 1,\ FENG\ En min 1, LI\ Zhen min 2,\ YIN\ Hong chao 2 1.Dept. of Math., Dalian Univ. of Technol., Dalian 116024, China 2.Dept. of Power Eng., Dalian Univ. of Technol., Dalian 116024, China
For the behavioral constraint optimization problem about installing some pieces in a satellite module,this paper presents and proves a non overlapped judgement theorem for rectangle pieces. Based on the theorem, the authors constructed a non overlapped genetic algorithm for the layout optimization problem. Numerical results show that the algorithm is correct and efficient.