arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.05350cs.NEcs.AIcs.LG
收藏

利用广义经验的自适应算子选择

Adaptive operator selection utilising generalised experience

UWE Bristol(西英格兰大学布里斯托分校);Bandirma Onyedi Eylul University(巴勒马厄塞蒂埃伊鲁尔大学);Coventry University(考文垂大学)

Mehmet Emin Aydin, Rafet Durgut, Abdur Rakib

AI总结:

本文针对组合优化中探索与开发平衡难题,提出基于强化学习的广义经验获取与利用框架,用于自适应算子选择,实验验证了其有效性。

摘要:

优化问题,特别是组合优化问题,由于其复杂性和困难性而难以求解。此类问题已通过进化算法和群体智能算法成功求解,尤其是在二进制格式下。然而,由于探索与开发活动(EvE)之间的平衡问题,近似求解可能会受到影响,这仍然是该领域的主要挑战。尽管通过自适应算子选择方案互补使用多个算子以管理 EvE 的做法日益流行,但定制的自适应选择系统仍然是一个重要的研究课题。强化学习(RL)最近被提出作为一种定制和塑造高效自适应选择系统的方法。然而,在可扩展性方面处理该问题仍然具有挑战性。本文提出并评估了一种基于 RL 的新方法,以帮助开发一个用于获取、处理和利用经验的广义框架,既服务于当前使用,也服务于未来使用。实验结果在一定程度上支持了所提出的方法并取得了成功。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑