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

11th International Workshop on Project Management and Scheduling

作者： Cakir, Ozan Wesolowsky, George O. McMaster Univ DeGroote Sch Business Hamilton ON L8S 4M4 Canada

In this paper, we introduce the planar expropriation problem with non-rigid rectangular facilities. The facilities considered in this study are two-dimensional facilities of rectangular shape. Moreover, we allow the facility dimensions to be decision variables and introduce the concept of non-rigid facilities. Based on the geometric properties of such facilities, we developed a new formulation for this continuous covering location model which does not require employing distance measures. This model is intended to determine the location and formation of facilities simultaneously. For solving this new model, we proposed a continuous branch-and-bound framework utilizing linear approximations for the tradeoff curve associated with the facility formation alternatives. Further, we developed new problem generation and bounding strategies suitable for our particular problem structure. Computational experience shows that the branch-and-bound procedure we developed performs better than conventional mixed-integer nonlinear programming solvers BARON and SBB for solving this particular location model. (C) 2010 Published by Elsevier Ltd.

关键词： Location analysis Continuous facility location Expropriation location problem Minimal covering location problem Noxious facility location problem Aspect ratio non-rigid facilities mixed integer non-linear programming Branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

Strategic design of competing supply chain networks for inelastic demand

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2011年第10期62卷 1784-1795页

作者： Rezapour, S. Farahani, R. Zanjirani Drezner, T. Amirkabir Univ Technol Dept Ind Engn Tehran 15914 Iran Calif State Univ Fullerton Fullerton CA 92634 USA

A model for designing the network of a new entrant supply chain under inelastic demand and in the presence of pre-existing competing chains is proposed. These supply chains provide an identical product for a market area. The model considers the location of distribution centres and retail outlets on a discrete set of potential locations. The assumptions of the model are: (1) static competition between the new and pre-existing chains and (2) a probabilistic customer behaviour based on an attraction function depending on both the location and the quality of the retailers. This model also incorporates the impact of the facilities' location decisions on the operational inventory and shipment decisions. The resulting model is formulated as a mixed integer non-linear programme (MINLP). To solve the MINLP it is transformed to a linear one. We illustrate the model, discuss the results of a real-world case, and investigate the effectiveness of the proposed algorithm using randomly generated examples. Journal of the Operational Research Society (2011) 62, 1784-1795. doi:10.1057/jors.2010.146 Published online 17 November 2010

关键词： supply chains network design mixed integer non-linear programming static competition

来源：评论

学校读者我要写书评

暂无评论

Distribution Network Short Term Scheduling in Smart Grid Context

Distribution Network Short Term Scheduling in Smart Grid Con...

引用

IEEE Power and Energy Society General Meeting

作者： M. Silva H. Morais Z. A. Vale GECAD - Knowledge Engineering and Decision-Support Research Group of the Electrical Engineering Institute of Porto - Polytechnic Institute of Porto (ISEP/IPP)

ISBN: (纸本)9781457710001

The large increase of Distributed Generation (DG) in Power Systems (PS) and specially in distribution networks makes the management of distribution generation resources an increasingly important issue. Beyond DG, other resources such as storage systems and demand response must be managed in order to obtain more efficient and "green" operation of PS. More players, such as aggregators or Virtual Power Players (VPP), that operate these kinds of resources will be appearing. This paper proposes a new methodology to solve the distribution network short term scheduling problem in the Smart Grid context. This methodology is based on a Genetic Algorithms (GA) approach for energy resource scheduling optimization and on PSCAD software to obtain realistic results for power system simulation. The paper includes a case study with 99 distributed generators, 208 loads and 27 storage units. The GA results for the determination of the economic dispatch considering the generation forecast, storage management and load curtailment in each period (one hour) are compared with the ones obtained with a mixed integer non-linear programming (MINLP) approach.

关键词： Energy Resources Scheduling Genetic Algorithm mixed integer non-linear programming Power grids Genetic Algorithm (GA) mixed integer linear programming Smart grids Power system simulation storage units Energy sources Demand-Responsive Cache Memory System short duration

来源：评论

学校读者我要写书评

暂无评论

Market-based transmission expansion planning by improved differential evolution

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2010年第5期32卷 450-456页

作者： Georgilakis, Pavlos S. Natl Tech Univ Athens Elect Power Div Sch Elect & Comp Engn Athens 15780 Greece

The restructuring and deregulation has exposed the transmission planner to new objectives and uncertainties. As a result, new criteria and approaches are needed for transmission expansion planning (TEP) in deregulated electricity markets. This paper proposes a new market-based approach for TEP. An improved differential evolution (IDE) model is proposed for the solution of this new market-based TEP problem. The modifications of IDE in comparison to the simple differential evolution method are: (1) the scaling factor F is varied randomly within some range, (2) an auxiliary set is employed to enhance the diversity of the population, (3) the newly generated trial vector is compared with the nearest parent, and (4) the simple feasibility rule is used to treat the constraints. Results from the application of the proposed method on the IEEE 30-bus test system demonstrate the feasibility and practicality of the proposed IDE for the solution of TEP problem. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Competitive electricity markets Transmission expansion planning mixed integer non-linear programming Differential evolution

来源：评论

学校读者我要写书评

暂无评论

COMBINING MATHEMATICAL programming AND SYSML FOR AUTOMATED COMPONENT SIZING OF HYDRAULIC SYSTEMS

COMBINING MATHEMATICAL PROGRAMMING AND SYSML FOR AUTOMATED C...

引用

ASME International Design Engineering Technical Conferences / Computers and Information in Engineering Conference

作者： Shah, Aditya A. Paredis, Christiaan J. J. Burkhart, Roger Schaefer, Dirk Georgia Inst Technol GW Woodruff Sch Mech Engn Atlanta GA 30332 USA

ISBN: (纸本)9780791844113

In this paper, we present a framework that improves a designer's capability to determine near-optimal sizes of components for a given system architecture. Component sizing is a hard problem to solve because of competing objectives, requirements from multiple disciplines, and the need for finding a solution quickly for the architecture being considered. In current approaches, designers rely on heuristics and iterate over the multiple objectives and requirements until a satisfactory solution is found. To improve on this state of practice, we introduce advances in the following two areas: a) Formulating a component sizing problem in a manner that is convenient to designers and b) Solving the problem efficiently so that all of the imposed requirements are satisfied simultaneously and the solution obtained is mathematically optimal. An acausal, algebraic, equation-based, declarative modeling approach using mathematical programming (GAMS) is taken to solve these problems more efficiently. In addition the Systems Modeling Language (OMG SysML (TM)) is used to formulate component sizing problems to facilitate problem formulation, model reuse and the automatic generation of low-level code that can be solved using GAMS and its solvers (BARON). This framework is demonstrated by applying it to an example of a hydraulic log splitter.

关键词： MINLP CSP mixed integer non-linear programming Constraint Satisfaction Problems SysML Model Transformations Component Sizing Algebraic Equations GAMS

来源：评论

学校读者我要写书评

暂无评论

Pattern of secure bilateral transactions ensuring power economic dispatch in hybrid electricity markets

引用

APPLIED ENERGY 2009年第7-8期86卷 1000-1010页

作者： Kumar, Ashwani Gao, Wenzhong Tennessee Technol Univ Dept Elect & Comp Engn Cookeville TN 38505 USA

This paper proposes a new method for secure bilateral transactions determination ensuring economic power dispatch of the generators using new AC distribution factors for pool and bilateral coordinated markets. The new optimization problem considers simultaneous minimization of deviations from scheduled transactions and fuel cost of the generators in the network. The fuel cost has been obtained for hybrid market model and impact of different percentage of bilateral demand on fuel cost, generation share, and pattern of transactions has also been determined. The impact of optimally located unified power flow controller (UPFC) on the bilateral transactions, fuel cost and generation pattern has also been studied. The results have also been obtained for pool market model. The proposed technique has been applied on IEEE 24-bus reliability test system (RTS). (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Secure transaction matrix Transaction matrix pattern mixed integer non-linear programming UPFC location AC distribution factors

来源：评论

学校读者我要写书评

暂无评论

Some transformation techniques with applications in global optimization

引用

JOURNAL OF GLOBAL OPTIMIZATION 2009年第2-3期43卷 391-405页

作者： Lundell, Andreas Westerlund, Joakim Westerlund, Tapio Abo Akad Univ Proc Design Lab SF-20500 Turku Finland

In this paper some transformation techniques, based on power transformations, are discussed. The techniques can be applied to solve optimization problems including signomial functions to global optimality. Signomial terms can always be convexified and underestimated using power transformations on the individual variables in the terms. However, often not all variables need to be transformed. A method for minimizing the number of original variables involved in the transformations is, therefore, presented. In order to illustrate how the given method can be integrated into the transformation framework, some mixed integer optimization problems including signomial functions are finally solved to global optimality using the given techniques.

关键词： Transformation and convexification techniques Signomial functions Global optimization mixed integer non-linear programming

来源：评论

学校读者我要写书评

暂无评论

Multi-step simultaneous changes Constructive Heuristic Algorithm for Transmission Network Expansion Planning

引用

ELECTRIC POWER SYSTEMS RESEARCH 2009年第4期79卷 586-594页

作者： Bustamante-Cedeno, Enrique Arora, Sant Univ Minnesota Dept Mech Engn Ind & Syst Engn Div Minneapolis MN 55455 USA

In this paper, a Constructive Heuristic Algorithm (CHA) is presented to solve the Transmission Network Expansion Planning Problem (TNEP), a complex non-convex mixed integer non-linear programming (MINLP) problem with multiple local minima. In the proposed algorithm, the non-linearities are resolved through the following feature: when discrete decision variables are given, the model becomes linear in the continuous variables. A CHA is developed which improves the current solution by implementing multiple step simultaneous changes over a number of saturated transmission lines, in contrast to the approach traditionally followed. which implements one change at a time. Solutions to test problems are computed. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Transmission Network Expansion Planning Constructive Heuristic Algorithm mixed integer non-linear programming non-convex optimization Power deregulation

来源：评论

学校读者我要写书评

暂无评论

New secure bilateral transaction determination and study of pattern under contingencies and UPFC in competitive hybrid electricity markets

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2009年第1期31卷 23-33页

作者： Kumar, A. Chanana, S. Natl Inst Technol Dept Elect Engn Kurukshetra 136119 Haryana India

In the competitive electricity environment, the flexibility of power transactions is expected to drastically increase among the trading partners and can compromise the system security and reliability. These transactions are to be evaluated ahead of their scheduling in a day-ahead and hour-ahead market to avoid congestion and ensure their feasibility with respect to the system operating conditions. The security of the transactions has become essential in the new environment for better planning and management of competitive electricity markets. This paper proposes a new method of secure bilateral transaction determination using AC distribution factors based on the full Jacobian sensitivity and considering the impact of slack bus for pool and bilateral coordinated markets. The secure bilateral transactions have also been determined considering critical line outage contingencies cases. The bilateral transaction matrix pattern has also been determined in the presence of unified power flow controller (UPFC). The optimal location of UPFC has been determined using mixed integer non-linear programming approach. The proposed technique has been applied on IEEE 24-bus reliability test system (RTS). (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Secure transaction matrix Transaction matrix pattern mixed integer non-linear programming UPFC location AC distribution factors

来源：评论

学校读者我要写书评

暂无评论

Multiple allocation hub-and-spoke network design under hub congestion

引用

COMPUTERS & OPERATIONS RESEARCH 2009年第12期36卷 3097-3106页

作者： de Camargo, R. S. Miranda, G., Jr. Ferreira, R. P. M. Luna, H. P. Univ Fed Minas Gerais Dept Ind Engn Belo Horizonte MG Brazil Pontificia Univ Catolica Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil

The multiple allocation hub-and-spoke network design under hub congestion problem is addressed in this paper. A non-linear mixed integer programming formulation is proposed, modeling the congestion as a convex cost function. A generalized Benders decomposition algorithm has been deployed and has successfully solved standard data set instances up to 81 nodes. The proposed algorithm has also outperformed a commercial leading edge non-linear integer programming package. The main contribution of this work is to establish a compromise between the transportation cost savings induced by the economies of scale exploitation and the costs associated with the congestion effects. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Hub-and-spoke networks Benders decomposition Large scale optimization mixed integer non-linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：