共查询到20条相似文献,搜索用时 15 毫秒
1.
In this work, we propose a hybrid simulation‐based optimization framework to solve the supply chain management problem. The hybrid approach combines a mathematical programming model with an agent‐based simulation model and uses them in an iterative framework. The optimization model is used to guide the decisions toward an optimal allocation of resources given the realistic supply chain representation given by the simulation. Thus, the proposed approach provides a more realistic solution compared to a stand‐alone optimization model, often a simplified representation of the actual system, by making use of the simulation model, which captures the detailed dynamic behavior of the system. A multiobjective problem has been formulated by taking into consideration the environmental impact of supply chain operations. The proposed framework has been applied to small‐scale case studies to study the effectiveness of the approach for such problems. © 2013 American Institute of Chemical Engineers AIChE J, 59: 4612–4626, 2013 相似文献
2.
改进生物地理学优化算法及其在汽油调合调度中的应用 总被引:1,自引:1,他引:0
汽油调合和调度优化问题中含有典型的非线性约束(NLP)问题。针对一般智能优化算法在解决此类优化问题中易陷于局部极值,提出了一种改进的生物地理学优化算法(HMBBO)。该算法设计了一种基于种群个体差异信息的启发式变异算子,弥补了Gauss变异、Cauchy变异算子缺乏启发式信息的不足,以解决原算法在局部搜索时易出现的早熟问题,提高算法的全局搜索能力,并且采用非线性物种迁移模型以适应不同的自然环境。采用4个测试函数进行仿真,结果表明:HMBBO算法与标准BBO算法、基于Gauss变异及基于Cauchy变异的BBO算法比较,其收敛速度和全局寻优能力有明显改善。汽油调合和调度优化实例表明,该算法能够快速有效地找到全局最优解。 相似文献
3.
Yunfei Chu John M. Wassick Fengqi You 《American Institute of Chemical Engineers》2013,59(8):2884-2906
A novel efficient agent‐based method for scheduling network batch processes in the process industry is proposed. The agent‐based model is based on the resource‐task network. To overcome the drawback of localized solutions found in conventional agent‐based methods, a new scheduling algorithm is proposed. The algorithm predicts the objective function value by simulating another cloned agent‐based model. Global information is obtained, and the solution quality is improved. The solution quality of this approach is validated by detailed comparisons with the mixed‐integer programming (MIP) methods. A solution close to the optimal one can be found by the agent‐based method with a much shorter computational time than the MIP methods. As a scheduling problem becomes increasingly complicated with increased scale, more specifications, and uncertainties, the advantages of the agent‐based method become more evident. The proposed method is applied to simulated industrial problems where the MIP methods require excessive computational resources. © 2013 American Institute of Chemical Engineers AIChE J, 59: 2884–2906, 2013 相似文献
4.
The self‐emulsified aqueous‐based polyurethane (PU) consists of carboxyl group, which is an ionic center not only stabilizing the aqueous polymer dispersion but also serving as the curing site toward aziridinyl curing agent. Two new aziridinyl curing agents, HDI‐AZ and ADA‐AZ, are prepared from an addition reaction of aziridine to hexamethylene diisocyanate (HDI) and adipic acyl chloride (ADA), respectively. These curing agents are added separately into NCO‐terminated PU prepolymer before or after the water dispersion process. The resulting PU dispersion becomes a single component self‐curable aqueous‐based PU system. The cured PU is obtained from this single component PU dispersion on drying at ambient temperature. The improved PU properties demonstrate the feasibility of this convenient single component self‐curable aqueous‐based PU system. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 91:1997–2007, 2004 相似文献
5.
Finding the global optimum of an objective function has been of interest in many disciplines. Recently, a global optimisation technique based on multiunit extremum seeking has been proposed for scalar and two‐input systems. The idea of multiunit extremum‐seeking is to control the gradient evaluated using finite difference between two identical units operating with an offset. For scalar systems, it was shown that the global optimum could be obtained by reducing the offset to zero. For two‐input systems, the univariate global optimisation is performed on the circumference of a circle of reducing radius. In this study, the concept is extended to three‐input systems where the circle of varying radius sits on a shrinking sphere. The key contribution lies in formulating the rotation required to keep the best point found in the search domain. The theoretical concepts are illustrated on the global optimisation of several examples. Comparison results with other competitive methods show that the proposed technique performs well in terms of number of function evaluations and accuracy. © 2011 Canadian Society for Chemical Engineering 相似文献
6.
7.
不确定条件下炼化企业计划与调度整合策略 总被引: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. 相似文献
8.
We present an effective scheduling heuristic for realistic production planning in a petrochemical blending plant. The considered model takes into account orders spanning a multi-product portfolio with multiple bills of materials per product, that need to be scheduled on shared production facilities including a complex pipeline network. Capacity constraints, intermediate storage restrictions, due dates, and the dedication of resources to specific product families have to be respected. The primary objective of the heuristic is to minimize the total order tardiness. Secondary objectives include the minimization of pipeline cleaning operations, the minimization of lead times, and the balanced utilization of filling units.The developed algorithm is based on a dynamic prioritization-based greedy search that schedules the orders sequentially. The proposed method can schedule short to mid-term operations and evaluate different plant configurations or production policies on a tactical level. We demonstrate its performance on various real-world inspired scenarios for different scheduling strategies.Our heuristic was used during the construction phase of a new blending plant and was instrumental in the optimal design of the plant. 相似文献
9.
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 相似文献
10.
Multi‐period planning,design, and strategic models for long‐term,quality‐sensitive shale gas development
下载免费PDF全文

Markus G. Drouven Ignacio E. Grossmann 《American Institute of Chemical Engineers》2016,62(7):2296-2323
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 相似文献
11.
12.
基于微粒群优化算法的不确定性调和调度 总被引:1,自引:0,他引:1
Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimization problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization (PSO) algorithm is developed for nonlinear optimization problems with both continuous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results based on an example of gasoline blending agree satisfactory with the ideal values, which illustrates that the PSO algorithm is valid and effective in solving the blending scheduling problem. 相似文献
13.
Jaime Cerdá Pedro C. Pautasso Diego C. Cafaro 《American Institute of Chemical Engineers》2016,62(9):3002-3019
Gasoline blending is a critical process with a significant impact on the total revenues of oil refineries. It consists of mixing several feedstocks coming from various upstream processes and small amounts of additives to make different blends with some specified quality properties. The major goal is to minimize operating costs by optimizing blend recipes, while meeting product demands on time and quality specifications. This work introduces a novel continuous‐time mixed‐integer linear programming (MILP) formulation based on floating time slots to simultaneously optimize blend recipes and the scheduling of blending and distribution operations. The model can handle non‐identical blenders, multipurpose product tanks, sequence‐dependent changeover costs, limited amounts of gasoline components, and multi‐period scenarios. Because it features an integrality gap close to zero, the proposed MILP approach is able to find optimal solutions at much lower computational cost than previous contributions when applied to large gasoline blend problems. © 2016 American Institute of Chemical Engineers AIChE J, 62: 3002–3019, 2016 相似文献
14.
Double‐modified montmorillonite (MMT) was first prepared by covalent modification of MMT with 3‐aminopropyltriethoxysilane and then intercalation modification by tributyl tetradecyl phosphonium ions. The obtained double‐modified MMT was melt compounded with polypropylene (PP) to obtain nanocomposites. The dispersion of the double‐modified MMT in PP was found to be greatly improved by the addition of PP‐graft‐maleic anhydride (PP‐g‐MA) as a “compatibilizer,” whose anhydride groups can react with the amino groups on the surface of the double‐modified MMT platelets and thus improve the dispersion of MMT in PP. Fourier transform infrared, X‐ray diffraction, transmission electron microscopy, thermogravimetric analysis, scanning electron microscopy, and tensile test were used to characterize the structure of the double‐modified MMT, morphology, and the thermal and mechanical properties of the nanocomposites. The results show that PP‐g‐MA promotes the formation of exfoliated/intercalated morphology and obviously increases the thermal properties, tensile strength, and Young's modulus of the PP/double‐modified MMT nanocomposites. © 2012 Wiley Periodicals, Inc. J. Appl. Polym. Sci., 2013 相似文献
15.
新型美白剂Arlatone DCA的研究进展 总被引:2,自引:0,他引:2
讨论了新型美白剂Arlatone DCA的配方技巧和美白效果。采用FfE理论可以促进美白效果最大化,而最新的临床测试数据也证实了DCA拥有明显的美白效果。 相似文献
16.
17.
18.
19.
Stijn WH Van Hulle Peter A Vanrolleghem 《Journal of chemical technology and biotechnology (Oxford, Oxfordshire : 1986)》2004,79(10):1084-1091
Industrial wastewater treatment plants (WWTPs) have to provide 100% reliability and availability for the discharging facilities at an industrial site. Varying production schedules at these facilities and specific components occurring in the industrial wastewater considerably hinder the optimisation of industrial WWTPs. In this context it is shown in this paper that model‐based optimisation is an efficient and cost‐reducing way to ensure that an industrial WWTP functions well. The aim of the study presented was two‐fold. The first step was to show the usefulness of a proposed procedure to build and calibrate a model for the industrial WWTP. The second objective was to use the model for optimisation of the WWTP. As an example, a large set of possible production schedules in the different discharging facilities was simulated. Based on these simulations it could be predicted which schedules allow the effluent standards to be met and which do not. The calibrated and validated model was also used to investigate different operating strategies such as the in‐series operation of the two available aeration tanks. In fact, with the model it was shown that a 20% reduction of the degradable COD concentration in the effluent could be achieved by operating the tanks in series instead of in parallel. This case study shows how the approach presented can lead to fast and cost effective modelling and optimisation of an industrial WWTP. Copyright © 2004 Society of Chemical Industry 相似文献
20.
The advancements in connectivity among the entities belonging to industrial supply chain have given rise to more complex, global supply chain networks. These networks are often constituted of entities that belong to multiple such networks. Interactions among the entities in such networks are also influenced by whether they belong to the same enterprise or different ones. This work takes into consideration the effect of such interactions. The entities belonging to different enterprises are assumed to interact through auctions. An agent based simulation model that incorporates such auctions is used to represent multienterprise supply chain networks. The dynamics of the supply chain affected by the auction mechanism are investigated. Also a derivative free optimization methodology is proposed to find the optimal warehouse capacities for the minimization of total cost. © 2016 American Institute of Chemical Engineers AIChE J, 62: 3392–3403, 2016 相似文献