.png){kind=icon}
Return
A Reinforcement Learning Based Large-Scale Refinery Production Scheduling Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TASE.2023.3321612.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Refinery production scheduling is a mixed-integer programming problem, which exists the issue of combinational explosion. Thus, solving a large-scale refinery production scheduling problem is time-consuming. This article proposes an approximate solution framework based on reinforcement learning (RL) for large-scale long-time refinery production scheduling problems to rapidly obtain a satisfactory solution. In the proposed algorithm, the Proximal Policy Optimization algorithm is used to process the continuous action. To address the cold start issue of RL in refinery scheduling problem, we present an initialization method for the actor of agent, which utilizes the operation knowledge of tractable small-scale problems to initialize the actor network, and the agent is trained in the environment of large-scale problems. Hence, the convergence of the RL algorithm is greatly accelerated. In addition, the product flowrate concept is used to express the state, making the scheduling agent scalable in terms of scheduling horizon. Experimental studies show, to large-scale refinery scheduling problems, the proposed algorithm can obtain better solutions than that of the CPLEX solver and the existing evolutionary algorithm in a much shorter solving time of the two methods.
Keywords:
Production
Job shop scheduling
Mathematical models
Oils
Reinforcement learning
Optimization
Petroleum
Large-scale optimization
reinforcement learning
refinery
scheduling
Journal
IF:
6.4
Papers:
5.2K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more