论文标题
Hybrid cuckoo搜索算法最小主导设置问题
Hybrid cuckoo search algorithm for the minimum dominating set problem
论文作者
论文摘要
大约400年前的国际象棋游戏始于大约400年前的统治图，这引发了对统治图的分析，最初是相对松散的，直到1960年代开始，当时该问题得到了数学描述。这是图理论中最重要的问题之一，也是在多项式时间无法解决的NP完整问题。结果，我们描述了一种新的混合杜鹃搜索技术，以解决这项工作中的MDS问题。杜鹃搜索是一种著名的元神经，其能力探索了巨大的搜索空间，使其对多元化有用。但是，为了提高性能，除了遗传跨界操作员外，我们还将强化技术纳入了建议的方法。在详尽的实验测试中介绍了我们的方法与文献中相应的最新技术的比较。根据获得的结果，建议的算法优于当前的最新状态。
The notions of dominating sets of graphs began almost 400 years ago with the game of chess, which sparked the analysis of dominating sets of graphs, at first relatively loosely until the beginnings of the 1960s, when the issue was given mathematical description. It's among the most important problems in graph theory, as well as an NP-Complete problem that can't be solved in polynomial time. As a result, we describe a new hybrid cuckoo search technique to tackle the MDS problem in this work. Cuckoo search is a well-known metaheuristic famed for its capacity for exploring a large area of the search space, making it useful for diversification. However, to enhance performance, we incorporated intensification techniques in addition to the genetic crossover operator in the suggested approach. The comparison of our method with the corresponding state-of-the-art techniques from the literature is presented in an exhaustive experimental test. The suggested algorithm outperforms the present state of the art, according to the obtained results.
