Graph-Encoded Imitation Learning for Optimization of Multi-Process Electric Load Shifting in the Steel Industry

Iron and steel production scenarios involve complex hierarchical relationships between processes, workshops, and production lines, as well as intricate process constraints. These factors lead to a large number of variables in the electric load shifting optimization (ELSO), making it challenging to solve efficiently using linear programming methods. Heuristic algorithms, while useful, often fail to ensure the feasibility of individuals within the population during the iterative process, which can result in solution instability. Moreover, traditional reinforcement learning methods, which require continuous interaction with the environment to optimize scheduling strategies, struggle to improve learning efficiency in this context. To address these challenges, this paper introduces expert-driven imitation learning (IL) into this problem. In addition, to capture the inherent characteristics of multi-process loads and the variations between them, we propose a multi-layer gated graph structure encoder, represented by nodes and undirected edges, to enhance the feature representation of the input loads. Finally, a multi-head attention (MHA) decoder is utilized to learn the scheduling strategies across multiple processes. Experimental results demonstrate that our proposed model converges more rapidly and exhibits greater solution stability for large-scale problems.

Institutions

Publication Details

Published
2025-05-17
DOI
https://doi.org/10.1109/yac66630.2025.11150134
Primary Topic
Education, Psychology, and Social Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph-Encoded Imitation Learning for Optimization of Multi-Process Electric Load Shifting in the Steel Industry

Education, Psychology, and Social Research
article

Graph-Encoded Imitation Learning for Optimization of Multi-Process Electric Load Shifting in the Steel Industry

article en

Abstract

Iron and steel production scenarios involve complex hierarchical relationships between processes, workshops, and production lines, as well as intricate process constraints. These factors lead to a large number of variables in the electric load shifting optimization (ELSO), making it challenging to solve efficiently using linear programming methods. Heuristic algorithms, while useful, often fail to ensure the feasibility of individuals within the population during the iterative process, which can result in solution instability. Moreover, traditional reinforcement learning methods, which require continuous interaction with the environment to optimize scheduling strategies, struggle to improve learning efficiency in this context. To address these challenges, this paper introduces expert-driven imitation learning (IL) into this problem. In addition, to capture the inherent characteristics of multi-process loads and the variations between them, we propose a multi-layer gated graph structure encoder, represented by nodes and undirected edges, to enhance the feature representation of the input loads. Finally, a multi-head attention (MHA) decoder is utilized to learn the scheduling strategies across multiple processes. Experimental results demonstrate that our proposed model converges more rapidly and exhibits greater solution stability for large-scale problems.

Dalian University of Technology (CN), Baosteel (China) (CN)
Decent work and economic growth
Openalex Percentile: Top 36%
Education, Psychology, and Social Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.