Randomization and Complex Networks for Meta-Heuristic Algorithms

  • Šenkeřík R
  • Zelinka I
  • Pluhacek M
  • et al.
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter deals with the hybridization of the chaos driven heuristics concept and complex networks framework for meta-heuristic. This research aims on the experimental investigations on the time development and influence of different randomization types, different strategies for Differential Evolution (DE) through the analysis of complex network as a record of population dynamics and indices selection. The population is visualized as an evolving complex network, which exhibits non-trivial features such as adjacency graph, centralities, clustering coefficient and other attributes showing efficiency of the network. Experiments were performed for different DE strategies, several different randomization types and simple test functions.

Cite

CITATION STYLE

APA

Šenkeřík, R., Zelinka, I., Pluhacek, M., Viktorin, A., Janostik, J., & Kominkova Oplatkova, Z. (2018). Randomization and Complex Networks for Meta-Heuristic Algorithms (pp. 177–194). https://doi.org/10.1007/978-3-662-55663-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free