ELENA用表观遗传机制提升进化算法适应力,解决复杂网络优化难题。
ELENA: Epigenetic Learning through Evolved Neural Adaptation
- 引入表观遗传标记动态调节学习参数,增强搜索适应性。
- 在TSP、VRP、MCP上性能超越现有最优方法。
- 适合高维动态环境下的复杂优化问题研究者使用。
尽管元启发式算法在解决复杂网络优化问题上取得成功,但在动态或高维搜索空间中常因缺乏适应性而陷入局部最优,导致探索效率低和解质量差。现有先进算法往往仅在高度复杂或小规模空间表现良好。为此,我们提出ELENA(表观遗传学习通过进化神经适配),一种融合表观遗传机制的新型进化框架。ELENA利用动态更新的压缩学习参数表示,通过三种表观遗传标记(突变抗性、交叉亲和度、稳定性得分)引导解空间搜索,实现更智能的假设空间探索。在旅行商问题(TSP)、车辆路径问题(VRP)和最大团问题(MCP)三个关键网络优化任务上进行实验,结果表明ELENA性能具有竞争力,多数情况下优于现有最先进方法。
原文摘要 · Abstract (English)
Despite the success of metaheuristic algorithms in solving complex network optimization problems, they often struggle with adaptation, especially in dynamic or high-dimensional search spaces. Traditional approaches can become stuck in local optima, leading to inefficient exploration and suboptimal solutions. Most of the widely accepted advanced algorithms do well either on highly complex or smaller search spaces due to the lack of adaptation. To address these limitations, we present ELENA (Epigenetic Learning through Evolved Neural Adaptation), a new evolutionary framework that incorporates epigenetic mechanisms to enhance the adaptability of the core evolutionary approach. ELENA leverages compressed representation of learning parameters improved dynamically through epigenetic tags that serve as adaptive memory. Three epigenetic tags (mutation resistance, crossover affinity, and stability score) assist with guiding solution space search, facilitating a more intelligent hypothesis landscape exploration. To assess the framework performance, we conduct experiments on three critical network optimization problems: the Traveling Salesman Problem (TSP), the Vehicle Routing Problem (VRP), and the Maximum Clique Problem (MCP). Experiments indicate that ELENA achieves competitive results, often surpassing state-of-the-art methods on network optimization tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。