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

Please use this identifier to cite or link to this item: https://ir.cnu.edu.tw/handle/310902800/29601

Title:	Ant algorithm for modifying an inconsistent pairwise weighting matrix in an analytic hierarchy process
Authors:	Girsang, Abba Suganda Tsai, Chun-Wei Yang, Chu-Sing
Contributors:	資訊多媒體應用系
Keywords:	Ant algorithm Inconsistent matrix Pairwise weight matrix Consistent ratio
Date:	2015-02
Issue Date:	2016-04-19 19:01:39 (UTC+8)
Publisher:	Springer
Abstract:	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.
Relation:	Neural Computing & Applications, v.26 n.2, pp.313-327
Appears in Collections:	[Dept. of Multimedia and Game Development] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	2171	View/Open