Abstract
Stochastic simulations are often used to determine the crossover rates and step size of evolutionary algorithms to avoid the tuning process, but they cannot fully utilize information from the evolutionary process. A two-stage adaptive differential evolution algorithm (APDE) is proposed in this article based on an accompanying population, and it has unique mutation strategies and adaptive parameters that conform to the search characteristics. The global exploration capability can be enhanced by the accompanying population to achieve a balance between global exploration and local search. This algorithm has proven to be convergent with a probability of 1 using the theory of Markov chains. In numerical experiments, the APDE is statistically compared with nine comparison algorithms using the CEC2005 and CEC2017 standard set of test functions, and the results show that the APDE is statistically superior to the comparison methods.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call