A robust optimization approach for steeling-continuous casting charge batch planning with uncertain slab weight

被引:1
作者
Li, Congxin [1 ]
Sun, Liangliang [1 ,2 ]
机构
[1] Shenyang Jianzhu Univ, Sch Mech Engn, Shenyang 110168, Peoples R China
[2] Northeastern Univ Qinghuangdao, Sch Control Engn, Qinhuangdao 066004, Peoples R China
基金
中国国家自然科学基金;
关键词
Charge batch planning; Robust optimization; Surrogate lagrangian relaxation; Improved objective feasibility pump; 0-1 mixed integer programming; LAGRANGIAN-RELAXATION; STEELMAKING; ALGORITHM; DECOMPOSITION; CONVERGENCE; SEARCH;
D O I
10.1016/j.jprocont.2024.103338
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The volatility of slab weight in steelmaking-continuous casting (SCC) production, attributed to factors such as flexible order demand, is addressed in this paper. A robust optimization mathematical model for charge batch planning (CBP) with uncertain slab weight is established, and a collaborative optimization method using the surrogate Lagrangian relaxation (SLR) framework and improved objective feasibility pump (IOFP) is developed to solve the problem. In the SLR method, new step-size updating conditions are developed, eliminating the need for pre-estimating the optimal dual value. Additionally, only a subset of subproblems that satisfy the optimality conditions of the surrogate needs to be solved to overcome the low optimization efficiency resulting from oscillations in the feasible domain during internal searches in traditional Lagrangian relaxation (LR) methods. The IOFP method is employed to match the structure of the subproblem model of 0-1 mixed integer programming (MIP). During the search for integer solutions, a weighted objective function is added to the auxiliary model to improve the quality of solutions. Furthermore, it combines a variable neighborhood branching method to prevent the algorithm from entering into cycles. Finally, the effectiveness of the proposed model and the performance of the algorithm are validated through simulation experiments.
引用
收藏
页数:16
相关论文
共 54 条
[1]   Improving the feasibility pump [J].
Achterberg, Tobias ;
Berthold, Timo .
DISCRETE OPTIMIZATION, 2007, 4 (01) :77-86
[2]  
[Anonymous], 2010, Electron. Notes Discret. Math.
[3]   Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem [J].
Assuncao, Lucas ;
Mateus, Geraldo Robson .
COMPUTERS & OPERATIONS RESEARCH, 2021, 128
[4]   Production planning with flexible product specifications: An application to specialty steel manufacturing [J].
Balakrishnan, A ;
Geunes, J .
OPERATIONS RESEARCH, 2003, 51 (01) :94-112
[5]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[6]   Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities [J].
Bragin, Mikhail A. .
ANNALS OF OPERATIONS RESEARCH, 2024, 333 (01) :29-45
[7]   A Scalable Solution Methodology for Mixed-Integer Linear Programming Problems Arising in Automation [J].
Bragin, Mikhail A. ;
Luh, Peter B. ;
Yan, Bing ;
Sun, Xiaorong .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2019, 16 (02) :531-541
[8]   Convergence of the Surrogate Lagrangian Relaxation Method [J].
Bragin, Mikhail A. ;
Luh, Peter B. ;
Yan, Joseph H. ;
Yu, Nanpeng ;
Stern, Gary A. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2015, 164 (01) :173-201
[9]   A knapsack problem as a tool to solve the production planning problem in small foundries [J].
Camargo, Victor C. B. ;
Mattiolli, Leandro ;
Toledo, Franklina M. B. .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) :86-92
[10]   On the integrated charge planning with flexible jobs in primary steelmaking processes [J].
Dong, Hongyu ;
Huang, Min ;
Ip, W. H. ;
Wang, Xingwei .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (21) :6499-6535