Particle Swarm Optimization Based-Algorithm For An Optimal Completion Of Incomplete Pairwise Comparison Matrices
Boletim da Sociedade Paranaense de Matemática · 23.02.2026
DOI: 10.5269/bspm.79306 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 23.02.2026. Verfasst von Y. Karkour und 2 weiteren Autor:innen. Die Arbeit nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This study introduces a method based on Particle Swarm Optimization (PSO) to estimate the missing entries in incomplete Pairwise Comparison Matrices (PCMs), commonly utilized in multi-criteria decision-making processes. Incompleteness, due to missing data or subjective biases, often affects the consistency and reliability of decisions. The proposed method refines the estimates iteratively to minimize the consistency ratio and improve matrix coherence. Numerical experiments show that PSO offers a robust and efficient solution. A comparison with the Geometric Mean Method (GMM) across various matrix sizes demonstrates that PSO achieves higher accuracy, particularly in terms of consistency and estimation quality.
Zitieren
APA
Karkour, Y., Daoudi, J., & Tajani, C. (2026). Particle Swarm Optimization Based-Algorithm For An Optimal Completion Of Incomplete Pairwise Comparison Matrices. Boletim da Sociedade Paranaense de Matemática. https://doi.org/10.5269/bspm.79306
Vancouver
Karkour Y, Daoudi J, Tajani C. Particle Swarm Optimization Based-Algorithm For An Optimal Completion Of Incomplete Pairwise Comparison Matrices. Boletim da Sociedade Paranaense de Matemática. 2026. doi:10.5269/bspm.79306
BibTeX
@article{Karkour2026,
author = {Karkour, Y. and Daoudi, J. and Tajani, C.},
title = {Particle Swarm Optimization Based-Algorithm For An Optimal Completion Of Incomplete Pairwise Comparison Matrices},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
doi = {10.5269/bspm.79306}
}
EUVIMED