Competitive Decision Algorithm for Multi-objective Minimum Spanning tree Problem
Xiong Xiao · Systems Engineering · 2010
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.