共查询到20条相似文献,搜索用时 0 毫秒
1.
David A. Liñán Luis A. Ricardez-Sandoval 《American Institute of Chemical Engineers》2023,69(5):e18008
This study introduces the logic-based discrete-Benders decomposition (LD-BD) for Generalized Disjunctive Programming (GDP) superstructure problems with ordered Boolean variables. The key idea is to obtain Benders cuts that use neighborhood information of a reformulated version of Boolean variables. These Benders cuts are iteratively refined, which guarantees convergence to a local optimum. A mathematical case study, the optimization of a network with Continuous Stirred-Tank Reactors (CSTRs) in series, and a large-scale problem involving the design of a distillation column are considered to demonstrate the features of LD-BD. The results from these case studies have shown that the LD-BD method exhibited good performance by finding attractive locally optimal solutions relative to existing logic-based solvers for GDP problems. Based on these tests, the LD-BD method is a promising strategy to solve optimal synthesis problems with ordered discrete decisions emerging in chemical engineering applications. 相似文献
2.
Lifeng Zhang;Ana Inés Torres;Bingzhen Chen;Zhihong Yuan;Ignacio E. Grossmann; 《American Institute of Chemical Engineers》2024,70(4):e18371
This article focuses on a novel optimization problem to retrofit a conventional fossil-based refinery into a hybrid biomass-based refinery. A mixed-integer linear programming model, which considers a 10-year-long retrofit planning along with operational constraints in each year, is formulated. The problem is extended to a multistage stochastic programming model to handle both endogenous and exogenous uncertainties, and solved through a series of two-stage stochastic programming subproblems. Furthermore, a Lagrangean decomposition algorithm is implemented to solve such a problem. By determining whether to add new units or retrofit existing units to the selected biomass-based technologies, the results provide flexible design alternatives with consideration of operational constraints for each year. The results show the advantages of the selected biomass-based technologies and enhance the performance of the final solution under uncertainty. 相似文献
3.
4.
Ilias Mitrai Wentao Tang Prodromos Daoutidis 《American Institute of Chemical Engineers》2022,68(6):e17415
Decomposition-based solution algorithms for optimization problems depend on the underlying latent block structure of the problem. Methods for detecting this structure are currently lacking. In this article, we propose stochastic blockmodeling (SBM) as a systematic framework for learning the underlying block structure in generic optimization problems. SBM is a generative graph model in which nodes belong to some blocks and the interconnections among the nodes are stochastically dependent on their block affiliations. Hence, through parametric statistical inference, the interconnection patterns underlying optimization problems can be estimated. For benchmark optimization problems, we show that SBM can reveal the underlying block structure and that the estimated blocks can be used as the basis for decomposition-based solution algorithms which can reach an optimum or bound estimates in reduced computational time. Finally, we present a general software platform for automated block structure detection and decomposition-based solution following distributed and hierarchical optimization approaches. 相似文献
5.
While domain reduction has been successfully applied in branch-and-bound based global optimization over the last two decades, it has not been systematically studied for decomposition based global optimization, which is usually more efficient for problems with decomposable structures. This paper discusses integration of domain reduction in Benders decomposition based global optimization, specifically, generalized Benders decomposition (GBD) and nonconvex generalized Benders decomposition (NGBD). Revised GBD and NGBD frameworks are proposed to incorporate bound contraction operations or/and range reduction calculations, which can reduce the variable bounds and therefore improve the convergence rate and expedite the solution of nonconvex subproblems. Novel customized bound contraction problems are proposed for GBD and NGBD, and they are easier to solve than the classical bound contraction problems because they are defined on reduced variable spaces. The benefits of the proposed methods are demonstrated through a gas production operation problem and a power distribution system design problem. 相似文献
6.
Integration of production scheduling and dynamic optimization can improve the overall performance of multi-product CSTRs. However, the integration leads to a mixed-integer dynamic optimization problem, which could be challenging to solve. We propose two efficient methods based on the generalized Bender decomposition framework that take advantage of the special structures of the integrated problem. The first method is applied to a time-slot formulation. The decomposed primal problem is a set of separable dynamic optimization problems and the master problem is a mixed-integer nonlinear fractional program. The master problem is then solved to global optimality by a fractional programming algorithm, ensuring valid Benders cuts. The second decomposition method is applied to a production sequence formulation. Similar to the first method, the second method uses a fractional programming algorithm to solve the master problem. Compared with the simultaneous method, the proposed decomposition methods can reduce the computational time by over two orders of magnitudes for a polymer production process in a CSTR. 相似文献
7.
Abstract Production planning under uncertainty is considered as one of the most important problems in plant-wide optimization. In this article, first, a stochastic programming model with uniform distribution assumption is developed for refinery production planning under demand uncertainty, and then a hybrid programming model incorporating the linear programming model with the stochastic programming one by a weight factor is proposed. Subsequently, piecewise linear approximation functions are derived and applied to solve the hybrid programming model-under uniform distribution assumption. Case studies show that the linear approximation algorithm is effective to solve.the hybrid programming model, along with an error≤0.5% when the deviatiorgmean≤20%. The simulation results indicate that the hybrid programming model with an appropriate weight factor (0.1-0.2) can effectively improve the optimal operational strategies under demand uncertainty, achieving higher profit than the linear programming model and the stochastic programming one with about 1.3% and 0.4% enhancement, respectavely. 相似文献
8.
Stochastic programming models for optimal shale well development and refracturing planning under uncertainty
下载免费PDF全文

Markus G. Drouven Ignacio E. Grossmann Diego C. Cafaro 《American Institute of Chemical Engineers》2017,63(11):4799-4813
In this work we present an optimization framework for shale gas well development and refracturing planning. This problem is concerned with if and when a new shale gas well should be drilled at a prospective location, and whether or not it should be refractured over its lifespan. We account for exogenous gas price uncertainty and endogenous well performance uncertainty. We propose a mixed‐integer linear, two‐stage stochastic programming model embedded in a moving horizon strategy to dynamically solve the planning problem. A generalized production estimate function is described that predicts the gas production over time depending on how often a well has been refractured, and when exactly it was restimulated last. From a detailed case study, we conclude that early in the life of an active shale well, refracturing makes economic sense even in low‐price environments, whereas additional restimulations only appear to be justified if prices are high. © 2017 American Institute of Chemical Engineers AIChE J, 2017 相似文献
9.
Congqin Ge Lifeng Zhang Wenhui Yang Zhihong Yuan 《American Institute of Chemical Engineers》2023,69(9):e18156
Traditional supply chains usually follow fixed facility designs which coincide with the strategic nature of supply chain management (SCM). However, as the global market turns more volatile, the concept of mobile modularization has been adopted by increasingly more industrial practitioners. In mobile modular networks, modular units can be installed or removed at a particular site to expand or reduce the capacity of a facility, or relocated to other sites to tackle market volatility. In this work, we formulate a mixed-integer linear programming (MILP) model for the closed-loop supply chain network planning with modular distribution and collection facilities. To further deal with uncertain customer demands and recovery rates, we extend our model to a multistage stochastic programming model and efficiently solve it using a tailored stochastic dynamic dual integer programming (SDDiP) with Magnanti-Wong enhanced cuts. Computational experiments show that the added Magnanti-Wong cuts in the proposed algorithm can effectively close the gap between upper and lower bounds, and the benefit of mobile modules is evident when the temporal and spatial variability of customer demand is high. 相似文献
10.
Sylvain MouretIgnacio E. Grossmann Pierre Pestiaux 《Computers & Chemical Engineering》2011,35(12):2750-2766
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. 相似文献
11.
夹点技术在炼油企业生产计划中的运用 总被引:3,自引:0,他引:3
本文通过分析炼油企业产品传递或配送过程中的质和量的约束关系,即时间和产品加工量的约束关系,提出将能量综合集成技术夹点技术运用于炼油企业生产计划。使企业能快速响应市场变化,降低生产成本,指导企业生产经营过程。文章最后以某炼油企业为例建立一个实例模型,表明了该模型的有效性和实用性。 相似文献
12.
Fupei Li Feng Qian Minglei Yang Wenli Du Vladimir Mahalec 《American Institute of Chemical Engineers》2021,67(2):e17115
Accuracy of a crude distillation unit (CDU) model has a significant impact on refinery production planning. High accuracy is typically accomplished via nonlinear models which causes convergence difficulties when the entire refinery model is optimized. CDU model presented in this work is a mixed-integer linear model with a modest number of binary variables; its accuracy is on par with rigorous tray to tray CDU models. The model relies on the observation12 that a line through the middle of the product true boiling point (TBP) curve depends on the crude feed properties and the yields of the adjacent products. Novelty of the product tri-section CDU model is that it does not require models of individual distillation towers comprising the CDU, thereby leading to a much simpler model structure. Significant reduction in the computational effort required for the optimization of nonlinear refinery models is illustrated by comparison with previous work. 相似文献
13.
This work investigates the computational procedures used to obtain global solution to the economic linear optimal control (ELOC) problem. The proposed method employs the generalized Benders decomposition (GBD) algorithm. Compared to the previous branch and bound approach, a naive application of GBD to the ELOC problem will improve computational performance, due to less frequent calls to computationally slow semi-definite programming (SDP) routines. However, the reverse-convex constraints of the original problem will reappear in the relaxed master problem. In response, a convexification of the relaxed master constraints has been developed and proven to preserve global solution characteristics. The result is a multi-fold improvement in computational performance. A technological benefit of decomposing the problem into steady-state and dynamic parts is the ability to utilize nonlinear steady-state models, since the relaxed master problem is free of SDP type constraints and can be solved using any global nonlinear programming algorithm. 相似文献
14.
David A. Liñán;Luis A. Ricardez-Sandoval; 《American Institute of Chemical Engineers》2024,70(9):e18491
This study presents the first application of a logic-based Benders decomposition (LBBD) technique in the field of simultaneous scheduling and dynamic optimization (SSDO), applied to network batch processes with a discrete-time scheduling formulation. The proposed algorithm employs neighborhood information of ordered discrete decisions (e.g., batching variables) to generate cuts, rather than relying on traditional cut generation techniques based on dual information that are implemented in generalized Benders decomposition (GBD) algorithms. The proposed algorithm relies on solving multiple subproblems per iteration, which is a feature that allows the generation of multiple cuts per iteration thus producing accurate approximations of the objective function in shorter computational times. This results in the herein proposed multicut logic-based discrete Benders decomposition (MLD-BD) algorithm, which enables features such as a pruning strategy, and a cut-off technique. Two case studies are used to demonstrate the computational advantages of the MLD-BD framework against GBD and heuristic methodologies. 相似文献
15.
This article addresses a production planning optimization problem of overall refinery. The authors formulated the optimization problem as mixed integer linear programming. The model considers the main factors for optimizing the production plan of overall refinery related to the use of run-modes of processing units. The aim of this planning is to decide which run-mode to use in each processing unit in each period of a given horizon, to satisfy the demand, such as the total cost of production and inventory is minimized. The resulting model can be regarded as a generalized lot-sizing problem where a run-mode can produce and consume more than one product. The resulting optimization problem is large-sized and NP-hard. The authors have proposed a column generation-based algorithm called branch-and-price (BP) for solving the interested optimization problem. The model and implementation of the algorithm are described in detail in this article. The computational results verify the effectiveness of the proposed model and the solution method. 相似文献
16.
The paper presents two heuristic approaches, a shrinking horizon multiple two-stage stochastic programming (MTSSP) decomposition algorithm and a knapsack decomposition algorithm (KDA), for solving multistage stochastic programmes (MSSPs) with endogenous uncertainty, specifically focusing on pharmaceutical research and development (R&D) pipeline management problem. The MTSSP decomposition algorithm decomposes the problem into a series of two-stage stochastic programmes, which are solved as resources become available. The KDA decomposes the MSSP into a series of knapsack problems, which are created and solved at key decision points on a rolling horizon fashion. Based on the results of the six case studies, both the MTSSP decomposition algorithm and the KDA generate implementable solutions that are within three percent of the rigorous MSSP solution obtained by CPLEX 12.51. Both methods showed several orders of magnitude decrease in the CPU times compared to ones that were required to solve the rigorous MSSP. 相似文献
17.
生产计划与调度是化工供应链优化中两个重要的决策问题。为了提高生产决策的效率,不仅要对计划与调度进行集成,而且要考虑不确定性的影响。对于多周期生产计划与调度问题,首先在每个生产周期内,分别建立计划与调度的确定性模型,通过产量关联对二者进行集成。然后考虑需求不确定性,使用有限数量的场景表达决策变量,建立二阶段随机规划模型。最后运用滚动时域求解策略,使计划与调度结果在迭代过程中达到一致。实例结果表明,在考虑需求不确定性时,与传统方法相比,随机规划方法可以降低总费用,结合计划与调度的分层集成策略,实现了生产操作性和经济性的综合优化。 相似文献
18.
A game theoretic framework for strategic refinery production planning is presented in which strategic planning problems are formulated as non‐cooperative potential games whose solutions represent Nash equilibria. The potential game model takes the form of a nonconvex nonlinear program (NLP) and we examine an additional scenario extending this to a nonconvex mixed integer nonlinear program (MINLP). Tactical planning decisions are linked to strategic decision processes through a potential game structure derived from a Cournot oligopoly‐type game in which multiple crude oil refineries supply several markets. Two scenarios are presented which illustrate the utility of the game theoretic framework in the analysis of production planning problems in competitive scenarios. Solutions to these problems are interpreted as mutual best responses yielding maximum profit in the competitive planning game. The resulting production planning decisions are rational in a game theoretic sense and are robust to deviations in competitor strategies. © 2017 American Institute of Chemical Engineers AIChE J, 63: 2751–2763, 2017 相似文献
19.
Gang Fu Yoel Sanchez Vladimir Mahalec 《American Institute of Chemical Engineers》2016,62(4):1065-1078
Planning, scheduling, and real time optimization are currently implemented using different types of models, which causes discrepancies between their results. This work presents a single model of a crude distillation unit (preflash, atmospheric, and vacuum towers) suitable for all of these applications, thereby eliminating discrepancies between models used in these decision processes. Product true boiling point (TBP) curves are predicted via partial least squares model from the feed TBP curve and operating conditions (flows, pumparound heat duties, furnace coil outlet temperatures). Combined with volumetric and energy balances, this enables prediction of crude distillation on par with a rigorous distillation model, with 0.5% root mean square error (RMSE) over a wide range of conditions. Associated properties (e.g., gravity, sulfur) are computed for each product based on its distillation curve and corresponding property distribution in the feed. Model structure makes it particularly amenable for development from plant data. © 2015 American Institute of Chemical Engineers AIChE J, 62: 1065–1078, 2016 相似文献
20.
不确定条件下炼化企业计划与调度整合策略 总被引:2,自引:1,他引:2
A strategy for the integration of production planning and scheduling in refineries is proposed.This strategy relies on rolling horizon strategy and a two-level decomposition strategy.This strategy involves an upper level multiperiod mixed integer linear programming(MILP) model and a lower level simulation system,which is extended from our previous framework for short-term scheduling problems [Luo,C.P.,Rong,G.,\"Hierarchical approach for short-term scheduling in refineries\",Ind.Eng.Chem.Res.,46,3656-3668(2007)].The main purpose of this extended framework is to reduce the number of variables and the size of the optimization model and,to quickly find the optimal solution for the integrated planning/scheduling problem in refineries.Uncertainties are also considered in this article.An integrated robust optimization approach is introduced to cope with uncertain parameters with both continuous and discrete probability distribution. 相似文献