PSO algorithm for hot-milling batch planning problem based on PCVRP

This paper formulates the hot-milling batch planning problem as a prize collecting vehicle routing problem(PCVRP).According to the hot-milling technics rules,this paper considers the inverse bounce of the width and the thickness of the steel strips and presents a multi-objective mathematics programming model.The objectives include minimizing the number of hot-milling plans,minimizing the total penalties,and minimizing the number of slabs without being milled.To solve this problem,an improved particle swarm optimization(PSO) algorithm is presented.This paper also analyzes the effect of parameter settings on the swarm convergence for the hot strip mill batch planning problem.The computational results with the best parameters show that both the solution obtained by this algorithm and the average used time are effective.