A MTSP Model for Hot Rolling Scheduling in Baosteel Complex
暂无分享,去创建一个
Abstract This article has investigated the hot rolling scheduling in the iron & steel plants. The task of a hot rolling scheduling is to determine a sequence of orders (bars or slabs) on hot rolling finishing mill. Unlike previously considered series strategy, we proposed the parallel strategy lo simultaneously produce M turns on same shift from global optimal viewpoint. Using this strategy, the model to hot rolling scheduling is developed as MTSP model and then this model is converted into single TSP model. A modi Tied genetic algorithm (MGA) is constructed to obtain near-optimal solutions to TSP. This procedure has been embedded in the practical hot rolling scheduling system by combining MTSP with man-machine interactive methods.
[1] R. Jonker,et al. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .
[2] Jan Karel Lenstra,et al. Some Simple Applications of the Travelling Salesman Problem , 1975 .
[3] Jeff R. Wright,et al. Discrete event sequencing as a Traveling Salesman Problem , 1992 .