Wagdy Mohamed, AliKhater Mohamed, Ali2020-01-282020-01-2820191868-8071https://doi.org/10.1007/s13042-017-0711-7https://cutt.ly/arR5xXGMSA Google ScholarThis paper presents adaptive guided differential evolution algorithm (AGDE) for solving global numerical optimization problems over continuous space. In order to utilize the information of good and bad vectors in the DE population, the proposed algorithm introduces a new mutation rule. It uses two random chosen vectors of the top and the bottom 100p% individuals in the current population of size NP while the third vector is selected randomly from the middle [NP-2(100p %)] individuals. This new mutation scheme helps maintain effectively the balance between the global exploration and local exploitation abilities for searching process of the DE. Besides, a novel and effective adaptation scheme is used to update the values of the crossover rate to appropriate values without either extra parameters or prior knowledge of the characteristics of the optimization problem. In order to verify and analyze the performance of AGDE, Numerical experiments on a set of 28 test problems from the CEC2013 benchmark for 10, 30, and 50 dimensions, including a comparison with classical DE schemes and some recent evolutionary algorithms are executed. Experimental results indicate that in terms of robustness, stability and quality of the solution obtained, AGDE is significantly better than, or at least comparable to state-of-the-art approaches.enOctober University for University for Evolutionary computationGlobal optimizationDifferential evolutionNovel mutationAdaptive crossoverArticlehttps://doi.org/10.1007/s13042-017-0711-7