Author： Jia S.J.
Publisher： Taylor & Francis Ltd
ISSN： 0020-7543
Source： International Journal of Production Research, Vol.51, Iss.3, 2013-02, pp. : 667-681
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
The hot rolling batch scheduling problem is a hard problem in the steel industry. In this paper, the problem is formulated as a multi-objective prize collecting vehicle routing problem (PCVRP) model. In order to avoid the selection of weight coefficients encountered in single objective optimisation, a multi-objective optimisation algorithm based on Pareto-dominance is used to solve this model. Firstly, the Pareto ℳ-ℳ Ant System (P-ℳℳAS), which is a brand new multi-objective ant colony optimisation algorithm, is proposed to minimise the penalties caused by jumps between adjacent slabs, and simultaneously maximise the prizes collected. Then a multi-objective decision-making approach based on TOPSIS is used to select a final rolling batch from the Pareto-optimal solutions provided by P-ℳℳAS. The experimental results using practical production data from Shanghai Baoshan Iron & Steel Co., Ltd. have indicated that the proposed model and algorithm are effective and efficient.
Access to resources
Recommend
