mlsanityData to 7 Oct 2026

Adaptive operator selection utilising generalised experience

arXiv 2401.05350 ↗First posted 4 Dec 2023cs.NE cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Optimisation problems, particularly combinatorial optimisation problems, are difficult to solve due to their complexity and hardness. Such problems have been successfully solved by evolutionary and swarm intelligence algorithms, especially in binary format. However, the approximation may suffer due to the the issues in balance between exploration and exploitation activities (EvE), which remain as the major challenge in this context. Although the complementary usage of multiple operators is becoming more popular for managing EvE with adaptive operator selection schemes, a bespoke adaptive selection system is still an important topic in research. Reinforcement Learning (RL) has recently been proposed as a way to customise and shape up a highly effective adaptive selection system. However, it is still challenging to handle the problem in terms of scalability. This paper proposes and assesses a RL-based novel approach to help develop a generalised framework for gaining, processing, and utilising the experiences for both the immediate and future use. The experimental results support the proposed approach with a certain level of success.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 2 of its 44 references that are in the map. First posted on arXiv 4 Dec 2023.

Builds on

2 of 44 references.

References · 2

  1. 2020Adaptive Operator Selection Based on Dynamic Thompson Sampling for MOEA/Dcited by 4
  2. 2022Analysing the Predictivity of Features to Characterise the Search Spacecited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.