A N OPTIMAL RELIABILITY ALLOCATION METHOD FOR DIGITAL SUBSTATION SYSTEMS Y UZHOU H U, P EICHAO Z HANG, Y ONGCHUN S U, Y U Z OU Adviser: Frank, Yeong-Sung.

Slides:



Advertisements
Similar presentations
Application a hybrid controller to a mobile robot J.-S Chiou, K. -Y. Wang,Simulation Modelling Pratice and Theory Vol. 16 pp (2008) Professor:
Advertisements

Dr. Miguel Bagajewicz Sanjay Kumar DuyQuang Nguyen Novel methods for Sensor Network Design.
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.
Lect.3 Modeling in The Time Domain Basil Hamed
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Object Specific Compressed Sensing by minimizing a weighted L2-norm A. Mahalanobis.
Optimal redundancy allocation for information technology disaster recovery in the network economy Benjamin B.M. Shao IEEE Transaction on Dependable and.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/3/07 Defending simple series and parallel systems with imperfect false targets R. Peng, G. Levitin,
Algorithms Recurrences. Definition – a recurrence is an equation or inequality that describes a function in terms of its value on smaller inputs Example.
Fault Detection in a HW/SW CoDesign Environment Prepared by A. Gaye Soykök.
LINEAR REGRESSION MODEL
Visual Recognition Tutorial
Optimization in Engineering Design 1 Lagrange Multipliers.
1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.
Chapter 4 Multiple Regression.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Copyright 2007 Koren & Krishna, Morgan-Kaufman Part.2.1 FAULT TOLERANT SYSTEMS Part 2 – Canonical.
Visual Recognition Tutorial
Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing Y.Thomas Hou, Yi Shi, Jianping Pan, Scott F.Midkiff Mobile.
Estimation 8.
Chapter 3 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Introduction to Optimization (Part 1)
Reliability-Redundancy Allocation for Multi-State Series-Parallel Systems Zhigang Tian, Ming J. Zuo, and Hongzhong Huang IEEE Transactions on Reliability,

COMPLEXITY SCIENCE WORKSHOP 18, 19 June 2015 Systems & Control Research Centre School of Mathematics, Computer Science and Engineering CITY UNIVERSITY.
Lesson №2. is the unique activity that has a beginning and an end time, aimed at achieving a predetermined result/goal, the creation of a specific, unique.
VTT-STUK assessment method for safety evaluation of safety-critical computer based systems - application in BE-SECBS project.
1 Chapter 8 Sensitivity Analysis  Bottom line:   How does the optimal solution change as some of the elements of the model change?  For obvious reasons.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
Minimum Phoneme Error Based Heteroscedastic Linear Discriminant Analysis for Speech Recognition Bing Zhang and Spyros Matsoukas BBN Technologies Present.
Fundamentals of Data Analysis Lecture 9 Management of data sets and improving the precision of measurement.
INVERSE KINEMATICS ANALYSIS TRAJECTORY PLANNING FOR A ROBOT ARM Proceedings of th Asian Control Conference Kaohsiung, Taiwan, May 15-18, 2011 Guo-Shing.
Chapter 6 Linear Programming: The Simplex Method
Placement of WiFi Access Points for Efficient WiFi Offloading in an Overlay Network Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
Frankfurt (Germany), 6-9 June 2011 Hans-Erik Olovsson – Sweden – Session 1 Network Components – Paper 0453 Innovative Compact 145/12 kV Indoor Air Insulated.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
Lecture 2: Combinatorial Modeling CS 7040 Trustworthy System Design, Implementation, and Analysis Spring 2015, Dr. Rozier Adapted from slides by WHS at.
Adviser: Frank, Yeong-Sung Lin Presenter: Yi-Cin Lin.
Dual Winding Method of a BLDC Motor for Large Starting Torque and High Speed IEEE TRANSACTIONS ON MAGNETICS, VOL. 41, NO. 10, OCTOBER 2005 G. H. Jang and.
Protection vs. false targets in series systems Reliability Engineering and System Safety(2009) Kjell Hausken, Gregory Levitin Advisor: Frank,Yeong-Sung.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Chin-Yu Huang Department of Computer Science National Tsing Hua University Hsinchu, Taiwan Optimal Allocation of Testing-Resource Considering Cost, Reliability,
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
Adviser: Frank, Yeong - Sung Lin Present by Jason Chang 1.
1 MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments The variational method.
O PTIMAL SERVICE TASK PARTITION AND DISTRIBUTION IN GRID SYSTEM WITH STAR TOPOLOGY G REGORY L EVITIN, Y UAN -S HUN D AI Adviser: Frank, Yeong-Sung Lin.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
Optimal Resource Allocation for Protecting System Availability against Random Cyber Attack International Conference Computer Research and Development(ICCRD),
Mitigation strategies on scale-free networks against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Chris Chang.
Author: Tadeusz Sawik Decision Support Systems Volume 55, Issue 1, April 2013, Pages 156–164 Adviser: Frank, Yeong-Sung Lin Presenter: Yi-Cin Lin.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
STATIC ANALYSIS OF UNCERTAIN STRUCTURES USING INTERVAL EIGENVALUE DECOMPOSITION Mehdi Modares Tufts University Robert L. Mullen Case Western Reserve University.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Part.2.1 In The Name of GOD FAULT TOLERANT SYSTEMS Part 2 – Canonical Structures Chapter 2 – Hardware Fault Tolerance.
M. R. Gouvea BR Session 1 – Block 1 – Transformers – Paper #36 Barcelona May RISK CRITERIA TO APPLY AND MANAGE DISTRIBUTION TRANSFORMERS M.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
Lecture -5 Topic :- Step Response in RL and RC Circuits Reference : Chapter 7, Electric circuits, Nilsson and Riedel, 2010, 9 th Edition, Prentice Hall.
Microwave Engineering Chapter 5.7 ~ 5.9
A fault tree – Based Bayesian network construction for the failure rate assessment of a complex system 46th ESReDA Seminar May 29-30, 2014, Politecnico.
O PTIMAL R EPLACEMENT AND P ROTECTION S TRATEGY FOR P ARALLEL S YSTEMS R UI P ENG, G REGORY L EVITIN, M IN X IE AND S ZU H UI N G Adviser: Frank, Yeong-Sung.
YuankaiGao,XiaogangLi
Definitions Cumulative time to failure (T): Mean life:
Apply KCL to the top node ,we have We normalize the highest derivative by dividing by C , we get Since the highest derivative in the equation is.
Optimal defence of single object with imperfect false targets
Presentation transcript:

A N OPTIMAL RELIABILITY ALLOCATION METHOD FOR DIGITAL SUBSTATION SYSTEMS Y UZHOU H U, P EICHAO Z HANG, Y ONGCHUN S U, Y U Z OU Adviser: Frank, Yeong-Sung Lin Present by Sean Chou 1

A GENDA Introduction Reliability allocation modeling and solving Equivalent redundancy coefficient Case study Conclusions 2

A GENDA Introduction Reliability allocation modeling and solving Equivalent redundancy coefficient Case study Conclusions 3

I NTRODUCTION The applying of the IEC standard and the rapid development of the high-speed Ethernet technology permit implementation of a digital substation system. Comprises more electronic devices, e.g., merging units, Ethernet switches and time synchronization sources [1]. It is a potential shortcoming of the all-digital protection system and has a dramatic impact on the reliability of the system. 4

I NTRODUCTION The digital substation system is expected to have equal or higher reliability than the conventional one. Thus, it is necessary to design a robust system structure. Many methods can help to optimize the system reliability such as the component importance analysis, the fault tree analysis, and the reliability allocation methods. 5

I NTRODUCTION Component importance analysis can analyze the system structure and help to diagnose the weaknesses of the system. But it has three limitations: It cannot set the system optimization objective It does not tell us how the reliability should be allocated among the components exactly. It cannot consider the optimization constraints of each component. 6

I NTRODUCTION In paper [4], the principle for reliability allocation is given. Common reliability allocation methods include proportion method, AGREE method, minimum cost method, etc. [5]-[8]. It is unrealistic to discuss the reliability allocation issues without considering the economic factors. Thus, this paper chooses the minimum cost method as the basis for analysis to model the mathematic programming. 7

I NTRODUCTION Using the above method, we can determine the reliability optimization objective of each component while obtaining a target level of the whole system. But the analysis result often cannot help to guide the optimization process directly. We usually employ redundancy instead to increase the reliability of the system effectively. Thus the problem turns to decide how to achieve redundancy in a most cost-effective way. 8

I NTRODUCTION Traditional reliability allocation methods mentioned above cannot answer the question. This paper aims to propose a novel reliability optimal allocation method based on minimum cost allocation method, which considers the cost factors, optimization feasibility, and constraints for the components of the digital substation system. 9

A GENDA Introduction Reliability allocation modeling and solving Equivalent redundancy coefficient Case study Conclusions 10

R ELIABILITY ALLOCATION MODELING AND SOLVING Basic Concept of Reliability Allocation Model of the cost versus the reliability of components Mathematic Programming 11

R ELIABILITY ALLOCATION MODELING AND SOLVING Basic Concept of Reliability Allocation The goal of reliability allocation is to solve the inequalities: 12

R ELIABILITY ALLOCATION MODELING AND SOLVING The math expression can be defined as Before modeling the math programming, R s and C (R i0, R i )should be defined. Based on the RBD method, we can adopt the minimal path set and the connection matrix technology to derive the system reliability function R s. 13

R ELIABILITY ALLOCATION MODELING AND SOLVING A Reliability Block Diagram (RBD) performs the system reliability and availability analyses on large and complex systems using block diagrams to show network relationships. The structure of the reliability block diagram defines the logical interaction of failures within a system that are required to sustain system operation. 14

R ELIABILITY ALLOCATION MODELING AND SOLVING 15

R ELIABILITY ALLOCATION MODELING AND SOLVING Model of the cost versus the reliability of components The other important element in the minimum cost allocation is the cost function. Classical cost-reliability models : Lagrange model is based on the assumption that the logarithm of component unreliability is proportional to cost, which may not always be the case. Power model has two constants to be calculated, both of which are not related to reliability. 16

R ELIABILITY ALLOCATION MODELING AND SOLVING Because of these shortcomings, these models are difficult to be applied in practice. The modified “three parameters model” is an exponential function of manufacturing cost with respect to reliability, which contains following parameters. 17

R ELIABILITY ALLOCATION MODELING AND SOLVING “three parameters model” Using the above cost model, we can take optimize costs, feasibility of optimization, and constraints for the components of the digital substation system into consideration. 18

R ELIABILITY ALLOCATION MODELING AND SOLVING Mathematic Programming Based on the RBD of the system structure, we have already got the system reliability function. We should also define the following vectors: 19

R ELIABILITY ALLOCATION MODELING AND SOLVING The cost function is defined as: Considering the optimization objective, we need to find the optimal solution which yields to: 20

R ELIABILITY ALLOCATION MODELING AND SOLVING Then, we get the mathematic programming: The GRG (Generalized Reduced Gradient) method [13] is employed to solve the problem and calculate the optimal feasible solution. Thus, the vector is the reliability optimization objective of each component. 21

R ELIABILITY ALLOCATION MODELING AND SOLVING However, the solution of the reliability allocation tells only one part of a story. When the results are generated, follow-up question arises: how to improve the reliability of the components in practice? How? 22

A GENDA Introduction Reliability allocation modeling and solving Equivalent redundancy coefficient Case study Conclusions 23

E QUIVALENT REDUNDANCY COEFFICIENT Two ways to improve the reliability of components: substitution (with more reliable components) redundancy (achieved in the component level) The former way is often unavailable, whereas the latter is more effective. Based on the optimal feasible solution, this section further demonstrates the above discussions. 24

E QUIVALENT REDUNDANCY COEFFICIENT According to the reliability of parallel- redundancy components, the equivalent redundancy coefficient θ i is introduced which yields to: θ i can measure the gap between the initial reliability and objective reliability of the component i. 25

E QUIVALENT REDUNDANCY COEFFICIENT Because the calculation result R i is solved by the minimum cost allocation method, the equivalent redundancy coefficient θ i has already taken the cost factors into consideration. When all the other conditions remain the same, the higher the initial cost of the component is, the smaller the equivalent redundancy coefficient θ i becomes. 26

E QUIVALENT REDUNDANCY COEFFICIENT Arrange θ i in descending order and mark the array subscript of the maximum θ i as u, namely: Then the component u is the critical component in the optimization process. If we reduplicate the component u, the total system reliability will improve in the most effective way, while the additional cost remains minimum. Thus, reduplicating the component u is an effective quasi-optimal method in engineering practice. 27

E QUIVALENT REDUNDANCY COEFFICIENT Since the system structure has changed after realizing the redundancy, it is necessary to modify the variable R u in the system reliability function ( ). Check, if can’t meet the objective  Use GRG to find the new θ u 28

E QUIVALENT REDUNDANCY COEFFICIENT The complete process of the method in this paper: 29

A GENDA Introduction Reliability allocation modeling and solving Equivalent redundancy coefficient Case study Conclusions 30

C ASE STUDY We apply the method of the preceding section to a practical digital protection system at the transformer bay of a typical 110kV digital substation to demonstrate the effectiveness. Includes the following components: Protection Main protection (PR) Zero-sequence protection Breaker failure protection Merging unit (MU) Circuit breaker IED (CB IED) Time source (TS) Ethernet media (EM). Transformer auxiliary relay 31

C ASE STUDY Based on the above protection configuration, we can form the RBD for the transformer bay as shown in Fig.2. 32

C ASE STUDY This paper assumes that the life of all the components accord with exponential distribution. It means that the failure rate of each component is constant and their mean time to failure(MTTF) is the reciprocal of the average life expectancy. 33

C ASE STUDY Referring to the parameters listed in paper [2] and [3], this paper estimates the cost, MTTF, and the optimization feasibility parameters of all the components as showed in Table I. 34

C ASE STUDY According to the system RBD, this paper employs minimal path set method to solve the system reliability function, and calculates the reliability of the components as well as the whole system. The initial reliability of the system is , and the optimization objective is set as We implement the GRG method, with the error tolerance to be

C ASE STUDY 36

C ASE STUDY 37

C ASE STUDY 38 The additional costs of quasi-optimal scheme showed in Table V are $9,000, which has risen by 17.51%.

A GENDA Introduction Reliability allocation modeling and solving Equivalent redundancy coefficient Case study Conclusions 39

C ONCLUSIONS The novel method proposed in this paper provides the quasi-optimal redundancy scheme which can be used in practice directly. The methodology proposed in this paper is easy to implement using software and suitable to analyze the digital substation system with arbitrary architectures. 40

C ONCLUSIONS In this research A resource allocation method Other issues Internal factor Component geographic location External factor Nature disaster Attacker Confidential issue about storage Secret sharing 41

Thanks for your listening. 42