多目标最小生成树的竞争决策算法

Competitive Decision Algorithm for Multi-objective Minimum Spanning tree Problem

为求解多目标最小生成树问题,基于竞争决策算法原理和多目标优化问题的特性,提出了一种求解多目标最小生成树的竞争决策算法。为了提高Pareto解集的分布性与多样性,在寻找到的Pareto解集中寻找最稀疏的解并在稀疏解附近进行领域搜索。经过大量数据测试和验证,该算法具有较好的性能。

Based on the mechanism of competitions and the feature of multi-objective optimization problem,a competitive decision algorithm for multi-objective minimum spanning tree is presented.In order to improve the diversity and distribution of Pareto optimal set,it performs neighborhood search in the sparse area of optimal set.We use this algorithm to solve many instances of multi-objective minimum spanning tree.After testing and verifying a lot of data,the computational result results are proved to have better performance.