Novel Optimization Model and Efficient Solution Method for Integrating Dynamic Optimization with Process Operations of Continuous Manufacturing Processes

被引:20
|
作者
Shi, Hanyu [1 ]
Chu, Yunfei [1 ]
You, Fengqi [1 ]
机构
[1] Northwestern Univ, Dept Chem & Biol Engn, Evanston, IL 60208 USA
关键词
GENERALIZED BENDERS DECOMPOSITION; BATCH PROCESSES; FEEDBACK-CONTROL; CONTINUOUS-TIME; UNCERTAINTY; FEEDFORWARD; FORMULATION; STRATEGIES;
D O I
10.1021/ie503857r
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
In this paper, we propose a novel mathematical model for the integrated optimization for production planning, scheduling, and dynamic optimization of continuous manufacturing processes. With a novel approach to estimate the inventory cost, the integrated problem is first formulated as a mixed-integer dynamic optimization (MIDO) problem, which is then reformulated into a large scale mixed-integer nonlinear program (MINLP). By using metamodeling to characterize the detailed linking information between different decision layers, we develop an efficient solution method to decompose the integrated MINLP into a mixed-integer linear program (MILP) for an integrated planning and scheduling problem with flexible recipes, and a set of dynamic optimization problems for generating metamodels. We further apply a bilevel decomposition algorithm to improve the computational efficiency of solving the integrated planning and scheduling problem with flexible recipes. The proposed models and algorithms are demonstrated through case studies of methyl methacrylate (MMA) polymerization processes. The results show that the proposed methods reduce the computational time by more than 2 orders of magnitude compared with the approach of solving the entire integrated optimization problem directly.
引用
收藏
页码:2167 / 2187
页数:21
相关论文
共 50 条
  • [21] Integrated Planning, Scheduling, and Dynamic Optimization for Continuous Processes
    Shi, Hanyu
    Chu, Yunfei
    You, Fengqi
    2014 IEEE 53RD ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2014, : 388 - 393
  • [22] COST OPTIMIZATION OF PVC ENTERPRISE BASED ON PROCESS MANUFACTURING OPTIMIZATION MODEL
    Xu, Rui-Yuan
    Shi, Hong-Fa
    Zhou, Shu-Gong
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 2513 - +
  • [23] An Intelligent Process Model for Manufacturing System Optimization
    Hoe, Ho Kok
    Muthusamy, Kanesan
    Kanthen, Harikrishnan
    MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-8, 2012, 383-390 : 6674 - +
  • [24] A stochastic method for discrete and continuous optimization in manufacturing systems
    ALEXANDRE DOLGUI
    DMITRY OFITSEROV
    Journal of Intelligent Manufacturing, 1997, 8 : 405 - 413
  • [25] A stochastic method for discrete and continuous optimization in manufacturing systems
    Dolgui, A
    Ofitserov, D
    JOURNAL OF INTELLIGENT MANUFACTURING, 1997, 8 (05) : 405 - 413
  • [26] Manufacturing for design: A novel interconnect optimization method
    Zhang, Hongbo
    Deng, Liang
    Chao, Kai-Yuan
    Wong, Martin D. F.
    DESIGN FOR MANUFACTURABILITY THROUGH DESIGN-PROCESS INTEGRATION II, 2008, 6925
  • [27] Continuous optimization using a dynamic simplex method
    Xiong, Q
    Jutan, A
    CHEMICAL ENGINEERING SCIENCE, 2003, 58 (16) : 3817 - 3828
  • [28] Efficient Bayesian Function Optimization of Evolving Material Manufacturing Processes
    Leal, David Rubin de Celis
    Nguyen, Dang
    Vellanki, Pratibha
    Li, Cheng
    Rana, Santu
    Thompson, Nathan
    Gupta, Sunil
    Pringle, Keiran
    Subianto, Surya
    Venkatesh, Svetha
    Slezak, Teo
    Height, Murray
    Sutti, Alessandra
    ACS OMEGA, 2019, 4 (24): : 20571 - 20578
  • [29] Initial guess of the solution of dynamic optimization of chemical processes
    L. Bayón
    J. M. Grau
    M. M. Ruiz
    P. M. Suárez
    Journal of Mathematical Chemistry, 2010, 48 : 28 - 37
  • [30] Initial guess of the solution of dynamic optimization of chemical processes
    Bayon, L.
    Grau, J. M.
    Ruiz, M. M.
    Suarez, P. M.
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2010, 48 (01) : 28 - 37