PROMETHEE II is a widely used outranking method in the field of multi criteria decision aid (MCDA) method. The method outputs a ranking of a considered set of alternatives, based on the computation of net flow scores. <p>In this thesis, aggregating several published journal articles and conference papers, we propose three contributions that relate to the method: 1) Outranking methods are based on the pairwise comparison of all considered alternatives, yielding a quadratic time complexity for evaluating the net flow scores. We propose a method for reducing to a linear time complexity and show that it offers good results; 2) Determining preference parameters, i.e. relative weights for each criterion, is not a trivial task. We propose two complementary approaches to eliciting preferences, based on the aggregation-disaggregation paradigm; 3) The phenomenon of rank reversal, that also affects the PROMETHEE II method, is often considered as problematic in the MCDA community. We formalise the exact conditions for rank reversal to occur with PROMETHEE II when adding or removing one or more alternatives to the original set. These conditions lead to the exact bound of rank reversal, a way to determine the actions that actually provoke rank reversal and two associated metrics that should be useful for concrete applications. / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished
| Identifer | oai:union.ndltd.org:ulb.ac.be/oai:dipot.ulb.ac.be:2013/209033 |
| Date | 02 July 2015 |
| Creators | Eppe, Stefan |
| Contributors | De Smet, Yves, Stutzle, Thomas, Calders, Toon, Pirlot, Marc, Springael, Johan |
| Publisher | Universite Libre de Bruxelles, Université libre de Bruxelles, Ecole polytechnique de Bruxelles – Informatique, Bruxelles |
| Source Sets | Université libre de Bruxelles |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/doctoralThesis, info:ulb-repo/semantics/doctoralThesis, info:ulb-repo/semantics/openurl/vlink-dissertation |
| Format | No full-text files |
Page generated in 0.0087 seconds