Double-Layer and Multi-objective Constraint Optimization Model for Transportation Scheduling of Molten Iron

被引：0
|
作者：
Ma L. [1 ,2 ]
Hu C. [3 ]
Jin F. [3 ]
Dong W. [4 ]
机构：
[1] School of Information Science and Technology, Southwest Jiaotong University, Chengdu
[2] The Center of National Railway Intelligent Transportation System Engineering and Technology, Beijing
[3] Institute of Computing Technologies, China Academy of Railway Sciences Corporation Limited, Beijing
[4] The Transportation Department of Maanshan Iron and Steel Co., Ltd., Maanshan
来源：
Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University | 2023年 / 58卷 / 02期
关键词：
constraint optimization; lexicographic multi-objective; molten iron transportation; operation scheduling; search algorithm;
D O I：
10.3969/j.issn.0258-2724.20220008
中图分类号：
学科分类号：
摘要：
In order to realize the collaborative optimization of operation scheduling and resource allocation in molten iron transportation, based on the theory of the cumulative scheduling with constraint programming and lexicographic multi-objective optimization, a double-layer and multi-objective constraint optimization method is explored for the transportation scheduling of molten iron. Firstly, setting the highest turnover rate of molten iron tanks and the highest operation efficiency as two lexicographic objectives, the upper-level constraint optimization model is built for molten iron transportation operation. In the model, the constraints are involved, such as operation sequence, operation implementation logic, time limit of molten iron cooling, limited operation times of molten iron tank, resource capacity limit, and resource pool of the molten iron tanks. Secondly, with the highest resource utilization balance, the lower-level constrained optimization model is established for resource allocation in molten iron transportation, in which the uniqueness of operation implementation and resource capacity are taken as constraints. Finally, the hybrid algorithm of constraint propagation and multi-point constructive search is developed to solve the whole model iteratively. The case study shows that, the turnover rate target and transportation efficiency target obtained by the hybrid algorithm are 14.29% and 60.53% higher than those obtained by the basic depth first backtracking algorithm respectively. Compared with weighted and single objective models, lexicographical multi-objective model improves the efficiency and quality of solution by 20.3% and 11.11%, respectively. © 2023 Science Press. All rights reserved.
引用
收藏
页码：357 / 366and397
相关论文
共 15 条
  • [11] ROSSI F, VAN BEEK P, WALSH T., Handbook of constraint programming, (2006)
  • [12] MA Liang, GUO Jin, CHEN Guangwei, Constraint propagation and heuristics backtracking algorithm for static wagon-flow allocation at a marshalling station, Journal of Southwest Jiaotong University, 49, 6, pp. 1116-1122, (2014)
  • [13] OJHA A K, BISWAL K K., Lexicographic multi-objective geometric programming problems[J], International Journal of Computer Science Issues, 6, 2, pp. 20-24, (2009)
  • [14] BECK J C., Solution-guided multi-point constructive search for job shop scheduling[J], Journal of Artificial Intelligence Research, 29, pp. 49-77, (2007)
  • [15] MA Liang, GUO Jin, CHEN Guangwei, Et al., Hybrid algorithm of constraint propagation and multi-point constructive search for the dynamic wagon-flow allocation problem at a railway marshalling station, Information and Control, 44, 2, pp. 230-237, (2015)
12