Chia Nan University of Pharmacy & Science Institutional Repository:Item 310902800/29601
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 18074/20272 (89%)
造访人次 : 4072865      在线人数 : 890
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    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
    显示于类别:[多媒體與遊戲發展系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML2050检视/开启


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

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈