%0 Report %D 2013 %T Benchmark Functions for CEC'2013 Special Session and Competition on Niching Methods for Multimodal Function Optimization' %A Xiaodong Li %A Andries Engelbrecht %A M. G. Epitropakis %I Evolutionary Computation and Machine Learning Group, RMIT University %C Melbourne, Australia %G eng %U http://goanna.cs.rmit.edu.au/~xiaodong/cec13-niching/competition/ %0 Conference Proceedings %B IEEE Congress on Evolutionary Computation, 2013. CEC 2013 %D 2013 %T A Dynamic Archive Niching Differential Evolution Algorithm for Multimodal Optimization %A M. G. Epitropakis %A Xiaodong Li %A Edmund K. Burke %X Highly multimodal landscapes with multiple local/global optima represent common characteristics in real-world applications. Many niching algorithms have been proposed in the literature which aim to search such landscapes in an attempt to locate as many global optima as possible. However, to locate and maintain a large number of global solutions, these algorithms are substantially influenced by their parameter values, such as a large population size. Here, we propose a new niching Differential Evolution algorithm that attempts to overcome the population size influence and produce good performance almost independently of its population size. To this end, we incorporate two mechanisms into the algorithm: a control parameter adaptation technique and an external dynamic archive along with a reinitialization mechanism. The first mechanism is designed to efficiently adapt the control parameters of the algorithm, whilst the second one is responsible for enabling the algorithm to investigate unexplored regions of the search space and simultaneously keep the best solutions found by the algorithm. The proposed approach is compared with two Differential Evolution variants on a recently proposed benchmark suite. Empirical results indicate that the proposed niching algorithm is competitive and very promising. It exhibits a robust and stable behavior, whilst the incorporation of the dynamic archive seems to tackle the population size influence effectively. Moreover, it alleviates the problem of having to fine-tune the population size parameter in a niching algorithm. %B IEEE Congress on Evolutionary Computation, 2013. CEC 2013 %C Cancun, Mexico %P 79-86 %8 June %G eng %U http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6557556 %R 10.1109/CEC.2013.6557556