English  |  正體中文  |  简体中文  |  Items with full text/Total items : 17423/19718 (88%)
Visitors : 6231879      Online Users : 777
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://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
    Appears in Collections:[資訊多媒體應用系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in CNU IR are protected by copyright, with all rights reserved.

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