Computation of optimal break point set of relays - An integer linear programming approach

Rajeev Kumar Gajbhiye; Anindya De; S. A. Soman

doi:10.1109/TPWRD.2007.905539

Computation of optimal break point set of relays - An integer linear programming approach

Rajeev Kumar Gajbhiye^*, Anindya De, S. A. Soman

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

Abstract

We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed version of the ILP can be efficiently solved by the dual-simplex method. The performance of the proposed algorithm is compared and contrasted with existing algorithms. Case studies on various test systems show the efficacy of the proposed approach.

Original language	English (US)
Pages (from-to)	2087-2098
Number of pages	12
Journal	IEEE Transactions on Power Delivery
Volume	22
Issue number	4
DOIs	https://doi.org/10.1109/TPWRD.2007.905539
State	Published - Oct 2007

Keywords

Greedy algorithms
Integer linear programming
Linear programming
Minimum break point set (MBPS)
NP-complete problem
Relays

ASJC Scopus subject areas

Energy Engineering and Power Technology
Electrical and Electronic Engineering

Access to Document

10.1109/TPWRD.2007.905539

Cite this

@article{401b636cb74c481dbc73ac5d5339465e,

title = "Computation of optimal break point set of relays - An integer linear programming approach",

abstract = "We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed version of the ILP can be efficiently solved by the dual-simplex method. The performance of the proposed algorithm is compared and contrasted with existing algorithms. Case studies on various test systems show the efficacy of the proposed approach.",

keywords = "Greedy algorithms, Integer linear programming, Linear programming, Minimum break point set (MBPS), NP-complete problem, Relays",

author = "Gajbhiye, {Rajeev Kumar} and Anindya De and Soman, {S. A.}",

note = "Funding Information: Manuscript received July 7, 2006; revised December 26, 2006. This work was supported by CPRI Project (02PW001) “Coordination of Overcurrent and Distance Relays Considering Power Swings in Object Oriented Paradigm”. Paper no. TPWRD-00390-2006. R. K. Gajbhiye and S. A. Soman are with the Indian Institute of Technology, Bombay 400076, India (e-mail: [email protected]; [email protected]). A. De is with the Indian Institute of Technology, Kanpur 208016, India (e-mail: [email protected]). Digital Object Identifier 10.1109/TPWRD.2007.905539",

year = "2007",

month = oct,

doi = "10.1109/TPWRD.2007.905539",

language = "English (US)",

volume = "22",

pages = "2087--2098",

journal = "IEEE Transactions on Power Delivery",

issn = "0885-8977",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Computation of optimal break point set of relays - An integer linear programming approach

AU - Gajbhiye, Rajeev Kumar

AU - De, Anindya

AU - Soman, S. A.

N1 - Funding Information: Manuscript received July 7, 2006; revised December 26, 2006. This work was supported by CPRI Project (02PW001) “Coordination of Overcurrent and Distance Relays Considering Power Swings in Object Oriented Paradigm”. Paper no. TPWRD-00390-2006. R. K. Gajbhiye and S. A. Soman are with the Indian Institute of Technology, Bombay 400076, India (e-mail: [email protected]; [email protected]). A. De is with the Indian Institute of Technology, Kanpur 208016, India (e-mail: [email protected]). Digital Object Identifier 10.1109/TPWRD.2007.905539

PY - 2007/10

Y1 - 2007/10

N2 - We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed version of the ILP can be efficiently solved by the dual-simplex method. The performance of the proposed algorithm is compared and contrasted with existing algorithms. Case studies on various test systems show the efficacy of the proposed approach.

AB - We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed version of the ILP can be efficiently solved by the dual-simplex method. The performance of the proposed algorithm is compared and contrasted with existing algorithms. Case studies on various test systems show the efficacy of the proposed approach.

KW - Greedy algorithms

KW - Integer linear programming

KW - Linear programming

KW - Minimum break point set (MBPS)

KW - NP-complete problem

KW - Relays

UR - http://www.scopus.com/inward/record.url?scp=35148831648&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35148831648&partnerID=8YFLogxK

U2 - 10.1109/TPWRD.2007.905539

DO - 10.1109/TPWRD.2007.905539

M3 - Article

AN - SCOPUS:35148831648

SN - 0885-8977

VL - 22

SP - 2087

EP - 2098

JO - IEEE Transactions on Power Delivery

JF - IEEE Transactions on Power Delivery

IS - 4

ER -

Computation of optimal break point set of relays - An integer linear programming approach

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this