摘要
多目标最小生成树问题是典型的NP问题,Zhou和Gen提出了一种用于计数多目标最小生成树问题的所有非劣最优最小生成树的算法,但该算法无法保证能够找到所有非劣最优最小生成树.针对此问题,提出一种改进的计数算法,并定性说明改进算法能够找到问题的所有非劣最优最小生成树.改进算法在进行子树剔除时增加了一些条件.模拟实验结果表明,改进后的计数算法能够找到所有的非劣最优解.这也说明该算法具有应用的潜力.
The multi-criteria minimum spanning tree （mc-MST） problem is a typical NP-hard problem. An algorithm to enumerate the set of Pareto optimal spanning trees on some me -MST instances was put forward by Zhou and Gen, but it does not guarantee returning all the Pareto optimal solutions. To settle this problem, an improved algorithm is developed and also proved to be able to find all the true Pareto optimal solutions in this paper. The new algorithm adds some conditions in the elimination of subtrees, Simulation results show that the new algorithm can find all the Pareto optimal solutions and also show that the new algorithm has potential usage in practice.
出处
《软件学报》
EI
CSCD
北大核心
2006年第3期364-370,共7页
Journal of Software
基金
国家自然科学基金
福建省自然科学基金
福建省教育厅科技三项科研项目~~
关键词
最小生成树
非劣最优解
minimum spanning tree
Pareto optimal
