Random walks on local optima networks

Détails

ID Serval
serval:BIB_CFFBB4CB1361
Type
Article: article d'un périodique ou d'un magazine.
Collection
Publications
Institution
Titre
Random walks on local optima networks
Périodique
IEEE Congress on Evolutionary Computation (CEC), Proceedings
Auteur(s)
Tomassini Marco
Statut éditorial
Publié
Date de publication
15/07/2020
Peer-reviewed
Oui
Pages
1-8
Langue
anglais
Résumé
The Local Optima Networks represent combinatorial landscapes as graphs, where nodes are local optima and edges are transitions between optima. It brings a new set of metrics to characterize them. Here we investigate the behavior of random walks on such oriented and weighted networks using NK landscapes and QAP instances as examples. We show that random walks are useful to characterize the structure of the corresponding LONs and give interesting information about the relationships between search difficulty and LON structure.
Création de la notice
05/09/2020 14:45
Dernière modification de la notice
12/09/2020 5:20
Données d'usage