Improved Ant Colony Algorithm Base on Slab Cluster for Roll Planning

Article Preview

Abstract:

Focusing on the disadvantages of recent researches for roll planning that seldom consider the warm-up part and solution efficiency is low, in this paper, a parallel planning model and an improved ant colony algorithm were proposed to solve the problem. Firstly, the model considering constraints of both warm-up part and staple one was designed; Secondly, the improved ant colony algorithm was proposed where the slab cluster was used to decrease the searching scope and the local optimization to improve the efficiency of pheromone accumulation. Finally, with production data from hot strip mill, we proof the method can get the best results by comparing with other two ant colony algorithms.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

7-11

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Lopez L, Carter W M, Gendreau M. The hot strip mill production scheduling problem: A tabu search approach [J]. European Journal of Operational Research. 1998, 106: 317~ 335.

DOI: 10.1016/s0377-2217(97)00277-4

Google Scholar

[2] Peter Cowling, Wafa Rezig. Integration of continuous caster and hot strip mill planning for steel production [J]. Journal of Research and Development. 2000, (3): 185~208.

DOI: 10.1002/1099-1425(200007/08)3:4<185::aid-jos42>3.0.co;2-g

Google Scholar

[3] Li Yao-hua, Wang Wei, Xu Le-jiang. Rolling plan model and algorithm in hot rolling plant [J]. Control and Decision, 2005, 20(3): 275~279.

Google Scholar

[4] Chen Ai-ling, Yang Gen-ke, WU Zhi-ming. Rolling Plan Optimization Model and Algorithm for Hot Rolling Processes; Journal of System Engineer [J]. 2006, 18(09): 2484~2562.

Google Scholar

[5] Gao Huimin, Zeng Jianchao. Interllegent scheduling theory and application in steel industries [M]. Metallurgical Industry press. 2006: 10.

Google Scholar

[6] Sun Ling, Li Tie-ke. Constraint satisfaction algorithm of batch planning for steel making-continuous casting-hot rolling [J]. Computer Integrated Manufacturing Systems, 2007, 13(5): 110~114.

Google Scholar

[7] ZhaoJun, Wang Wei, Pan Xuedong. Parallel particle swarm algorithm and its application in hot rolling planning [J]. Computer Integrated Manufacturing Systems, 2007, 13(4): 698-703.

Google Scholar

[8] Liu Shi-xin, Song Jian-hai. Model and algorithm for solving hot strip rolling batch planning problems [J]. Control Theory & Applications, 2007, 24(2): 243-248.

Google Scholar