Improve Crisscross Optimization Algorithm for Solving the Multi-Area Economic/Emission Dispatch

Crisscross optimization algorithm and its application

Distributed generation (DG) systems are integral parts in future distribution networks. In this paper, a novel approach integrating crisscross optimization algorithm and Monte Carlo simulation (CSO-MCS) is implemented to solve the optimal DG allocation (ODGA) problem. The feature of applying CSO to address the ODGA problem lies in three interacting operators, namely horizontal crossover, vertical crossover and competitive operator. The horizontal crossover can search new solutions in a hypercube space with a larger probability while in the periphery of each hypercube with a decreasing probability. The vertical crossover can effectively facilitate those stagnant dimensions of a population to escape from premature convergence. The competitive operator allows the crisscross search to always maintain in a historical best position to quicken the converge rate. It is the combination of the double search strategies and competitive mechanism that enables CSO significant advantage in convergence speed and accuracy. Moreover, to deal with system uncertainties such as the output power of wind turbine and photovoltaic generators, an MCS-based method is adopted to solve the probabilistic power flow. The effectiveness of the CSO-MCS method is validated on the typical 33-bus and 69-bus test system, and results substantiate the suitability of CSO-MCS for multi-objective ODGA problem.

Hybrid chameleon swarm algorithm with multi-strategy: A case study of degree reduction for disk Wang–Ball curves

Aiming at the defects of the Aquila optimizer (AO) in dealing with some complex optimization problems, such as slow convergence speed, low convergence accuracy, and easy to fall into local optimum, in this paper, a hybrid Aquila optimizer (HAO) algorithm based on Gauss map and crisscross operator is proposed. First, Gauss map is introduced to initialize the Aquila population to improve the quality of the initial population. Then use the crisscross operator to promote the exchange of information within the population and maintain the diversity of the population in each iteration, which not only enhances the ability of the algorithm to jump out of the local optimum but also accelerates the global convergence of the algorithm. The results of experiments using 21 classical benchmark functions indicate that HAO has better global search ability, faster convergence speed, and better stability than AO. The overall optimization performance of HAO in different dimensions is better than particle swarm optimization (PSO) algorithm, gray wolf optimization (GWO) algorithm, whale optimization algorithm (WOA), and crisscross optimization (CSO) algorithm. Finally, the results of K-means clustering optimization on six University of California (UCI) standard data sets demonstrate that HAO has significant advantages over three algorithms that are good at clustering optimization.

The Economic Dispatch (ED) is one of the most important optimization problems in power systems the ultimate goal of the ED is to minimize the cost of operations in a power generation. In this paper, the Woodpecker Mating Algorithm (WMA) is used to solve the ED problem considering the nonlinear properties of generators such as valve point effects (VPE), prohibited operating zones (POZ), ramp rate limits, multiple fuel options, and transmission loss. The WMA algorithm is a novel metaheuristic algorithm inspired by the mating behavior of woodpeckers and sound intensity (a physical quantity). The WMA is implemented on six test systems of different operational dimensions and characteristics to show its capacity for solving the ED problem. The results are compared with the latest and most efficient methods introduced in the literature. Proving the efficiency of the WMA to solve the ED problem, simulation results are promising and offer the optimal fuel cost of production.

Solving non-convex economic load dispatch problem via artificial cooperative search algorithm

This paper presents an efficient approach for solving economic dispatch(ED) problem with non-convex cost functions using particle swarm optimization with time varying acceleration coefficients. PSO_TVAC is applied to 3, 13, & 14 unit test system with and without valve point loading effects. The results of PSO_TVAC are compared with PSO From simulation results, it is clear that PSO_TVAC performance is better than many well settled nature inspired algorithms.Economic dispatch is one of the key functions of the modern energy management system. Classical particle swarm optimization (PSO) algorithm is capable of achieving near global solutions for such problems but it tends to converge prematurely. The practical Non Convex Economic Dispatch problem is solved here using PSO with a novel parameter automation strategy in which time varying acceleration coefficients (TVAC) are employed to efficiently control the local and global search, such that premature convergence is avoided and global solutions are achieved.

Solving non-convex economic dispatch problem with valve point effects using modified group search optimizer method

Single period economic dispatch cannot handle the intertemporal constraints in multi-period environment. To cope with this issue, the extension of economic dispatch over multiple time intervals (i.e., dynamic economic dispatch) has been introduced that considers the intertemporal constraints between different time intervals. Another issue is determining the most economical generation dispatch that could supply the area demand without violating the tie-line capacity, which cannot be solved by conventional economic dispatch problems. However, this study shows that the most economic schedule of power generation cannot satisfy echo-system expectation; therefore, making a compromise between fuel cost and environmental issues, a hot-button subject in industrialized nations, seems to be crucial. To reach the goals a bi-objective multi-area dynamic economic dispatch approach, which can handle intertemporal and multi-area constraints concurrently, is proposed to assist power system operators more and more. Finally, a hybrid algorithm, namely gray wolf optimizer-particle swarm optimization is introduced to solve the proposed problem and also a set of benchmark problems. By implementing the proposed approach on two small (10-unit, three areas) and large (40-unit, four areas) scale test systems, about 3.1% and 3.3% improvement in generation cost is obtained, respectively compare to the best reported results in the literature.

Hybrid neuro-fuzzy system for power generation control with environmental constraints

Evolutionary multi-objective optimization algorithms are generally employed to generate Pareto optimal solutions by exploring the search space. To enhance the performance, exploration by global search can be complemented with exploitation by combining it with local search. In this paper, we address the issues in integrating local search with global search such as: how to select individuals for local search; how deep the local search is performed; how to combine multiple objectives into single objective for local search. We introduce a Preferential Local Search mechanism to fine tune the global optimal solutions further and an adaptive weight mechanism for combining multi-objectives together. These ideas have been integrated into NSGA-II to arrive at a new memetic algorithm for solving multi-objective optimization problems. The proposed algorithm has been applied on a set of constrained and unconstrained multi-objective benchmark test suite. The performance was analyzed by computing different metrics such as Generational distance, Spread, Max spread, and HyperVolume Ratio for the test suite functions. Statistical test applied on the results obtained suggests that the proposed algorithm outperforms the state-of-art multi-objective algorithms like NSGA-II and SPEA2. To study the performance of our algorithm on a real-world application, Economic Emission Load Dispatch was also taken up for validation. The performance was studied with the help of measures such as Hypervolume and Set Coverage Metrics. Experimental results substantiate that our algorithm has the capability to solve real-world problems like Economic Emission Load Dispatch and is able to produce better solutions, when compared with NSGA-II, SPEA2, and traditional memetic algorithms with fixed local search steps.

In this paper, an effective and reliable variant of particle swarm optimization with time-varying acceleration coefficients (PSO-TVAC) technique is proposed for the economic load dispatch problem considering valve-point loading effect. Main objective of the economic load dispatch (ELD) problem is to minimize the fuel cost by allocating the generation of the committed units subjected to the equality and inequality constraints. Equation of the economic dispatch objective function gets modified with the addition of a new parameter which represents the effect of valve-point loading. While exploring the use of PSO and its other variants to the economic dispatch problem, a number of research works have not considered the transmission losses properly. This paper represents the usefulness of the proposed PSO-TVAC algorithm to significantly reduce the fuel cost while taking into account the effect of transmission losses along with the non-convex characteristic due to valve loading. The results have been demonstrated for three-generator and ten-generator test systems.

A stochastic conjugate gradient multi-modulus algorithm based on global artificial fish swarm and genetic optimization DNA encoding sequences(GAFS-GDNA-SMMA) is proposed to solve the high computational loads, low convergence rate, and large mean square error(MSE) of the multi-modulus blind equalization algorithm(MMA). In this proposed algorithm, the optimal DNA coding sequence can be found and used as the initial optimal weight vector of the stochastic conjugate gradient MMA(SMMA) after decoding the optimization DNA sequences. The simulation results show that the proposed algorithm has the faster convergence speed and smaller mean square error comparison with MMA, SMMA, GA-DNA-SMMA(Genetic algorithm and DNA optimization based SMMA)

The Economic Dispatch (ED) goal is to reduce the cost of fuel for any viable demand of load, though maintain optimum power output at the same time. The practical problem of ED includes valve-point effect and piecewise cost functions due to multiple fuels. Due to presence of valve-point effect and piecewise cost function ED modelled as complex problem. It is challenging to find global finest point by using classic methods. In this paper, Spotted Hyena Optimization (SHO) is used to solve complex ED problem. SHO is a new most eristic algorithm motivated by spotted hyena behavior. The key idea behind SHO algorithm is social connection between spotted hyenas and their collective behaviour. SHO algorithm basic steps are looking for prey, surrounding and attacking prey. This SHO algorithm has been evaluate on 10-unit system with practical constraints for solution of complex ED problem. For given test system four case studies are performed for four different load demands. The test system results are compared with recently published journals results to check the consistency of SHO for solving complex ED problem. The comparative results proven that SHO is better optimization technique to solve complex ED problem.

Economic dispatch using particle swarm optimization with bacterial foraging effect