IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v241y2026ipap498-512.html

A novel local adjustment approach to improve multiplicative consistency of additive reciprocal matrices with an optimal allocation of information granularity

Author

Listed:
  • Zhang, Jia-Wei
  • Liu, Fang
  • Gong, Ben-Gang
  • Cabrerizo, Francisco Javier
  • Pérez, Ignacio Javier

Abstract

In decision-making processes, ensuring the consistency of additive reciprocal matrices (ARMs) is critical for obtaining reliable rankings. However, achieving multiplicative consistency in real-world applications is often difficult due to the inherent complexities of human judgment. This paper introduces a novel local adjustment approach to enhance multiplicative consistency in ARMs by leveraging an optimal allocation of information granularity. Firstly, a sequential model of ARMs is proposed to quickly determine which entries need to be modified. Secondly, with a given average level of information granularity, a new optimization model, which aims to maximize multiplicative consistency and is solved via Gaussian quantum-behaved particle swarm optimization, is employed to optimally allocate information granularity to the necessary revisions. Then, a new algorithm is proposed to ensure that the adjusted ARM not only achieves acceptable multiplicative consistency but also minimizes the loss of initial preference information. Finally, numerical experiments and extensive simulations are conducted to demonstrate the effectiveness of the proposed approach. These findings highlight the efficiency and applicability of the method in complex decision-making scenarios, offering a practical solution for improving ARM consistency with minimal information loss.

Suggested Citation

  • Zhang, Jia-Wei & Liu, Fang & Gong, Ben-Gang & Cabrerizo, Francisco Javier & Pérez, Ignacio Javier, 2026. "A novel local adjustment approach to improve multiplicative consistency of additive reciprocal matrices with an optimal allocation of information granularity," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 241(PA), pages 498-512.
    • Handle: RePEc:eee:matcom:v:241:y:2026:i:pa:p:498-512
    DOI: 10.1016/j.matcom.2025.09.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425003891
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2025.09.016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Cavallo, Bice & Ishizaka, Alessio, 2025. "A comparative study on precision of direct evaluations, the Pairwise Comparisons Method and the Best-Worst Method," Omega, Elsevier, vol. 130(C).
    2. Liu, Fang & Chen, Ya-Ru & Zhou, Da-Hai, 2023. "A two-dimensional approach to flexibility degree of XOR numbers with application to group decision making," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 207(C), pages 267-287.
    3. Jiří Mazurek & Pedro Linares, 2024. "Some notes on non-reciprocal matrices in the multiplicative pairwise comparisons framework," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(5), pages 955-966, May.
    4. Mondal, Rajan & Manna, Amalesh Kumar & Akhtar, Md & Bhunia, Asoke Kumar, 2025. "Optimization of a price break policy and advertisement effort based non-instantaneous deteriorating inventory problem with partial backlogged via metaheuristic algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 236(C), pages 221-247.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kavitha, S. & Satheeshkumar, J. & Amudha, T., 2024. "Multi-label feature selection using q-rung orthopair hesitant fuzzy MCDM approach extended to CODAS," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 222(C), pages 148-173.
    2. Janani, K. & Mohanrasu, S.S. & Kashkynbayev, Ardak & Rakkiyappan, R., 2025. "Ensemble feature selection via CoCoSo method extended to interval-valued intuitionistic fuzzy environment," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 229(C), pages 50-77.
    3. Mohanrasu, S.S. & Janani, K. & Rakkiyappan, R., 2024. "A COPRAS-based Approach to Multi-Label Feature Selection for Text Classification," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 222(C), pages 3-23.
    4. Chen, Ya-Ru & Liu, Fang & Bustince, Humberto & Huang, Hao & Zhong, Xian-Ci, 2026. "Optimization-driven group decision making with XOR comparison matrices," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 241(PA), pages 763-786.
    5. Janani, K. & Mohanrasu, S.S. & Kashkynbayev, Ardak & Rakkiyappan, R., 2024. "Minkowski distance measure in fuzzy PROMETHEE for ensemble feature selection," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 222(C), pages 264-295.
    6. Wenshuai Wu, 2024. "Probabilistic Linguistic TODIM Method with Probabilistic Linguistic Entropy Weight and Hamming Distance for Teaching Reform Plan Evaluation," Mathematics, MDPI, vol. 12(22), pages 1-18, November.
    7. S., Kavitha & N., Kendra & J., Satheeshkumar & T., Amudha & Manavalan, Balachandran, 2025. "Decision making based ensemble feature selection approach through a new score function in q-rung orthopair hesitant fuzzy environment," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 232(C), pages 362-381.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:241:y:2026:i:pa:p:498-512. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.