Ant algorithm for modifying an inconsistent pairwise weighting matrix in an analytic hierarchy process

CNU IR > College of Smart Living > Dept. of Multimedia and Game Development > Periodical Articles > Item 310902800/29601

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.cnu.edu.tw/handle/310902800/29601

题名:	Ant algorithm for modifying an inconsistent pairwise weighting matrix in an analytic hierarchy process
作者:	Girsang, Abba Suganda Tsai, Chun-Wei Yang, Chu-Sing
贡献者:	資訊多媒體應用系
关键词:	Ant algorithm Inconsistent matrix Pairwise weight matrix Consistent ratio
日期:	2015-02
上传时间:	2016-04-19 19:01:39 (UTC+8)
出版者:	Springer
摘要:	One important issue in the analytic hierarchy process (AHP) is confirming the consistency of comparison matrix to verify the logical respondent opinion. As inconsistent comparison matrix cannot be used as reference to make decisions, this paper proposes a method using an ant algorithm to modify an inconsistent pairwise weight matrix to be consistent in AHP, called ANTAHP. This method employs the matrix element as the path in an ant colony optimization to construct the tour. By laying pheromone information on their path, the ants can find the optimal matrix (or tour), which satisfies the consistency and closer to the original judgment of the decision makers. The experimental results demonstrate that the proposed algorithm is able to make consistent matrices, as well as minimize the difference index.
關聯:	Neural Computing & Applications, v.26 n.2, pp.313-327
显示于类别:	[Dept. of Multimedia and Game Development] Periodical Articles

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	2144	检视/开启

在CNU IR中所有的数据项都受到原著作权保护.

TAIR相关文章