Access the full text.
Sign up today, get DeepDyve free for 14 days.
CK Chow, SY Yuen (2011)
An evolutionary algorithm that makes decision based on the entire previous search historyIEEE Trans Evol Comput, 15
R Storn, K Price (1997)
Differential evolution-a simple and efficient heuristic for global optimization over continuous spacesJ Glob Optim, 11
A Qin, V Huang, P Suganthan (2009)
Differential evolution algorithm with strategy adaptation for global numerical optimizationIEEE Trans Evol Comput, 13
B Dorronsoro, P Bouvry (2011)
Improving classical and decentralized differential evolution with new mutation operator and population topologies [J]IEEE Trans Evol Comput, 15
S Rahnamayan, H Tizhoosh, M Salama (2008)
Opposition-based differential evolutionIEEE Trans Evol Comput, 12
RA Sarker, SM Elsayed, T Ray (2014)
Differential evolution with dynamic parameters selection for optimization problemsIEEE Trans Evol Comput, 18
J Wang, Y Cai (2014)
Multiobjective evolutionary algorithm for frequency assignment problem in satellite communicationsSoft Comput, 19
Y Wang, Z Cai, Q Zhang (2011)
Differential evolution with composite trial vector generation strategies and control parametersIEEE Trans Evol Comput, 15
J Zhang, A Sanderson (2009)
Jade: adaptive differential evolution with optional external archiveIEEE Trans Evol Comput, 13
W Gong, Z Cai (2013)
Differential evolution with ranking-based mutation operatorsIEEE Trans Cybern, 43
X Yao, Y Liu, G Lin (1999)
Evolutionary programming made fasterIEEE Trans Evol Comput, 3
Y Cai, J Wang, J Yin (2012)
Learning-enhanced differential evolution for numerical optimizationSoft Comput Fusion Found Methodol Appl, 16
L Li, K Tang (2015)
History-based topological speciation for multimodal optimizationIEEE Trans Evol Comput, 19
Y Cai, J Wang, Y Chen, W Tian, T Hui (2016)
Adaptive direction information in differential evolution for numerical optimizationSoft Comput, 20
F Neri, V Tirronen (2010)
Recent advances in differential evolution: a survey and experimental analysisArtif Intell Rev, 33
MG Omran, AP Engelbrecht, A Salman (2009)
Bare bones differential evolutionEur J Oper Res, 196
MG Epitropakis, DK Tasoulis, NG Pavlidis, VP Plagianakos, MN Vrahatis (2011)
Enhancing differential evolution utilizing proximity-based mutation operatorsIEEE Trans Evol Comput, 15
S García, A Fernández, J Luengo, F Herrera (2009)
A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretabilitySoft Comput, 13
L Tang, Y Dong, J Liu (2015)
Differential evolution with an individual-dependent mechanismIEEE Trans Evol Comput, 19
M Weber, V Tirronen, F Neri (2010)
Scale factor inheritance mechanism in distributed differential evolutionSoft Comput, 14
J Brest, S Greiner, B Boskovic, M Mernik, V Zumer (2006)
Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problemsIEEE Trans Evol Comput, 10
S Das, P Suganthan (2011)
Differential evolution: a survey of the state-of-the-artIEEE Trans Evol Comput, 15
M Weber, F Neri, V Tirronen (2011)
A study on scale factor in distributed differential evolutionInf Sci, 181
J Kennedy, R Mendes (2006)
Neighborhood topologies in fully informed and best-of-neighborhood particle swarmIEEE Trans Syst Man Cybern Part C, 36
S Das, A Abraham, UK Chakraborty, A Konar (2009)
Differential evolution using a neighborhood-based mutation operatorIEEE Trans Evol Comput, 13
Q Fan, X Yan (2016)
Self-adaptive differential evolution algorithm with zoning evolution of control parameters and adaptive mutation strategiesIEEE Trans Cybern, 46
R Mallipeddi, P Suganthan, Q Pan, M Tasgetiren (2011)
Differential evolution algorithm with ensemble of parameters and mutation strategiesAppl Soft Comput, 11
J Sun, Q Zhang, E Tsang (2005)
De/eda: a new evolutionary algorithm for global optimizationInf Sci, 169
Y Wang, B Li, T Weise (2010)
Estimation of distribution and differential evolution cooperation for large scale economic load dispatch optimization of power systemsInf Sci, 180
J Wang, J Liao, Y Zhou, Y Cai (2014)
Differential evolution enhanced with multiobjective sorting based mutation operatorsIEEE Trans Cybern, 46
S Biswas, S Kundu, S Das (2015)
Inducing niching behavior in differential evolution through local information sharingIEEE Trans Evol Comput, 19
R Cheng, Y Jin (2015)
A social learning particle swarm optimization algorithm for scalable optimizationInf Sci, 291
W Gong, Z Cai, C Ling (2010)
De/bbo: a hybrid differential evolution with biogeography-based optimization for global numerical optimizationSoft Comput, 15
BY Qu, PN Suganthan, JJ Liang (2012)
Differential evolution with neighborhood mutation for multimodal optimizationIEEE Trans Evol Comput, 16
Y Cai, J Wang (2013)
Differential evolution with neighborhood and direction information for numerical optimizationIEEE Trans Cybern, 43
Differential evolution (DE) relies mainly on its mutation mechanism to guide its search. Generally, the parents involved in mutation are randomly selected from the current population. Although such a mutation strategy is easy to use, it is inefficient for solving complex problems. Hence, how to utilize population information to further enhance the search ability of the mutation operator has become one of the most salient and active topics in DE. To address this issue, a new DE framework with the concept of index-based neighborhood, is proposed in this study. The proposed framework is named as neighborhood guided DE (NGDE). In NGDE, a neighborhood guided selection (NGS) is introduced to guide the mutation process by extracting the promising search directions with the neighborhood information. NGS includes four main operators: neighborhood construction, neighbors grouping, two-level neighbors ranking, and parents selection. With these four operators, NGS can utilize the topology and fitness information of population simultaneously. To evaluate the effectiveness of the proposed approach, NGS is applied to several original and advanced DE algorithms. Experimental results have shown that NGDE generally outperforms most of the corresponding DE algorithms on different kinds of optimization problems.
Soft Computing – Springer Journals
Published: Mar 5, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.