Minimizing Inconsistency in Pairwise Comparison Matrices Using Genetic Algorithm

This paper introduces a novel approach to reduce inconsistencies in pairwise comparison matrices using a genetic algorithm inspired by the process of natural selection. The method applies a distance-based inconsistency index as the fitness function within an evolutionary process. Through experiments, we show that our genetic algorithm greatly reduces inconsistencies over generations. Smaller matrices quickly become consistent in just a few generations, showing the method’s effectiveness and efficiency for different scenarios and use cases. Larger matrices, however, require more generations to reach the acceptable consistency level. The algorithm works well for different matrix sizes, adapting effectively to various challenging situations.

Authors

Institutions

Publication Details

Published
2025-03-19
DOI
https://doi.org/10.1109/ciss64860.2025.10944754
Citations
2
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimizing Inconsistency in Pairwise Comparison Matrices Using Genetic Algorithm

Ahmad Reza Sayadi, Ryszard Janicki, Baran Shajari
2 citations
Neural Networks and Applications
4.96
article

Minimizing Inconsistency in Pairwise Comparison Matrices Using Genetic Algorithm

Ahmad Reza Sayadi, Ryszard Janicki, Baran Shajari
article en
2 citations

Abstract

This paper introduces a novel approach to reduce inconsistencies in pairwise comparison matrices using a genetic algorithm inspired by the process of natural selection. The method applies a distance-based inconsistency index as the fitness function within an evolutionary process. Through experiments, we show that our genetic algorithm greatly reduces inconsistencies over generations. Smaller matrices quickly become consistent in just a few generations, showing the method’s effectiveness and efficiency for different scenarios and use cases. Larger matrices, however, require more generations to reach the acceptable consistency level. The algorithm works well for different matrix sizes, adapting effectively to various challenging situations.

McMaster University (CA)
Openalex Percentile: Top 6%
Neural Networks and Applications
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.