Hybridized Symbiotic Organism Search Algorithm for the Optimal Operation of Directional Overcurrent Relays

This paper presents the solution of directional overcurrent relay (DOCR) problems using Simulated Annealing based Symbiotic Organism Search (SASOS). The objective function of the problem is to minimize the sum of the operating times of all primary relays. The DOCR problem is nonlinear and highly constrained with two types of decision variables, namely, the time dial settings (TDS) and plug setting (PS). In this paper, three models of the problem are considered, the IEEE 3-bus, 4-bus, and 6-bus, respectively. We have applied SASOS to solve the problem and the obtained results are compared with other algorithms available in the literature.

Download Full-text

Honey-bee mating optimization (HBMO) algorithm in deriving optimal operation rules for reservoirs

Journal of Hydroinformatics ◽

10.2166/hydro.2008.018 ◽

2008 ◽

Vol 10 (3) ◽

pp. 257-264 ◽

Cited By ~ 60

Author(s):

O. Bozorg Haddad ◽

A. Afshar ◽

M. A. Mariño

Keyword(s):

Honey Bee ◽

Objective Function Value ◽

Search Algorithm ◽

Optimal Solution ◽

Optimal Operation ◽

Local Optimum ◽

Operation Rules ◽

Decision Variables ◽

Starting Point ◽

Honey Bee Mating Optimization

The honey-bee mating process is considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of real honey-bee mating. In this paper, the honey-bee mating optimization (HBMO) algorithm is applied to extract the linear monthly operation rules of reservoirs for both irrigation and hydropower purposes. The release rules for each month are considered as a linear function of the reservoir past-month-end storage as well as current monthly inflow to the reservoir. In such a case, the decision variables are 36 for each problem and are set so that water supply deficits are minimized. In both irrigation and hydropower purposes, 60–480 months are considered and results are compared to those from the nonlinear programming solver of the LINGO 8.0 software. The approach and the rules tend to be very promising and denote the capability of the proposed HBMO algorithm in solving reservoir operation problems. Furthermore, the results indicated that, by using the near-optimal solution from the HBMO as a starting point for the NLP solver, the obtained objective function value was enhanced significantly and a better local optimum was found.

Download Full-text

Optimal Overcurrent Relay Coordination Using Optimized Objective Function

ISRN Power Engineering ◽

10.1155/2014/869617 ◽

2014 ◽

Vol 2014 ◽

pp. 1-10 ◽

Cited By ~ 9

Author(s):

Seyed Hadi Mousavi Motlagh ◽

Kazem Mazlumi

Keyword(s):

Objective Function ◽

Optimization Algorithm ◽

Optimization Problem ◽

Particle Swarm Optimization Algorithm ◽

Hybrid Genetic Algorithm ◽

Objective Functions ◽

Swarm Optimization ◽

Overcurrent Relays ◽

Overcurrent Relay ◽

Novel Strategy

A novel strategy for directional overcurrent relays (DOCRs) coordination is proposed. In the proposed method, the objective function is improved during the optimization process and objective function coefficients are changed in optimization problem. The proposed objective function is more flexible than the old objective functions because various coefficients of objective function are set by optimization algorithm. The optimization problem is solved using hybrid genetic algorithm and particle swarm optimization algorithm (HGAPSOA). This method is applied to 6-bus and 30-bus sample networks.

Download Full-text

Voltage Stability Enhancement with Optimal Placement of IPFC

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.d9748.118419 ◽

2019 ◽

Vol 8 (4) ◽

pp. 9465-9471

Keyword(s):

Transmission Line ◽

Objective Function ◽

Search Algorithm ◽

Cuckoo Search ◽

Test System ◽

Optimal Location ◽

Optimal Placement ◽

Utilization Factor ◽

Location Selection ◽

Multi Objective

This paper presents a novel technique based on Cuckoo Search Algorithm (CSA) for enhancing the performance of multiline transmission network to reduce congestion in transmission line to huge level. Optimal location selection of IPFC is done using subtracting line utilization factor (SLUF) and CSA-based optimal tuning. The multi objective function consists of real power loss, security margin, bus voltage limit violation and capacity of installed IPFC. The multi objective function is tuned by CSA and the optimal location for minimizing transmission line congestion is obtained. The simulation is performed using MATLAB for IEEE 30-bus test system. The performance of CSA has been considered for various loading conditions. Results shows that the proposed CSA technique performs better by optimal location of IPFC while maintaining power system performance

Download Full-text

Optimal Integration of Photovoltaic Sources in Distribution Networks for Daily Energy Losses Minimization Using the Vortex Search Algorithm

Applied Sciences ◽

10.3390/app11104418 ◽

2021 ◽

Vol 11 (10) ◽

pp. 4418

Author(s):

Alejandra Paz-Rodríguez ◽

Juan Felipe Castro-Ordoñez ◽

Oscar Danilo Montoya ◽

Diego Armando Giral-Ramírez

Keyword(s):

Objective Function ◽

Power Flow ◽

Search Algorithm ◽

Peak Load ◽

Distribution Networks ◽

Energy Losses ◽

Continuous Version ◽

Continuous Section ◽

Daily Energy ◽

Discrete Part

This paper deals with the optimal siting and sizing problem of photovoltaic (PV) generators in electrical distribution networks considering daily load and generation profiles. It proposes the discrete-continuous version of the vortex search algorithm (DCVSA) to locate and size the PV sources where the discrete part of the codification defines the nodes. Renewable generators are installed in these nodes, and the continuous section determines their optimal sizes. In addition, through the successive approximation power flow method, the objective function of the optimization model is obtained. This objective function is related to the minimization of the daily energy losses. This method allows determining the power losses in each period for each renewable generation input provided by the DCVSA (i.e., location and sizing of the PV sources). Numerical validations in the IEEE 33- and IEEE 69-bus systems demonstrate that: (i) the proposed DCVSA finds the optimal global solution for both test feeders when the location and size of the PV generators are explored, considering the peak load scenario. (ii) In the case of the daily operative scenario, the total reduction of energy losses for both test feeders are 23.3643% and 24.3863%, respectively; and (iii) the DCVSA presents a better numerical performance regarding the objective function value when compared with the BONMIN solver in the GAMS software, which demonstrates the effectiveness and robustness of the proposed master-slave optimization algorithm.

Download Full-text

Optimal Selection of Conductors in Three-Phase Distribution Networks Using a Discrete Version of the Vortex Search Algorithm

Computation ◽

10.3390/computation9070080 ◽

2021 ◽

Vol 9 (7) ◽

pp. 80

Author(s):

John Fernando Martínez-Gil ◽

Nicolas Alejandro Moyano-García ◽

Oscar Danilo Montoya ◽

Jorge Alexander Alarcon-Villamil

Keyword(s):

Objective Function ◽

Power Flow ◽

Phase Distribution ◽

Search Algorithm ◽

Distribution Networks ◽

Discrete Version ◽

Optimal Selection ◽

Flow Method ◽

Three Phase ◽

Selection Of

In this study, a new methodology is proposed to perform optimal selection of conductors in three-phase distribution networks through a discrete version of the metaheuristic method of vortex search. To represent the problem, a single-objective mathematical model with a mixed-integer nonlinear programming (MINLP) structure is used. As an objective function, minimization of the investment costs in conductors together with the technical losses of the network for a study period of one year is considered. Additionally, the model will be implemented in balanced and unbalanced test systems and with variations in the connection of their loads, i.e., Δ− and Y−connections. To evaluate the costs of the energy losses, a classical backward/forward three-phase power-flow method is implemented. Two test systems used in the specialized literature were employed, which comprise 8 and 27 nodes with radial structures in medium voltage levels. All computational implementations were developed in the MATLAB programming environment, and all results were evaluated in DigSILENT software to verify the effectiveness and the proposed three-phase unbalanced power-flow method. Comparative analyses with classical and Chu & Beasley genetic algorithms, tabu search algorithm, and exact MINLP approaches demonstrate the efficiency of the proposed optimization approach regarding the final value of the objective function.

Download Full-text

EXPRESS: Baseline Correction Based on a Search Algorithm from Artificial Intelligence

Applied Spectroscopy ◽

10.1177/0003702820977512 ◽

2020 ◽

pp. 000370282097751

Author(s):

Xin Wang ◽

Xia Chen

Keyword(s):

Artificial Intelligence ◽

Objective Function ◽

Least Squares ◽

Least Squares Method ◽

Search Algorithm ◽

Absolute Error ◽

Search Problem ◽

Baseline Correction ◽

Current Spectrum ◽

Data Points

Many spectra have a polynomial-like baseline. Iterative polynomial fitting (IPF) is one of the most popular methods for baseline correction of these spectra. However, the baseline estimated by IPF may have substantially error when the spectrum contains significantly strong peaks or have strong peaks located at the endpoints. First, IPF uses temporary baseline estimated from the current spectrum to identify peak data points. If the current spectrum contains strong peaks, then the temporary baseline substantially deviates from the true baseline. Some good baseline data points of the spectrum might be mistakenly identified as peak data points and are artificially re-assigned with a low value. Second, if a strong peak is located at the endpoint of the spectrum, then the endpoint region of the estimated baseline might have significant error due to overfitting. This study proposes a search algorithm-based baseline correction method (SA) that aims to compress sample the raw spectrum to a dataset with small number of data points and then convert the peak removal process into solving a search problem in artificial intelligence (AI) to minimize an objective function by deleting peak data points. First, the raw spectrum is smoothened out by the moving average method to reduce noise and then divided into dozens of unequally spaced sections on the basis of Chebyshev nodes. Finally, the minimal points of each section are collected to form a dataset for peak removal through search algorithm. SA selects the mean absolute error (MAE) as the objective function because of its sensitivity to overfitting and rapid calculation. The baseline correction performance of SA is compared with those of three baseline correction methods: Lieber and MahadevanâJansen method, adaptive iteratively reweighted penalized least squares method, and improved asymmetric least squares method. Simulated and real FTIR and Raman spectra with polynomial-like baselines are employed in the experiments. Results show that for these spectra, the baseline estimated by SA has fewer error than those by the three other methods.

Download Full-text

Efficient Operative Cost Reduction in Distribution Grids Considering the Optimal Placement and Sizing of D-STATCOMs Using a Discrete-Continuous VSA

Applied Sciences ◽

10.3390/app11052175 ◽

2021 ◽

Vol 11 (5) ◽

pp. 2175

Author(s):

Oscar Danilo Montoya ◽

Walter Gil-González ◽

Jesus C. Hernández

Keyword(s):

Objective Function ◽

Reactive Power ◽

Programming Model ◽

Search Algorithm ◽

Solution Space ◽

Distribution Networks ◽

Optimal Placement ◽

Mixed Integer ◽

Solution Vector ◽

The Impact

The problem of reactive power compensation in electric distribution networks is addressed in this research paper from the point of view of the combinatorial optimization using a new discrete-continuous version of the vortex search algorithm (DCVSA). To explore and exploit the solution space, a discrete-continuous codification of the solution vector is proposed, where the discrete part determines the nodes where the distribution static compensator (D-STATCOM) will be installed, and the continuous part of the codification determines the optimal sizes of the D-STATCOMs. The main advantage of such codification is that the mixed-integer nonlinear programming model (MINLP) that represents the problem of optimal placement and sizing of the D-STATCOMs in distribution networks only requires a classical power flow method to evaluate the objective function, which implies that it can be implemented in any programming language. The objective function is the total costs of the grid power losses and the annualized investment costs in D-STATCOMs. In addition, to include the impact of the daily load variations, the active and reactive power demand curves are included in the optimization model. Numerical results in two radial test feeders with 33 and 69 buses demonstrate that the proposed DCVSA can solve the MINLP model with best results when compared with the MINLP solvers available in the GAMS software. All the simulations are implemented in MATLAB software using its programming environment.

Download Full-text