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     

Proactive scheduling of batch processes by a combined robust optimization and multiparametric programming approach

We address short‐term batch process scheduling problems contaminated with uncertainty in the data. The mixed integer linear programming (MILP) scheduling model, based on the formulation of Ierapetritou and Floudas, Ind Eng Chem Res. 1998; 37(11):4341–4359, contains parameter dependencies at multiple locations, yielding a general multiparametric (mp) MILP problem. A proactive scheduling policy is obtained by solving the partially robust counterpart formulation. The counterpart model may remain a multiparametric problem, yet it is immunized against uncertainty in the entries of the constraint matrix and against all parameters whose values are not available at the time of decision making. We extend our previous work on the approximate solution of mp‐MILP problems by embedding different uncertainty sets (box, ellipsoidal and budget parameter regulated uncertainty), and by incorporating information about the availability of uncertain data in the construction of the partially robust scheduling model. For any parameter realization, the corresponding schedule is then obtained through function evaluation. © 2013 American Institute of Chemical Engineers AIChE J, 59: 4184–4211, 2013     

Optimal maintenance scheduling of a gas engine power plant using generalized disjunctive programming

A new continuous‐time model for long‐term scheduling of a gas engine power plant with parallel units is presented. Gas engines are shut down according to a regular maintenance plan that limits the number of hours spent online. To minimize salary expenditure with skilled labor, a single maintenance team is considered which is unavailable during certain periods of time. Other challenging constraints involve constant minimum and variable maximum power demands. The objective is to maximize the revenue from electricity sales assuming seasonal variations in electricity pricing by reducing idle times and shutdowns in high‐tariff periods. By first developing a generalized disjunctive programming model and then applying both big‐M and hull reformulation techniques, we reduce the burden of finding the appropriate set of mixed‐integer linear constraints. Through the solution of a real‐life problem, we show that the proposed formulations are very efficient computationally, while gaining valuable insights about the system. © 2014 American Institute of Chemical Engineers AIChE J, 60: 2083–2097, 2014     

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

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

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     

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     

Scheduling of crude oil operations under demand uncertainty: A robust optimization framework coupled with global optimization

Scheduling of crude oil operations is an important component of overall refinery operations, because crude oil costs account for about 80% of the refinery turnover. The mathematical modeling of blending different crudes in storage tanks results in many bilinear terms, which transform the problem into a challenging, nonconvex, mixed‐integer nonlinear programming (MINLP) optimization model. In practice, uncertainties are unavoidable and include demand fluctuations, ship arrival delays, equipment malfunction, and tank unavailability. In the presence of these uncertainties, an optimal schedule generated using nominal parameter values may often be suboptimal or even become infeasible. In this article, the robust optimization framework proposed by Lin et al. and Janak et al. is extended to develop a deterministic robust counterpart optimization model for demand uncertainty. The recently proposed branch and bound global optimization algorithm with piecewise‐linear underestimation of bilinear terms by Li et al. is also extended to solve the nonconvex MINLP deterministic robust counterpart optimization model and generate robust schedules. Two examples are used to illustrate the capability of the proposed robust optimization approach, and the extended branch and bound global optimization algorithm for demand uncertainty. The computational results demonstrate that the obtained schedules are robust in the presence of demand uncertainty. © 2011 American Institute of Chemical Engineers AIChE J, 58: 2373–2396, 2012     

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     

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     

Optimal processing network design under uncertainty for producing fuels and value‐added bioproducts from microalgae: Two‐stage adaptive robust mixed integer fractional programming model and computationally efficient solution algorithm

Fractional metrics, such as return on investment (ROI), are widely used for performance evaluation, but uncertainty in the real market may unfortunately diminish the results that are based on nominal parameters. This article addresses the optimal design of a large‐scale processing network for producing a variety of algae‐based fuels and value‐added bioproducts under uncertainty. We develop by far the most comprehensive processing network with 46,704 alternative processing pathways. Based on the superstructure, a two‐stage adaptive robust mixed integer fractional programming model is proposed to tackle the uncertainty and select the robust optimal processing pathway with the highest ROI. Since the proposed problem cannot be solved directly by any off‐the‐shelf solver, we develop an efficient tailored solution method that integrates a parametric algorithm with a column‐and‐constraint generation algorithm. The resulting robust optimal processing pathway selects biodiesel and poly‐3‐hydroxybutyrate as the final fuel and bioproduct, respectively. © 2016 American Institute of Chemical Engineers AIChE J, 63: 582–600, 2017     

Optimal European cooperative supply chains for carbon capture,transport, and sequestration with costs share policies

In the past decades, CO₂ constituted nearly the 80% of anthropogenic greenhouse gases emissions therefore, global actions are needed to tackle the increase of carbon concentration in the atmosphere. CO₂ (carbon) capture and storage has been highlighted among the most promising options to decarbonize the energy and industry sectors. Considering a large-scale infrastructure at European level, economic cooperation has been highlighted as a key requirement to relieve single countries from too high risk and commitment. This article proposes an economic optimization for cooperative supply chains for CO₂ capture and storage, by adopting policies that balance the spread of costs among countries, according to local characteristics in terms of population, CO₂ emissions, and macroeconomic outcome. Results show that the additional European investment for cooperation (max. +2.6% with respect to a noncooperative network) should not constitute a barrier toward the installation and operation of such more effective network designs.     

Integrated gasoline blending and order delivery operations: Part I. short‐term scheduling and global optimization for single and multi‐period operations

Gasoline is one of the most valuable products in an oil refinery and can account for as much as 60–70% of total profit. Optimal integrated scheduling of gasoline blending and order delivery operations can significantly increase profit by avoiding ship demurrage, improving customer satisfaction, minimizing quality give‐aways, reducing costly transitions and slop generation, exploiting low‐quality cuts, and reducing inventory costs. In this article, we first introduce a new unit‐specific event‐based continuous‐time formulation for the integrated treatment of recipes, blending, and scheduling of gasoline blending and order delivery operations. Many operational features are included such as nonidentical parallel blenders, constant blending rate, minimum blend length and amount, blender transition times, multipurpose product tanks, changeovers, and piecewise constant profiles for blend component qualities and feed rates. To address the nonconvexities arising from forcing constant blending rates during a run, we propose a hybrid global optimization approach incorporating a schedule adjustment procedure, iteratively via a mixed‐integer programming and nonlinear programming scheme, and a rigorous deterministic global optimization approach. The computational results demonstrate that our proposed formulation does improve the mixed‐integer linear programming relaxation of Li and Karimi, Ind. Eng. Chem. Res., 2011, 50, 9156–9174. All examples are solved to be 1%‐global optimality with modest computational effort. © 2016 American Institute of Chemical Engineers AIChE J, 62: 2043–2070, 2016     

Using short‐term resource scheduling for assessing effectiveness of CCS within electricity generation subsector

A new methodology for assessing the effectiveness of carbon capture and storage (CCS) that does explicitly consider the detailed operation of the target electricity system is proposed. The electricity system simulation consists of three phases, each one using a modified version of an economic dispatch problem that seeks to maximize the producers’ and consumers’ surplus while satisfying the technical constraints of the system. The economic dispatch is formulated as a dynamic mixed‐integer nonlinear programming problem and implemented in general algebraic modelling system (GAMS). The generating unit with CCS is designed and simulated using Aspen Plus®. In the first case study, the operation of the IEEE RTS ’96 (Institute of Electrical and Electronics Engineers One‐Area Reliability Test System—1996) is simulated with greenhouse gas (GHG) regulation implemented in the form of CO₂ permits that generators need to acquire for every unit of CO₂ that it is emitted. In the second case study, CCS is added at one of the buses and the operation of the modified IEEE RTS ’96 is again simulated with and without GHG regulation. The results suggest that the detailed operation of the target electricity system should be considered in future assessments of CCS and a general procedure for undertaking this for any GHG mitigation option is proposed. Future work will use the novel methodology for assessing the effectiveness of generating units with flexible CO₂ capture. © 2015 American Institute of Chemical Engineers AIChE J, 61: 4210–4234, 2015     

液化天然气冷量利用与轻烃分离集成优化

为充分利用进口液化天然气(LNG)湿气中的C2+轻烃资源,以流程模拟软件为工具,通过对现有轻烃分离流程的换热网络进行优化设计,开发出了一种LNG冷量利用与轻烃分离相集成的优化工艺流程。此流程轻烃回收率高达95%以上,而且能够将质量分数25%左右的液体甲烷进行低压储存,大大提升了轻烃分离装置的调峰能力;同时通过回收LNG的冷量将分离获得的C2+轻烃液体过冷,使之能够保持低压液相,有利于轻烃的储存、运输和销售。     

Conceptual design of ammonia‐based energy storage system: System design and time‐invariant performance

Chemicals‐based energy storage is promising for integrating intermittent renewables on the utility scale. High round‐trip efficiency, low cost, and considerable flexibility are desirable. To this end, an ammonia‐based energy storage system is proposed. It utilizes a pressurized reversible solid‐oxide fuel cell for power conversion, coupled with external ammonia synthesis and decomposition processes and a steam power cycle. A coupled refrigeration cycle is utilized to recycle nitrogen completely. Pure oxygen, produced as a side‐product in electrochemical water splitting, is used to drive the fuel cell. A first‐principle process model extended by detailed cost calculation is used for process optimization. In this work, the performance of a 100 MW system under time‐invariant operation is studied. The system can achieve a round‐trip efficiency as high as 72%. The lowest levelized cost of delivered energy is obtained at 0.24 $/kWh, which is comparable to that of pumped hydro and compressed air energy storage systems. © 2016 American Institute of Chemical Engineers AIChE J, 63: 1620–1637, 2017