DocumentCode
3416014
Title
Study of one-dimensional cutting stock problem with multi-objective optimization
Author
Feifei, Ge ; Lin, Liu ; Jun, Pei ; Xiazi, Zhang
Author_Institution
Sch. of Manage., Hefei Univ. of Technol., Hefei, China
fYear
2012
fDate
24-26 Aug. 2012
Firstpage
571
Lastpage
574
Abstract
Under current research of one-dimensional cutting stock problem in manufacture industry, we establish an optimal model which is aim at the minimization of waste, minimization of cutting patterns and the minimization of usable leftover in the whole cutting process. The method we proposed is an improvement of NSGA-II, computation result shows our algorithm could arrive Pareto optimization. Then we use the subjective weighting method to find the optimal solution.
Keywords
bin packing; genetic algorithms; manufacturing industries; minimisation; NSGA-II; Pareto optimization; cutting patterns; manufacture industry; minimization; multiobjective optimization; one-dimensional cutting stock problem; subjective weighting method; usable leftover; Optimization; Sociology; Statistics; NSGA-II algorithm; One-dimensional cutting stock; information entropy;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Processing (CSIP), 2012 International Conference on
Conference_Location
Xi´an, Shaanxi
Print_ISBN
978-1-4673-1410-7
Type
conf
DOI
10.1109/CSIP.2012.6308918
Filename
6308918
Link To Document