An Analysis of the Branch-and-Bound Method in Solving the Reactive Optimal Power Flow Problem

被引：0

作者：

Matos, Luiza ^{[1
]}

Silva, Daisy ^{[2
]}

Soler, Edilaine ^{[3
]}

机构：

[1] Sao Paulo State Univ UNESP, Sch Engn Bauru, BR-17033360 Sao Paulo, Brazil

[2] Sao Paulo State Univ UNESP, Grad Program Elect Engn, BR-17033360 Sao Paulo, Brazil

[3] Sao Paulo State Univ UNESP, Sch Sci, BR-17033360 Sao Paulo, Brazil

来源：

PROCEEDINGS OF THE 2017 IEEE XXIV INTERNATIONAL CONFERENCE ON ELECTRONICS, ELECTRICAL ENGINEERING AND COMPUTING (INTERCON) | 2017年

基金：

巴西圣保罗研究基金会;

关键词：

DISPATCH;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The purpose of an Optimal Power Flow (OPF) problem is to determine the state of an electric power transmission system that optimizes a given system performance and satisfies its physical and operational constraints. The OPF problem can be mathematically modeled as a nonlinear programming problem with discrete and continuous variables. In this paper, we investigate the efficiency of the Branch-and-Bound method in solving the OPF problem considering its continuous and discrete variables. In order to, three different solutions algorithms involving this method are analyzed. Numerical tests with the IEEE 14, 30, 118 and 300 buses electrical systems are presented.

引用

页数：4

共 50 条

[1] BRANCH-AND-BOUND ALGORITHM FOR SOLVING GENERALIZED PROBLEM OF OPTIMAL ASSIGNMENT
BABKIN, VT
GASRETOV, AL
ZOLOTUKHIN, VF
[J]. ENGINEERING CYBERNETICS, 1977, 15 (06): : 37 - 42
[2] Branch-and-bound technique for solving optimal clustering
Fränti, P
Virmajoki, O
Kaukoranta, T
[J]. 16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL II, PROCEEDINGS, 2002, : 232 - 235
[3] Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
Phan, Dzung T.
[J]. OPERATIONS RESEARCH, 2012, 60 (02) : 275 - 285
[4] OPTIMAL NETWORK PROBLEM - BRANCH-AND-BOUND ALGORITHM
BOYCE, DE
FARHI, A
WEISCHEDEL, R
[J]. ENVIRONMENT AND PLANNING A, 1973, 5 (04) : 519 - 533
[5] Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem
Kolpakov, Roman
Posypkin, Mikhail
[J]. OPEN COMPUTER SCIENCE, 2020, 11 (01) : 116 - 126
[6] BRANCH-AND-BOUND METHOD FOR SOLVING CERTAIN DISCRETE OPTIMAL-CONTROL PROBLEMS
TEPLITSKIY, MG
[J]. ENGINEERING CYBERNETICS, 1975, 13 (05): : 33 - 41
[7] A branch-and-bound method for solving multi-skill project scheduling problem
Bellenguez-Morineau, Odile
Neron, Emmanuel
[J]. RAIRO-OPERATIONS RESEARCH, 2007, 41 (02) : 155 - 170
[8] Effective implementation of algorithm for solving the travelling salesman problem by branch-and-bound method
Kostyuk, Yu L.
[J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 20 (02): : 78 - 90
[9] MODIFIED BRANCH-AND-BOUND METHOD FOR SOLVING A SERIES OF PROBLEMS
SKALETSKII, VV
[J]. AUTOMATION AND REMOTE CONTROL, 1988, 49 (04) : 493 - 499
[10] A Branch-and-Bound Method for Power Minimization of IDMA
Lau, Mark S. K.
Yue, Wuyi
Wang, Peng
Ping, Li
[J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2008, 57 (06) : 3525 - 3537

← 1 2 3 4 5 →