DocumentCode
1571034
Title
Optimal combination problem of orders in cold rolling plant solved by partheno-genetic algorithm
Author
Yaohua Li ; Dabo Zhang ; Ning, Shushi ; Wang, Wei ; Zhu, Xueqi
Author_Institution
Res. Center of Inf. & Control, Dalian Univ. of Technol., China
Volume
4
fYear
2004
Firstpage
2953
Abstract
The order sequence problem of cold rolling production scheduling in iron and steel enterprises was discussed. The production planning of cold rolling was regarded as a traveling salesman problem. The bounce of the width, gauge and hardness of the production orders was considered and an order sequence model of order optimal combination was suggested. A partheno-genetic algorithm is used to solve the model and the algorithm has a characteristic of genetic operation being done on a single individual. The algorithm uses a new coding method based on natural serial number and some operators such as gene exchange, gene shift. The simulation with production data shows that the algorithm suggested in this paper is feasible.
Keywords
cold rolling; genetic algorithms; production control; production planning; steel industry; travelling salesman problems; cold rolling plant; gene exchange; gene shift; iron and steel enterprises; natural serial number; optimal combination problem; order sequence problem; partheno-genetic algorithm; production planning; production scheduling; traveling salesman problem; Companies; Genetics; Iron; Production planning; Scheduling algorithm; Software algorithms; Steel; Time of arrival estimation; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on
Print_ISBN
0-7803-8273-0
Type
conf
DOI
10.1109/WCICA.2004.1343057
Filename
1343057
Link To Document