DocumentCode :
3597295
Title :
An improved genetic algorithm for the packing of rectangles
Author :
Li, Ming
Author_Institution :
Zhejiang Inst. of Metrol., Hangzhou, China
Volume :
3
fYear :
2009
Firstpage :
1690
Lastpage :
1693
Abstract :
Aiming at the optimal layout problem of rectangular parts with dynamic constraints, a novel heuristic rectangular optimal layout method is proposed based on the improved genetic algorithm. In order to enhance operation speed of the algorithm, the algorithm of population initialization is improved by using the elitist preservation strategy; In order to enhance the global convergence performance of the algorithm, the crossover and mutation operator are improved by using the self-adaptive strategy; in order to enhance the precision of the algorithm, the decoding algorithm is improved by using the height adjustment algorithm. The proposed approach could achieve the layout optimization for both single standard and multi-standard plates. The solution of numerical example indicates that the proposed algorithm is a feasible approach to rectangular parts optimal layout.
Keywords :
bin packing; decoding; genetic algorithms; mathematical operators; crossover operator; decoding algorithm; dynamic constraints; elitist preservation strategy; genetic algorithm; height adjustment algorithm; heuristic rectangular optimal layout method; multistandard plates; mutation operator; population initialization; rectangle packing; selfadaptive strategy; single standard plates; Cybernetics; Genetic algorithms; Genetic engineering; Industrial control; Laboratories; Machine learning; Metrology; Optimal control; Production; Testing; Genetic algorithm; Height adjustment algorithm; Rectangular parts; Self-adaptive;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2009 International Conference on
Print_ISBN :
978-1-4244-3702-3
Electronic_ISBN :
978-1-4244-3703-0
Type :
conf
DOI :
10.1109/ICMLC.2009.5212347
Filename :
5212347
Link To Document :
بازگشت