.png){kind=icon}
返回
A multi-objective optimisation algorithm for the hot rolling batch scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2011.654138.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 M????MI?? Ant System (P-MMAS), 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-MMAS. 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.
Keyword:
ant colony optimisation
Pareto optimisation
hot rolling batch scheduling
multi-objective optimisation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏Pareto ant colony optimization: A metaheuristic approach to multiobjective portfolio selection帕累托蚁群优化: 多目标投资组合选择的元启发式方法
PREAI
分享收藏
查看更多内容