Particle Swarm Algorithm for Weight Estimation of Incomplete Comparison Matrix
It is very important to estimate incomplete comparisons data to have alternatives weights. To solve the lack of Harkers method that it can not estimate the uncertainty of the incomplete pairwise comparison matrix, based on analysis of several processing methods, the criterion to minimize problem of the largest eigenvalue is established. An algorithm based on particle swarm optimization is proposed to process this problem. The example shows that the new algorithm is effective.
analytic hierarchy process incomplete comparison matrix particle swarm algorithm
Shang Gao
School of Computer Science and Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003 China
国际会议
武汉
英文
704-707
2010-06-06(万方平台首次上网日期,不代表论文的发表时间)