强化学习
调度(生产过程)
时间范围
计算机科学
盈利能力指数
数学优化
整数规划
灵活性(工程)
人工智能
工业工程
工程类
数学
算法
财务
经济
统计
作者
Christian D. Hubbs,Can Li,Nikolaos V. Sahinidis,Ignacio E. Grossmann,John M. Wassick
标识
DOI:10.1016/j.compchemeng.2020.106982
摘要
This work examines applying deep reinforcement learning to a chemical production scheduling process to account for uncertainty and achieve online, dynamic scheduling, and benchmarks the results with a mixed-integer linear programming (MILP) model that schedules each time interval on a receding horizon basis. An industrial example is used as a case study for comparing the differing approaches. Results show that the reinforcement learning method outperforms the naive MILP approaches and is competitive with a shrinking horizon MILP approach in terms of profitability, inventory levels, and customer service. The speed and flexibility of the reinforcement learning system is promising for achieving real-time optimization of a scheduling system, but there is reason to pursue integration of data-driven deep reinforcement learning methods and model-based mathematical optimization approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI