Solve the optimum steelmaking charge plan with unknown charge number using improved DPSO

Iron and Steel industrial is an essential and sizable sector for industrialized economies. This paper presents a mathematical charge plan model of the steelmaking scheduling. Because of the difficulty to solve the problem directly, a pseudo travel salesman problem model is presented to describe the scheduling plan. 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 discrete particle swarm optimization with inver over operator (IDPSO) is presented. Parameter selection of the algorithm is detailed discussed. Simulations have been carried and the results show that the improved DPSO algorithm is very efficient, 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.