arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.1905cs.AI
收藏

最长公共子序列问题的蚁群优化动态算法

A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique

Meghnad Saha Institute of Technology(梅格纳德·萨哈技术学院)

Arindam Chaudhuri

摘要:

提出了一种利用蚁群优化技术求解最长公共子序列问题的动态算法。蚁群优化技术已被应用于优化理论、机器学习和电信网络等领域的许多问题的求解,特别是在NP难问题中的应用具有重要意义。给定两个字符串,传统的寻找最长公共子序列的方法是基于动态规划,它包括建立递归关系和填充大小表。该算法与蚁群函数的行为进行类比,这种新的计算范式被称为蚂蚁系统。这是随机组合优化的一种新的可行的方法。该模型的主要特点是正反馈,分布式计算,并使用建设性的贪婪启发式。正反馈算法可以快速发现好的解,分布式计算可以避免早熟收敛,贪婪启发式算法可以在最少的阶段内找到可接受的解。最后将该方法应用于最长公共子序列问题,并给出了仿真结果。这种方法的有效性证明了有效的计算复杂性。据我们所知,这是第一个蚁群优化算法的最长公共子序列问题。

英文摘要:

We present a dynamic algorithm for solving the Longest Common Subsequence Problem using Ant Colony Optimization Technique. The Ant Colony Optimization Technique has been applied to solve many problems in Optimization Theory, Machine Learning and Telecommunication Networks etc. In particular, application of this theory in NP-Hard Problems has a remarkable significance. Given two strings, the traditional technique for finding Longest Common Subsequence is based on Dynamic Programming which consists of creating a recurrence relation and filling a table of size . The proposed algorithm draws analogy with behavior of ant colonies function and this new computational paradigm is known as Ant System. It is a viable new approach to Stochastic Combinatorial Optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence and greedy heuristic helps find acceptable solutions in minimum number of stages. We apply the proposed methodology to Longest Common Subsequence Problem and give the simulation results. The effectiveness of this approach is demonstrated by efficient Computational Complexity. To the best of our knowledge, this is the first Ant Colony Optimization Algorithm for Longest Common Subsequence Problem.

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

↑