Integrated Scheduling and Dynamic Optimization of Sequential Batch Processes with Online Implementation

An efficient decomposition method to solve the integrated problem of scheduling and dynamic optimization for sequential batch processes is proposed. The integrated problem is formulated as a mixed‐integer dynamic optimization problem or a large‐scale mixed‐integer nonlinear programming (MINLP) problem by discretizing the dynamic models. To reduce the computational complexity, we first decompose all dynamic models from the integrated problem, which is then approximated by a scheduling problem based on the flexible recipe. The recipe candidates are expressed by Pareto frontiers, which are determined offline by using multiobjective dynamic optimization to minimize the processing cost and processing time. The operational recipe is then optimized simultaneously with the scheduling decisions online. Because the dynamic models are encapsulated by the Pareto frontiers, the online problem is a mixed‐integer programming problem which is much more computationally efficient than the original MINLP problem, and allows the online implementation to deal with uncertainties. © 2013 American Institute of Chemical Engineers AIChE J, 59: 2379–2406, 2013     

Moving horizon approach of integrating scheduling and control for sequential batch processes

Online integration of scheduling and control is crucial to cope with process uncertainties. We propose a new online integrated method for sequential batch processes, where the integrated problem is solved to determine controller references rather than process inputs. Under a two‐level feedback loop structure, the integrated problem is solved in a frequency lower than that of the control loops. To achieve the goal of computational efficiency and rescheduling stability, a moving horizon approach is developed. A reduced integrated problem in a resolving horizon is formulated, which can be solved efficiently online. Solving the reduced problem only changes a small part of the initial solution, guaranteeing rescheduling stability. The integrated method is demonstrated in a simulated case study. Under uncertainties of the control system disruption and the processing unit breakdown, the integrated method prevents a large loss in the production profit compared with the simple shifted rescheduling solution. © 2014 American Institute of Chemical Engineers AIChE J, 60: 1654–1671, 2014     

Sensor network design for maximizing process efficiency: An algorithm and its application

Sensor network design (SND) is a constrained optimization problem requiring systematic and effective solution algorithms for determining where best to locate sensors. A SND algorithm is developed for maximizing plant efficiency for an estimator‐based control system while simultaneously satisfying accuracy requirements for the desired process measurements. The SND problem formulation leads to a mixed integer nonlinear programming (MINLP) optimization that is difficult to solve for large‐scale system applications. Therefore, a sequential approach is developed to solve the MINLP problem, where the integer problem for sensor selection is solved using the genetic algorithm while the nonlinear programming problem including convergence of the “tear stream” in the estimator‐based control system is solved using the direct substitution method. The SND algorithm is then successfully applied to a large scale, highly integrated chemical process. © 2014 American Institute of Chemical Engineers AIChE J, 61: 464–476, 2015     

A computational framework and solution algorithms for two‐stage adaptive robust scheduling of batch manufacturing processes under uncertainty

A novel two‐stage adaptive robust optimization (ARO) approach to production scheduling of batch processes under uncertainty is proposed. We first reformulate the deterministic mixed‐integer linear programming model of batch scheduling into a two‐stage optimization problem. Symmetric uncertainty sets are then introduced to confine the uncertain parameters, and budgets of uncertainty are used to adjust the degree of conservatism. We then apply both the Benders decomposition algorithm and the column‐and‐constraint generation (C&CG) algorithm to efficiently solve the resulting two‐stage ARO problem, which cannot be tackled directly by any existing optimization solvers. Two case studies are considered to demonstrate the applicability of the proposed modeling framework and solution algorithms. The results show that the C&CG algorithm is more computationally efficient than the Benders decomposition algorithm, and the proposed two‐stage ARO approach returns 9% higher profits than the conventional robust optimization approach for batch scheduling. © 2015 American Institute of Chemical Engineers AIChE J, 62: 687–703, 2016     

Integrated scheduling and dynamic optimization of batch processes using state equipment networks

A systematic framework for the integration of short‐term scheduling and dynamic optimization (DO) of batch processes is described. The state equipment network (SEN) is used to represent a process system, where it decomposes the process into two basic kinds of entities: process materials and process units. Mathematical modeling based on the SEN framework invokes both logical disjunctions and operational dynamics; thus the integrated formulation leads to a mixed‐logic dynamic optimization (MLDO) problem. The integrated approach seeks to benefit the overall process performance by incorporating process dynamics into scheduling considerations. The solution procedure of an MLDO problem is also addressed in this article, where MLDO problems are translated into mixed‐integer nonlinear programs using the Big M reformulation and the simultaneous collocation method. Finally, through two case studies, we show advantages of the integrated approach over the conventional recipe‐based scheduling method. © 2012 American Institute of Chemical Engineers AIChE J, 2012     

基于矩阵编码的遗传算法多杂质间歇用水网络优化

针对多杂质间歇用水网络优化设计问题,建立了以新鲜水用量最小为目标的混合整数非线性规划(MINLP)模型,并提出基于矩阵编码的遗传算法和信赖域序列二次规划(trust region sequential quadratic programming,TRSQP)法相结合的求解策略。本文采用矩阵编码方法为时间条件约束提供了方便,从而使用水单元之间水回用关系更加清晰明确;采用基于矩阵编码的遗传算法对整数变量进行优化,采用TRSQP法对连续变量进行优化,集成应用两种方法进行优化求解,从而获得MINLP模型的最优解;并借助MATLAB软件进行编程并实现。利用本文所提出的求解方法和策略对文献中2个典型案例进行求解,求解结果均优于文献数据。实例计算表明,本文所提求解方法是可行的。     

Integration of scheduling and control with online closed-loop implementation: Fast computational strategy and large-scale global optimization algorithm

In this paper, we propose a novel integration method to solve the scheduling problem and the control problem simultaneously. The integrated problem is formulated as a mixed-integer dynamic optimization (MIDO) problem which contains discrete variables in the scheduling problem and constraints of differential equations from the control problem. Because online implementation is crucial to deal with uncertainties and disturbances in operation and control of the production system, we develop a fast computational strategy to solve the integration problem efficiently and allow its online applications. In the proposed integration framework, we first generate a set of controller candidates offline for each possible transition, and then reformulate the integration problem as a simultaneous scheduling and controller selection problem. This is a mixed-integer nonlinear fractional programming problem with a non-convex nonlinear objective function and linear constraints. To solve the resulting large-scale problem within sufficiently short computational time for online implementation, we propose a global optimization method based on the model properties and the Dinkelbach's algorithm. The advantage of the proposed method is demonstrated through four case studies on an MMA polymer manufacturing process. The results show that the proposed integration framework achieves a lower cost rate than the conventional sequential method, because the proposed framework provides a better tradeoff between the conflicting factors in scheduling and control problems. Compared with the simultaneous approach based on the full discretization and reformulation of the MIDO problem, the proposed integration framework is computationally much more efficient, especially for large-scale cases. The proposed method addresses the challenges in the online implementation of the integrated scheduling and control decisions by globally optimizing the integrated problem in an efficient way. The results also show that the online solution is crucial to deal with the various uncertainties and disturbances in the production system.     

Energy optimization of water supply system scheduling: Novel MINLP model and efficient global optimization algorithm

This article is concerned with global optimization of water supply system scheduling with pump operations to minimize total energy cost. The scheduling problem is first formulated as a non‐convex mixed‐integer nonlinear programming (MINLP) problem, accounting for flow rates in pipes, operation profiles of pumps, water levels of tanks, and customer demand. Binary variables denote on–off switch operations for pumps and flow directions in pipes, and nonlinear terms originate from characteristic functions for pumps and hydraulic functions for pipes. The proposed MINLP model is verified with EPANET, which is a leading software package for water distribution system modeling. We further develop a novel global optimization algorithm for solving the non‐convex MINLP problem. To demonstrate the applicability of the proposed model and the efficiency of the tailored global optimization algorithm, we present results of two case studies with up to 4 tanks, 5 pumps, 5 check valves, and 21 pipes. © 2016 American Institute of Chemical Engineers AIChE J, 62: 4277–4296, 2016     

Fair profit allocation in supply chain optimization with transfer price and revenue sharing: MINLP model and algorithm for cellulosic biofuel supply chains

A mixed‐integer nonlinear programming (MINLP) formulation to simultaneously optimize operational decisions as well as profit allocation mechanisms in supply chain optimization, namely material transfer prices and revenue share policies among the supply chain participants is proposed. The case of cellulosic bioethanol supply chains is specifically considered and the game‐theory Nash bargaining solution approach is employed to achieve fair allocation of profit among the collection facilities, biorefineries, and distribution centers. The structural advantages of certain supply chain participants can be taken into account by specifying different values of the negotiation‐power indicators in the generalized Nash‐type objective function. A solution strategy based on a logarithm transformation and a branch‐and‐refine algorithm for efficient global optimization of the resulting nonconvex MINLP problem is proposed. To demonstrate the application of the proposed framework, an illustrative example and a state‐wide county‐level case study on the optimization of a potential cellulosic bioethanol supply chain in Illinois are presented. © 2014 American Institute of Chemical Engineers AIChE J, 60: 3211–3229, 2014     

Global optimization of large‐scale mixed‐integer linear fractional programming problems: A reformulation‐linearization method and process scheduling applications

Mixed‐integer linear fractional program (MILFP) is a class of mixed‐integer nonlinear programs (MINLP) where the objective function is the ratio of two linear functions and all constraints are linear. Global optimization of large‐scale MILFPs can be computationally intractable due to the presence of discrete variables and the pseudoconvex/pseudoconcave objective function. We propose a novel and efficient reformulation–linearization method, which integrates Charnes–Cooper transformation and Glover's linearization scheme, to transform general MILFPs into their equivalent mixed‐integer linear programs (MILP), allowing MILFPs to be globally optimized effectively with MILP methods. Extensive computational studies are performed to demonstrate the efficiency of this method. To illustrate its applications, we consider two batch scheduling problems, which are modeled as MILFPs based on the continuous‐time formulations. Computational results show that the proposed approach requires significantly shorter CPU times than various general‐purpose MINLP methods and shows similar performance than the tailored parametric algorithm for solving large‐scale MILFP problems. Specifically, it performs with respect to the CPU time roughly a half of the parametric algorithm for the scheduling applications. © 2013 American Institute of Chemical Engineers AIChE J, 59: 4255–4272, 2013     

Data‐driven adaptive nested robust optimization: General modeling framework and efficient computational algorithm for decision making under uncertainty

A novel data‐driven adaptive robust optimization framework that leverages big data in process industries is proposed. A Bayesian nonparametric model—the Dirichlet process mixture model—is adopted and combined with a variational inference algorithm to extract the information embedded within uncertainty data. Further a data‐driven approach for defining uncertainty set is proposed. This machine‐learning model is seamlessly integrated with adaptive robust optimization approach through a novel four‐level optimization framework. This framework explicitly accounts for the correlation, asymmetry and multimode of uncertainty data, so it generates less conservative solutions. Additionally, the proposed framework is robust not only to parameter variations, but also to anomalous measurements. Because the resulting multilevel optimization problem cannot be solved directly by any off‐the‐shelf solvers, an efficient column‐and‐constraint generation algorithm is proposed to address the computational challenge. Two industrial applications on batch process scheduling and on process network planning are presented to demonstrate the advantages of the proposed modeling framework and effectiveness of the solution algorithm. © 2017 American Institute of Chemical Engineers AIChE J, 63: 3790–3817, 2017     

A new superstructure optimization paradigm for process synthesis with product distribution optimization: Application to an integrated shale gas processing and chemical manufacturing process

We propose a novel process synthesis framework that combines product distribution optimization of chemical reactions and superstructure optimization of the process flowsheet. A superstructure with a set of technology/process alternatives is first developed. Next, the product distributions of the involved chemical reactions are optimized to maximize the profits of the effluent products. Extensive process simulations are then performed to collect high‐fidelity process data tailored to the optimal product distributions. Based on the simulation results, a superstructure optimization model is formulated as a mixed‐integer nonlinear program (MINLP) to determine the optimal process design. A tailored global optimization algorithm is used to efficiently solve the large‐scale nonconvex MINLP problem. The resulting optimal process design is further validated by a whole‐process simulation. The proposed framework is applied to a comprehensive superstructure of an integrated shale gas processing and chemical manufacturing process, which involves steam cracking of ethane, propane, n‐butane, and i‐butane. © 2017 American Institute of Chemical Engineers AIChE J, 63: 123–143, 2018     

Multiobjective evolutionary optimization of batch process scheduling under environmental and economic concerns

The simultaneous consideration of economic and environmental objectives in batch production scheduling is today a subject of major concern. However, it constitutes a complex problem whose solution necessarily entails production trade‐offs. Unfortunately, a rigorous multiobjective optimization approach to solve this kind of problem often implies high computational effort and time, which seriously undermine its applicability to day‐to‐day operation in industrial practice. Hence, this work presents a hybrid optimization strategy based on rigorous local search and genetic algorithm to efficiently deal with industrial scale batch scheduling problems. Thus, a deeper insight into the combined environmental and economic issues when considering the trade‐offs of adopting a particular schedule is provided. The proposed methodology is applied to a case study concerning a multiproduct acrylic fiber production plant, where product changeovers influence the problem results. The proposed strategy stands for a marked improvement in effectively incorporating multiobjective optimization in short‐term plant operation. © 2012 American Institute of Chemical Engineers AIChE J, 59: 429–444, 2013     

基于P-graph的乙烯裂解原料调度建模与优化

乙烯工业不同的裂解装置间存在着设备、技术上的差别，每一种原料在乙烯工厂不同炉型或工艺的裂解装置的乙烯产品收率、能耗也存在着差别。随着新的乙烯工厂的投产，需要同时运行台数众多的差异化裂解装置，从而为通过优化调度乙烯裂解原料实现提高物效、降低能耗提供了空间。对于此类工厂间原料调度及能耗优化问题提出了一种基于P-graph的建模和优化方法(scheduling generation based on P-graph, SGBP算法)，该算法通过P-graph本身提取过程结构信息的能力，在加速求解的同时，保留了次优解集。之后以两个实际的乙烯厂为研究实例，采用提出的SGBP方法实现了原料调度的建模和优化，该方法与MINLP优化算法的对比分析验证了提出方法的优势：(1)可以同时提供较为丰富的最优解与次优解方案；(2)提出方法的最优结果与MINLP的优化效果相当；(3)优化后的整体能耗下降明显，为生产计划人员选择可采用灵活的原料调配方案提供了多种可选择的运行方案。     

Operational strategy and planning for raw natural gas refining complexes: Process modeling and global optimization

Optimal operational strategy and planning of a raw natural gas refining complex (RNGRC) is very challenging since it involves highly nonlinear processes, complex thermodynamics, blending, and utility systems. In this article, we first propose a superstructure integrating a utility system for the RNGRC, involving multiple gas feedstocks, and different product specifications. Then, we develop a large‐scale nonconvex mixed‐integer nonlinear programming (MINLP) optimization model. The model incorporates rigorous process models for input and output relations based on fundamentals of thermodynamics and unit operations and accurate models for utility systems. To reduce the noncovex items in the proposed MINLP model, equivalent reformulation techniques are introduced. Finally, the reformulated nonconvex MINLP model is solved to global optimality using state of the art deterministic global optimization approaches. The computational results demonstrate that a significant profit increase is achieved using the proposed approach compared to that from the real operation. © 2016 American Institute of Chemical Engineers AIChE J, 63: 652–668, 2017     

多因素不确定条件下的间歇生产调度优化

不确定条件下的间歇生产调度优化是生产调度问题研究中具有挑战性的课题。提出了一种基于混合整数线性规划(MILP)的鲁棒优化模型,来优化不确定条件下的生产调度决策。考虑到生产过程中的操作成本和原料成本,建立了以净利润最大为调度目标的确定性数学模型。然后考虑需求、处理时间、市场价格三种不确定因素,建立可调整保守程度的鲁棒优化模型并转换成鲁棒对应模型。实例结果表明,鲁棒优化的间歇生产调度模型较确定性模型利润减少,但生产任务数量增加,设备空闲时间缩短,从而增强了调度方案的可靠性,实现了不确定条件下生产操作性和经济性的综合优化。     

A decomposition algorithm for simultaneous scheduling and control of CSP systems

We present a decomposition algorithm to perform simultaneous scheduling and control decisions in concentrated solar power (CSP) systems. Our algorithm is motivated by the need to determine optimal market participation strategies at multiple timescales. The decomposition scheme uses physical insights to create surrogate linear models that are embedded within a mixed‐integer linear scheduling layer to perform discrete (operational mode) decisions. The schedules are then validated for physical feasibility in a dynamic optimization layer that uses a continuous full‐resolution CSP model. The dynamic optimization layer updates the physical variables of the surrogate models to refine schedules. We demonstrate that performing this procedure recursively provides high‐quality solutions of the simultaneous scheduling and control problem. We exploit these capabilities to analyze different market participation strategies and to explore the influence of key design variables on revenue. Our results also indicate that using scheduling algorithms that neglect detailed dynamics significantly decreases market revenues. © 2018 American Institute of Chemical Engineers AIChE J, 64: 2408–2417, 2018     

Continuous‐time modeling and global optimization approach for scheduling of crude oil operations

Scheduling of crude oil operations is a critical and complicated component of overall refinery operations, because crude oil costs account for about 80% of the refinery turnover. Moreover, blending with less expensive crudes can significantly increase profit margins. The mathematical modeling of blending different crudes in storage tanks results in many bilinear terms, which transforms the problem into a challenging, nonconvex, and mixed‐integer nonlinear programming (MINLP) optimization model. Two primary contributions have been made. First, the authors developed a novel unit‐specific event‐based continuous‐time MINLP formulation for this problem. Then they incorporated realistic operational features such as single buoy mooring (SBM), multiple jetties, multiparcel vessels, single‐parcel vessels, crude blending, brine settling, crude segregation, and multiple tanks feeding one crude distillation unit at one time and vice versa. In addition, 15 important volume‐based or weight‐based crude property indices are also considered. Second, they exploited recent advances in piecewise‐linear underestimation of bilinear terms within a branch‐and‐bound algorithm to globally optimize the MINLP problem. It is shown that the continuous‐time model results in substantially fewer bilinear terms. Several examples taken from the work of Li et al. are used to illustrate that (1) better solutions are obtained and (2) ε‐global optimality can be attained using the proposed branch‐and‐bound global optimization algorithm with piecewise‐linear underestimations of the bilinear terms. © 2011 American Institute of Chemical Engineers AIChE J, 2012     

考虑能耗影响的多产品间歇化工过程优化排序

提出一种用于间歇生产的多产品化工厂排序的多目标优化的混合整数非线性规划(MINLP)模型,其目标函数同时考虑了总生产时间最短和能耗最小的影响,定义了关于过程能耗的影响因子及决策因子,用以对总生产时间和能耗的影响进行权衡。采用改进的模拟退火算法(SA)对具有不同决策因子和能耗影响因子情况下的算例进行了求解,结果表明,该模型能够较好地反映能耗因素在多产品厂排序问题中的影响,使排序结果达到生产时间和能耗影响的综合最优。     

Global optimization for sustainable design and synthesis of algae processing network for CO2 mitigation and biofuel production using life cycle optimization

Global optimization for sustainable design and synthesis of a large‐scale algae processing network under economic and environmental criteria is addressed. An algae processing network superstructure including 7800 processing routes is proposed. Based on the superstructure, a multiobjective mixed‐integer nonlinear programming (MINLP) model is developed to simultaneously optimize the unit cost and the unit global warming potential (GWP). To efficiently solve the nonconvex MINLP model with separable concave terms and mixed‐integer fractional terms in the objective functions, a global optimization strategy that integrates a branch‐and‐refine algorithm based on successive piecewise linear approximations is proposed and an exact parametric algorithm based on Newton's method. Two Pareto‐optimal curves are obtained for biofuel production and biological carbon sequestration, respectively. The unit annual biofuel production cost ranges from $7.02/gasoline gallon equivalent (GGE) to $9.71/GGE, corresponding to unit GWP's of 26.491 to 16.52 kg CO₂‐eq/GGE, respectively. © 2014 American Institute of Chemical Engineers AIChE J, 60: 3195–3210, 2014