Name
Abstract | ||
|---|---|---|
This research paper presents a new approach to population size reduction in Success-History based Adaptive Differential Evolution (SHADE). The current L-SHADE algorithm uses fitness function value to select individuals which will be deleted from the current population. Algorithm variant proposed in this paper (Net L-SHADE) is using the information from evolutionary process to construct a network of individuals and the ones which would be deleted are selected based on their degree of centrality. The proposed technique is compared to state-of-art L-SHADE on CEC2015 benchmark set and the results are reported. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/INCoS.2016.50 | 2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS) |
Keywords | Field | DocType |
Network,SHADE,linear population size reduction | Population,Mathematical optimization,Computer science,Centrality,Differential evolution,Fitness function,Population size,Benchmark (computing) | Conference |
ISSN | ISBN | Citations |
2470-9166 | 978-1-5090-4125-1 | 6 |
PageRank | References | Authors |
0.46 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adam Viktorin | 1 | 29 | 16.76 |
| Michal Pluhacek | 2 | 217 | 47.34 |
| Roman Senkerik | 3 | 375 | 74.92 |