Combinatorial weighted superposition attraction algorithm for solving multiple criteria decision-making problems


BAYKASOĞLU A., Büyükdeveci Ö.

Computers and Industrial Engineering, cilt.208, 2025 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 208
  • Basım Tarihi: 2025
  • Doi Numarası: 10.1016/j.cie.2025.111364
  • Dergi Adı: Computers and Industrial Engineering
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, DIALNET, Civil Engineering Abstracts
  • Anahtar Kelimeler: Decision making, Fuzzy MCDM, Metaheuristics, Permutation based MCDM, Weighted superposition attraction algorithm
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

In this study, a metaheuristic-based optimization approach is proposed in order to enhance applicability and effectiveness of a classical Multiple Criteria Decision Making method (MCDM) that is known as permutation method. The permutation method offers several advantages, such as robustness against the rank-reversal phenomenon and the ability to bypass normalization and aggregation of alternative scores across criteria, enabling it to effectively manage diverse data types. These advantages stem from its ability to directly compare alternatives within a given criteria set. However, the standard permutation method requires evaluating all possible permutations, which is computationally intensive and does not consider the magnitude of differences between alternatives in satisfying the criteria. The proposed approach introduces a new technique for calculating the ranking values of permutations by considering the magnitude of differences between alternatives. It also employs a parallel Weighted Superposition Attraction (WSA) algorithm to efficiently search for permutations, addressing these difficulties and identifying the optimal permutation of alternatives in MCDM problems. The proposed approach is evaluated on a range of real-world case studies, including agile methods assessment, laptop computer selection and fuzzy personnel selection, as well as on large-scale randomly generated problem instances. To demonstrate its effectiveness and validity, the method is also benchmarked against several well-established MCDM techniques and widely recognized metaheuristic algorithms.