期刊
NEURAL COMPUTING & APPLICATIONS
卷 26, 期 2, 页码 313-327出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00521-014-1630-0
关键词
Ant algorithm; Inconsistent matrix; Pairwise weight matrix; Consistent ratio
资金
- Ministry of Science and Technology of Taiwan, R.O.C. [NSC102-2221-E-041-006, NSC 102-2219-E-006-001]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据