EURO 2025 Leeds
Abstract Submission

1157. Ranking construction based on crisp or valued outranking relation

Invited abstract in session MD-8: Methodological developments in PROMETHEE methods, stream Multiple Criteria Decision Aiding.

Monday, 14:30-16:00
Room: Clarendon SR 2.08

Authors (first author is the speaker)

1. Jerzy Łukaszewicz
Institute of Computing Science, Poznan University of Technology
2. Milosz Kadzinski
Institute of Computing Science, Poznan University of Technology

Abstract

The outranking relation constructed by the ELECTRE or PROMETHEE methods, widely used in Multiple Criteria Decision Aiding, is intransitive. Therefore, to support the solution of ranking and choice problems, the existing approaches apply some exploitation procedures to impose order on the set of alternatives. Examples include the distillation procedures incorporated in ELECTRE III or Net Flow Score techniques encapsulated in PROMETHEE I and II. We propose novel exploitation methods for constructing complete or partial ranking. While both need to satisfy the transitivity property, the former assumes that all pairs of alternatives are comparable, while the latter tolerates incomparability relations. The proposed approaches are based on mathematical programming. They exploit either a valued relation that captures the preference degrees or a crisp relation consisting of binary statements. The methods minimize the distance between the constructed ranking and the input relation for all pairs of alternatives. The intensity of the divergence for a given pair of alternatives depends on the nature of the two relations, input and output, in question. Alternatively, our aim can be understood as the maximization of support for the relations that are preserved in the obtained ranking. We demonstrate the use of proposed methods in illustrative case studies. We also experimentally compare their results with those returned by the state-of-the-art methods.

Keywords

Status: accepted

Back to the list of papers