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

IEEE Conference on Decision and Control

作者： Samuel Chevalier Mads R. Almassalkhi Department of Wind and Energy Systems Denmark’s Technical University (DTU) Kongens Lyngby Denmark Electrical Engineering University of Vermont (UVM) Burlington Pacific Northwest National Laboratory (PNNL) Richland WA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

For fast timescales or long prediction horizons, the AC optimal power flow (OPF) problem becomes a computational challenge for large-scale, realistic AC networks. To overcome this challenge, this paper presents a novel network reduction methodology that leverages an efficient mixed-integer linear programming (MILP) formulation of a Kron-based reduction that is optimal in the sense that it balances the degree of the reduction with resulting modeling errors in the reduced network. The method takes as inputs the full AC network and a pre-computed library of AC load flow data and uses the graph Laplacian to constraint nodal reductions to only be feasible for neighbors of non-reduced nodes. This results in a highly effective MILP formulation which is embedded within an iterative scheme to successively improve the Kron-based network reduction until convergence. The resulting optimal network reduction is, thus, grounded in the physics of the full network. The accuracy of the network reduction methodology is then explored for a 100+ node medium-voltage radial distribution feeder example across a wide range of operating conditions. It is finally shown that a network reduction of 25-85% can be achieved within seconds and with worst-case voltage magnitude deviation errors within any super node cluster of less than 0.01pu. These results illustrate that the proposed optimization-based approach to Kron reduction of networks is viable for larger networks and suitable for use within various power system applications.

关键词： Laplace equations Medium voltage Libraries Power systems mixed integer linear programming Iterative methods Physics

来源：评论

学校读者我要写书评

暂无评论

Multi-objective vehicle routing and loading with time window constraints: a real-life application

引用

ANNALS OF OPERATIONS RESEARCH 2020年第1-2期291卷 799-825页

作者： Song, Xiang Jones, Dylan Asgari, Nasrin Pigden, Tim Univ Portsmouth Sch Math & Phys Ctr Operat Res & Logist Lion Gate BldgLion Terrace Portsmouth P01 3HF England Univ Roehampton Roehampton Business Sch London SW15 5SL England Optrak Distribut Software Ltd Suite 6Hoe Lane Ware SG12 9LR Herts England

Motivated by a real-life application, this research considers the multi-objective vehicle routing and loading problem with time window constraints which is a variant of the Capacitated Vehicle Routing Problem with Time Windows with one/two-dimensional loading constraints. The problem consists of routing a number of vehicles to serve a set of customers and determining the best way of loading the goods ordered by the customers onto the vehicles used for transportation. The three objectives pertaining to minimisation of total travel distance, number of routes to use and total number of mixed orders in the same pallet are, more often than not, conflicting. To achieve a solution with no preferential information known in advance from the decision maker, the problem is formulated as a mixed integer linear programming (MILP) model with one objective-minimising the total cost, where the three original objectives are incorporated as parts of the total cost function. A Generalised Variable Neighbourhood Search (GVNS) algorithm is designed as the search engine to relieve the computational burden inherent to the application of the MILP model. To evaluate the effectiveness of the GVNS algorithm, a real instance case study is generated and solved by both the GVNS algorithm and the software provided by our industrial partner. The results show that the suggested approach provides solutions with better overall values than those found by the software provided by our industrial partner.

关键词： Routing and loading mixed integer linear programming Generalised Variable Neighbourhood Search

来源：评论

学校读者我要写书评

暂无评论

Single mode resource constrained project scheduling with unreliable resources

引用

OPERATIONAL RESEARCH 2020年第3期20卷 1369-1403页

作者： Chakrabortty, Ripon K. Sarker, Ruhul A. Essam, Daryl L. Univ New South Wales Sch Engn & Informat Technol Canberra ACT 2600 Australia

Over the last few decades, resource constrained project scheduling has been widely studied. In real life, resources may fail or be interrupted due to various reasons. They then require reactive rescheduling to minimize the effect of such disruptions. During the course of a project, a single or a series of independent disruptions may take place where the disruption information is not known a priori. In this paper, we have formulated two discrete time based models to deal with two types of disruption scenarios. We have also proposed a solution approach that can deal with a single, as well as a series of independent disruptions, in a reactive rescheduling manner. To judge the performance of the proposed approach, a number of test instances from the Project Scheduling Library were combined with randomly generated disruption events. The computational experiments were also conducted to analyse the effects of different factors related to the disruption recovery process.

关键词： Resource constrained project scheduling Rescheduling Disruption mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Fast Solution Method for Large-Scale Unit Commitment Based on Virtual Power Boundary

A Fast Solution Method for Large-Scale Unit Commitment Based...

引用

Chinese Automation Congress (CAC)

作者： Can Liu Qiaozhu Zhai Yuzhou Zhou Systems Engineering Institute Xi’an Jiaotong University Xi’an China

This paper investigates the fast solution difficulty for large-scale unit commitment (UC) problems. The UC problem is a typical puzzle in the scheduling of power systems. Lagrangian relaxation (LR) and mixed-integer linear programming (MILP) are the two most widely adopted methods. However, in the LR framework, constructing feasible solutions and updating Lagrangian multipliers are two major challenges, and the efficiency of MILP methods is restricted by the scale of UC problems. To this end, this paper proposes a new fast solution method for large-scale UC based on virtual power boundary. Specifically, first, an initial trial solution is obtained based on the established state transition diagram. Second, a feasibility test model based on virtual power boundary is established to check the feasibility of trial UC solutions effectively. Third, the updating strategies for UC solutions are proposed based on the feasible gap solved by the feasibility test model. The procedure is implemented until a good feasible UC solution is obtained. Numerical results implemented on IEEE 24-bus, IEEE 31-bus, IEEE 118-bus, and Polish 2383-bus systems show the efficiency of the proposed method.

关键词： Automation Stochastic processes Numerical models Power systems mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Network-aware operational strategies to provide (flexibility) services from Local Energy Community

Network-aware operational strategies to provide (flexibility...

引用

International Universities Power Engineering Conference (UPEC)

作者： Thien-An Nguyen-Huu Trung Thai Tran Phuong H. Nguyen Jg Slootweg Department of Electrical Engineering Eindhoven University of Technology Eindhoven The Netherlands Enexis Netbeheer’s-Hertogenbosch The Netherlands

ISBN: (数字)9781665455053

ISBN: (纸本)9781665455060

This paper proposes the network-aware operational strategies to provide (flexibility) services from Local Energy Community (LEC) by maximizing their profit based on the optimized operation of battery energy storage system (BESS), considering the uncertainty between forecasted and actual load net in LEC. The proposed method takes into account the capacity limitation constrain in the contract between LEC and distribution system operator in order to avoid penalties, and provides insightful data to support LEC in making the decision to join the balancing reserve. Three different case studies, which investigate the hypothetical LEC including 01 BESS (100kW/200kWh) and 55 houses with each installed photovoltaic system, are performed using a mixed-integer linear programming to validate the effectiveness of the proposed method. The results show that, by considering the registered limitation, the benefit is increased up to 30%, compared to the case without the capacity limitation constrain.

关键词： Photovoltaic systems Power engineering Uncertainty mixed integer linear programming Batteries Contracts Optimization

来源：评论

学校读者我要写书评

暂无评论

Non-iterative Distributed Community Energy Management System

Non-iterative Distributed Community Energy Management System

引用

International Conference on Environment and Electrical Engineering (EEEIC)

作者： Leehter Yao Che-Hao Wang J. C. Teo Department of Electrical Engineering National Taipei University of Technology Taipei Taiwan

ISBN: (数字)9781665485371

ISBN: (纸本)9781665485388

A non-iterative distributed community energy management system (CEMS) is presented in this paper. More specifically, each home energy management system (HEMS) in the community do not need to iteratively adjust its appliance scheduling to make their scheduling optimal to the entire community. Instead, each HEMS determines its appliance scheduling only once, based on its own interests, without having to consider whether its appliance scheduling is optimal from the perspective of the entire community. The central controller will then determine a solution that is optimal to the entire community by optimally dispatching the community's distributed energy sources according to the appliance scheduling of the HEMS. Distributed optimization and mixed-integer linear programming are used in developing the proposed CEMS. Simulation results shows that the proposed CEMS is effective, minimizing the total electricity cost of the entire community without needing each HEMS to iteratively adjust their appliance scheduling.

关键词： Home appliances Uncertainty Simulation programming linear programming Real-time systems mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Process Capacity Allocation Under Abnormal Conditions

引用

PROCESS INTEGRATION AND OPTIMIZATION FOR SUSTAINABILITY 2020年第2期4卷 163-169页

作者： Gumilao, T. K. Aviso, K. B. Tan, R. R. De La Salle Univ Dept Chem Engn 2401 Taft Ave Manila 0922 Philippines

Plant operations may need to be optimized in response to abnormal conditions resulting from various disruptive events. In such cases, it is of interest to minimize interim economic losses by allocating the capacities of process units optimally while the plant operations deviate from the nominal design conditions. This note extends the mixed integer linear programming (MILP) model previously developed by Kasivisvanathan et al. (Applied Energy 102: 492-500, 2013) by considering the effect of financial penalties for failure to meet contractual obligations to customers;it is assumed that such penalties are paid in direct proportion to the magnitude of production deficit. The extended model is illustrated with a case study of a chlor-alkali industrial complex, and general implications of the results are discussed.

关键词： Inoperability Optimization mixed integer linear programming Abnormal operations

来源：评论

学校读者我要写书评

暂无评论

Backup Resource Allocation Model with Two-Stage Probabilistic Protection

Backup Resource Allocation Model with Two-Stage Probabilisti...

引用

IEEE Conference on Network Softwarization (NetSoft)

作者： Kento Yokouchi Fujun He Eiji Oki Kyoto University Kyoto Japan

ISBN: (数字)9781665406949

ISBN: (纸本)9781665406956

This paper proposes a backup resource allocation model with two-stage probabilistic protection to minimize the total required backup capacity for multiple simultaneous failures of physical machines (PMs). Probabilistic protection ensures that the probability that the PM used for backup fails to backup due to lack of computing capacity does not exceed a given survivability parameter. The proposed model protects the primary virtual machines by allocating computing capacity to backup PMs with probabilistic protection. Since it is uncertain which primary PMs fail, we apply robust optimization to the probabilistic protection. By using a table that takes into account the survivability parameter and the failure probability of PMs, this proposed model is formulated as a mixed integer linear programming problem. The proposed model extends the probabilistic protection to two stages; the VMs that fail to be protected in the first stage are protected in the second stage to achieve the probabilistic protection with the final survivability parameter. This model can reduce the total required backup capacity compared to the conventional model with one-stage probabilistic protection.

关键词： Computational modeling Conferences Probabilistic logic Virtual machining Numerical models mixed integer linear programming Resource management

来源：评论

学校读者我要写书评

暂无评论

Bi-Objective Optimization for Uniform Parallel Batch Machine Scheduling under Time-of-Use Tariffs

Bi-Objective Optimization for Uniform Parallel Batch Machine...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Junheng Cheng Jingya Cheng Feng Chu School of Economics Fujian Normal University Fuzhou China Laboratory IBISC Univ-Évry Université Paris-Saclay Évry France

ISBN: (纸本)9781665472449

Time-of-Use (ToU) electricity pricing scheme has been widely implemented to alleviate the grid's peak load, under which manufacturing companies obtain a good opportunity to save energy cost through more reasonable production scheduling. As a typical production system, batch processing machine manufacturing system has been widely used in modern manufacturing industry because of its advantages in improving production efficiency and reducing production costs. In this work, a new bi-objective uniform parallel batch machine scheduling problem with different job sizes under ToU tariffs is explored, with the goal of minimizing the total electricity cost and the number of enabled machines. We first establish a mixed integer linear programming model, and then propose an improved model. Both models are solved by CPLEX using the $\varepsilon$ -constraint method. The calculation results of randomly generated instances prove the effectiveness of the proposed model. At the same time, the calculation results show that the improved model is more effective than the original one.

关键词： Schedules Job shop scheduling Costs Tensors Tariffs mixed integer linear programming Sensors

来源：评论

学校读者我要写书评

暂无评论

Unit Commitment Analysis in Hybrid Networks Containing Point-to-Point VSC-HVDC links

Unit Commitment Analysis in Hybrid Networks Containing Point...

引用

IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)

作者： N. Gónzalez-Cabrera Luis M. Castro L. E. Hernández-Amador Department of Electrical Energy Engineering Faculty National Autonomous University of Mexico (UNAM) Mexico City Mexico Postgraduate of Engineering National Autonomous University of Mexico (UNAM) Mexico City Mexico

ISBN: (纸本)9781665458931

This paper presents an efficient modeling approach for solving the Unit Commitment (UC) problem in hybrid power grids. This is based on the linear modeling of the AC network and point-to-point High Voltage Direct Current (VSC-HVDC) links through a nodal power flow approach using AC voltage phase angles and DC voltages. This results in a mixed-integer linear programming (MILP) formulation. The obtained results permit to determine the optimal hourly scheduling for VSC-based transmission grids in the context of day-ahead electricity markets. The applicability of this formulation is showcased using two empirical power systems incorporating a point-to-point VSC-HVDC link.

关键词： Analytical models HVDC transmission High-voltage techniques Electricity supply industry Hybrid power systems Power grids mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：