UDK 519.85
SELF-CONFIGURING ENSEMBLE OF GENETIC ALGORITHMS FOR MULTIMODAL OPTIMIZATION PROBLEMS
E. A. Sopov*, S. S. Aplesnin
Reshetnev Siberian State Aerospace University 31, Krasnoyarsky Rabochy Av., Krasnoyarsk, 660037, Russian Federation *E-mail: evgenysopov@gmail.com
Multimodal optimization (MMO) is the problem of finding a set of all global and local optima or a good approxima-tion of that set. In recent years many efficient nature-inspired and evolutionary techniques (based on ES, PSO, DE and others) have been proposed for real-valued problems. At the same time, many real-world problems contain variables of many different types, including integer, rank, binary and others. In this case, the weakest representation (namely binary representation) is used. Unfortunately, there is a lack of efficient approaches for problems with binary representation. Existing techniques are usually based on general ideas of niching. Moreover, there exists the problem of choosing a suitable algorithm and fine tuning it for a certain problem. In this study, a novel approach based on a metaheuristic for designing multi-strategy genetic algorithm is proposed. The approach controls the interactions of many search tech-niques (different genetic algorithms for MMO) and leads to the self-configuring solving of problems with a priori unknown structure (“black-box” optimization). The results of numerical experiments and of comparison with other popular techniques for classical benchmark problems and benchmark problems from the CEC’2013 competition on MMO are presented. The proposed approach has demonstrated efficiency better than standard niching techniques and comparable to modern advanced algorithms. The main feature and advantage of the approach is that it does not require the participation of the human-expert, because it operates in an automated, self-configuring way.
Keywords: multimodal optimization, self-configuration, genetic algorithm, metaheuristic, niching.
References

References

  1. Das S., Maity S., Qub B.-Y. and Suganthan P. N. Real-parameter evolutionary multimodal optimization: a survey of the state-of-the art. Swarm and Evolutionary Computation 1, 2011, P. 71–88.
  2. Preuss M. Tutorial on Multimodal Optimization. In the 13th International Conference on Parallel Problem Solving from Nature, PPSN 2014. Ljubljana, 2014.
  3. Li X., Engelbrecht A. and Epitropakis M., Results of the 2013 IEEE CEC Competition on Niching Methods for Multimodal Optimization. Report presented at 2013 IEEE Congress on Evolutionary Computation Competition on: Niching Methods for Multimodal Optimization, 2013a.
  4. Liu Y., Ling X., Shi Zh., Lv M., Fang. J. and Zhang L. A Survey on Particle Swarm Optimization Algorithms for Multimodal Function Optimization. Journal of Software, 2011, Vol. 6, No. 12, P. 2449–2455.
  5. Deb K., Saha A. Finding Multiple Solutions for Multimodal Optimization Problems Using a Multi-Objective Evolutionary Approach. Proceedings of the 12th Conference on Genetic and Evolutionary Computation, GECCO 2010. ACM, New York, 2010, P. 447–454.
  6. Li X., Engelbrecht A., Epitropakis M. G. Benchmark functions for CEC’2013 special session and competition on niching methods for multimodal function optimization. Evol. Comput. Mach. Learn. Group, RMIT University, Melbourne, VIC, Australia. Tech. Rep, 2013b.
  7. Bessaou M., Petrowski A., Siarry P. Island Model Cooperating with Speciation for Multimodal Optimization. Parallel Problem Solving from Nature PPSN VI, Lecture Notes in Computer Science, 2000, Vol. 1917, P. 437–446.
  8. Yu E. L., Suganthan P. N. Ensemble of niching algorithms. Information Sciences, 2010, Vol. 180, No. 15, P. 2815–2833.
  9. Qu B., Liang J., Suganthan P.N., Chen T. Ensemble of Clearing Differential Evolution for Multi-modal Optimization. Advances in Swarm Intelligence Lecture Notes in Computer Science, 2012, Vol. 7331, P. 350–357.
  10. Sopov E. A Self-configuring Metaheuristic for Control of Multi-Strategy Evolutionary Search. ICSI-CCI 2015, Part III, LNCS 9142. 2015, P. 29–37.
  11. Singh G., Deb K. Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference, Seattle. 2006, P. 1305–1312.
  12. Preuss M., Wessing S. Measuring multimodal optimization solution sets with a view to multiobjective techniques. EVOLVE – A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV. AISC, vol. 227, Springer, Heidelberg. 2013, P. 123–137.
  13. Preuss M., Stoean C., Stoean R. Niching foundations: basin identification on fixed-property generated landscapes. Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011. 2011, P. 837–844.
  14. Semenkin E. S., Semenkina M. E. Self-configuring Genetic Algorithm with Modified Uniform Crossover Operator. Advances in Swarm Intelligence. Lecture Notes in Computer Science 7331. Springer-Verlag, Berlin Heidelberg. 2012, P. 414–421.
  15. Molina D., Puris A., Bello R., Herrera F. Variable mesh optimization for the 2013 CEC special session niching methods for multimodal optimization. Proc. 2013 IEEE Congress on Evolutionary Computation (CEC’13). 2013, P. 87–94.
  16. Epitropakis M. G., Li X., Burke E. K. A dynamic archive niching differential evolution algorithm for multimodal optimization. Proc. 2013 IEEE Congress on Evolutionary Computation (CEC’13). 2013, P. 79–86.
  17. Bandaru S., Deb K. A parameterless-niching-assisted bi-objective approach to multimodal optimization. Proc. 2013 IEEE Congress on Evolutionary Computation (CEC’13). 2013, P. 95–102.

Sopov Evgenii Aleksandrovich – Cand. Sc., Docent of Systems Analysis and Operations Research department, Reshetnev Siberian State Aerospace University. E-mail: evgenysopov@gmail.com.

Aplesnin Sergei Stepanovich – Dr. Sc., head of Physics department, Reshetnev Siberian State Aerospace University. E-mail: aplesnin@sibsau.ru.