DocumentCode :
2893996
Title :
An Online Layout Algorithm for the One-Dimensional Cutting Problems
Author :
Zhao, Zhi-Yan ; Zhan, Yuan-rui
Author_Institution :
Sch. of Manage., Tianjin Univ.
fYear :
2006
fDate :
13-16 Aug. 2006
Firstpage :
2560
Lastpage :
2564
Abstract :
In this paper, an online layout algorithm for the one-dimensional cutting stock problems (ODCSP) has been proposed. The whole algorithm has been divided into two parts. The outer is the online controlled loop, and can continually transfer the given parameters to the inner loop; Partheno-genetic algorithm (PGA) has been applied to realize the layout optimization in the inner loop. In PGA, several strategies have been developed to reduce the amount of computation and improve the speed of the convergence, such as a simplified encoding method, an efficient evaluation function and the mutation-holding strategy. Thus, the optimal solutions can be obtained. Finally, the practical experiments from the real factory have been performed to demonstrate the effectiveness of the method proposed in this paper
Keywords :
bin packing; convergence; encoding; genetic algorithms; Partheno-genetic algorithm; convergence; layout optimization; mutation-holding strategy; one-dimensional cutting stock problem; online controlled loop; online layout algorithm; simplified encoding method; Biological cells; Conference management; Cost function; Cybernetics; Electronics packaging; Encoding; Genetic algorithms; Linear programming; Machine learning; Machine learning algorithms; Production facilities; Simulated annealing; Layout; Mutation-holding Strategy; ODCSP; PGA; Simplified Encoding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2006 International Conference on
Conference_Location :
Dalian, China
Print_ISBN :
1-4244-0061-9
Type :
conf
DOI :
10.1109/ICMLC.2006.258849
Filename :
4028495
Link To Document :
بازگشت