Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis

Abstract Safe operation of the power grid requires a complete and robust control network to ensure full observability. However, redundancy measurements can create problems in expense, management, and control. The optimal phasor measurement unit (PMU) positioning problem (OPPP) is proposed to limit t...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Rohit Babu, Saurav Raj, Bishwajit Dey, Biplab Bhattacharyya
Formato:	article
Lenguaje:	EN
Publicado:	Wiley 2021
Materias:	Computational linguistics. Natural language processing P98-98.5 Computer software QA76.75-76.765
Acceso en línea:	https://doaj.org/article/7fd0e93badf146b789c3435a707706e4
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:7fd0e93badf146b789c3435a707706e4
record_format	dspace
spelling	oai:doaj.org-article:7fd0e93badf146b789c3435a707706e42021-11-17T03:12:43ZModified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis2468-232210.1049/cit2.12038https://doaj.org/article/7fd0e93badf146b789c3435a707706e42021-12-01T00:00:00Zhttps://doi.org/10.1049/cit2.12038https://doaj.org/toc/2468-2322Abstract Safe operation of the power grid requires a complete and robust control network to ensure full observability. However, redundancy measurements can create problems in expense, management, and control. The optimal phasor measurement unit (PMU) positioning problem (OPPP) is proposed to limit the number of PMUs deployed in the power grid and ensure the whole grid's observability in the meantime. A modified branch‐and‐bound algorithm (MBBA) to unravel the OPPP is presented. Original BBA, which uses a single search order to create a binary tree, gives only one solution to the OPPP, although more than one optimal solution exists. The proposed MBBA method consists of two different stages: the vertexes in the search tree are investigated by depth‐first search (DFS) in stage 1, and the search route continues as the breadth‐first search. In stage 1, the LP relaxing problems are solved by dual simplex, and in stage 2, the basic viable solution from stage 1 is used to configure the primary simplex until the optimum solution is found. OPPP is formulated as a binary decision variable MBBA model, minimizing linear objective function subject to linear matrix observability constraints. The MBBA model is unravelled using a linear integer‐based external approximation scheme. IEEE test systems are used to check the feasibility of the proposed approach. Matlab software performs simulation based on a number of graph theory‐based methods such as DFS, graph‐theoretical method, simulated annealing, and recursive N‐algorithms. These algorithms are compared to the algorithmic perspective of the proposed MBBA method. IEEE test network results confirm the validity of the proposed methodology.Rohit BabuSaurav RajBishwajit DeyBiplab BhattacharyyaWileyarticleComputational linguistics. Natural language processingP98-98.5Computer softwareQA76.75-76.765ENCAAI Transactions on Intelligence Technology, Vol 6, Iss 4, Pp 450-470 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Computational linguistics. Natural language processing P98-98.5 Computer software QA76.75-76.765
spellingShingle	Computational linguistics. Natural language processing P98-98.5 Computer software QA76.75-76.765 Rohit Babu Saurav Raj Bishwajit Dey Biplab Bhattacharyya Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis
description	Abstract Safe operation of the power grid requires a complete and robust control network to ensure full observability. However, redundancy measurements can create problems in expense, management, and control. The optimal phasor measurement unit (PMU) positioning problem (OPPP) is proposed to limit the number of PMUs deployed in the power grid and ensure the whole grid's observability in the meantime. A modified branch‐and‐bound algorithm (MBBA) to unravel the OPPP is presented. Original BBA, which uses a single search order to create a binary tree, gives only one solution to the OPPP, although more than one optimal solution exists. The proposed MBBA method consists of two different stages: the vertexes in the search tree are investigated by depth‐first search (DFS) in stage 1, and the search route continues as the breadth‐first search. In stage 1, the LP relaxing problems are solved by dual simplex, and in stage 2, the basic viable solution from stage 1 is used to configure the primary simplex until the optimum solution is found. OPPP is formulated as a binary decision variable MBBA model, minimizing linear objective function subject to linear matrix observability constraints. The MBBA model is unravelled using a linear integer‐based external approximation scheme. IEEE test systems are used to check the feasibility of the proposed approach. Matlab software performs simulation based on a number of graph theory‐based methods such as DFS, graph‐theoretical method, simulated annealing, and recursive N‐algorithms. These algorithms are compared to the algorithmic perspective of the proposed MBBA method. IEEE test network results confirm the validity of the proposed methodology.
format	article
author	Rohit Babu Saurav Raj Bishwajit Dey Biplab Bhattacharyya
author_facet	Rohit Babu Saurav Raj Bishwajit Dey Biplab Bhattacharyya
author_sort	Rohit Babu
title	Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis
title_short	Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis
title_full	Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis
title_fullStr	Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis
title_full_unstemmed	Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis
title_sort	modified branch‐and‐bound algorithm for unravelling optimal pmu placement problem for power grid observability: a comparative analysis
publisher	Wiley
publishDate	2021
url	https://doaj.org/article/7fd0e93badf146b789c3435a707706e4
work_keys_str_mv	AT rohitbabu modifiedbranchandboundalgorithmforunravellingoptimalpmuplacementproblemforpowergridobservabilityacomparativeanalysis AT sauravraj modifiedbranchandboundalgorithmforunravellingoptimalpmuplacementproblemforpowergridobservabilityacomparativeanalysis AT bishwajitdey modifiedbranchandboundalgorithmforunravellingoptimalpmuplacementproblemforpowergridobservabilityacomparativeanalysis AT biplabbhattacharyya modifiedbranchandboundalgorithmforunravellingoptimalpmuplacementproblemforpowergridobservabilityacomparativeanalysis
_version_	1718425996548374528

Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: A comparative analysis

Ejemplares similares