Jiayang Chen
Frequency Fitness Assignment: Optimization without Bias for Good Solution outperforms Randomized Local Search on the Quadratic Assignment Problem
Chen, Jiayang; Wu, Zhize; Thomson, Sarah L.; Weise, Thomas
Abstract
The Quadratic Assignment Problem (QAP) is one of the classical N P-hard tasks from operations research with a history of more than 65 years. It is often approached with heuristic algorithms and over the years, a multitude of such methods has been applied. All of them have in common that they tend to prefer better solutions over worse ones. We approach the QAP with Frequency Fitness Assignment (FFA), an algorithm module that can be plugged into arbitrary iterative heuristics and that removes this bias. One would expect that a heuristic that does not care whether a new solution is better or worse compared to the current one should not perform very well. We plug FFA into a simple randomized local search (RLS) and yield the FRLS, which surprisingly outperforms RLS on the vast majority of the instances of the well-known QAPLIB benchmark set.
Citation
Chen, J., Wu, Z., Thomson, S. L., & Weise, T. (2024, November). Frequency Fitness Assignment: Optimization without Bias for Good Solution outperforms Randomized Local Search on the Quadratic Assignment Problem. Presented at ECTA 2024: 16th International Conference on Evolutionary Computation Theory and Applications, Porto, Portugal
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | ECTA 2024: 16th International Conference on Evolutionary Computation Theory and Applications |
Start Date | Nov 20, 2024 |
Acceptance Date | Jul 31, 2024 |
Publication Date | 2024 |
Deposit Date | Aug 26, 2024 |
Publicly Available Date | Jan 9, 2025 |
Publisher | Scitepress Digital Library |
Peer Reviewed | Peer Reviewed |
Volume | 1 |
Pages | 27-37 |
Book Title | Proceedings of the 16th International Joint Conference on Computational Intelligence |
ISBN | 978-989-758-721-4 |
DOI | https://doi.org/10.5220/0012888600003837 |
Keywords | Quadratic Assignment Problem; Frequency Fitness Assignment; Randomized Local Search |
External URL | https://ecta.scitevents.org/ |
Files
Frequency Fitness Assignment: Optimization without Bias for Good Solution outperforms Randomized Local Search on the Quadratic Assignment Problem (accepted version)
(348 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
CC BY-NC-ND 4.0
You might also like
The fractal geometry of fitness landscapes at the local optima level
(2020)
Journal Article
Inferring Future Landscapes: Sampling the Local Optima Level
(2020)
Journal Article
Frequency Fitness Assignment for Untangling Proteins in 2D
(2024)
Presentation / Conference Contribution
The Easiest Hard Problem: Now Even Easier
(2024)
Presentation / Conference Contribution
Shape of the Waterfall: Solvability Transitions in the QAP
(2024)
Presentation / Conference Contribution
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
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