Random walks on local optima networks
Details
Serval ID
serval:BIB_CFFBB4CB1361
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
Random walks on local optima networks
Title of the conference
IEEE Congress on Evolutionary Computation (CEC), Proceedings
Publication state
Published
Issued date
15/07/2020
Peer-reviewed
Oui
Pages
1-8
Language
english
Abstract
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.
Create date
05/09/2020 15:45
Last modification date
04/06/2021 6:38