Dr Sarah L. Thomson S.Thomson4@napier.ac.uk
Lecturer
Dr Sarah L. Thomson S.Thomson4@napier.ac.uk
Lecturer
Sébastien Verel
Gabriela Ochoa
Nadarajen Veerapen
David Cairns
We conduct a study of local optima networks (LONs) in a search space using fractal dimensions. The fractal dimension (FD) of these networks is a complexity index which assigns a non-integer dimension to an object. We propose a fine-grained approach to obtaining the FD of LONs, using the probabilistic search transitions encoded in LON edge weights. We then apply multi-fractal calculations to LONs for the first time, comparing with mono-fractal analysis. For complex systems such as LONs, the dimensionality may be different between two sub-systems and multi-fractal analysis is needed. Here we focus on the Quadratic Assignment Problem (QAP), conducting fractal analyses on sampled LONs of reasonable size for the first time. We also include fully enumerated LONs of smaller size. Our results show that local optima spaces can be multi-fractal and that valuable information regarding probabilistic self-similarity is encoded in the edge weights of local optima networks. Links are drawn between these phenomena and the performance of two competitive metaheuristic algorithms.
Thomson, S. L., Verel, S., Ochoa, G., Veerapen, N., & Cairns, D. (2018, July). Multifractality and dimensional determinism in local optima networks. Presented at GECCO '18: Genetic and Evolutionary Computation Conference, Kyoto, Japan
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | GECCO '18: Genetic and Evolutionary Computation Conference |
Start Date | Jul 15, 2018 |
End Date | Jul 19, 2018 |
Online Publication Date | Jul 2, 2018 |
Publication Date | 2018 |
Deposit Date | Aug 16, 2023 |
Publisher | Association for Computing Machinery (ACM) |
Pages | 371-378 |
Book Title | GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference |
ISBN | 9781450356183 |
DOI | https://doi.org/10.1145/3205455.3205472 |
Keywords | fractal dimension, quadratic assignment problem, fitness landscapes, local optima networks |
Public URL | http://researchrepository.napier.ac.uk/Output/3169670 |
The Easiest Hard Problem: Now Even Easier
(2024)
Presentation / Conference Contribution
Channel Configuration for Neural Architecture: Insights from the Search Space
(2023)
Presentation / Conference Contribution
From Fitness Landscapes to Explainable AI and Back
(2023)
Presentation / Conference Contribution
Randomness in Local Optima Network Sampling
(2023)
Presentation / Conference Contribution
Universally Hard Hamiltonian Cycle Problem Instances
(2022)
Presentation / Conference Contribution
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search