• Energy Research

<p>This paper presents cuckoo search algorithm (CSA) for solving non-convex economic load dispatch (ELD) problems of fossil fuel fired generators considering transmission losses and valve point loading effect. CSA is a new meta-heuristic optimisation technique inspired from the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds of other species. The strength of the proposed meta-heuristic optimization technique CSA has been tested and validated on the standard IEEE 14-bus, 26-bus and 30-bus system with several heuristic load patterns. The results have indicated that the proposed approach is able to obtain significant economic load dispatch solutions than those of Firefly Algorithm (FFA) and other soft computing techniques reported in the literature.</p>

Abstract The primary objective of CDEED (combined dynamic economic emission dispatch) problem is to determine the optimal power generation schedule for the online generating units over a time horizon considered and simultaneously minimizing the emission level and satisfying the generators and system constraints. The CDEED problem is bi-objective optimization problem, where generation cost and emission are considered as two competing objective functions. This bi-objective CDEED problem is represented as a single objective optimization problem by assigning different weights for each objective functions. The weights are varied in steps and for each variation one compromise solution are generated and finally fuzzy based selection method is used to select the best compromise solution from the set of compromise solutions obtained. In order to reflect the test systems considered as real power system model, the security constraints are also taken into account. Three new versions of DHS (differential harmony search) algorithms have been proposed to solve the CDEED problems. The feasibility of the proposed algorithms is demonstrated on IEEE-26 and IEEE-39 bus systems. The result obtained by the proposed CSADHS (chaotic self-adaptive differential harmony search) algorithm is found to be better than EP (evolutionary programming), DHS, and the other proposed algorithms in terms of solution quality, convergence speed and computation time.

Abstract Dynamic economic dispatch (DED) is one of the main optimization problems in electrical power system operation and control. DED problem is a non-smooth and non-convex problem when valve point effect, ramp-rate limits and prohibited operating zones of generation units are taken into account. This paper proposes an efficient chaotic self-adaptive differential harmony search (CSADHS) algorithm to solve the complicated DED problem in the presence of valve point effect, ramp-rate limits and prohibited operating zones constraints. In the proposed algorithm, chaotic self-adaptive differential mutation operator is used instead of pitch adjustment operator in the harmony search (HS) algorithm, to enhance the searching performance to find the quality solution. The effectiveness of the proposed algorithm is demonstrated on 10, 15 and 30 unit systems for a period of 24 h. The simulation results obtained by the proposed algorithm are compared with the results obtained, using differential harmony search (DHS) algorithm, chaotic differential harmony search (CDHS) algorithm, and also with the results of other methods available in the literature. In terms of solution quality, the proposed algorithm is found to be better than other algorithms and in terms of speed of convergence, standard deviation of generation cost, and computational time, the proposed algorithm is better than DHS and CDHS algorithm.

The modest objective is to check the integrated effect of energy storage systems (ESSs) and distributed generations (DGs) and compare the optimization of the size and location of ESS and DG to explore its challenges for smart grids (SGs) modernization. The research enlisted different algorithms for cost-effectiveness, security, voltage control, and less power losses. From this perspective, optimization of the distribution network’s energy storage and capacity are being performed using a variety of methods, including the particle swarm, ant-lion optimization, genetic, and flower pollination algorithms. The experimental outcomes demonstrate the effectiveness of these techniques in lowering distribution network operating costs and controlling system load fluctuations. The efficiency and dependability of the distribution network (DN) are both maximized by these strategies.

This paper deals with the problem of the optimal selection of capacitor banks in electrical AC distribution systems for minimizing the costs of energy losses during a year of operation through a discrete version of the vortex search algorithm (DVSA). This algorithm works with a hypersphere with a variable radius defined by an exponential function where a Gaussian distribution is used to generate a set of candidate solutions uniformly distributed around the center of this hypersphere. This center corresponds to the best solution obtained at the iteration t, which is initialized at the center of the solution space at the iterative search beginning. The main advantage of combining the exponential function with the Gaussian distribution is the correct balance between the exploration and exploitation of the solution space, which allows reaching the global optimal solution of the optimization problem with a low standard deviation, i.e., guaranteeing repeatability at each simulation. Two classical distribution networks composed of 33 and 69 nodes were used to validate the proposed DVSA algorithm. They demonstrated that the DVSA improves numerical reports found in specialized literature regarding the optimal selection and location of fixed-step capacitor banks with a low computational burden. All the simulations were carried out in MATLAB software.

This paper presents Interior search algorithm for solving economic load dispatch problem of a microgrid. ISA is a aesthetic seeking algorithm which is inspired from the interior design and decoration. The efficacy of ISA has been validated on a simple microgrid test system which comprises wind generators, fuel cells, diesel generators. Simulation results reveal that ISA appears to be a robust unconventional technique for elucidating the ELD problems in microgrid when compared with the other optimization techniques taking into consideration the superiority of the solution attained.

This paper presents a chaotic firefly algorithm (CFA) to solve economic load dispatch (ELD) problems. In the proposed algorithm, chaotic variables generated using tent map are used in the control parameters of FA algorithm, instead of rand number generator to improve the searching capacity of FA and to find the better optimum solution. The effectiveness of the proposed algorithm has been tested with 13, 15, 40, 10 units with multiple fuel options and IEEE-30 bus system with different constraints, such as power balance, prohibited operating zones, ramp-rate limits, bus voltage constraints and line flow limits. The results obtained by the proposed algorithm are compared with the results of FA and other soft computing techniques reported in literature. The results obtained reveal that the optimal results obtained by the proposed algorithm are better than FA and other soft computing techniques reported in the literature. Furthermore, the proposed algorithm has good convergence characteristic in all the test cases considered.

Power losses (PL) are one of the most—if not the most—vital concerns in power distribution networks (DN). With respect to sustainability, distribution network reconfiguration (DNR) is an effective course of action to minimize power losses. However, the optimal DNR is usually a non-convex optimization process that necessitates the employment of powerful global optimization methods. This paper proposes a novel hybrid metaheuristic optimization (MO) method called the chaotic golden flower algorithm (CGFA) for PL minimization. As the name implies, the proposed method combines the golden search method with the flower pollination algorithm to multiply their benefits, guarantee the best solution, and reduce convergence time. The performance of the algorithm has been evaluated under different test systems, including the IEEE 33-bus, IEEE 69-bus, and IEEE 119-bus systems and the smart city (SC) network, each of which includes distributed-generation (DG) units and energy storage systems (ESS). In addition, the locations of tie-switches in the DN, which used to be considered as given information in previous studies, are assumed to be variable, and a branch-exchange adaption is included in the reconfiguration process. Furthermore, uncertainty analysis, such as bus and/or line fault conditions, are studied, and the performance of the proposed method is compared with other pioneering MO algorithms with minimal standard deviations ranging from 0.0012 to 0.0101. The case study of SC is considered and the obtained simulation results show the superiority of the algorithm in finding higher PL reduction under different scenarios, with the lowest standard deviations ranging from 0.012 to 0.0432.