Optimum hot rolling plan with modified discrete particle swarm optimization

The iron and steel industry is an essential and sizable sector for industrialized economies. This paper presents a mathematical model of steelmaking hot rolling plan. Because of the difficulty to solve the model directly, a pseudo traveling salesman problem model (TSP) is presented to describe the scheduling model. Using this method, we can solve the optimum rolling problem even without knowing the unit number, while other methods must know the unit 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 out and the results show that the IDPSO algorithm is very efficient, the pseudo TSP is very fit to describe the model. The computation with practical data shows that the model and the solving method are very effective.