Reactive Power and Voltage Control Based on Mesh Adaptive Direct Search Algorithm

Hosseini, Seyyed Soheil Sadat; Gandomi, Amir H.; Nemati, Alireza; Hosseini, Seyed Hamidreza Sadat

doi:10.1007/978-3-319-18320-6_12

Cited by 3 publications

(21 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(1) To achieve the proper PMU number by optimizing a linear or a quadratic cost function under a topological constraint function considering the limitation of the PMU channel limit capacity. (2) To accomplish this task, branch-and-bound algorithms [37], sequential quadratic programming [42], interior-point methods [42], generalized pattern search algorithms [41,70,71], genetic algorithms [51], and binary swarm optimization [51] are utilized to achieve optimality. (3) We focus on finding the proper PMU number with a branch assignment set solution with a fixed number of channels.…”

Section: Consideration Of This Studymentioning

confidence: 99%

“…Furthermore, derivative-free optimizers (DFOs) are adopted to handle such a kind of nonlinear programming model [22,41,70,71].…”

Section: Definition 9 Statement Of the (P) Problemmentioning

confidence: 99%

“…DFO is a totally free direct-search algorithm that calculates the gradient of the objective and constraint functions per iteration [22,41,70,71].…”

Section: Definition 9 Statement Of the (P) Problemmentioning

confidence: 99%

“…Direct-search algorithms guarantee global convergence to a local solution with optimality conditions fully satisfied [22,41,70,71]. For that convergence, the Clarke calculus is adopted for handling non-smooth functions [22,41,70,71].…”

Section: Definition 9 Statement Of the (P) Problemmentioning

confidence: 99%

See 3 more Smart Citations

Mathematical Models for the Single-Channel and Multi-Channel PMU Allocation Problem and Their Solution Algorithms

Theodorakatos,

Babu,

Theodoridis

et al. 2024

Algorithms

View full text Add to dashboard Cite

Phasor measurement units (PMUs) are deployed at power grid nodes around the transmission grid, determining precise power system monitoring conditions. In real life, it is not realistic to place a PMU at every power grid node; thus, the lowest PMU number is optimally selected for the full observation of the entire network. In this study, the PMU placement model is reconsidered, taking into account single- and multi-capacity placement models rather than the well-studied PMU placement model with an unrestricted number of channels. A restricted number of channels per monitoring device is used, instead of supposing that a PMU is able to observe all incident buses through the transmission connectivity lines. The optimization models are declared closely to the power dominating set and minimum edge cover problem in graph theory. These discrete optimization problems are directly related with the minimum set covering problem. Initially, the allocation model is declared as a constrained mixed-integer linear program implemented by mathematical and stochastic algorithms. Then, the integer linear problem is reformulated into a non-convex constraint program to find optimality. The mathematical models are solved either in binary form or in the continuous domain using specialized optimization libraries, and are all implemented in YALMIP software in conjunction with MATLAB. Mixed-integer linear solvers, nonlinear programming solvers, and heuristic algorithms are utilized in the aforementioned software packages to locate the global solution for each instance solved in this application, which considers the transformation of the existing power grids to smart grids.

show abstract

Section: Consideration Of This Studymentioning

confidence: 99%

“…Furthermore, derivative-free optimizers (DFOs) are adopted to handle such a kind of nonlinear programming model [22,41,70,71].…”

Section: Definition 9 Statement Of the (P) Problemmentioning

confidence: 99%

“…DFO is a totally free direct-search algorithm that calculates the gradient of the objective and constraint functions per iteration [22,41,70,71].…”

Section: Definition 9 Statement Of the (P) Problemmentioning

confidence: 99%

Section: Definition 9 Statement Of the (P) Problemmentioning

confidence: 99%

See 2 more Smart Citations

Mathematical Models for the Single-Channel and Multi-Channel PMU Allocation Problem and Their Solution Algorithms

Theodorakatos,

Babu,

Theodoridis

et al. 2024

Algorithms

View full text Add to dashboard Cite

show abstract

“…Port sweeps in UDP represent a sizable bit of the Internet movement and nearly little research describes security in UDP port output action. To meet the developing pattern of attacks and other security challenges in the constantly advancing web field, this is paper displays a computationally clever intrusion detection instrument utilizing swarm insight worldview, especially ant colony improvement, to break down specimen arrange follows in UDP The fundamental point of this study [6] is introducing port outputs. This work goes for producing a DOS assault intrusion detection framework by3 utilizing support vector relapse and enhancing this calculation by consolidating two calculations of ant colony and firefly.…”

Section: Related Workmentioning

confidence: 99%

Survey on Classification, Detection and Prevention of Network Attacks using Rule based Approach

Kirnapure¹,

Patil²

2017

IJCA

View full text Add to dashboard Cite

Intrusion detection systems(IDS) has assumes an important part to protect the qualities of PC mostly into two classifications: malignant and irrelevant exercises. Intrusion detection can be accomplish by Categorization. Another machine learning based algorithm for order of information is actualized to network intrusion detection is presented in this paper. The most basic employment is to separate exercises of network are as ordinary or irrelevant while decreasing the misclassification. The goal of Intrusion detection framework (IDS) are to apply all the accessible data keeping in mind the end goal to distinguish the attacks by outcast programmers and abuse of insiders. For Network intrusion detection there are diverse arrangement models have been produced, the most regularly connected strategies are Support Vector Machine(SVM) and Ant Colony both consider their qualities and shortcomings independently. To diminishes the shortcoming, blend of the SVM technique with Ant Colony to take the advantages ofboth . A standard benchmark of information set KDD99 is assessed and actualized as another algorithm. Despite the fact that to increment both the grouping rate and runtime adequacy it is important to actualize the Combining Support Vectors with Ant Colony which beat SVM alone . An individual continuous network dataset and a notable dataset i.e. KDD99 CUP has been actualized as proposed framework. All attack sorts, detection rate, detection speed, false alert rate can be measured by execution of intrusion detection framework IDS.

show abstract

A multi-object black hole gravitational search algorithm for day-ahead reactive optimization in distribution network

Pei

Liu³

2016

2016 IEEE Chinese Guidance, Navigation and Control Conference (CGNCC)

View full text Add to dashboard Cite

Reactive Power and Voltage Control Based on Mesh Adaptive Direct Search Algorithm

Cited by 3 publications

References 31 publications

Mathematical Models for the Single-Channel and Multi-Channel PMU Allocation Problem and Their Solution Algorithms

Mathematical Models for the Single-Channel and Multi-Channel PMU Allocation Problem and Their Solution Algorithms

Survey on Classification, Detection and Prevention of Network Attacks using Rule based Approach

A multi-object black hole gravitational search algorithm for day-ahead reactive optimization in distribution network

Contact Info

Product

Resources

About