Production of benzene,toluene, and xylenes from natural gas via methanol: Process synthesis and global optimization

A systematic global optimization‐based process synthesis framework is presented to determine the most profitable processes to produce aromatics from natural gas. Several novel, commercial, and/or competing technologies are modeled within the framework, including methanol‐to‐aromatics, toluene alkylation with methanol, selective toluene disproportionation, and toluene disproportionation and transalkylation with heavy aromatics, among others. We propose a stand‐alone chemicals facility: the main products are aromatics with allowable by‐products of gasoline, liquefied petroleum gas, and electricity. Several case studies are discussed that produce varying ratios of para‐, ortho‐, and meta‐xylene across multiple refinery capacities. The results indicate that utilizing natural gas for the production of aromatics is profitable with net present values as high as $3800 MM dollars and payback periods as low as 6 years. The required investment for these refineries represents as much as a 65% decrease compared to published estimates of similar coal‐based capacity plants. © 2016 American Institute of Chemical Engineers AIChE J, 62: 1531–1556, 2016     

Optimization models for planning shale gas well refracture treatments

Refracturing is a promising option for addressing the characteristically steep decline curves of shale gas wells. In this work we propose two optimization models to address the refracturing planning problem. First, we present a continuous‐time nonlinear programming model based on a novel forecast function that predicts pre‐ and post‐treatment productivity declines. Next, we propose a discrete‐time, multi‐period mixed‐integer linear programming (MILP) model that explicitly accounts for the possibility of multiple refracture treatments over the lifespan of a well. In an attempt to reduce solution times to a minimum, we compare three alternative formulations against each other (big‐M formulation, disjunctive formulation using Standard and Compact Hull‐Reformulations) and find that the disjunctive models yield the best computational performance. Finally, we apply the proposed MILP model to two case studies to demonstrate how refracturing can increase the expected recovery of a well and improve its profitability by several hundred thousand USD. © 2016 American Institute of Chemical Engineers AIChE J, 62: 4297–4307, 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     

A superstructure representation,generation, and modeling framework for chemical process synthesis

We present a framework for the efficient representation, generation, and modeling of superstructures for process synthesis. First, we develop a new representation based on three basic elements: units, ports, and conditioning streams. Second, we present four rules based on “minimal” and “feasible” component sets for the generation of simple superstructures containing all feasible embedded processes. Third, in terms of modeling, we develop a modular approach, and formulate models for each basic element. We also present a canonical form of element models using input/output variables and constrained/free variables. The proposed methods provide a coherent framework for superstructure‐based process synthesis, allowing efficient model generation and modification. © 2016 American Institute of Chemical Engineers AIChE J, 62: 3199–3214, 2016     

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     

Decomposition strategy for the global optimization of flexible energy polygeneration systems

The optimal design and operation of flexible energy polygeneration systems using coal and biomass to coproduce power, liquid fuels, and chemicals are investigated. This problem is formulated as a multiperiod optimization problem, which is a potentially large‐scale nonconvex mixed‐integer nonlinear program (MINLP) and cannot be solved to global optimality by state‐of‐the‐art global optimization solvers, such as BARON, within a reasonable time. A duality‐based decomposition method, which can exploit the special structure of this problem, is applied. In this work, the decomposition method is enhanced by the introduction of additional dual information for faster convergence. The enhanced decomposition algorithm (EDA) guarantees to find an ε‐optimal solution in a finite time. The case study results show that the EDA achieves much faster convergence than both BARON and the original decomposition algorithm, and it solved the large‐scale nonconvex MINLPs to ε‐optimality in practical times. © 2011 American Institute of Chemical Engineers AIChE J, 58: 3080–3095, 2012     

Multi‐period planning,design, and strategic models for long‐term,quality‐sensitive shale gas development

In this work we address the long‐term, quality‐sensitive shale gas development problem. This problem involves planning, design, and strategic decisions such as where, when, and how many shale gas wells to drill, where to lay out gathering pipelines, as well as which delivery agreements to arrange. Our objective is to use computational models to identify the most profitable shale gas development strategies. For this purpose we propose a large‐scale, nonconvex, mixed‐integer nonlinear programming model. We rely on generalized disjunctive programming to systematically derive the building blocks of this model. Based on a tailor‐designed solution strategy we identify near‐global solutions to the resulting large‐scale problems. Finally, we apply the proposed modeling framework to two case studies based on real data to quantify the value of optimization models for shale gas development. Our results suggest that the proposed models can increase upstream operators’ profitability by several million U.S. dollars. © 2016 American Institute of Chemical Engineers AIChE J, 62: 2296–2323, 2016     

Data‐driven mathematical modeling and global optimization framework for entire petrochemical planning operations

In this work we develop a novel modeling and global optimization‐based planning formulation, which predicts product yields and properties for all of the production units within a highly integrated refinery‐petrochemical complex. Distillation is modeled using swing‐cut theory, while data‐based nonlinear models are developed for other processing units. The parameters of the postulated models are globally optimized based on a large data set of daily production. Property indices in blending units are linearly additive and they are calculated on a weight or volume basis. Binary variables are introduced to denote unit and operation modes selection. The planning model is a large‐scale non‐convex mixed integer nonlinear optimization model, which is solved to ε‐global optimality. Computational results for multiple case studies indicate that we achieve a significant profit increase (37–65%) using the proposed data‐driven global optimization framework. Finally, a user‐friendly interface is presented which enables automated updating of demand, specification, and cost parameters. © 2016 American Institute of Chemical Engineers AIChE J, 62: 3020–3040, 2016     

A new optimization model and a customized solution method for natural gas production network design and operation

This article proposes to tackle integrated design and operation of natural gas production networks under uncertainty, using a new two‐stage stochastic programming model, a novel reformulation strategy, and a customized global optimization method. The new model addresses material balances for multiple key gas components, pressure flow relationships in gas wells and pipelines, and compressor performance. This model is a large‐scale nonconvex mixed‐integer nonlinear programming problem that cannot be practically solved by existing global optimization solvers or decomposition‐based optimization methods. With the new reformulation strategy, the reformulated model has a better decomposable structure, and then a new decomposition‐based global optimization method is developed for efficient global optimization. In the case study of an industrial naturals production system, it is shown that the proposed modeling and optimization methods enable efficient solution, and the proposed optimization method is faster than a state‐of‐the‐art decomposition method by at least an order of magnitude. © 2016 American Institute of Chemical Engineers AIChE J, 63: 933–948, 2017     

Systematic modeling of discrete‐continuous optimization models through generalized disjunctive programming

Discrete‐continuous optimization problems are commonly modeled in algebraic form as mixed‐integer linear or nonlinear programming models. Since these models can be formulated in different ways, leading either to solvable or nonsolvable problems, there is a need for a systematic modeling framework that provides a fundamental understanding on the nature of these models. This work presents a modeling framework, generalized disjunctive programming (GDP), which represents problems in terms of Boolean and continuous variables, allowing the representation of constraints as algebraic equations, disjunctions and logic propositions. An overview is provided of major research results that have emerged in this area. Basic concepts are emphasized as well as the major classes of formulations that can be derived. These are illustrated with a number of examples in the area of process systems engineering. As will be shown, GDP provides a structured way for systematically deriving mixed‐integer optimization models that exhibit strong continuous relaxations, which often translates into shorter computational times. © 2013 American Institute of Chemical Engineers AIChE J, 59: 3276–3295, 2013     

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     

Process synthesis using block superstructure with automated flowsheet generation and optimization

An alternative method for chemical process synthesis using a block‐based superstructure representation is proposed. The block‐based superstructure is a collection of blocks arranged in a two‐dimensional grid. The assignment of different equipment on blocks and the determination of their connectivity are performed using a mixed‐integer nonlinear formulation for automated flowsheet generation and optimization‐based process synthesis. Based on the special structure of the block representation, an efficient strategy is proposed to generate and successively refine feasible and optimized process flowsheets. Our approach is demonstrated using two process synthesis case studies adapted from the literature and one new process synthesis problem for methanol production from biogas © 2018 American Institute of Chemical Engineers AIChE J, 64: 3082–3100, 2018     

Strategic planning,design, and development of the shale gas supply chain network

The long‐term planning of the shale gas supply chain is a relevant problem that has not been addressed before in the literature. This article presents a mixed‐integer nonlinear programming (MINLP) model to optimally determine the number of wells to drill at every location, the size of gas processing plants, the section and length of pipelines for gathering raw gas and delivering processed gas and by‐products, the power of gas compressors, and the amount of freshwater required from reservoirs for drilling and hydraulic fracturing so as to maximize the net present value of the project. Because the proposed model is a large‐scale nonconvex MINLP, we develop a decomposition approach based on successively refining a piecewise linear approximation of the objective function. Results on realistic instances show the importance of heavier hydrocarbons to the economics of the project, as well as the optimal usage of the infrastructure by properly planning the drilling strategy. © 2014 American Institute of Chemical Engineers AIChE J, 60: 2122–2142, 2014     

A multi‐objective optimization approach to polygeneration energy systems design

Polygeneration, typically involving co‐production of methanol and electricity, is a promising energy conversion technology which provides opportunities for high energy utilization efficiency and low/zero emissions. The optimal design of such a complex, large‐scale and highly nonlinear process system poses significant challenges. In this article, we present a multiobjective optimization model for the optimal design of a methanol/electricity polygeneration plant. Economic and environmental criteria are simultaneously optimized over a superstructure capturing a number of possible combinations of technologies and types of equipment. Aggregated models are considered, including a detailed methanol synthesis step with chemical kinetics and phase equilibrium considerations. The resulting model is formulated as a non‐convex mixed‐integer nonlinear programming problem. Global optimization and parallel computation techniques are employed to generate an optimal Pareto frontier. © 2009 American Institute of Chemical Engineers AIChE J, 2010     

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     

A projection‐based method for production planning of multiproduct facilities

An algorithm is presented for identifying the projection of a scheduling model's feasible region onto the space of production targets. The projected feasible region is expressed using one of two mixed‐integer programming formulations, which can be readily used to address integrated production planning and scheduling problems that were previously intractable. Production planning is solved in combination with a surrogate model representing the region of feasible production amounts to provide optimum production targets, while a detailed scheduling is solved in a rolling‐horizon manner to define feasible schedules for meeting these targets. The proposed framework provides solutions of higher quality and yields tighter bounds than previously proposed approaches. © 2009 American Institute of Chemical Engineers AIChE J, 2009     

Deciphering and handling uncertainty in shale gas supply chain design and optimization: Novel modeling framework and computationally efficient solution algorithm

The optimal design and operations of shale gas supply chains under uncertainty of estimated ultimate recovery (EUR) is addressed. A two‐stage stochastic mixed‐integer linear fractional programming (SMILFP) model is developed to optimize the levelized cost of energy generated from shale gas. In this model, both design and planning decisions are considered with respect to shale well drilling, shale gas production, processing, multiple end‐uses, and transportation. To reduce the model size and number of scenarios, we apply a sample average approximation method to generate scenarios based on the real‐world EUR data. In addition, a novel solution algorithm integrating the parametric approach and the L‐shaped method is proposed for solving the resulting SMILFP problem within a reasonable computational time. The proposed model and algorithm are illustrated through a case study based on the Marcellus shale play, and a deterministic model is considered for comparison. © 2015 American Institute of Chemical Engineers AIChE J, 61: 3739–3755, 2015     

Multi-objective modeling and optimization for scheduling of cracking furnace systems

Cracking furnace is the core device for ethylene production. In practice, multiple ethylene furnaces are usual y run in parallel. The scheduling of the entire cracking furnace system has great significance when multiple feeds are simultaneously processed in multiple cracking furnaces with the changing of operating cost and yield of product. In this paper, given the requirements of both profit and energy saving in actual production process, a multi-objective optimization model contains two objectives, maximizing the average benefits and minimizing the average coking amount was proposed. The model can be abstracted as a multi-objective mixed integer non-linear programming problem. Considering the mixed integer decision variables of this multi-objective problem, an improved hybrid encoding non-dominated sorting genetic algorithm with mixed discrete variables (MDNSGA-I ) is used to solve the Pareto optimal front of this model, the algorithm adopted crossover and muta-tion strategy with multi-operators, which overcomes the deficiency that normal genetic algorithm cannot handle the optimization problem with mixed variables. Finally, using an ethylene plant with multiple cracking furnaces as an example to illustrate the effectiveness of the scheduling results by comparing the optimization results of multi-objective and single objective model.     

Modeling and optimization methods of integrated production planning for steel plate mill with flexible customization

With diversified requirements and varying manufacturing environments, the optimal production planning for a steelmill becomes more flexible and complicated. The flexibility provides operators with auxiliary requirements through an implementable integrated production planning. In this paper, a mixed-integer nonlinear programming (MINLP) model is proposed for the optimal planning that incorporates various manufacturing constraints and flexibility in a steel plate mill. Furthermore, two solution strategies are developed to overcome theweakness in solving the MINLP problem directly. The first one is to transformthe original MINLP formulation to an approximate mixed integer linear programming using a classic linearization method. The second one is to decompose the originalmodel using a branch-and-bound based iterative method. Computational experiments on various instances are presented in terms of the effectiveness and applicability. The result shows that the second method performs better in computational efforts and solution accuracy.     

Optimization models for shale gas water management

There are four key aspects for water use in hydraulic fracturing, including source water acquisition, wastewater production, reuse and recycle, and subsequent transportation, storage, and disposal. Water use life cycle is optimized for wellpads through a discrete‐time two‐stage stochastic mixed‐integer linear programming model under uncertain availability of water. The objective is to minimize expected transportation, treatment, storage, and disposal cost while accounting for the revenue from gas production. Assuming freshwater sources, river withdrawal data, location of wellpads, and treatment facilities are given, the goal is to determine an optimal fracturing schedule in coordination with water transportation, and its treatment and reuse. The proposed models consider a long‐time horizon and multiple scenarios from historical data. Two examples representative of the Marcellus Shale play are presented to illustrate the effectiveness of the formulation, and to identify optimization opportunities that can improve both the environmental impact and economical use of water. © 2014 American Institute of Chemical Engineers AIChE J, 60: 3490–3501, 2014