| 基于变邻域搜索的热轧圆钢批量调度多目标优化方法 |
| |
| 引用本文： | 柏亮, 李铁克, 王柏琳, 许绍云, 董广静. 基于变邻域搜索的热轧圆钢批量调度多目标优化方法[J]. 工程科学学报, 2015, 37(1): 111-117. DOI: 10.13374/j.issn2095-9389.2015.01.017 |
| |
| 作者姓名： | 柏亮 李铁克 王柏琳 许绍云 董广静 |
| |
| 作者单位： | 1. 北京科技大学东凌经济管理学院, 北京 100083; |
| |
| 基金项目： | 国家自然科学基金;中央高校基本科研业务费专项 |
| |
| 摘 要： | 针对热轧圆钢的批量调度问题,考虑实际生产中工艺规程和交货期对轧制单元连续加工的影响,建立了以最小化设备调整时间、拖期生产惩罚和钢种跳跃惩罚为优化目标的数学模型,并设计了一种嵌入EDD规则的变邻域搜索算法.算法首先结合模型的约束特征,采用约束满足技术生成初始解;根据实际生产需求,将最小化设备调整时间作为主要目标,设计变邻域搜索算法实现目标优化,其中,运用混合算子构造邻域结构和局部搜索,并引入模拟退火接受准则来控制迭代过程中产生的新解;同时,为了最小化拖期惩罚和钢种跳跃惩罚,在求解过程中嵌入了EDD规则以及钢种排序规则.实验结果表明,模型和算法是可行且有效的.
|
| 关 键 词： | 热轧 调度 变邻域搜索 多目标优化 约束满足问题 |
| 收稿时间： | 2013-11-26 |
Variable neighborhood search based multi-objective optimization method for batch scheduling of hot-rolled bars |
| |
| BO Liang, LI Tie-ke, WANG Bo-lin, XU Shao-yun, DONG Guang-jing. Variable neighborhood search based multi-objective optimization method for batch scheduling of hot-rolled bars[J]. Chinese Journal of Engineering, 2015, 37(1): 111-117. DOI: 10.13374/j.issn2095-9389.2015.01.017 |
| |
| Authors: | BO Liang LI Tie-ke WANG Bo-lin XU Shao-yun DONG Guang-jing |
| |
| Affiliation: | 1. Donlinks School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China;2. Engineering Research Center of MES Technology for Iron & Steel Production(the Ministry of Education), Beijing 100083 |
| |
| Abstract: | A batch scheduling problem of hot-rolled bars was discussed according to the influences of process conditions and due date on the continuous production of rolling units. A mathematical model with three objectives to minimize the setup time, tardiness penalty and steel grade bounce penalty was constructed, and a method of the variable neighborhood search algorithm embedding the earliest due date first (EDD) rule was proposed to solve the model. In consideration of constraints in the model, an initial solution was generated by constraint satisfaction technology. Then, to meet the actual production needs, a variable neighborhood search method was designed to minimize the setup time, which is considered as a primary objective. In this algorithm, a hybrid operator is applied in sha-king and local search, and the idea of simulated annealing is introduced to take control of the acceptance of new solutions. Meanwhile, in order to minimize the tardiness penalty and the steel grade bounce penalty, the earliest due date first rule and the steel grade sorting rule are applied. Experiment results show that the model and the algorithm are feasible and effective. |
| |
| Keywords: | hot rolling scheduling variable neighborhood search multi-objective optimization constraint satisfaction problems |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《工程科学学报》浏览原始摘要信息 |
|
点击此处可从《工程科学学报》下载免费的PDF全文 |
|
