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

Yuncan Xue, Qiwen Yang, Haibin Zhao
2006 Proceedings of the 45th IEEE Conference on Decision and Control  
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
more » ... sly. To solve the problem, an improved discrete particle swarm optimization (DPSO) is presented. A new crossover probability is introduced into the DPSO algorithm, which is differed to that of the GA.. 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.
doi:10.1109/cdc.2006.377276 dblp:conf/cdc/XueYZ06 fatcat:vhhjwhoubjaoxkpazo66ocnpza