首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
We discuss a tank design problem for a multi product plant, in which the optimal cycle time and the optimal campaign size are unknown. A mixed-integer nonlinear programming (MINLP) formulation is presented, where non-convexities are due to the tank investment cost, storage cost, campaign setup cost and variable production rates. The objective of the optimization model is to minimize the sum of the production cost per ton per product produced. A continuous-time mathematical programming formulation is proposed and several extensions are discussed. The model is implemented in GAMS and computational results are reported for the two global MINLP solver BARON and LINDOGlobal as well as several nonlinear solvers available in GAMS.  相似文献   

2.
A novel robust optimization framework is proposed to address general nonlinear problems in process design. Local linearization is taken with respect to the uncertain parameters around multiple realizations of the uncertainty, and an iterative algorithm is implemented to solve the problem. Furthermore, the proposed methodology can handle different categories of problems according to the complexity of the problems. First, inequality‐only constrained optimization problem as studied in most existing robust optimization methods can be addressed. Second, the proposed framework can deal with problems with equality constraint associated with uncertain parameters. In the final case, we investigate problems with operation variables which can be adjusted according to the realizations of uncertainty. A local affinely adjustable decision rule is adopted for the operation variables (i.e., an affine function of the uncertain parameter). Different applications corresponding to different classes of problems are used to demonstrate the effectiveness of the proposed nonlinear robust optimization framework. © 2017 American Institute of Chemical Engineers AIChE J, 64: 481–494, 2018  相似文献   

3.
    
A universally applicable procedure for multi‐objective optimization of chemical processes is developed. A set of known methods and procedures is adapted, combined with newly developed concepts, and integrated into the developed optimization tool, namely, the Adv:ProcessOptimizer. It allows for efficient, comfortable, and robust optimization of a process which is modeled in one of the various linked commercial simulation tools. As a result, the application of the process design with an overlaid optimization is easily accessible for academia and process industry. The industrial styrene process was optimized in order to validate the method. The results show a very densely and mostly equally crowded Pareto front and considerable savings in investment as well as operating costs compared to two reference designs.  相似文献   

4.
There has been an increasing interest in multicriteria optimization (MCO) of nonlinear process network problems in recent years. Several mathematical models have been developed and solved using MCO methodologies including ϵ-constraint, weighted sum, and minimum distance. In this paper, we investigate the bi-objective nonlinear network synthesis problem and propose an effective algorithm, ϵ-OA, based on augmented ϵ-constraint and logic-based outer approximation (OA). We provide theoretical characterization of the proposed algorithm and show that the solutions generated are efficient. We illustrate the effectiveness of our novel algorithm on two benchmark problems. The ϵ-OA is compared to the straightforward use of OA with augmented ϵ-constraint algorithm (ϵ-con + OA), the augmented ϵ-constraint without OA (ϵ-MINLP), and the traditional ϵ-constraint (T-ϵ-con). Based on the results, our novel algorithm is very effective in solving the bi-objective generalized disjunctive programming problems in the synthesis of process networks.  相似文献   

5.
An optimal design strategy for membrane networks separating multicomponent gas mixtures based on an approximate permeator model and mixed-integer nonlinear programming (MINLP) is proposed. A permeator system superstructure is used to embed a very large number of possible network configurations and allows the permeator feed-side pressure to be fixed or a design variable. A MINLP design model is developed to minimize the total annual process cost by simultaneous optimization of the permeator configuration and operating conditions. Case studies for the separation of acid gases (CO2 and H2S) from crude natural gas mixtures with spiral-wound permeators are presented. Permeator configurations are derived for different number of separation stages for both continuous and discrete membrane areas. The method is sufficiently robust to handle product compositions that vary five orders of magnitude. The proposed approach provides an efficient methodology for preliminary screening of multi-stage membrane separation systems for multicomponent gas mixtures.  相似文献   

6.
The Environmental Protection Agency (EPA) introduced Reformulated Gasoline (RFG) requirements as a measure to reduce emissions from gasoline-powered vehicles in certain geographic areas. As part of this effort, the EPA developed empirical models for predicting emissions as a function of gasoline properties and established statutory baseline emissions from a representative set of gasolines. All reformulated gasoline requires certification via this model, known as the Complex Model, and all refiners and importers calculate emissions performance reductions from the statutory baseline gasoline. The current representation of the Complex Model is extremely difficult to implement within refinery operations models or to use in combination with models for designer gasoline. RFG and boutique fuels are key driving forces in the North American refining industry.The RFG models introduce increasingly complex constraints with the major limitation that they are implicitly defined through a series of complicated disjunctions assembled by the EPA in the form of spreadsheets. This implicit and cumbersome representation of the emissions predictive models renders rigorous optimization and sensitivity analysis very difficult to address directly. In this paper, we discuss how the federal government requirements for reformulated gasoline can be restated as a set of mixed-integer nonlinear programming (MINLP) constraints with the aid of disjunctive programming techniques. We illustrate the use of this model with two simple example fuel blending problems.  相似文献   

7.
    
The optimization of crude oil operations in refineries is a challenging scheduling problem due to the need to model tanks of varying composition with nonconvex bilinear terms, and complicating logistic constraints. Following recent work for multiperiod pooling problems of refined petroleum products, a source-based mixed-integer nonlinear programming formulation is proposed for discrete and continuous representations of time. Logistic constraints are modeled through Generalized Disjunctive Programming while a specialized algorithm featuring relaxations from multiparametric disaggregation handles the bilinear terms. Results over a set of test problems from the literature show that the discrete-time approach finds better solutions when minimizing cost (avoids source of bilinear terms). In contrast, solution quality is slightly better for the continuous-time formulation when maximizing gross margin. The results also show that the specialized global optimization algorithm can lead to lower optimality gaps for fixed CPU, but overall, the performance of commercial solvers BARON and GloMIQO are better.  相似文献   

8.
    
A general modelling framework for optimization of multiphase flow networks with discrete decision variables is presented. The framework is expressed with the graph and special attention is given to the convexity properties of the mathematical programming formulation that follows. Nonlinear pressure and temperature relations are modelled using multivariate splines, resulting in a mixed-integer nonlinear programming (MINLP) formulation with spline constraints. A global solution method is devised by combining the framework with a spline-compatible MINLP solver, recently presented in the literature. The solver is able to globally solve the nonconvex optimization problems. The new solution method is benchmarked with several local optimization methods on a set of three realistic subsea production optimization cases provided by the oil company BP.  相似文献   

9.
    
Decentralized energy supply systems (DESS) are highly integrated and complex systems designed to meet time-varying energy demands, e.g., heating, cooling, and electricity. The synthesis problem of DESS addresses combining various types of energy conversion units, choosing their sizing and operations to maximize an objective function, e.g., the net present value. In practice, investment costs and part-load performances are nonlinear. Thus, this optimization problem can be modeled as a nonconvex mixed-integer nonlinear programming (MINLP) problem. We present an adaptive discretization algorithm to solve such synthesis problems containing an iterative interaction between mixed-integer linear programs (MIPs) and nonlinear programs (NLPs). The proposed algorithm outperforms state-of-the-art MINLP solvers as well as linearization approaches with regard to solution quality and computation times on a test set obtained from real industrial data, which we made available online.  相似文献   

10.
    
Despite research in the area, the relationship between the (open-loop) optimization problem and the quality of the (closed-loop) implemented schedule is poorly understood. Accordingly, we first show that open-loop and closed-loop scheduling are two different problems, even in the deterministic case. Thereafter, we investigate attributes of the open-loop problem and the rescheduling algorithm that affect closed-loop schedule quality. We find that it is important to reschedule periodically even when there are no “trigger” events. We show that solving the open-loop problem suboptimally does not lead to poor closed-loop solutions; instead, suboptimal solutions are corrected through feedback. We also observe that there exist thresholds for rescheduling frequency and moving horizon length, operating outside of which leads to substantial performance deterioration. Fourth, we show that the design attributes work in conjunction, hence, studying them simultaneously is important. Finally, we explore objective function modifications and constraint addition as methods to improve performance.  相似文献   

11.
This paper addresses problem of designing water usage network that consists of fixed flow rate water using processes. A design method is founded on the solution of mixed-integer linear programming (MILP) model of network superstructure. The application of optimization to solve basic formulation of network synthesis has been reported in some works. However, this approach applies certain extensions of the standard formulation that allow accounting for several industrial scenarios. In particular, it is possible to apply various performance indices and imposing conditions on continuous variables as well as on network topology. Multiple contaminant case is easily accounted for. At least but not at last, the method is able to generate several solutions of identical values of major performance indices but of different structure and other features. All these possibilities are available within single optimization framework. Several examples are given to illustrate advantages of the approach.  相似文献   

12.
    
A novel mathematical model for simultaneous optimization of batch mass exchange networks with multipurpose mass exchange units that can be shared by more than one match in different periods is presented in this work. It can be shown that both utility cost and capital investment can be reduced simultaneously with the use of multipurpose mass exchangers and mass storage tanks. Specifically, state-space superstructure that does not contain any structural simplification is proposed to capture the entire characteristics of the network configuration and a mixed-integer nonlinear optimization model is then formulated accordingly to generate the optimal batch operating policies and the corresponding flowsheet. Two examples are presented in this paper to demonstrate the validity and advantages of the proposed approach.  相似文献   

13.
    
We present a framework for the formulation of MIP scheduling models based on multiple and nonuniform discrete time grids. In a previous work we showed that it is possible to use different (possibly non-uniform) time grids for each task, unit, and material. Here, we generalize these ideas to account for general resources, and a range of processing characteristics such as limited intermediate storage and changeovers. Each resource has its own grid based on resource consumption and availability allowing resource constraints to be modeled more accurately without increasing the number of binary variables. We develop algorithms to define the unit-, task-, material-, and resource-specific grids directly from problem data. Importantly, we prove that the multi-grid formulation is able to find a schedule with the same optimal objective as the discrete-time single-grid model with an arbitrarily fine grid. The proposed framework leads to the formulation of models with reduced number of binary variables and constraints, which are able to find good solutions faster than existing models.  相似文献   

14.
The dramatic reduction in morbidity and mortality associated with the use of highly active antiretroviral therapy has created new challenges for clinicians: AIDS has become a chronic, potentially life-threatening, condition in many clinical instances. In this paper, a novel system engineering approach based on mixed-integer linear programming (MILP) is presented to support HIV/AIDS clinicians when formulating real-world therapeutic plans for heavily treatment-experienced patients under variable settings. Our results suggest that, while current practices (standard protocols and/or subjective recommendations based on the clinician's experience) can generally provide satisfactory management of drug resistance in the short-term, optimization-based therapy planning has a far greater potential to achieve this goal over expanded time horizons thereby changing paradigms and rethinking best practices in the HIV/AIDS clinical arena. Moreover, the ability of this methodology to address other viral pathologies (e.g., hepatitis B and C virus) can make this work appeal to a broader audience.  相似文献   

15.
We present a comprehensive approach to the simultaneous design and control of a continuous stirred tank reactor (CSTR) for styrene solution polymerization that must be able to produce different polymer grades. The resulting tool allows simultaneous selection of the polymerization equipment, the multivariable feedforward-feedback controller's structure and tuning parameters, the steady states and the transition paths between them. For this purpose a multiobjective optimization is implemented to minimize the annualized reactor cost, the operating costs, the production of off-specification polymer and the transition time between steady states. Trade-offs between the sometimes conflicting objectives are dealt with by the optimization. Unlike many previous grade transition studies, steady states are not known a priori. The only known parameters are the target molecular weights to be produced at each steady state. We have analyzed three different scenarios, and propose practical criteria for selecting the most reasonable optimum when the solution is not unique.  相似文献   

16.
    
Plant maintenance poses extended disruptions to production. Maintenance effects are amplified when the plant is part of an integrated chemical site, as production levels of adjacent plants in the site are also significantly influenced. A challenge in dealing with turnarounds is the difficulty in predicting their duration, due to discovery work and delays. This uncertainty in duration affects two major planning decisions: production levels and maintenance manpower allocation. The latter must be decided several months before the turnarounds occur. We address the scheduling of a set of plant turnarounds over a medium-term of several months using integer programming formulations. Due to the nature of uncertainty, production decisions are treated through stochastic programming ideas, while the manpower aspect is handled through a robust optimization framework. We propose combined robust optimization and stochastic programming formulations to address the problem and demonstrate, through an industrial case study, the potential for significant savings.  相似文献   

17.
The aim of this paper is to introduce a methodology to solve a large-scale mixed-integer nonlinear program (MINLP) integrating the two main optimization problems appearing in the oil refining industry: refinery planning and crude-oil operations scheduling. The proposed approach consists of using Lagrangian decomposition to efficiently integrate both problems. The main advantage of this technique is to solve each problem separately. A new hybrid dual problem is introduced to update the Lagrange multipliers. It uses the classical concepts of cutting planes, subgradient, and boxstep. The proposed approach is compared to a basic sequential approach and to standard MINLP solvers. The results obtained on a case study and a larger refinery problem show that the new Lagrangian decomposition algorithm is more robust than the other approaches and produces better solutions in reasonable times.  相似文献   

18.
    
In this work, we present a new Big-M reformulation for Generalized Disjunctive Programs. Unlike the traditional Big-M reformulation that uses one M-parameter for each constraint, the new approach uses multiple M-parameters for each constraint. Each of these M-parameters is associated with each alternative in the disjunction to which the constraint belongs. In this way, the proposed MINLP reformulation is at least as tight as the traditional Big-M, and it does not require additional variables or constraints. We present the new Big-M, and analyze the strength in its continuous relaxation compared to that of the traditional Big-M. The new formulation is tested by solving several instances with an NLP-based branch and bound method. The results show that, in most cases, the new reformulation requires fewer nodes and less time to find the optimal solution.  相似文献   

19.
A stochastic programming formulation (SPqt), based on the P‐median problem, is proposed for determining the optimal placement of detectors in mitigation systems while considering nonuniform dynamic detector unavailabilities. Unlike previously proposed formulations, SPqt explicitly considers backup detection levels. This allows the modeller to determine the maximum degree of the nonlinear products to be used based on the trade‐off between computational complexity and solution accuracy. We analyze this trade‐off on formulation SPqt results by using 4 real data sets for the gas detector placement problem while using unavailability values obtained from real industry gas detector data. For this data, our results show that two detection levels are sufficient to find objective values within 1% of the optimal solution. Using two detection levels reduces the nonlinear formulation to a quadratic formulation. Three solution strategies are proposed for this quadratic formulation and then compared from the computational efficiency perspective. © 2016 American Institute of Chemical Engineers AIChE J, 62: 2728–2739, 2016  相似文献   

20.
    
An integrated chemical site involves a complex network of chemical plants. Typically, these plants interact closely, are dependent on each other for raw materials and demand for their products, and have the provision of intermediate storage tanks to help manage inventory at strategic points in the network. Disruptions in the operation of these plants can drastically affect flow of material in the site network. As a result, the choice of sequence and timing of planned periodic turnarounds, which are major disruptions, is important in order to minimize effects on profits and production. We investigate a discrete-time mixed-integer linear programming (MILP) model to perform turnaround optimization. The objective is to recommend potential schedules in order to minimize losses while satisfying network, resource, turnaround, demand, financial and other practical constraints. We propose general formulations to tackle this problem and study an industrial-size site network under various scenarios over a long-term horizon.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号