By Topic

A genetic algorithm approach to hot strip mill rolling scheduling problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hsiao-Lan Fang ; E&C Dept., China Steel Corp., Kaohsiung, Taiwan ; Chung-Hsiu Tsai

The operation of hot strip mill rolling scheduling (HSMRS) at China Steel Corporation (CSC), Taiwan is an extremely difficult and time consuming process due to the complexity of the problem. The paper explores how this problem can be solved through the use of a genetic algorithm. One of the key aspects of this approach is the use of specially designed representations for such scheduling problems. The representations explicitly encode a schedule by encoding information for building cycles. We have found that this representation cooperates with a stochastic violation directed mutation operator and suitable fitness function and can quickly produce results comparable to human scheduling. The efficient and flexible GA approach presented is potentially widely useful in other similar rolling cycle scheduling applications in large steel companies

Published in:

Tools with Artificial Intelligence, 1998. Proceedings. Tenth IEEE International Conference on

Date of Conference:

10-12 Nov 1998