欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
最大团问题是经典的NP-hard问题,对该问题求解方法的研究在理论上,实践上都具有一定的意义。蚁群算法已成功地求解许多组合优化难题。本文使用分治法,将图分解成子图,对各子图应用蚁群算法求解,并根据目前求得的最优解的值对各个子图进行剪枝,去除对求解没有意义的点,提出基于分治、剪枝和蚁群算法求解最大团问题的算法。它减小了问题的求解规模,使求解容易。实验取得了较好的结果。
英文摘要：
Maximum clique problem,MCP,is a classic NP-hard problem.Study of method on the problem,whether in theory or in practice,has a certain significance.Ant colony optimization,ACO,was applied successfully to hard combinational optimization problems.In this article,divide and conquer algorithm is used and graph is decomposed into sub-graph and then in these sub-graph ACO is used to solving MCP and pruning is used in each sub-graph according to the current value of the optimal solution.The algorithm of solving maximum clique problem based on divide and conquer,pruning and ant colony optimization is put forward,which reduces the size of the problem and makes problem solving easier.The simulation results show that the algorithm is more efficient.
同期刊论文项目
同项目期刊论文
A novel statistical time-series pattern based interval forecasting strategy for activity durations i
期刊信息
位置：