An Analytic Approach for Synthesizing Comparison Matrices in AHP

  • Authors:

  • Hsuan-Shih Lee;Cheng-Chi Chung;Su-Man Wang;Ming-Tao Chou;Chen-Huei Yeh

  • Affiliations:

  • Department of Shipping and Transportation Management, National Taiwan Ocean University, Keelung 202, Taiwan;Department of Shipping and Transportation Management, National Taiwan Ocean University, Keelung 202, Taiwan;Department of International Trade, St. John's University, Tamsui, Taipei 251, Taiwan;Department of Aviation and Maritime Management, Chang Jung Christian University, Tainan 711, Taiwan;Department of Shipping and Transportation Management, National Taiwan Ocean University, Keelung 202, Taiwan and Yang Ming Marine Transport Corporation,

  • Venue:
  • KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In AHP, judgements of decision makers are represented by positive reciprocal matrices (pairwise comparison matrices) with ratio judgements representing the preference of a decision maker. Each decision maker's opinion is characterized by a pairwise comparison matrix in the AHP. Under group decision environment, a group comparison matrix has to be drawn from the matrices of the members of the group as the consensus of the group. In 2001, Yeh, Kerng and Lin [11] proposed a goal programming method to synthesize the pairwise comparison matrices into a consensus matrix for the group. Yeh et al. proposed a generic algorithm to find a solution approximating the objective function proposed by them. In this paper, we are going to show that their formulation can be solved analytically and the optimal solution can be easily computed.