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

Experimental validation of a real time energy management system for microgrids in islanded mode using a local day-ahead electricity market and MINLP

引用

ENERGY CONVERSION AND MANAGEMENT 2013年 76卷 314-322页

作者： Marzband, Mousa Sumper, Andreas Dominguez-Garcia, Jose Luis Gumara-Ferret, Ramon Catalonia Inst Energy Res IREC Barcelona Spain UPC EU Engn Tecn Ind Barcelona CITCEA UPC Dept Engn Elect Barcelona 08036 Spain Univ Politecn Cataluna EIS Engn Ind Barcelona Dept Engn Elect Ctr Innovacio Tecnol Convertidors Estat & Acciona E-08028 Barcelona Spain

Energy management systems (EMS) are vital supervisory control tools used to optimally operate and schedule Microgrids (MG). In this paper, an EMS algorithm based on mixed-integer nonlinear programming (MINLP) is presented for MG in islanding mode considering different scenarios. A local energy market (LEM) is also proposed with in this EMS to obtain the cheapest price, maximizing the utilization of distributed energy resources. The proposed energy management is based on LEM and allows scheduling the MG generation with minimum information shared sent by generation units. Load demand management is carried out by demand response concept to improve reliability and efficiency as well as to reduce the total cost of energy (COE). Simulations are performed with real data to test the performance and accuracy of the proposed algorithm. The proposed algorithm is experimentally tested to evaluate processing speed as well as to validate the results obtained from the simulation setup on a real MG Testbed. The results of the EMS-MINLP based on LEM are compared with a conventional EMS based on LEM. Simulation and experimental results show the effectiveness of the proposed algorithm which provides a reduction of 15% in COE, in comparison with conventional EMS. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Day-ahead market Energy management system Local energy market Single side auction Microgrid mixed-integer nonlinear programming Optimal scheduling and operation

来源：评论

学校读者我要写书评

暂无评论

Global optimization methods for the discrete network design problem

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2013年第Apr.期50卷 42-60页

作者： 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

This paper addresses the discrete network design problem (DNDP) with multiple capacity levels, or multi-capacity DNDP for short, 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 two global optimization methods by taking advantage of the relationship between UE and system optimal (SO) traffic assignment principles. The first method, termed as SO-relaxation, exploits the property that an optimal network design solution under SO principle can be a good approximate solution under UE principle, and successively sorts the solutions in the order of increasing total travel time under SO principle. Optimality is guaranteed when the lower bound of the total travel time of the unexplored solutions under UE principle is not less than the total travel time of a known solution under UE principle. The second method, termed as UE-reduction, adds the objective function of the Beckmann-McGuire-Winsten transformation of UE traffic assignment to the constraints of the SO-relaxation formulation of the multi-capacity DNDP. This constraint is convex and strengthens the SO-relaxation formulation. We also develop a dynamic outer-approximation scheme to make use of the state-of-the-art mixed-integer linear programming solvers to solve the SO-relaxation formulation. Numerical experiments based on a two-link network and the Sioux-Falls network are conducted. (C) 2013 Elsevier Ltd. All rights reserved.

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

来源：评论

学校读者我要写书评

暂无评论

Optimising production and distribution operations in large water supply networks: A piecewise linear optimisation approach

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2013年第23-24期51卷 7170-7189页

作者： Verleye, Derek Aghezzaf, El-Houssaine Univ Ghent Dept Ind Management Fac Engn B-9000 Ghent Belgium

Optimal planning of water production and distribution operations in large pressurised water supply networks is one of the most challenging problems in production planning. Its underlying optimisation model is typically formulated as a mixed-integer nonlinear programme (MINLP) involving a large number of nonconvex hydraulic constraints. This makes the optimisation task in an actual water supply network particularly complex. After a brief overview of the existing literature on water supply optimisation, we highlight the major similarities and differences between the water production and distribution operations planning problem and the common production planning problems, and discuss its specific challenges. We then present a complete and sufficiently accurate optimisation model to generate feasible operating plans for water production and distribution in a typical large-scale network. Next, we propose a heuristic method, based on piecewise linearisation, to determine close to optimal solutions in reasonable computational time. Results obtained for some instances generated from an actual drinking water network operated by De Watergroep in Flanders, Belgium, are reported and discussed. Finally, some concluding remarks on the computational difficulties to solve practical water supply optimisation instances in large-scale networks are presented.

关键词： large-scale production and supply networks mixed-integer nonlinear programming cost and energy efficiency piecewise linear approximation

来源：评论

学校读者我要写书评

暂无评论

Siting and Sizing of Facilities under Probabilistic Demands

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2013年第1期158卷 284-304页

作者： 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 Inst Telecomunicacoes Coimbra Portugal Virginia Polytech Inst & State Univ Grado Dept Ind & Syst Engn Blacksburg VA 24061 USA Univ Coimbra Dept Civil Engn Coimbra Portugal

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

来源：评论

学校读者我要写书评

暂无评论

Cyclic Cleaning Scheduling of Industrial Boiler Based on Steepest Descent Approximate Linear programming

引用

IFAC Proceedings Volumes 2013年第13期46卷 478-483页

作者： Yan Zhaoyang Ma Xin Gao Dong Liu Pingping Zhang Beike College of Information Science and Technology Beijing University of Chemical Technology Beijing China

In this paper, the planning for the multi-period cleaning of an industrial boiler is formulated as a mixed-integer nonlinear program (MINLP). The objective function accounted for both the cost of fuel consumption and boiler cleaning & maintenance costs. And a subsection method was proposed for solving the MINLP problem using the steepest descent approximate linear programming (SDALP), which exhibits the advantages of the approximate linear programming (ALP) algorithm, such as easy implementation and convenient solution, and then introduces the principle of purposeful search and rapid convergence via the steepest descent method. This new method can eliminate the negative effect of the subjective step restriction and reduction coefficient, improve the convergence speed, and enhance the solution accuracy. The computation time for the method was proportional to the number of periods, and global solution of the MINLP was guaranteed. At last, the effectiveness of the proposed method was illustrated with an example.

关键词： cyclic cleaning of industrial boiler scheduling algorithm steepest descent approximate linear programming mixed-integer nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A trust region SQP algorithm for mixed-integer nonlinear programming

引用

OPTIMIZATION LETTERS 2007年第3期1卷 269-280页

作者： Exler, Oliver Schittkowski, Klaus Univ Bayreuth Dept Comp Sci D-95440 Bayreuth Germany CSIC IIM Spanish Council Sci Res Proc Engn Grp Vigo 36208 Spain

We propose a modified sequential quadratic programming method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when in-or decrementing an integer value, successive quadratic approximations are applied. The algorithm is stabilized by a trust region method with Yuan's second order corrections. It is not assumed that the mixed-integer program is relaxable or, in other words, function values are evaluated only at integer points. The Hessian of the Lagrangian function is approximated by a quasi-Newton update formula subject to the continuous and integer variables. Numerical results are presented for a set of 80 mixed-integer test problems taken from the literature. The surprising result is that the number of function evaluations, the most important performance criterion in practice, is less than the number of function calls needed for solving the corresponding relaxed problem without integer variables.

关键词： mixed-integer nonlinear programming Sequential quadratic programming SQP Trust region methods

来源：评论

学校读者我要写书评

暂无评论

A STRONG DUAL FOR CONIC mixed-integer PROGRAMS

引用

SIAM JOURNAL ON OPTIMIZATION 2012年第3期22卷 1136-1150页

作者： Moran R, Diego A. Dey, Santanu S. Vielma, Juan Pablo Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA Univ Pittsburgh Dept Ind Engn Pittsburgh PA 15260 USA

mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [M. Guzelsoy and T. K. Ralphs, Int. J. Oper. Res. (Taichung), 4 (2007), pp. 118-137], [G. L. Nemhauser and L. A. Wolsey, integer and Combinatorial Optimization, Wiley-Interscience, New York, 1988]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we show that strong duality holds.

关键词： mixed-integer nonlinear programming conic programming duality cutting planes

来源：评论

学校读者我要写书评

暂无评论

mixed-integer nonlinear programs featuring "on/off" constraints

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2012年第2期52卷 537-558页

作者： Hijazi, Hassan Bonami, Pierre Cornuejols, Gerard Ouorou, Adam Ecole Polytech LIX F-91128 Palaiseau France Aix Marseille Univ CNRS LIF Marseille France Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA Orange Labs R&D CORE TPN F-92794 Issy Les Moulineaux 9 France

In this paper, we study MINLPs featuring "on/off" constraints. An "on/off" constraint is a constraint f(x)a parts per thousand currency sign0 that is activated whenever a corresponding 0-1 variable is equal to 1. Our main result is an explicit characterization of the convex hull of the feasible region when the MINLP consists of simple bounds on the variables and one "on/off" constraint defined by an isotone function f. When extended to general convex MINLPs, we show that this result yields tight lower bounds compared to classical formulations. This allows us to introduce new models for the delay-constrained routing problem in telecommunications. Numerical results show gains in computing time of up to one order of magnitude compared to state-of-the-art approaches.

关键词： mixed-integer nonlinear programming "on/off" constraints Disjunctive constraints Convex programming Delay-constrained routing problems

来源：评论

学校读者我要写书评

暂无评论

Scheduling of crude oil operations under demand uncertainty: A robust optimization framework coupled with global optimization

引用

AICHE JOURNAL 2012年第8期58卷 2373-2396页

作者： Li, Jie Misener, Ruth Floudas, Christodoulos A. Princeton Univ Dept Chem & Biol Engn Princeton NJ 08544 USA

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. (C) 2011 American Institute of Chemical Engineers AIChE J, 58: 23732396, 2012

关键词： refinery crude oil scheduling mixed-integer nonlinear programming nonconvex global optimality robust optimization

来源：评论

学校读者我要写书评

暂无评论

On the optimal design of water distribution networks: a practical MINLP approach

引用

OPTIMIZATION AND ENGINEERING 2012年第2期13卷 219-246页

作者： Bragalli, Cristiana D'Ambrosio, Claudia Lee, Jon Lodi, Andrea Toth, Paolo Univ Bologna DEIS I-40136 Bologna Italy Univ Bologna DISTART I-40136 Bologna Italy IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA

We propose a practical solution method for real-world instances of a water-network optimization problem with fixed topology using a nonconvex continuous NLP (nonlinear programming) relaxation and a MINLP (mixed integer nonlinear programming) search. Our approach employs a relatively simple and accurate model that pays some attention to the requirements of the solvers that we employ. Our view is that in doing so, with the goal of calculating only good feasible solutions, complicated algorithmics can be confined to the MINLP solver. We report successful computational experience using available open-source MINLP software on problems from the literature and on difficult real-world instances. An important contribution of this paper is that the solutions obtained, besides being low cost, are immediately usable in practice because they are characterized by an allocation of diameters to pipes that leads to a correct hydraulic operation of the network. This is not the case for most of the other methods presented in the literature.

关键词： Water network design mixed-integer nonlinear programming Modeling Computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：