The grey prediction evolution algorithm based on the even grey model (GPEAe) proposed by Z.B.Hu et al. in 2019 is a competitively stochastic real-parameter optimization algorithm with characters of simple code, less parameters and strong exploration capability. To improve the algorithmic overall performance, a topological opposition-based learning strategy (TOBL) is first developed to enhance its exploitation capability in this paper. The TOBL determines offsprings by calculating the Manhattan distances between the current best individual and all the vertices of the hypercube inspired by the opposition-based learning strategy. An improved grey prediction evolutionary algorithm based on the TOBL (TOGPEAe) is then proposed. The performance of the TOGPEAe is tested on CEC2005, CEC2014 benchmark functions and a test suite composed of six engineering design problems. The experimental results of the TOGPEAe are very competitive compared with those of the original GPEAe and other state-of-the-art algorithms.
The differential evolution algorithm (DE) is one of the most powerful stochastic real-parameter optimization algorithms. The theoretical studies on DE have gradually attracted the attention of more and more researchers. However, few theoretical researches have been done to deal with the convergence conditions for DE. In this paper, a sufficient condition and a corollary for the convergence of DE to the global optima are derived by using the infinite product. A DE algorithm framework satisfying the convergence conditions is then established. It is also proved that the two common mutation operators satisfy the algorithm framework. Numerical experiments are conducted on two parts. One aims to visualize the process that five convergent DE based on the classical DE algorithms escape from a local optimal set on two low dimensional functions. The other tests the performance of a modified DE algorithm inspired of the convergent algorithm framework on the benchmarks of the CEC2005.
13 February 2018 in Computational Intelligence and Neuroscience
The backtracking search optimization algorithm (BSA) is a population-based evolutionary algorithm for numerical optimization problems. BSA has a powerful global exploration capacity while its local exploitation capability is relatively poor. This affects the convergence speed of the algorithm. In this paper, we propose a modified BSA inspired by simulated annealing (BSAISA) to overcome the deficiency of BSA. In the BSAISA, the amplitude control factor () is modified based on the Metropolis criterion in simulated annealing. The redesigned could be adaptively decreased as the number of iterations increases and it does not introduce extra parameters. A self-adaptive -constrained method is used to handle the strict constraints. We compared the performance of the proposed BSAISA with BSA and other well-known algorithms when solving thirteen constrained benchmarks and five engineering design problems. The simulation results demonstrated that BSAISA is more effective than BSA and more competitive with other well-known algorithms in terms of convergence speed.
15 January 2018 in Neural Computing and Applications