Advertisement

Leveraging Local Optima Network Properties for Memetic Differential Evolution

  • Viktor Homolya
  • Tamás VinkóEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)

Abstract

Population based global optimization methods can be extended by properly defined networks in order to explore the structure of the search space, to describe how the method performed on a given problem and to inform the optimization algorithm so that it can be more efficient. The memetic differential evolution (MDE) algorithm using local optima network (LON) is investigated for these aspects. Firstly, we report the performance of the classical variants of differential evolution applied for MDE, including the structural properties of the resulting LONs. Secondly, a new restarting rule is proposed, which aims at avoiding early convergence and it uses the LON which is built-up during the evolutionary search of MDE. Finally, we show the promising results of this new rule, which contributes to the efforts of combining optimization methods with network science.

Keywords

Global optimization Memetic differential evolution Local optima network Network science 

Notes

Acknowledgment

This research has been partially supported by the project “Integrated program for training new generation of scientists in the fields of computer science”, no EFOP-3.6.3-VEKOP-16-2017-0002. The project has been supported by the European Union and co-funded by the European Social Fund. Ministry of Human Capacities, Hungary grant 20391-3/2018/FEKUSTRAT is acknowledged.

References

  1. 1.
    Cabassi, F., Locatelli, M.: Computational investigation of simple memetic approaches for continuous global optimization. Comput. Oper. Res. 72, 50 – 70 (2016)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Hagberg, A., Swart, P., S Chult, D.: Exploring network structure, dynamics, and function using NetworkX. Technical report, Los Alamos National Lab. (LANL), Los Alamos, NM (United States) (2008)Google Scholar
  3. 3.
    Hart, W.E., Laird, C.D., Watson, J.P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., Siirola, J.D.: Pyomo-Optimization Modeling in Python, vol. 67. Springer, Heidelberg (2012)Google Scholar
  4. 4.
    Homolya, V., T.Vinkó: Memetic differential evolution using network centrality measures. In: AIP Conference Proceedings 2070, 020023 (2019)Google Scholar
  5. 5.
    Locatelli, M., Maischberger, M., Schoen, F.: Differential evolution methods based on local searches. Comput. Oper. Res. 43, 169–180 (2014)CrossRefGoogle Scholar
  6. 6.
    Mezura-Montes, E., Velázquez-Reyes, J., Coello Coello, C.A.: A comparative study of differential evolution variants for global optimization. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 485–492. ACM (2006)Google Scholar
  7. 7.
    Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program. C3P Rep. 826 (1989)Google Scholar
  8. 8.
    Murtagh, B.A., Saunders, M.A.: MINOS 5.5.1 user’s guide. Technical Report SOL 83-20R (2003)Google Scholar
  9. 9.
    Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1–14 (2012)CrossRefGoogle Scholar
  10. 10.
    Piotrowski, A.P.: Adaptive memetic differential evolution with global and local neighborhood-based mutation operators. Inf. Sci. 241, 164–194 (2013)CrossRefGoogle Scholar
  11. 11.
    Skanderova, L., Fabian, T.: Differential evolution dynamics analysis by complex networks. Soft Comput. 21(7), 1817–1831 (2017)CrossRefGoogle Scholar
  12. 12.
    Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341–359 (1997)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Vinkó, T., Gelle, K.: Basin hopping networks of continuous global optimization problems. Cent. Eur. J. Oper. Res. 25, 985–1006 (2017)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Computational OptimizationUniversity of SzegedSzegedHungary

Personalised recommendations