[论文解读] Intelligent Algorithm for Optimum Solutions Based on the Principles of Bat Sonar

Mohammed Ali Tawfeeq|arXiv (Cornell University)|Nov 4, 2012

Underwater Vehicles and Communication Systems参考文献 4被引用 4

一句话总结

本文提出一种受蝙蝠回声定位启发的新型元启发式算法，通过建模声纳单元来探索状态空间以实现全局优化。该算法提出三种变体——单个声纳单元（SSU）、多个并行声纳单元（MSU）以及基于动量的单个声纳单元（SSM），在具有局部极小值的函数上，其收敛速度和全局最优解恢复能力显著优于遗传算法（GA）。

ABSTRACT

This paper presents a new intelligent algorithm that can solve the problems of finding the optimum solution in the state space among which the desired solution resides. The algorithm mimics the principles of bat sonar in finding its targets. The algorithm introduces three search approaches. The first search approach considers a single sonar unit (SSU) with a fixed beam length and a single starting point. In this approach, although the results converge toward the optimum fitness, it is not guaranteed to find the global optimum solution especially for complex problems; it is satisfied with finding 'acceptably good' solutions to these problems. The second approach considers multisonar units (MSU) working in parallel in the same state space. Each unit has its own starting point and tries to find the optimum solution. In this approach the probability that the algorithm converges toward the optimum solution is significantly increased. It is found that this approach is suitable for complex functions and for problems of wide state space. In the third approach, a single sonar unit with a moment (SSM) is used in order to handle the problem of convergence toward a local optimum rather than a global optimum. The momentum term is added to the length of the transmitted beams. This will give the chance to find the best fitness in a wider range within the state space. In this paper a comparison between the proposed algorithm and genetic algorithm (GA) has been made. It showed that both of the algorithms can catch approximately the optimum solutions for all of the testbed functions except for the function that has a local minimum, in which the proposed algorithm's result is much better than that of the GA algorithm. On the other hand, the comparison showed that the required execution time to obtain the optimum solution using the proposed algorithm is much less than that of the GA algorithm.

研究动机与目标

• 解决在复杂、高维状态空间中寻找全局最优解的挑战。
• 克服传统元启发式算法（如遗传算法GA）可能过早收敛至局部最优解的局限性。
• 基于蝙蝠声纳原理，开发一种生物启发式算法，以提升搜索效率和解的质量。
• 通过并行搜索和动量增强策略，提升收敛速度和鲁棒性。
• 提供一种可扩展且自适应的优化框架，适用于广泛而复杂的搜索空间。

提出的方法

• 通过固定波束长度和一个起始点，建模单个声纳单元（SSU），通过迭代调整波束来探索状态空间。
• 引入多个并行运行的声纳单元（MSU），每个单元具有独立的起始点，以提高定位全局最优解的概率。
• 在波束长度更新中引入动量项（SSM），以逃离局部最优解并探索状态空间更广阔的区域。
• 利用适应度评估来引导波束方向和长度的调整，模拟蝙蝠在目标探测中的回声定位行为。
• 基于适应度提升动态调节波束长度，模仿蝙蝠在频率和脉冲率上的自适应调整。
• 在相同条件下，使用标准基准函数与遗传算法（GA）进行性能对比。

实验结果

研究问题

• RQ1 受蝙蝠声纳启发的算法是否能有效在复杂、多峰优化问题中定位全局最优解？
• RQ2 多个声纳单元并行运行相比单个单元，如何提升收敛的可靠性？
• RQ3 在波束长度中引入动量项，在多大程度上能增强逃离局部最优解的能力？
• RQ4 与遗传算法相比，该算法在收敛速度和解质量方面表现如何？
• RQ5 在哪些类型的状态空间中，该算法相较于传统元启发式算法表现出更优性能？

主要发现

• MSU变体在复杂、宽广的状态空间问题中显著提高了找到全局最优解的概率。
• SSM变体在逃离局部极小值方面优于SSU和GA，尤其在具有欺骗性局部极小值的函数上表现更优。
• 所提算法在比遗传算法更短的执行时间内，更快地获得近似最优解。
• 在存在局部极小值的测试函数上，所提算法的解质量显著优于遗传算法。
• 该算法在所有测试的基准函数上均表现出一致的收敛性，能稳定趋向高适应度解。
• SSM中基于动量的波束长度调整增强了探索能力，实现了更广的搜索覆盖范围，并提升了全局收敛性能。