By Topic

Optimum Steelmaking Charge Plan with Unknown Charge Number Based on the Pseudo TSP Model

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

3 Author(s)
Yuncan Xue ; Coll. of Comput. & Inf. Eng., Hohai Univ., Changzhou ; Qiwen Yang ; Haibin Zhao

This paper presents a mathematical charge plan model of steelmaking-continuous casting (SCC) scheduling in the computer integrated manufacturing systems environment. Based on the analysis of the difficulty to solve the scheduling problem, a pseudo travel salesman problem model is presented to describe the scheduling model. By using this method, we can solve the optimum charge problem even without known the charge number, while other methods must know the charge number previously. To solve the problem, an improved particle swarm optimization with variant moving direction of the particle in every dimension is presented. The effect of the mutation rate is also discussed. Simulations have been carried and the results show that the pseudo travel salesman problem is very fit for describe the model. The computation with practical data shows that the model and the solving method are very effective

Published in:

Decision and Control, 2006 45th IEEE Conference on

Date of Conference:

13-15 Dec. 2006