Computing Interval Weights for Incomplete Pairwise-Comparison Matrices of Large Dimension—A Weak-Consistency-Based Approach

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F17%3A73580833" target="_blank" >RIV/61989592:15310/17:73580833 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1109/TFUZZ.2016.2633364" target="_blank" >http://dx.doi.org/10.1109/TFUZZ.2016.2633364</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TFUZZ.2016.2633364" target="_blank" >10.1109/TFUZZ.2016.2633364</a>

Result language

angličtina

Original language name

Computing Interval Weights for Incomplete Pairwise-Comparison Matrices of Large Dimension—A Weak-Consistency-Based Approach

Original language description

Multiple-criteria decision making and evaluation problems dealing with a large number of objects are very demanding, particularly when the use of pairwise-comparison (PC) techniques is required. A major drawback arises when it is not possible to obtain all the PCs, due to time or cost limitations, or to split the given problem into smaller subproblems. In such cases, two tools are needed to find acceptable weights of objects: an efficient method for partially filling a pairwise-comparison matrix (PCM) and a suitable method for deriving weights from this incomplete PCM. This paper presents a novel interactive algorithm for large-dimensional problems guided by two main ideas: the sequential optimal choice of the PCs to be performed and the concept of weak consistency. The proposed solution significantly reduces the number of needed PCs by adding information implied by the weak consistency after the input of each PC (providing sets of feasible values for all missing PCs). Interval weights of objects are computed from the resulting incomplete weakly consistent PCM adapting the methodology for calculating fuzzy weights from fuzzy PCMs. The computed weight intervals, thus, cover all possible weakly consistent completions of the incomplete PCM. The algorithm works both with Saaty&apos;s PCMs and fuzzy preference relations. The performance of the algorithm is illustrated by a numerical example and a real-life case study. The performed simulation demonstrates that the proposed algorithm is capable of reducing the number of PCs required in PCMs of dimension 15 and greater by more than 60% on average.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10100 - Mathematics

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

IEEE Transactions on Fuzzy Systems

ISSN

1063-6706

e-ISSN

—

Volume of the periodical

25

Issue of the periodical within the volume

6

Country of publishing house

US - UNITED STATES

Number of pages

15

Pages from-to

1714-1728

UT code for WoS article

000417559300026

EID of the result in the Scopus database

—