DocumentCode
2959137
Title
Tabu algorithms with two moves for solving the problem of hot rolling scheduling
Author
Hongbing, Wang ; Anjun, Xu ; Lin, Yao ; Hui, Li
Author_Institution
Sch. of Inf. Eng., Univ. of Sci. & Technol. Beijing, Beijing
fYear
2008
fDate
5-8 Aug. 2008
Firstpage
258
Lastpage
260
Abstract
The problem of hot rolling scheduling is formalized as a mathematical model. Tabu algorithms with two moves respectively based on inserting and swapping neighborhood are proposed and compared with the corresponding version with single move for the problem. The experiment results show that the selection strategy of candidate list with two moves can improve the solution quality a lot given the same number of iterations.
Keywords
hot rolling; iterative methods; scheduling; search problems; steel industry; candidate list selection strategy; hot rolling scheduling problem; iteration method; mathematical model; steel making industry; tabu algorithm; Automation; Bismuth; Machine learning algorithms; Mathematical model; Mechatronics; Partitioning algorithms; Scheduling algorithm; Slabs; Space technology; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Mechatronics and Automation, 2008. ICMA 2008. IEEE International Conference on
Conference_Location
Takamatsu
Print_ISBN
978-1-4244-2631-7
Electronic_ISBN
978-1-4244-2632-4
Type
conf
DOI
10.1109/ICMA.2008.4798762
Filename
4798762
Link To Document