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.

With the increasing emphasis on energy conservation and environmental protection, fuel cost and emission should be both considered into economic dispatch. The multi-area economic/emission dispatch (MOMAED) is a complex non-convex multi-objective problem, which is not yet addressed well. Aiming at this problem, this paper proposes an efficient and powerful crisscross optimization algorithm (CSO) combining Pareto multi-objective processing strategy(MOCSO). The proposed MOCSO approach addresses the different types of complex MOMAED problem by applying two interacting search operators, namely horizontal crossover and vertical crossover. The former enhances MOCSO's global search ability in complex solution space by introducing a distinctive cross-border crossover mechanism while the latter prevents the premature convergence by a unique dimensional crossover approach. Both operators generate moderation solutions and always maintain a population of currently personal best solutions through a greedy update strategy so as to speed up the process of finding the optimal solution. The proposed approach is validated on two test systems. The effectiveness and efficiency of the MOCSO algorithm is first tested on the MOMAED problems. The results show that the proposed MOCSO method yields higher quality solutions than other methods in the literature.

Two new crossover operators in genetic algorithms for solving some combinatorial problems with ordering are presented. One is enhanced order crossover (EOX). The other, GREE, is a heuristic crossover for a class of combinatorial optimization problems, such as traveling salesman problems (TSPs). Genetic algorithms using GREE as unique crossover run very fast and get good solutions. Combining GREE with EOX, genetic algorithms can find optimal or very near optimal solutions in a rather short time. >

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

The effects of two new crossover operators on genetic algorithm performance

Based on Latin Hypercube Sampling method, the crossover operation in GA is redesigned; combined with immune mechanism, chromosome concentration is defined and clonal selection strategy is designed, thus an Immune Genetic Algorithm is given based on Latin Hypercube Sampling for solving the Maximum Clique Problem in this paper. The examples shows the new algorithm in solution quality, convergence speed, and other indicators is better than the classical genetic algorithm and good point set genetic algorithm. On the other hand, the new algorithm is not inferior to such classical algorithms as dynamic local search, and it got better solutions to some examples.KeywordsMaximum Clique Problem(MCP)Genetic Algorithm (GA)Latin Hypercube Sampling(LHS)Artificial Immune Systems(AIS)Immune Genetic Algorithm based on Latin Hypercube Sampling(LIGA)

Genetic Algorithm(GA) is a guided random search and the guiding direction always aims at the family whose ancestors have schemata with high fitness.Based on the results,the crossover operation in GA was redesigned by using the principle of random uniform design sampling and combining the locale search strategy.Then a new GA called Genetic Algorithm based on Uniform Design Sampling(UDS) was presented.The new GA was applied to solve the 2-way graph partitioning problem.Compared to simple GA and good point GA for solving this problem,the simulation results show that the new GA has superiority in terms of speed and accuracy and overcomes premature convergence.

Crossover is the main genetic operator which influences the power of evolutionary algorithms. Among a variety of crossover operators, there has been a growing interest in multi-parent crossover operators in evolutionary computation. The main motivation of those schemes is establishing comprehensive collective collaboration of more than two chromosomes in the population to generate a new offspring. In this paper, a novel all-parent crossover operator called collective crossover for genetic algorithm is proposed. In this method, all individuals in the current population are involved in recombination part and one offspring is generated. The contribution of each individuals is defined based on its quality in terms of fitness value. The performance of the collective crossover operator is tested on CEC2017 benchmark functions. The results revealed that the proposed crossover operator performs better when compared to well-known two-parent crossover operators including one-point and two-point crossovers. In addition, the differences between collective crossover and the other crossover operators are statistically significant for the most cases.

In this paper, Current Injection Modeling of a novel FACTS Controller namely, Unified power flow controller is proposed and its incorporation into the conventional Newton Raphson load flow method is thoroughly projected for analyzing the impact of device on system parameters. Incorporation of FACTS devices employs a vital role in Optimal Power Flow problems, so a proposed Criss Cross Optimization Algorithm is implemented for single objective optimal power flow problems. The execution and feasibility of the proposed algorithm is analyzed on IEEE 30-bus power system. The obtained results which are detailed in literature show clearly the superiority of proposed algorithm over other already existing algorithms.

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 wide usage of tensor computation in deep neural networks (DNNs) has boosted the high demand for high-performance and flexible library implementation on different hardware platforms, which is time-cost and inefficient. Deep learning compilers (DLCs) are therefore proposed, such as Ansor, to search the optimization computation combinations automatically. Ansor can generate high-performance tensor programs by employing Genetic Algorithm (GA) in its auto-tuning process. However, the structure information of an individual is easily destroyed by the uniform crossover operator, which leads to low search efficiency. In this paper, we propose a two-point crossover operator applied in Ansor called Ansor-TPC, which can optimize tensor computation with higher efficiency. The tensor expression can be computed with random schedules regarded as individuals. When performing the crossover operator, Ansor-TPC exchanges parent genes at two points instead of every point, which can preserve the structure information of programs and find the optimal schedule combination in the large search space. A high-performance program is generated for targeted hardware based on the optimized schedule configuration. Ansor-TPC is compared with the benchmarks at different levels. In terms of average performance, Ansor-TPC achieves 1.07--23.2× performance speedup. In terms of the best performance, Ansor-TPC outperforms by up to 1.06--23.0×.

Genetic algorithms (GA) are one of the most successful techniques in solving combinatorial optimization problems. Its general character has enabled its application to different types of problems: vehicle routing, planning, scheduling, etc. This article shows that there is controversy in the basic structure of the algorithm steps when it is applied at routing problems. Specifically in this paper we show that the crossover (CX) offers no advantage in the optimization process. To solve such problems, the most important steps are mutation and selection of individuals. These two steps are what help to analyze the solution space exhaustively and give GA optimization capability. To prove our hypothesis we will analyze the results obtained by applying different blind crossover operators to solve multiple instances of the TSP (Travelling Salesman Problem).

We review the recent work done by our group on theoretically analyzing the behavior of genetic algorithms(GAs) and searching for new ideas and strategies to design more efficient GAs. By introducing the concept of degree of population diversity and using the tools from finite Markov chain, we presented fairly clear characterizations of premature convergence in GAs and proved some results on the relationships between premature convergence and GA’s control parameters such as the population size, the mutation and crossover probabilities, and some population statistics. In the mean time, we have also obtained a result that depicts the search ability of the crossover operators in GAs. An upper bound on the convergence rate for the GAs has been established. Based on the theoretical analyses, we have proposed a novel GA called Genetic Algorithm with No Genetic Operators (GANGO), which needs neither to maintain a population nor to use the conventional genetic operators, and yet has the same search mechanisms as the classical GAs. As another development in improving the performance of GAs, a new concept called Dual Fitness Function was proposed which, when incorporated into the classical GAs will enable the algorithms to judge whether the current population is in the local or global attractive basins. And in this way, the control parameters of GAs can be adjusted adaptively. Some applications of our results to fields such as fuzzy systems, multi-destination routing problem (MDR) are briefly

Due to the randomness and volatility of photovoltaic power generation, it is necessary to accurately predict photovoltaic power. Therefore, this paper proposes the similar day theory and the Complete ensemble empirical mode decomposition with adaptive noise(CEEMDAN), and optimizes the BP neural network by using the Crisscross optimization algorithm (CSO), in order to make short-term prediction of photovoltaic power. First of all, CEEMDAN is used to decompose the intrinsic mode of photovoltaic power, so as to eliminate the noise and burr. Then, the Similar day theory, small data sets and the concept of comprehensive similarity are used to select similar days. In addition, the weights and thresholds of BP neural network are optimized by crisscross algorithm, in order to make up for the defect that BP neural network is tend to sink into local optimal solution. Finally, the data are input into BP neural network to compare the predicted results with the actual results. The analysis of an example shows that the proposed model has higher prediction accuracy and efficiency than the traditional BP model.

The state of charge (SOC) of the battery is an index set to measure the leftover capacity of the battery. Its scientific estimation plays a vital role in ensuring the secure operation and efficient control of the battery. To enhance the certainty of battery SOC estimation, this study proposes a SOC estimation approach that blends the unscented Kalman filter (UKF) and the crisscross optimization algorithm (CSO) based on a second-order RC network equal battery model. Building upon hybrid pulse power characteristic (HPPC) testing and parameter estimation using the least squares method, the battery SOC is estimated using the urban dynamometer driving schedule (UDDS) test data and the UKF algorithm. Different from the extended Kalman filter (EKF), the UKF algorithm avoids the loss of multi-system nonlinearity during the linearization process through the Gaussian transformation based on sigma points. The CSO algorithm is utilized to calculate the noise in the battery model estimation by considering the battery charge-discharge voltage, current, and estimation results. By excluding the estimation error from the original estimation statistics, more accurate estimation statistics are obtained. Experimental analysis is conducted by comparing the proposed CSO-UKF algorithm with the UKF algorithm and the PSO-UKF algorithm, using battery charge-discharge data collected under the UDDS operating condition with a battery charge-discharge test instrument. The experimental statistics endorse the effectiveness and trustworthiness of the proposed algorithm.