Preference ranking organization method for enrichment evaluation: Difference between revisions
Content deleted Content added
m Cleanup/Typo fixing, typo(s) fixed: 1980's → 1980s using AWB |
Removing link(s) to "Italferr": Removing links to deleted page Italferr. |
||
(36 intermediate revisions by 29 users not shown) | |||
Line 1:
{{Short description|Promethee & Gaia, tools for management}}
{{Use dmy dates|date=
The '''preference ranking organization method for enrichment of evaluations''' and its descriptive complement '''geometrical analysis for interactive aid''' are better known as the '''Promethee and Gaia'''<ref name="Figueria">{{Cite book|title=Multiple Criteria Decision Analysis: State of the Art Surveys|author=J. Figueira, S. Greco, and M. Ehrgott|year=2005|publisher=Springer Verlag }}</ref> methods. ▼
{{multiple issues|
{{COI|date=June 2014}}
{{notability|date=June 2014}}
{{technical|date=June 2014}}
}}
▲The '''
Based on mathematics and sociology, the Promethee and Gaia method was developed at the beginning of the 1980s and has been extensively studied and refined since then.
Line 10 ⟶ 16:
== History==
The basic elements of the Promethee method have been first introduced by Professor Jean-Pierre Brans (CSOO, VUB Vrije Universiteit Brussel) in 1982.<ref name="Brans">{{Cite news|author=J.P. Brans|title=
The descriptive approach, named Gaia,<ref name="Gaia">{{Cite news|title=Geometrical representations for MCDA. the GAIA module|
The prescriptive approach, named Promethee,<ref name="Promethee">{{Cite news|title=A preference ranking organisation method: The PROMETHEE method for MCDM|
Promethee has successfully been used in many decision making contexts worldwide. A non-exhaustive list of scientific publications about extensions, applications and discussions related to the Promethee methods<ref name="applications">{{Cite news|
== Uses and applications ==
While it can be used by individuals working on straightforward decisions, the Promethee & Gaia is most useful where groups of people are working on complex problems, especially those with several
Decision situations to which the Promethee and Gaia can be applied include:
* [[Choice]] – The selection of one alternative from a given set of alternatives, usually where there are multiple decision criteria involved.
*
* [[Resource allocation]] – Allocating resources among a set of alternatives
* [[Ranking]] – Putting a set of alternatives in order from most to least preferred
Line 34 ⟶ 40:
Some uses of Promethee and Gaia have become case-studies. Recently these have included:
* Deciding which resources are the best with the available budget to meet SPS quality standards (STDF – [[WTO]]) [See more in External Links]
* Selecting new route for train performance (
== The mathematical model ==
Line 42 ⟶ 49:
The basic data related to such a problem can be written in a table containing <math>n\times q</math> evaluations. Each line corresponds to an action and each column corresponds to a criterion.
: <math>
\begin{array}{|c|c|c|c|c|c|c|} \hline
& f_{1}(
a_{1} & f_{1}(
\hline
a_{2} & f_{1}(a_{2}) & f_{2}(a_{2}) &
a_{i} & f_{1}(a_{i}) & f_{2}(a_{i}) &
a_{n} & f_{1}(a_{n}) & f_{2}(a_{n}) &
f_{q}(a_{n})
\\ \hline
Line 64 ⟶ 71:
<math>d_k(a_i,a_j)</math> is the difference between the evaluations of two actions for criterion <math>f_k</math>. Of course, these differences depend on the measurement scales used and are not always easy to compare for the decision maker.
=== Preference
As a consequence the notion of preference function is introduced to translate the difference into a unicriterion preference degree as follows:
:<math>\pi_k(a_i,a_j)=P_k[d_k(a_i,a_j)]</math>
where <math>P_k:\R\rightarrow[0,1]</math> is a positive non-decreasing preference function such that <math>
:<math>P_k(x) \begin{cases} 0, & \text{if } x\le q_k \\ \frac{x-q_k}{p_k-q_k}, & \text{if } q_k<x\le p_k \\ 1, & \text{if } x>p_k \end{cases}</math>
where <math>q_j</math> and <math>p_j</math> are respectively the indifference and preference thresholds. The meaning of these parameters is the following: when the difference is smaller than the indifference threshold it is considered as negligible by the decision maker. Therefore, the corresponding unicriterion preference degree is equal to zero. If the difference exceeds the preference threshold it is considered to be significant. Therefore, the unicriterion preference degree is equal to one (the maximum value). When the difference is between the two thresholds, an intermediate value is computed for the preference degree using a linear interpolation.
=== Multicriteria preference degree ===
When a preference function has been associated to each criterion by the decision maker, all comparisons between all pairs of actions can be done for all the criteria. A multicriteria preference degree is then computed to globally compare every couple of actions:
:<math>\pi(a,b)=\displaystyle\sum_{k=1}^qP_{k}(a,b)
Where <math>w_k</math> represents the weight of criterion <math>f_k</math>. It is assumed that <math>w_k\ge 0</math> and <math>\sum_{k=1}^q w_{k}=1</math>. As a direct consequence, we have:
Line 87 ⟶ 94:
=== Multicriteria preference flows ===
In order to position every action
:<math>\phi^{+}(a)=\frac{1}{n-1}\displaystyle\sum_{x \in A}\pi(a,x)</math>
:<math>\phi^{-}(a)=\frac{1}{n-1}\displaystyle\sum_{x \in A}\pi(x,a)</math>
The positive preference flow <math>\phi^{+}(a_i)</math> quantifies how a given action <math>a_i</math> is globally preferred to all the other actions while the negative preference flow <math>\phi^{-}(a_i)</math> quantifies how a given action <math>a_i</math> is being globally preferred by all the other actions. An ideal action would have a positive preference flow equal to 1 and a negative preference flow equal to 0. The two preference flows induce two generally different complete rankings on the set of actions. The first one is obtained by ranking the actions according to the decreasing values of their positive flow scores. The second one is obtained by ranking the actions according to the increasing values of their negative flow scores. The Promethee I partial ranking is defined as the intersection of these two rankings. As a consequence, an action <math>a_i</math> will be as good as another action <math>a_j</math> if <math> \phi^{
The positive and negative preference flows are aggregated into the net preference flow:
:<math>\phi(a)=\phi^{+}(a)-\phi^{-}(a)</math>
Direct consequences of the previous formula are:
:<math>\phi(a_i) \in [-1;1]</math>
Line 118 ⟶ 125:
A}\{P_{k}(a_i,a_j)-P_{k}(a_j,a_i)\}</math>.
The unicriterion net flow, denoted <math>\phi_{k}(a_i)\in[-1;1]</math>, has the same interpretation as the multicriteria net flow <math>\phi(a_i)</math> but is limited to one single criterion. Any action <math>a_i</math> can be characterized by a vector <math>\vec \phi(a_i) =[\phi_1(a_i),
=== Promethee preference functions ===
*Usual
::<math>
\begin{
0 & \text{if }
</math>
▲ \end{array}
*U-
::<math>\begin{array}{cc} P_{j}(d_{j})=\left\{
\begin{array}{lll}
0 & \text{if} & |d_{j}| \leq q_{j} \\
Line 143 ⟶ 148:
\end{array}</math>
*V-
::<math>\begin{array}{cc} P_{j}(d_{j})=\left\{
\begin{array}{lll}
\frac{|d_{j}|}{p_{j}} & \text{if} & |d_{j}| \leq p_{j} \\
Line 156 ⟶ 161:
*Level
::<math>\begin{array}{cc} P_{j}(d_{j})=\left\{
\begin{array}{lll}
0 & \text{if} & |d_{j}| \leq q_{j} \\
Line 170 ⟶ 175:
*Linear
::<math>\begin{array}{cc} P_{j}(d_{j})=\left\{
\begin{array}{lll}
0 & \text{if} & |d_{j}| \leq q_{j} \\
Line 183 ⟶ 188:
*Gaussian
::<math>P_{j}(d_{j})=1-e^{-\frac{d_{j}^{2}}{2s_{j}^{2}}}</math>
== Promethee rankings ==
Line 198 ⟶ 203:
* [[D-Sight]]
* [[Multi-criteria decision analysis]]
* [[
* [[Pairwise comparison (psychology)|Pairwise comparison]]
* [[Preference]]
==References==
{{
==External links==
* [http://www.d-sight.com/sites/default/files/documents/news/d-sight_case_study_italferr.pdf Italferr Case Study]
* [http://aca.d-sight.com/ D-Sight for Academics: Collaborative Decision-Making (CDM) Software For Academics based on PROMETHEE]
* [http://www.d-sight.com D-Sight: PROMETHEE based software]
* [http://www.amia-systems.com AMIA Systems: Visualize, Quantify and Optimize your flows]
* [https://web.archive.org/web/20120313062918/http://code.ulb.ac.be/promethee-gaia/ CoDE: PROMETHEE & GAIA Literature]
* [http://www.promethee-gaia.net PROMETHEE & GAIA web site]
* [http://www.smart-picker.com Smart-Picker Pro implementing PROMETHEE and FLOWSORT]
* [http://en.promethee-gaia.net/assets/vpmanual.pdf User manual for Visual PROMETHEE, a guide to all PROMETHEE methods]
{{DEFAULTSORT:Promethee}}
[[Category:Decision
|