Entropy, Search Trajectories, and Explainability for Frequency Fitness Assignment

被引:0
|
作者
Thomson, Sarah L. [1 ]
Ochoa, Gabriela [2 ]
van den Berg, Daan [3 ]
Liang, Tianyu [4 ]
Weise, Thomas [4 ]
机构
[1] Edinburgh Napier Univ, Edinburgh, Midlothian, Scotland
[2] Univ Stirling, Stirling, Scotland
[3] Vrije Univ, Amsterdam, Netherlands
[4] Hefei Univ, Hefei, Peoples R China
来源
PARALLEL PROBLEM SOLVING FROM NATURE-PPSN XVIII, PPSN 2024, PT I | 2024年 / 15148卷
关键词
frequency fitness assignment; quadratic assignment problem; fitness landscape; APPROXIMATE ENTROPY;
D O I
10.1007/978-3-031-70055-2_23
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Local optima are a menace that can trap optimisation processes. Frequency fitness assignment (FFA) is an concept aiming to overcome this problem. It steers the search towards solutions with rare fitness instead of high-quality fitness. FFA-based algorithms have shown promise in the literature, but their behaviour is not well understood. We take a first step in this direction by seeking to explain FFA behaviour and performance for the first time. In particular, we attempt to understand the difference in how FFA-based algorithms navigate the space when compared with a standard objective-guided algorithm which incorporates diversification: simulated annealing (SA). As a testbed for these investigations, a set of quadratic assignment problem (QAP) benchmark instances designed to be difficult for metaheuristics is used. A statistical analysis of trajectory behaviours for FFA-based algorithms is conducted. Additionally, we consider and compare the fitness distributions encountered by each algorithm, as well their respective proficiency on the problems. The findings help to explain FFA performance behaviours, and show that FFA explores more widely and consistently than SA. It is hoped that the explanatory approach adopted in this study serves as an example and inspires further similar investigations into how-and why-FFA-assisted optimisation works.
引用
收藏
页码:377 / 392
页数:16
相关论文
共 50 条
  • [21] A Dynamic Tabu Search Approach for Solving the Static Frequency Assignment Problem
    Alrajhi, Khaled
    Padungwech, Wasin
    ADVANCES IN COMPUTATIONAL INTELLIGENCE SYSTEMS, 2017, 513 : 59 - 70
  • [22] Evaluating Search System Explainability with Psychometrics and Crowdsourcing
    Chen, Catherine
    Eickhoff, Carsten
    PROCEEDINGS OF THE 47TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, SIGIR 2024, 2024, : 1051 - 1061
  • [23] Iterated Harmony Differential Search for the Minimum Interference Frequency Assignment Problem
    Lahsinat, Yasmine
    Boughaci, Dalila
    Benhamou, Belaid
    PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON MATHEMATICS AND INFORMATION TECHNOLOGY (ICMIT), 2017, : 122 - 127
  • [24] Integrating Tabu Search in Particle Swarm Optimization for the Frequency Assignment Problem
    Hadji, Houssem Eddine
    Babes, Malika
    CHINA COMMUNICATIONS, 2016, 13 (03) : 137 - 155
  • [25] Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem
    Alrajhi, Khaled
    Thompson, Jonathan
    Padungwech, Wasin
    HYBRID METAHEURISTICS (HM 2016), 2016, 9668 : 157 - 170
  • [26] Breakout variable neighbourhood search for the minimum interference frequency assignment problem
    Lahsinat Y.
    Boughaci D.
    Benhamou B.
    Lahsinat, Yasmine (yasminelhsnt@gmail.com), 2018, Emerald Group Holdings Ltd. (20) : 468 - 488
  • [27] STATE ASSIGNMENT AND ENTROPY
    EDWARDS, CR
    ERIS, E
    ELECTRONICS LETTERS, 1978, 14 (13) : 390 - 391
  • [28] THE ENTROPY OF MARKOV TRAJECTORIES
    EKROOT, L
    COVER, TM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1418 - 1421
  • [29] A Neighborhood Search-Based Heuristic for the Fixed Spectrum Frequency Assignment Problem
    Siddiqi, Umair F.
    Sait, Sadiq M.
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2019, 44 (04) : 2985 - 2994
  • [30] Consistency checking within local search applied to the frequency assignment with polarization problem
    Vasquez, M
    Dupont, A
    Habet, D
    RAIRO-OPERATIONS RESEARCH, 2003, 37 (04): : 311 - 323