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

Detailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries

INTERNATIONAL JOURNAL OF ENGINEERING 2017年第12期30卷 1870-1878页

作者： Taherkhani, M. Tavakkoli-Moghaddam, R. Seifbarghy, M. Fattahi, P. Islamic Azad Univ Sci & Res Branch Dept Ind Engn Tehran Iran Univ Tehran Sch Ind Engn Coll Engn Tehran Iran Arts & Metier Paris Tech LCFC Ctr Metz Metz France Alzahra Univ Dept Ind Engn Fac Engn Tehran Iran

In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers under demand uncertainty. A new deterministic mixed-integer linear programming (MILP) model is first presented, and then a two-stage stochastic model is proposed. The aim of this model is to meet depot requirements at the minimum total cost including pumping and stoppages costs. The efficiency and utility of the proposed model is shown by two numerical examples, which one of them uses the industrial and real data.

关键词： Pipeline Scheduling Refinery Supply Chain Multi-product Pipelines mixed-integer linear programming Demand Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Assessing solution quality and computational performance in the hydro unit commitment problem considering different mathematical programming approaches

引用

ELECTRIC POWER SYSTEMS RESEARCH 2016年 136卷 212-222页

作者： Finardi, E. C. Takigawa, F. Y. K. Brito, B. H. Univ Fed Santa Catarina Elect Syst Planning Res Lab BR-88040900 Florianopolis SC Brazil Fed Inst Santa Catarina BR-88020300 Florianopolis SC Brazil Fed Inst Tocantins BR-77020450 Palmas Brazil

This paper presents a comparative analysis of different mathematical programming approaches for optimizing the hydro unit commitment (HUC) problem with cascaded plants, multiple generating units, and a head-dependent hydropower model. Regarding the HUC problem related to this paper, the objective is to minimize the cascade outflow while satisfying all constraints, including a power target for each plant, in a day-ahead planning horizon. The decision variables are the on/off status of the units and the respective generation levels. Rigorously, the HUC is a mixed-integer nonlinear programming (MINLP) problem, and several strategies can be used to compute near-optimal solutions. In this paper, we are interested in accessing the solution quality, as well as the computational performance when the HUC problem is solved using the following mathematical programming approaches: (i) the Lagrangian relaxation that represents a decomposition technique that exploits the HUC modeling structure, (ii) a MINLP solver that can handle the size and the non-concavity of the problem, and (iii) a mixed-integer linear programming (MILP) approach obtained by means of the hydropower model linearization. To perform the proposed analysis, numerical results are presented related to a real hydro system with eight cascaded reservoirs and 29 generating units. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Hydro unit commitment Lagrangian relaxation mixed-integer nonlinear programming mixed-integer linear programming Hydropower model

来源：评论

学校读者我要写书评

暂无评论

Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2016年第3期20卷 131-146页

作者： Keskin, M. Emre Altinel, I. Kuban Aras, Necati Ersoy, Cem Bogazici Univ Dept Ind Engn TR-34342 Istanbul Turkey Bogazici Univ Dept Comp Engn TR-34342 Istanbul Turkey

The collective behaviour of wireless sensors provides a network to monitor a region. Most of the applications require a sufficiently long network operation, which makes the efficient management of the available energy resources an important issue. It is a known phenomenon that sensors communicating directly with a sink deplete their energy faster than others. Hence, some of the sinks are disconnected from the rest of the network even though most of the sensors are still functional. A possible remedy is to balance the relaying load of the sensors using mobile sinks and controlling their mobility. In this work, we consider three major design issues, i.e., coverage, locating mobile sinks, and routing sensor-to-sink data within a unified framework and develop mixed-integer linear programming formulations to maximise the network lifetime. We also numerically compare the new models and demonstrate the improvement obtained by controlling the sink mobility and integrating various design issues.

关键词： sensor networks sensor deployment activity scheduling controlled sink mobility lifetime maximisation mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Strategic CBDR bidding considering FTR and wind power

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2016年第10期10卷 2464-2474页

作者： Fang, Xin Li, Fangxing Hu, Qinran Wei, Yanli Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA Southern Calif Edison Power Supply Dept Rosemead CA 91770 USA

The independent system operators (ISOs) usually offer financial transmission right (FTR) as a financial instrument for electricity market participants to hedge against the transmission congestion cost. Meanwhile, the development of demand response (DR) provides load serving entities (LSEs) opportunities to perform coupon based demand response (CBDR) programs, and thus LSEs can behave as strategic bidders in the whole-sale market by adjusting its demand level. In the existing approaches for modelling CBDR, the potential impact of FTR which leads LSEs to obtain the congestion compensation under a high load level is overlooked. Therefore, this study proposes a comprehensive strategic CBDR model in which the LSE's profit is maximised by providing CBDR to customers and the congestion compensation from the LSE bidder's FTR holding is also considered. The proposed model is formulated as a bi-level optimisation problem with the LSE's net revenue maximisation as the upper level and the ISO's economic dispatch considering wind power uncertainty as the lower level problem. The bi-level model is addressed with mathematic program with equilibrium constraints technique and mixed-integer linear programming, which can be solved using available optimisation software tools. In addition, the case studies of an illustrative two bus system, the PJM 5-bus system, and IEEE 39-bus system verify the proposed method.

关键词： wind power plants power markets power transmission economics costing demand side management integer programming linear programming power generation economics power generation dispatch strategic CBDR bidding wind power independent system operators ISO financial transmission right financial instrument electricity market participant transmission congestion cost demand response development DR development load serving entities LSE opportunities coupon-based demand response program CBDR program strategic bidders whole-sale market congestion compensation comprehensive strategic CBDR model LSE bidder FTR holding bi-level optimisation problem LSE net revenue maximisation ISO economic dispatch wind power uncertainty mathematic program equilibrium constraint technique mixed-integer linear programming PJM 5-bus system IEEE 39-bus system

来源：评论

学校读者我要写书评

暂无评论

A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems

引用

INFORMS JOURNAL ON COMPUTING 2016年第1期28卷 14-30页

作者： Boland, Natashia Clement, Riley Waterer, Hamish Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA Univ Newcastle Sch Math & Phys Sci Callaghan NSW 2308 Australia

A new mixed-integer linear programming (MILP) formulation for nonpreemptive single machine scheduling problems is presented. The model is a generalisation of the classical time indexed (TI) model to one in which at most two jobs can be processing in each time period. Like the TI model, the new model, called the bucket indexed (BI) model, partitions the planning horizon into periods of equal length, or buckets. Unlike the TI model, the length of a period is a parameter of the BI model and can be chosen to be as long as the processing time of the shortest job. The two models are equivalent if a period is of unit length, but when longer periods are used in the BI model, it can have significantly fewer variables and nonzeros than the corresponding TI model. A computational study using weighted tardiness instances, and weighted completion time instances with release dates, reveals that the BI model significantly outperforms the TI model on instances where the minimum processing time of the jobs is large. Furthermore, the performance of the BI model is less vulnerable to increases in average processing time when the ratio of the largest processing time to the smallest is held constant.

关键词： single machine scheduling mixed-integer linear programming time indexed formulations

来源：评论

学校读者我要写书评

暂无评论

MILP branch flow model for concurrent AC multistage transmission expansion and reactive power planning with security constraints

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2016年第12期10卷 3023-3032页

作者： Macedo, Leonardo H. Montes, Cristiam V. Franco, John F. Rider, Marcos J. Romero, Ruben Sao Paulo State Univ Dept Elect Engn POB 31Ave Brasil Ctr 56 BR-15385000 Ilha Solteira SP Brazil Univ Estadual Campinas Dept Syst & Energy Ave Albert Einstein 400 BR-13083852 Campinas SP Brazil

This study presents a mixed-integer linear programming (MILP) model to solve the simultaneous transmission network expansion planning (TNEP) and reactive power planning (RPP) problem. The proposed model considers reactive power, off-nominal bus voltage magnitudes, power losses, multistage expansion, and security constraints. The use of an MILP model guarantees convergence to optimality by using existing classical optimisation methods. In order to validate the approximation performed, the steady-state operation points were compared with those obtained using an AC load flow method. Garver's 6-bus system and a modified IEEE 118-bus system were used to show the precision and efficiency of the methodology. The results indicate that better expansion and generation plans are found by considering RPP simultaneously with the AC TNEP, when the solutions were compared with the plans of the TNEP using the AC model without RPP and the TNEP considering the DC model, with RPP conducted at a subsequent stage.

关键词： load flow reactive power power transmission planning power system security integer programming linear programming MILP branch flow model concurrent AC multistage transmission expansion reactive power planning security constraints mixed-integer linear programming TNEP simultaneous transmission network expansion planning reactive power planning problem RPP problem off-nominal bus voltage magnitudes power losses classical optimisation methods steady-state operation points AC load flow method Garver 6-bus system modified IEEE 118-bus system

来源：评论

学校读者我要写书评

暂无评论

Bilevel Model for Analyzing Coordinated Cyber-Physical Attacks on Power Systems

引用

IEEE TRANSACTIONS ON SMART GRID 2016年第5期7卷 2260-2272页

作者： Li, Zhiyi Shahidehpour, Mohammad Alabdulwahab, Ahmed Abusorrah, Abdullah IIT Ctr Elect Innovat Chicago IL 60616 USA IIT Galvin Ctr Elect Innovat Chicago IL 60616 USA King Abdulaziz Univ Renewable Energy Res Grp Jeddah 21589 Saudi Arabia King Abdulaziz Univ Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia

This paper analyzes a coordinated cyber-physical attack on power systems, which could lead to undetectable line outages. Coordinated with physical attacks that cause line outages, the two-step cyberattacks comprising topology preserving and load redistribution attacks could mask and potentially exasperate outages to trigger cascading failures. These coordinated cyber-physical attacks are analyzed in a proposed bilevel model, which aims at identifying the most damaging and undetectable physical attacks constrained by attackers' total budget. After being transformed into a mixed-integer linear programming problem, the proposed bilevel model is solved by a rigorous two-stage solution approach. This paper also discusses the relevant countermeasure strategies. The proposed model, the solution algorithm, and the effectiveness of countermeasures are examined by case studies based on the IEEE 14- and 118-bus test systems.

关键词： Bilevel model countermeasure strategies cyber-physical systems mixed-integer linear programming topology preserving and load redistribution attacks

来源：评论

学校读者我要写书评

暂无评论

Optimal structural design of residential power and heat supply devices in consideration of operational and capital recovery constraints

引用

APPLIED ENERGY 2016年 163卷 118-133页

作者： Wakui, Tetsuya Kawayoshi, Hiroki Yokoyama, Ryohei Osaka Prefecture Univ Dept Mech Engn Naka Ku 1-1 Gakuen Cho Sakai Osaka 5998531 Japan

An optimal structural design model of residential power and heat supply devices (R-PHDs), including cogeneration and heat pump units, was developed by considering their operational and capital recovery constraints. The structure of R-PHDs with peripheral devices, sizes of energy storage devices, and their multi-period operation were determined so as to minimize annual primary energy consumption. In addition to various operational constraints for a cogeneration unit and a battery unit, an operable hours constraint and daily selection of outlet water temperature were newly formulated for heat pump units. The capital recovery by reducing energy cost was also considered in order to select R-PHDs that have high energy-saving effects but are presently expensive. The developed model took the form of a mixed-integer linear programming problem. The model was applied to the structural design of R-PHDs, whose candidates are three types of cogeneration units (gas engine, polymer electrolyte fuel cell, and solid oxide fuel cell), heat pump unit, storage tank, battery unit, and peripheral devices. The result revealed a trade-off between energy savings and initial cost in the optimal structures. A sensitivity analysis of the initial costs of expensive devices was also carried out to clarify their initial cost targets. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Cogeneration Heat pump Battery Structural design Optimization mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal dynamic allocation of mobile plants to monetize associated or stranded natural gas, part II: Dealing with uncertainty

引用

ENERGY 2016年 96卷 461-467页

作者： Tan, Siah Hong Barton, Paul I. MIT Proc Syst Engn Lab 77 Massachusetts Ave Cambridge MA 02139 USA

Using the Bakken shale play as a case study, the previous part of this two-part series demonstrated how small-scale mobile plants could be used to monetize associated or stranded gas effectively. Here, we address the issue of uncertainty in future supply, demand and price conditions. To this end, we modified our multi-period optimization framework to a stochastic programming framework to account for various scenarios with different parameter realizations in the future. The maximum ENPV (expected net present value) obtained was $2.01 billion, higher than the NPV obtained in the previous part. In addition, the value of the stochastic solution was 0.11% of the optimal ENPV, indicating that the flexible nature of mobile plants affords them a great advantage when dealing with uncertainty. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Natural gas monetization Mobile modular plants mixed-integer linear programming Two-stage stochastic programming Parametric uncertainty Bakken shale play

来源：评论

学校读者我要写书评

暂无评论

Nested general variable neighborhood search for the periodic maintenance problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2016年第2期252卷 385-396页

作者： Todosijevic, Raca Benmansour, Rachid Hanafi, Said Mladenovic, Nenad Artiba, Abdelhakim Univ Valenciennes & Hainaut Cambresis LAMIH UMR 8201 CNRS Valenciennes France Serbian Acad Arts & Sci Math Inst Kneza Mihaila 36 Belgrade 11001 Serbia

In this paper we study the periodic maintenance problem: given a set of m machines and a horizon of T periods, find indefinitely repeating itself maintenance schedule such that at most one machine can be serviced at each period. In addition, all the machines must be serviced at least once for any cycle. In each period the machine i generates a servicing cost b(i) or an operating cost which depends on the last period in which i was serviced. The operating cost of each machine i in a period equals a(i) times the number of periods since the last servicing of that machine. The main objective is to find a cyclic maintenance schedule of a periodicity T that minimizes total cost. To solve this problem we propose a new mixed integer programming formulation and a new heuristic method based on general Variable neighborhood search called Nested general variable neighborhood search. The performance of this heuristic is shown through an extensive experimentation on a diverse set of problem instances. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Scheduling Preventive maintenance mixed-integer linear programming Variable neighborhood search Nested general VNS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：