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

Using mixed integer programming for the volt/var optimization in distribution feeders

ELECTRIC POWER SYSTEMS RESEARCH 2013年 98卷 39-50页

作者： Borghetti, Alberto Univ Bologna I-40126 Bologna Italy

One of the functions that characterize modern management systems of electric power distribution networks is the periodical short-term optimization of the operating conditions. Such a function is typically designated as volt/var optimization (VVO). The usual objective is the minimization of network loss or demand. The main constraints are the maximum current values in lines or transformers and a few percentage point deviation of bus voltages from the rated value. WO exploits the availability of two-way communication and the possibility to control transformer load tap changers, switchable capacitor banks, and reactive outputs of specific embedded generators (being active outputs often fixed by market decisions or by energy resource characteristics). The use of mixed integer linear programming (MILP) appears to have been less explored than other approaches for the solution of WO problems. This paper presents a MILP model that includes the approximate representation of the main characteristics and constraints of short-term distribution system operation. The quality of the results obtained for different test feeders in various operating conditions and the corresponding performances of the solver appear promising for online applications. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Distribution management systems Volt/var optimization Load tap changers Switchable capacitor banks Embedded generation mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Robust location transportation problems under uncertain demands

引用

DISCRETE APPLIED MATHEMATICS 2014年第Part1期164卷 100-111页

作者： Gabrel, V. Lacroix, M. Murat, C. Remli, N. Univ Paris 09 Lamsade F-75775 Paris 16 France

In robust optimization, the multi-stage context (or dynamic decision-making) assumes that the information is revealed in stages. So, part of the decisions must be taken before knowing the real values of the uncertain parameters, and another part, called recourse decisions, is taken when the information is known. In this paper, we are interested in a robust version of the location transportation problem with an uncertain demand using a 2-stage formulation. The obtained robust formulation is a convex (not linear) program, and we apply a cutting plane algorithm to exactly solve the problem. At each iteration, we have to solve an NPhard recourse problem in an exact way, which is time-consuming. Here, we go further in the analysis of the recourse problem of the location transportation problem. In particular, we propose a mixed integer program formulation to solve the quadratic recourse problem and we define a tight bound for this reformulation. We present an extensive computation analysis of the 2-stage robust location transportation problem. The proposed tight bound allows us to solve large size instances. (c) 2011 Elsevier B.V. All rights reserved.

关键词： Robust optimization Interval uncertainty Convex optimization mixed integer linear programming Location transportation problem

来源：评论

学校读者我要写书评

暂无评论

A multi-objective mixed-integer programming model for a multi-floor facility layout

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2013年第14期51卷 4223-4239页

作者： Hathhorn, Jonathan Sisikoglu, Esra Sir, Mustafa Y. Univ Missouri Dept Ind & Mfg Engn Columbia MO 65211 USA

We consider a multi-floor facility layout problem in which the overall length and width of the facility, the size and location of each department, the number and the location of elevators and the number of floors in the facility are all modelled as decision variables. We adapt a linear approximation scheme to represent the area of each department. We consider two objective functions in our model, namely minimising material handling and facility building costs, and propose a lexicographic ordering technique to handle multiple objectives. The numerical experiments show that the slack used in the lexicographic ordering approach has a significant impact on the optimal solution. The experiments also show that the material handling cost can be significantly reduced in a multi-floor facility compared with a single-floor facility.

关键词： facility layout mixed integer linear programming multi-criteria decision making optimisation lexicographic ordering multi-floor facility layout

来源：评论

学校读者我要写书评

暂无评论

On Reducing a Quantile Optimization Problem with Discrete Distribution to a mixed integer programming Problem

引用

AUTOMATION AND REMOTE CONTROL 2013年第6期74卷 951-967页

作者： Kibzun, A. I. Naumov, A. V. Norkin, V. I. Moscow State Aviat Inst Moscow Russia Natl Acad Sci Ukraine VM Glushkov Cybernet Inst Kiev Ukraine

We propose an equivalent reduction of the quantile optimization problem with a discrete distribution of random parameters to a partially integer programming problem of large dimension. The number of integer (Boolean) variables in this problem equals the number of possible values for the random parameters vector. The resulting problems can be solved with standard discrete optimization software. We consider applications to quantile optimization of a financial portfolio and show results of numerical experiments.

关键词： QUANTILES DISCRETE uniform distribution mixed integer linear programming STOCHASTIC processes NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

An Aggregator for Demand Side Management at Domestic Level Including PEVs

An Aggregator for Demand Side Management at Domestic Level I...

引用

2014 IEEE International Electric Vehicle Conference (IEVC)

作者： Baccino, Francesco Grillo, Samuele Massucco, Stefano Mauri, Giuseppe Mora, Paolo Silvestro, Federico Univ Genoa DITEN Via All Opera Pia 11A I-16145 Genoa Italy Politecn Milan DEIB I-20133 Milan Italy RSE SpA I-20134 Milan Italy

ISBN: (纸本)9781479960750

The increasing availability of electrical equipment characterized by high efficiency and controllability is helping to increase the energy needs in the residential sector through the electric vector. In order to avoid congestion and stressed distribution infrastructure it is appropriate to manage in an optimized way the residential loads. This is also made possible by the new trends in ICT technologies, that are spreading all over. In this way, the needs of distributors (Distribution System Operators-DSOs and end-users can be scheduled optimally achieving win-win interaction. End-users can indeed benefit from an optimization-oriented maximum savings. DSOs or aggregators can also implement different objectives (economic or security) established at a higher level. The work is focused on the formulation of the mathematical problem.

关键词： Demand side management mixed integer linear programming optimization

来源：评论

学校读者我要写书评

暂无评论

A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs

引用

International Journal of Systems Science: Operations and Logistics 2014年第2期1卷 94-104页

作者： Mazdeh, Mohammad Mahdavi Rostami, Mohammad Department of Industrial Engineering Iran University of Science & Technology Tehran Iran

Manufacturers often dispatch jobs in batches to reduce delivery costs. However, this technique can have a negative effect on other scheduling-related objective functions such as minimising maximum tardiness. This paper aims to minimise the maximum tardiness and the sum of delivery costs of a two-machine flow-shop problem in a batch delivery system. It is proven in the literature that this problem is NP-complete. We present a mixed integer linear programming (MILP) model to solve the problem. As this is an MILP model, the commercial solver (the GAMS software using CPLEX solver) is not guaranteed to find the optimal solution for large-size problems at a logical CPU run time. Therefore, a branch-and-bound (B&B) algorithm is proposed for obtaining the optimum solution. Additionally, an upper bound (UB) heuristic with a quick processing time is presented. These methods are evaluated using randomly generated instances and the results indicate the efficiency of the B&B and UB heuristic algorithms. © 2014, © 2014 Taylor & Francis.

关键词： batched delivery system branch-and-bound algorithm maximum tardiness mixed integer linear programming two-machine flow-shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Minimizing Commercial Building Cost in Smart Grid: An Optimal Meeting Scheduling Approach

Minimizing Commercial Building Cost in Smart Grid: An Optima...

引用

2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Chai, Bo Costa, Alberto Ahipasaoglu, Selin Damla Huang, Shisheng Yuen, Chau Yang, Zaiyue Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Peoples R China Singapore Univ Technol & Design Sinagpore 138682 Singapore

ISBN: (纸本)9781479949342

We develop a mathematical programming approach to schedule meetings in an organization over a fixed period of time, while minimizing the wasted energy and possibly achieving more balanced demand distribution. The problem is formulated as a mixed integer linear program subject to a set of realistic constraints including people's available time slots and energy consumption characteristics of the meeting rooms. Two objective functions are considered: minimizing the total energy used and minimizing the total energy cost. Our simulations illustrate that using the optimal schedule may result in significant savings, both economical and environmental.

关键词： smart grid demand response meeting scheduling mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Asset Routing Problem within a Dynamic Environment

Multi-Objective Asset Routing Problem within a Dynamic Envir...

引用

4th IEEE International Advance Computing Conference (IACC)

作者： Mishra, Manisha Han, Xu Ayala, Diego F. M. Sidoti, David Pattipati, Krishna An, Woosun Klienman, David L. Univ Connecticut Dept Elect & Comp Engn Storrs CT 06269 USA SIMNET Co Ltd Seoul South Korea Naval Post Grad Sch Monterey CA USA

ISBN: (纸本)9781479925711

Coordination among maritime assets is crucial for reducing task latencies and enabling the effectiveness and success of the mission. Specifically, determining when the assets are dispatched to task locations, optimizing how the assets traverse to the task location, and how much time the assets wait at various intermediate points on the way to task location is a difficult problem due to dynamic and uncertain characteristics of the mission environment. In this paper, motivated by the navy's relevant operational needs to effectively route search assets in a dynamic mission environment, we consider a coordinated asset routing problem within a multi-objective framework allowing for stopping en route. The key objective is to find routes for a set of assets, given the start and end locations, such that the total traversal time, dispatch time and the wait time at each intermediate location is minimized. Given a task graph over Time-dependent Multi-objective (TM) risk maps, we formulate and solve a Time-dependent Multi-objective Shortest Path (TMSP) problem to determine asset routes in a multi-task scenario. We employ the method of compromised solution along with mixed integer linear programming to solve this NP-hard problem. Numerical results are provided by applying our proposed approach to an asset routing mission scenario.

关键词： Time-Dependent Multi-Objective Shortest Path mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Finding the Best Sink Location in WSNs with Reliability Route Analysis

Finding the Best Sink Location in WSNs with Reliability Rout...

引用

5th International Conference on Ambient Systems, Networks and Technologies (ANT) / 4th International Conference on Sustainable Energy Information Technology (SEIT)

作者： Hassan, Marwa M. Ramadan, Rabie A. El Boghdadi, Hatem M. Cairo Univ Fac Engn Giza 12613 Egypt

Wireless Sensor Network (WSN) became one of the emerged networks that are used in many critical applications. One of the challenges of the network is the energy source of its sensors since sensors depends, in most of the cases, on a double AA batteries and they are supposed to live for long time. One of the important methods to save sensors energy is to reduce the messages flow transferred to the sink node in a multi-hop wireless sensor networks. To do so, this paper investigates the best location to the sink node to maximize the reliability of a message delivery before it is being received and processed by a sink. The paper introduces the optimal location solution through utilizing the mixed integer linear programming (MILP) solution to the problem in smallscale WSNs. Consequently, maximum reliability of a path may lead to the minimum energy consumed for retransmission along the routing path. However, in large-scale networks, the paper introduces the Genetic Algorithm (GA) as one of the heuristics solution. The Fitness function of the GA calculates the negative value of the log of the reliability of a path and the GA tries to find the sink position with the minimum fitness value to minimize the energy spent by each sensor in the routing towards the sink.. An extensive set of experiments are introduced and the MILP solution results are compared to GA approach for the GA performance measure. The comparison showed that the GA have found near optimal solution in reasonable time. In addition, GA is utilized in large-scale problems as well. (C) 2014 Published by Elsevier B.V.

关键词： Genetic Algorithm mixed integer linear programming sink location reliability routing wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Research on Wind Power Integration Capacity of Hydro-Thermal-Wind Power System with Energy Storage System

Research on Wind Power Integration Capacity of Hydro-Thermal...

引用

International Conference on Renewable Energy and Environmental Technology (REET 2013)

作者： Li, Feng Zhang, Lizi Wang, Yunyun Feng, Junshu North China Elect Power Univ Beijing Peoples R China

ISBN: (纸本)9783037859124

With the fast development of clean energy in China, the conflict between limited peak load regulation capability and the increasing installed wind power capacity became more and more obvious. Two different wind power integration dispatching modes were proposed in this paper, meanwhile, the wind power integration capacity and system economy under different scenarios, which have different wind power penetration and energy storage system(ESS) capacity, were also analyzed. As indicated in the example analysis, the ESS can significantly enhance the wind power integration capacity;and the economical wind power integration dispatching mode is the most suitable choice for the power grid in wind-rich area.

关键词： optimal scheduling mixed integer linear programming wind power integration capacity peak load regulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：