Dr Sarah L. Thomson S.Thomson4@napier.ac.uk
Lecturer
Local optima networks (LONs) capture fitness landscape information. They are typically constructed in a black-box manner; information about the problem structure is not utilised. This also applies to the analysis of LONs: knowledge about the problem, such as interaction between variables, is not considered. We challenge this status-quo with an alternative approach: we consider how LON analysis can be improved by incorporating subfunction-based information this can either be known a-priori or learned during search. To this end, LONs are constructed for several benchmark pseudo-boolean problems using three approaches: firstly, the standard algorithm ; a second algorithm which uses deterministic grey-box crossover; and a third algorithm which selects perturbations based on learned information about variable interactions. Metrics related to subfunction changes in a LON are proposed and compared with metrics from previous literature which capture other aspects of a LON. Incorporating problem structure in LON construction and analysing it can bring enriched insight into optimisation dynamics. Such information may be crucial to understanding the difficulty of solving a given problem with state-of-the-art linkage learning optimisers. In light of the results, we suggest incorporation of problem structure as an alternative paradigm in landscape analysis for problems with known or suspected subfunction structure.
Thomson, S. L., & Przewozniczek, M. W. (2025, July). Subfunction Structure Matters: A New Perspective on Local Optima Networks. Presented at Genetic and Evolutionary Computation Conference (GECCO 2025), Málaga, Spain
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | Genetic and Evolutionary Computation Conference (GECCO 2025) |
Start Date | Jul 14, 2025 |
End Date | Jul 18, 2025 |
Acceptance Date | Mar 19, 2025 |
Deposit Date | Apr 11, 2025 |
Peer Reviewed | Peer Reviewed |
Keywords | fitness landscape analysis; local optima networks; combinatorial optimization; visualization |
Public URL | http://researchrepository.napier.ac.uk/Output/4237989 |
Publisher URL | https://dl.acm.org/conference/gecco |
External URL | http://gecco-2025.sigevo.org/HomePage |
This file is under embargo due to copyright reasons.
Contact repository@napier.ac.uk to request a copy for personal use.
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