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

Optimal allocation of phasor measurement units in distribution power systems

ALEXANDRIA ENGINEERING JOURNAL 2022年第10期61卷 8039-8049页

作者： Eladl, Abdelfattah A. Sheta, Ahmed N. Saeed, Mohammed A. Abido, Mohammed A. Hassan, Mohamed A. Mansoura Univ Fac Engn Elect Engn Dept Mansoura 35516 Egypt King Fahd Univ Petr & Minerals Fac Engn Elect Engn Dept Dhahran 31261 Saudi Arabia KFUPM King Abdullah City Atom & Renewable Energy KA CAR Energy Res & Innovat Ctr ERIC Dhahran 31261 Saudi Arabia King Fahd Univ Petr & Minerals Interdisciplinary Res Ctr Renewable Energy & Powe Res Inst Dhahran 31261 Saudi Arabia

Phasor measurement unit (PMU) is deemed a pivotal tool in wide-area monitoring, protection, and control of power systems. The optimal allocation of PMUs has recently received more attention. In this paper, binary integer programming (BIP) technique is proposed to optimally allocate PMUs in the power network keeping complete observability of the network and reducing the total numbers of PMUs. The proposed technique is tested and examined through different systems to investigate the effectiveness of BIP. Additionally, the BIP is compared with different techniques to verify its superiority and reveal the main contributions of BIP-based algorithms using different IEEE test systems. The proposed method shows an efficient technique while placing PMUs through direct, simple, and linear formulas regardless of the network scale or configuration;transmission, or distribution systems. Moreover, the whole process consumes the least time slots to hit the intended goal because of the problem formulating criteria. (C) 2022 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University.

关键词： binary integer programming Conventional measurements Optimal placement Phasor measurement units Zero injection bus

来源：评论

学校读者我要写书评

暂无评论

Temperature adaptive switching operation for distribution systems

引用

IEEE TRANSACTIONS ON POWER DELIVERY 2001年第4期16卷 694-699页

作者： Chen, CS Kang, MS Hwang, JC Huang, CW Natl Sun Yat Sen Univ Dept Elect Engn Kaohsiung 80424 Taiwan Natl Kaohsiung Inst Technol Dept Elect Engn Kaohsiung 80782 Taiwan Taiwan Power Co Power Res Inst Taipei Taiwan

This paper is to investigate the optimal switching problem of distribution systems by considering the customer load characteristics and the effect of temperature change to the customer loading. The load survey is applied to derive the typical load patterns of residential, commercial, and industrial customer classes. The power consumption of sample test customers and weather information are used to solve the hourly temperature sensitivity of power consumption for each customer class. All the customers served by each distribution transformer are identified and their monthly energy consumption is retrieved from the customer information system in Taipower. The hourly loading of each service zone and its change due to temperature rise are obtained based on the customer load consumption and its temperature sensitivity. By performing the connectivity trace to find the feeder configuration and executing the three-phase load flow analysis, the hourly current loading of line switches, distribution feeders, and main transformers in substations are solved. The binary integer programming is then applied to determine the temperature adaptive optimal switching operation for noninterruptible load transfer among distribution feeders and main transformers.

关键词： binary integer programming load model optimal switching operation temperature sensitivity

来源：评论

学校读者我要写书评

暂无评论

An intelligent decomposition of pairwise comparison matrices for large-scale decisions

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2014年第1期238卷 270-280页

作者： Jalao, Eugene Rex Wu, Teresa Shunk, Dan Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85281 USA Univ Philippines Diliman Coll Engn Dept Ind Engn & Operat Res Quezon City 1101 Philippines

A Pairwise Comparison Matrix (PCM) has been used to compute for relative priorities of elements and are integral components in widely applied decision making tools: the Analytic Hierarchy Process (AHP) and its generalized form, the Analytic Network Process (ANP). However, PCMs suffer from several issues limiting their applications to large-scale decision problems. These limitations can be attributed to the curse of dimensionality, that is, a large number of pairwise comparisons need to be elicited from a decision maker. This issue results to inconsistent preferences due to the limited cognitive powers of decision makers. To address these limitations, this research proposes a PCM decomposition methodology that reduces the elicited pairwise comparisons. A binary integer program is proposed to intelligently decompose a PCM into several smaller subsets using interdependence scores among elements. Since the subsets are disjoint, the most independent pivot element is identified to connect all subsets to derive the global weights of the elements from the original PCM. As a result, the number of pairwise comparison is reduced and consistency is of the comparisons is improved. The proposed decomposition methodology is applied to both AHP and ANP to demonstrate its advantages. Published by Elsevier B.V.

关键词： AHP ANP Pairwise comparison matrices Inconsistency binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Optimal visual sensor placement for coverage based on target location profile

引用

AD HOC NETWORKS 2011年第4期9卷 528-541页

作者： Mostafavi, Seyed Akbar Dehghan, Mehdi Amirkabir Univ Technol Dept Comp Engn & Informat Technol Tehran Iran

The proper placement of visual sensors across a sensor field for covering targets with arbitrary location and orientation is a mission-critical decision in surveillance applications. The specifics of sensor deployment in these applications not only determine the maximum achievable coverage, but it also affects the quality of the target's appearance in cameras for subsequent use in vision tasks. However, the inaccuracies inherent in localization techniques and the lack of knowledge regarding the target orientation render existing proposals insufficient for real-life scenarios. In this paper, we address both challenges. First, we extend the conventional point representation of targets with a circular model to account for full-angle coverage of targets with known location yet with unknown orientation from all directions. We then assume, in the absence of precise location information, a trajectory profile of targets could instead be generated through the importance sampling of the environment, indicating spots where the target is most likely located. This profile-based abstraction enables us to capture the uncertainty in target's location by encircling every agglomeration of proximal samples within one cluster. Each cluster can then be viewed as a virtual macroscopic circular target for which we formulate the coverage problem in terms of a binary integer programming (BIP) model. We have also taken into account the presence of obstruction in between multiple targets by calculating the angles of view of the sensors in an occlusion-dependant manner, effectively determining optimal placement for maximal instead of full-angle coverage. Evaluation results derived from our simulation experiments reveal that the proposed mechanism can effectively achieve high coverage accuracy with minimum number of deployed sensors. (C) 2010 Elsevier B.V. All rights reserved.

关键词： binary integer programming Directional sensor placement Full-angle coverage Circular target model Visual sensor networks

来源：评论

学校读者我要写书评

暂无评论

CRITERIA FOR INTERFEEDER SWITCHING IN DISTRIBUTION-SYSTEMS

引用

IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION 1988年第5期135卷 461-467页

作者： CHEN, CS WU, JS CHANG, YN Department of Electrical Engineering National Sun Yat-Sen University Kaohsiung Republic of China

The purpose of the paper is to find the optimal criteria for interfeeder switching in a distribution system during emergency conditions. A feeder in a distribution system usually has several interfeeder switches properly located along the feeder to link with other feeders. Under emergency conditions, such as when faults occur on the distribution feeder, these switches are operated interdependently to minimise the loss of load and to prevent overload or unbalance power flow on the distribution feeders. In the paper, a computer program is developed to find the optimal switching algorithm. The cost function of the switching operation is defined, and the bipartite graph network is constructed according to the configuration of the distribution system. The binary integer programming (BIP) technique is used to minimise the objective function which is set up based on the relief of feeder overloading and unbalance. A distribution system comprising several substations in the Taiwan Power Company is selected for the simulation of optimal switching and the accuracy and efficiency of this program are verified.

关键词： optimal switching algorithm distribution systems feeder overloading distribution networks emergency conditions switching electrical engineering computing cost function Distribution networks Power engineering computing computer program unbalance power flow Taiwan Power Company bipartite graph network interfeeder switching binary integer programming

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for the hospital health examination scheduling problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年第3期186卷 1137-1157页

作者： Chern, Ching-Chin Chien, Pei-Szu Chen, Shu-Yi Natl Taiwan Univ Dept Informat Management Taipei 10625 Taiwan Ming Chuang Univ Dept Informat Management Tao Yuan 333 Taiwan

This study considers the problem of health examination scheduling. Depending on their gender, age, and special requirements, health examinees select one of the health examination packages offered by a health examination center. The health examination center must schedule all the examinees, working to minimize examinee/doctor waiting time and respect time and resource constraints, while also taking other limitations, such as the sequence and continuity of the examination procedures, into consideration. The binary integer programming (BIP) model is one popular way to solve this health examination scheduling problem. However, as the number of examinees and health examination procedures increase, solving BIP models becomes more and more difficult, if not impossible. This study proposes health examination scheduling algorithm (HESA), a heuristic algorithm designed to solve the health examination scheduling problem efficiently and effectively. HESA has two primary objectives: minimizing examinee waiting time and minimizing doctor waiting time. To minimize examinee waiting time, HESA schedules the various parts of each examinee's checkup for times when the examinee is available, taking the sequence of the examination procedures and the availability of the resources required into account. To minimize doctor waiting time, HESA focuses on doctors instead of examinees, assigning waiting examinees to a doctor as soon as one becomes available. Both complexity analysis and computational analyses have shown that HESA is very efficient in solving the health examination scheduling problem. In addition to the theoretical results, the results of HESA's application to the concrete health examination scheduling problems of two large hospitals in Taiwan are also reported. (c) 2007 Elsevier B.V. All rights reserved.

关键词： health examination scheduling sequence-dependent flow-shop scheduling heuristic algorithm binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Maximizing the effectiveness of a preventive maintenance system: An adaptive modeling approach

引用

MANAGEMENT SCIENCE 1997年第6期43卷 827-840页

作者： Gopalakrishnan, M Ahire, SL Miller, DM WESTERN MICHIGAN UNIV HAWORTH COLL BUSINESS DEPT MANAGEMENT KALAMAZOO MI 49008 USA UNIV ALABAMA ALABAMA PRODUCT CTR DEPT MANAGEMENT SCI & STAT TUSCALOOSA AL 35487 USA

The dynamic nature of an operating environment, such as machine utilization and breakdown frequency results in changing preventive maintenance (PM) needs for manufacturing equipment. In this paper, we present an approach to generate an adaptive PM schedule which maximizes the net savings from PM subject to workforce constraints. The approach consists of two components: (a) task prioritization based on a multi-legit regression model for each type of PM task, and (b) task rescheduling based on a binary integer programming (BIP) model with constraints on single-skilled and multi-skilled workforce availability. The task prioritization component develops a multi-legit regression for machine failure probability associated with each type of PM task at the beginning of the year, using historical data on machine utilization, PM, and machine breakdowns. At the start of each PM time-bucket (e.g., a month), we use the updated machine failure probability for each candidate PM task to compute its current contribution to net PM savings, which indicates its current priority. The task rescheduling BIP model incorporates the priorities in selecting tasks for the current bucket to maximize PM effectiveness subject to workforce availability, yielding an adaptive and effective PM schedule for each time-bucket of the master PM schedule. We examine the effect of using multi-skilled workforce on the overall PM effectiveness, and also provide an illustration from a newspaper publishing environment to explain the use of the approach. We have developed four heuristic algorithms to yield good solutions to large scale versions of this scheduling problem. The heuristics perform extremely well, and the best heuristic solution is within 1.4% of optimality on an average.

关键词： preventive maintenance multi-logit regression binary integer programming

来源：评论

学校读者我要写书评

暂无评论

A novel technique for the optimal design of offshore wind farm electrical layout

引用

Journal of Modern Power Systems and Clean Energy 2013年第3期1卷 258-263页

作者： Yingying CHEN Zhaoyang DONG Ke MENG Fengji LUO Weifeng YAO Jing QIU Center of Intelligent Electricity Networks(CIEN) The University of NewcastleCallaghanNSW 2308Australia University of Sydney DarlingtonNSWAustralia

The design of electrical layout is a key element in the offshore wind farm *** present a novel electrical layout design optimization method for offshore wind farms in this *** proposed method can be used to generate the network model based on fuzzy c-means(FCM)and binary integer programming(BIP)*** can automatically allocate wind turbines to the nearest substations and obtain the topology structure of cables utilized to connect wind turbines or turbine and *** objective of this optimization is to minimize the investment costs of cable connection and the transmission power *** results of case study clearly demonstrated the feasibility of the proposed method and showed that it can be used as a reliable tool for electrical layout design of offshore wind farms.

关键词： Electrical layout Offshore wind farm Collector system Fuzzy c-means clustering binary integer programming

来源：评论

学校读者我要写书评

暂无评论

MIXED ASSEMBLY LINE REBALANCING: A binary integer APPROACH APPLIED TO REAL WORLD PROBLEMS IN THE AUTOMOTIVE INDUSTRY

引用

INTERNATIONAL JOURNAL OF AUTOMOTIVE TECHNOLOGY 2012年第6期13卷 933-940页

作者： Oliveira, F. S. Vittori, K. Russel, R. M. O. Travassos, X. L. Natl Serv Ind Learning DR Integrated Ctr Mfg & Technol Salvador Brazil Fed Univ ABC Sao Paulo Brazil

Industrial organizations have increasingly sought to optimize the resources needed for the manufacture of its products from the competition, in order to maintain their profit margins. The search for balance of resources and balanced distribution of tasks in various types of industrial environments is called balancing. When adjustments are made and adequacy of an assembly line that is already in operation, this process is called rebalancing. This paper presents a case study involving a problem of rebalancing of automotive assembly line in an environment of arbitrarily mixed models of products, also known as mix. The proposed procedure for solving the rebalancing in the company in question is based on binary integer programming, in particular the branch and bound algorithm. For comparison, we used a heuristic method based on precedence diagrams for solving the rebalancing of lines. To evaluate the results obtained between the two procedures were used performance indicators such as number of workstations created, average load of work and level of unbalance. The proposed algorithm has resulted in significant improvements in the production line capacity.

关键词： Balancing and rebalancing of assembly lines binary integer programming Branch Productivity

来源：评论

学校读者我要写书评

暂无评论

A mathematical formulation for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2011年第6期34卷 1869-1882页

作者： Jahanshahi, M. Dehghan, M. Meybodi, M. R. Islamic Azad Univ Dept Comp Engn Sci & Res Branch Tehran Iran Amirkabir Univ Technol Dept Comp Engn Tehran Iran

Multicast routing is generally an efficient mechanism for delivering identical content to a group of receivers. Multicast is also deemed a key enabling service for a wealth of audio and video applications as well as data dissemination protocols over the last-mile backhaul Internet connectivity provided by multi-channel multi-radio wireless mesh networks (MCMR WMNs). Major prior art multicast protocols in these networks center around heuristic or meta-heuristic initiatives in which channel assignment and multicast routing are considered as two separate sub-problems to be solved in sequence. It might even be the cast that the solution for either of these two sub-problems is assumed to be preparatively calculated and given as input to the other. Within this perspective, however, the interplay between the two sub-problems would essentially be ruled out from the computations, resulting in sub-optimal solutions for network configuration. The work in this article is targeted at promoting the adoption of cross-layer design for joint channel assignment and multicast tree construction problem in MCMR WMNs. In the proposed scheme, contrary to the existing methods, these two sub-problems will be solved conjointly and an optimal solution is provided. In particular, a comprehensive cross-optimization framework based on the binary integer programming (BIP) formulation of the problem is presented which also addresses the hidden channel problem in MCMR WMNs. We have, as well, conducted an extensive series of simulation experiments to verify the efficacy of the proposed method. Also, experimental results demonstrate that the proposed method outperforms the genetic algorithm and the simulated annealing based methods proposed by Cheng and Yang (2011) in terms of interference. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Wireless mesh network Multi-channel Multi-radio Channel assignment Multicast tree construction Cross-layer design binary integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：