A new volume of IEEE Access (IF=3.745) publishes a paper authored by scientists from School of Business Administration in Karvina, Silesian University, Opava, Czechia (Jiří Mazurek and Radomír Perzina) and from Department of Complex Systems Rzeszów University of Technology (Dominik Strzałka, Bartosz Kowal and Paweł Kuraś).
J. Mazurek, R. Perzina, D. Strzałka, B. Kowal and P. Kuraś, "A Numerical Comparison of Iterative Algorithms for Inconsistency Reduction in Pairwise Comparisons," in IEEE Access, vol. 9, pp. 62553-62561, 2021, doi: 10.1109/ACCESS.2021.3074274.
Abstrakt:
The aim of this paper is to compare selected iterative algorithms for inconsistency reduction in pairwise comparisons by Monte Carlo simulations. We perform simulations for pairwise comparison matrices of the order n=4 and n=8 with the initial inconsistency 0.10<CR<0.80 and entries drawn from Saaty’s fundamental scale. Subsequently, we evaluate the algorithms’ performance with respect to four measures that express the degree of original preference preservation. Our results indicate that no algorithm outperforms all other algorithms with respect to every measure of preference preservation. The Xu and Wei’s algorithm is the best with regard to the preservation of an original priority vector and the ranking of objects, the Step-by-Step algorithm best preserves the original preferences expressed in the form of a pairwise comparison matrix, and the algorithm of Szybowski keeps the most matrix entries unchanged during inconsistency reduction.
The paper was financed from:
- Ministry of Education and Science of the Republic of Poland within the “Regional Initiative of Excellence” program for years 2019–2022. Project number 027/RID/2018/19, amount granted 11 999 900 PLN
- GACR, Czech Republic, Grant 21-03085S
The paper is avaliable on page:
