检索结果-内蒙古大学图书馆

Joint optimization of oil well placement and controls

COMPUTATIONAL GEOSCIENCES 2012年第4期16卷 1061-1079页

作者： Bellout, Mathias C. Ciaurri, David Echeverria Durlofsky, Louis J. Foss, Bjarne Kleppe, Jon NTNU Dept Petr Engn & Appl Geophys Ctr Integrated Operat Petr Ind Trondheim Norway IBM Corp TJ Watson Res Ctr Dept Petr & Energy Analyt Yorktown Hts NY USA Stanford Univ Dept Energy Resources Engn Stanford CA 94305 USA NTNU Dept Engn Cybernet Ctr Integrated Operat Petr Ind Trondheim Norway

Well placement and control optimization in oil field development are commonly performed in a sequential manner. In this work, we propose a joint approach that embeds well control optimization within the search for optimum well placement configurations. We solve for well placement using derivative-free methods based on pattern search. Control optimization is solved by sequential quadratic programming using gradients efficiently computed through adjoints. Joint optimization yields a significant increase, of up to 20% in net present value, when compared to reasonable sequential approaches. The joint approach does, however, require about an order of magnitude increase in the number of objective function evaluations compared to sequential procedures. This increase is somewhat mitigated by the parallel implementation of some of the pattern-search algorithms used in this work. Two pattern-search algorithms using eight and 20 computing cores yield speedup factors of 4.1 and 6.4, respectively. A third pattern-search procedure based on a serial evaluation of the objective function is less efficient in terms of clock time, but the optimized cost function value obtained with this scheme is marginally better.

关键词： Oil production optimization Optimal oil well placement Simulation-based optimization Derivative-free optimization Adjoint methods mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A SYSTEM-OPTIMUM RELAXATION BASED APPROACH TO DISCRETE NETWORK DESIGN PROBLEMS

A SYSTEM-OPTIMUM RELAXATION BASED APPROACH TO DISCRETE NETWO...

引用

17th International Conference of Hong-Kong-Society-for-Transportation-Studies (HKSTS)

作者： Wang, Shuaian Meng, Qiang Yang, Hai Univ Wollongong Sch Math & Appl Stat Wollongong NSW 2522 Australia Natl Univ Singapore Dept Civil & Environm Engn Singapore 117576 Singapore Hong Kong Univ Sci & Technol Dept Civil & Environm Engn Kowloon Hong Kong Peoples R China

ISBN: (纸本)9789881581419

We address the discrete network design problem (DNDP) which determines the optimal number of lanes to add to each candidate link in a road network. We formulate the problem as a bi-level programming model, where the upper level aims to minimize the total travel time via adding new lanes to candidate links and the lower level is a traditional Wardrop user equilibrium (UE) problem. We propose a global optimization method that is based on the system-optimum relaxation of the UE model. Numerical examples are given.

关键词： Discrete network design problem Bi-level programming Traffic equilibrium Network optimization mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

On branching rules for convex mixed-integer nonlinear optimization

引用

ACM Journal of Experimental Algorithmics 2013年第PP2.1–2.31期18卷 2.1–2.31页

作者： Pierre Bonami Jon Lee Sven Leyffer Andreas Wächter CNRS Université Aix Marseille Marseille France University of Michigan MI USA Argonne National Laboratory IL USA Northwestern University Evanston IL USA

Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex mixed-integer nonlinear programming (MINLP) problems. It is well-known that carrying out branching in a nonsimplistic manner can greatly enhance the practicality of B&B in the context of mixed-integer Linear programming (MILP). No detailed study of branching has heretofore been carried out for MINLP. In this article, we study and identify useful sophisticated branching methods for MINLP, including novel approaches based on approximations of the nonlinear relaxations by linear and quadratic programs.

关键词： mixed-integer nonlinear programming Strong-Branching branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

Solving reliability redundancy allocation problems using an artificial bee colony algorithm

引用

COMPUTERS & OPERATIONS RESEARCH 2011年第11期38卷 1465-1473页

作者： Yeh, Wei-Chang Hsieh, Tsung-Jung Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu 30013 Taiwan

This paper proposed a penalty guided artificial bee colony algorithm (ABC) to solve the reliability redundancy allocation problem (RAP). The redundancy allocation problem involves setting reliability objectives for components or subsystems in order to meet the resource consumption constraint, e.g. the total cost. RAP has been an active area of research for the past four decades. The difficulty that one is confronted with the RAP is the maintenance of feasibility with respect to three nonlinear constraints, namely, cost, weight and volume related constraints. In this paper nonlinearly mixed-integer reliability design problems are investigated where both the number of redundancy components and the corresponding component reliability in each subsystem are to be decided simultaneously so as to maximize the reliability of the system. The reliability design problems have been studied in the literature for decades, usually using mathematical programming or heuristic optimization approaches. To the best of our knowledge the ABC algorithm can search over promising feasible and infeasible regions to find the feasible optimal/near-optimal solution effectively and efficiently;numerical examples indicate that the proposed approach performs well with the reliability redundant allocation design problems considered in this paper and computational results compare favorably with previously-developed algorithms in the literature. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Reliability design Redundancy allocation problem Artificial bee colony algorithm mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Tree network design avoiding congestion

引用

APPLIED MATHEMATICAL MODELLING 2011年第9期35卷 4175-4188页

作者： Miranda, G. Luna, H. P. de Camargo, R. S. Pinto, L. R. Univ Fed Minas Gerais Dept Prod Engn BR-30161010 Belo Horizonte MG Brazil Univ Fed Alagoas Inst Comp BR-57072970 Maceio Alagoas Brazil

We introduce in this paper an optimal method for tree network design avoiding congestion. We see this problem arising in telecommunication and transportation networks as a flow extension of the Steiner problem in directed graphs, thus including as a particular case any alternative approach based on the minimum spanning tree problem. Our multi-commodity formulation is able to cope with the design of centralized computer networks, modern multi-cast multi-party or hub-based transportation trees. The objective in such cases is the minimization of the sum of the fixed (structural) and variable (operational) costs of all the arcs composing an arborescence that links the origin node (switching center, server, station) to every demand node (multi-cast participants, users in general). The nonlinear multi-commodity flow model is solved by a generalized Benders decomposition approach. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Multi-commodity network design flow problems Generalized Benders decomposition mixed-integer nonlinear programming Steiner tree problems

来源：评论

学校读者我要写书评

暂无评论

Hydro energy systems management in Portugal: Profit-based evaluation of a mixed-integer nonlinear approach

引用

ENERGY 2011年第1期36卷 500-507页

作者： Catalao, J. P. S. Pousinho, H. M. I. Mendes, V. M. F. Univ Beira Interior Dept Electromech Engn P-6201001 Covilha Portugal Univ Tecn Lisbon Inst Super Tecn Ctr Innovat Elect & Energy Engn P-1049001 Lisbon Portugal Inst Super Engn Lisboa Dept Elect Engn & Automat P-1950062 Lisbon Portugal

In this paper, a novel mixed-integer nonlinear approach is proposed to solve the short-term hydro scheduling problem in the day-ahead electricity market, considering not only head-dependency, but also start/stop of units, discontinuous operating regions and discharge ramping constraints. Results from a case study based on one of the main Portuguese cascaded hydro energy systems are presented, showing that the proposed mixed-integer nonlinear approach is proficient. Conclusions are duly drawn. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Short-term hydro scheduling mixed-integer nonlinear programming Cascaded reservoirs Head-dependency

来源：评论

学校读者我要写书评

暂无评论

A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling

引用

COMPUTERS & CHEMICAL ENGINEERING 2011年第12期35卷 2750-2766页

作者： Mouret, Sylvain Grossmann, Ignacio E. Pestiaux, Pierre Carnegie Mellon Univ Dept Chem Engn Pittsburgh PA 15213 USA Total Refining & Mkt Div Res F-76700 Harfleur France

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. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Refinery planning Crude-oil scheduling mixed-integer nonlinear programming Lagrangian decomposition

来源：评论

学校读者我要写书评

暂无评论

Siting and Sizing of Facilities under Probabilistic Demands

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2011年第2期149卷 420-440页

作者： Fernandes, Luis M. Judice, Joaquim J. Sherali, Hanif D. Antunes, Antonio P. Inst Politecn Tomar Tomar Portugal Inst Telecomunicacoes Tomar Portugal Univ Coimbra Dept Matemat P-3000 Coimbra Portugal Univ Coimbra Dept Engn Civil P-3000 Coimbra Portugal Inst Telecomunicacoes Coimbra Portugal Virginia Polytech Inst & State Univ Grado Dept Ind & Syst Engn Blacksburg VA USA

In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance from facilities and to their size. It is also assumed that facilities must satisfy a threshold level of demand (facilities are not economically viable below that level). A mixed-integer nonlinear programming (MINLP) model is proposed for this problem. A branch-and-bound algorithm is designed for solving this MINLP and its convergence to a global minimum is established. A finite procedure is also introduced to find a feasible solution for the MINLP that reduces the overall search in the binary tree generated by the branch-and-bound algorithm. Some numerical results using a GAMS/MINOS implementation of the algorithm are reported to illustrate its efficacy and efficiency in practice.

关键词： Facility location models mixed-integer nonlinear programming Discrete optimization Global optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal storage design for a multi-product plant: A non-convex MINLP formulation

引用

COMPUTERS & CHEMICAL ENGINEERING 2011年第2期35卷 255-271页

作者： Rebennack, Steffen Kallrath, Josef Pardalos, Panos M. Univ Florida Dept Ind & Syst Engn Ctr Appl Optimizat Gainesville FL 32611 USA Univ Florida Dept Astron Gainesville FL 32611 USA Sci Comp GVC S BASF SE D-67056 Ludwigshafen Germany

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. (c) 2010 Elsevier Ltd. All rights reserved.

关键词： mixed-integer nonlinear programming Global optimization Storage design Cycle time Campaign length Lot sizing problem Continuous-time model

来源：评论

学校读者我要写书评

暂无评论

Application of an advanced real options approach for renewable energy generation projects planning

引用

RENEWABLE & SUSTAINABLE ENERGY REVIEWS 2011年第4期15卷 2087-2094页

作者： Martinez-Cesena, E. A. Mutale, J. Univ Manchester Sch Elect & Elect Engn Manchester M60 1QD Lancs England

Nowadays, there is growing interest in renewable energy (RE) generation projects due to environmental and sustainability concerns. However, initial costs and uncertainties caused by RE source variability, changes in support schemes, and other factors can render RE projects unattractive when subject to conventional financial assessment. Initial research suggests that the value of RE projects can be enhanced by the application of real options (RO) theory in the planning and evaluation of such projects. Literature on application of RO planning in RE generation projects is limited, and typically focuses solely on flexible investment decisions and neglects flexible design A more comprehensive approach should address flexibility in designs. This paper proposes an advanced RO methodology for RE generation projects planning, and illustrates the methodology using variations of a hydropower case study. The fundamental differences between advanced RO approaches and other techniques are illustrated on a simple case study. The complete version of the proposed advanced methodology is then compared against other available tools. The results show higher expected profits for projects planned with the advanced RO methodology. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Real options (RO) Uncertainty Optimization mixed-integer nonlinear programming Hydropower

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：