ElectreIsFindKernel - finds kernel of a graph (i.e. subset of best alternatives) according to the procedure used by the Electre Is method. The graph is generated from the outranking matrix provided as one of the input files.
This module provides two methods of cycle elimination: by cutting weakest edge (i.e. with the lowest weight) or by aggregation of the nodes, which is the default. In case of the former method, it is required to provide a credibility matrix as an additional input, since weights are derived from credibility indices. Please note that these two methods may give different results.
(For outputs, see below)
Alternatives to consider.
Optional: yes, enabled by default
The credibility matrix for determining the weights of the generated graph. This input is required only if the ‘cut_weakest’ option is used for cycle elimination.
The outranking relations which should be used as a base for generated graph. This input should be provided in a ‘crisp’ form, i.e. it should contain only pairs where outranking occurs, but without assigning any explicit value (e.g. ‘1.0’) to them. For example:
Method for cycle elimination. Please note that ‘cut_weakest’ method requires providing credibility matrix as an additional input.
<methodParameters> <parameter name="eliminate_cycles_method"> <value> <label>%1</label> </value> </parameter> </methodParameters>
Resulting kernel (i.e. subset of best alternatives).
<alternativesSets> <alternativesSet mcdaConcept="kernel"> <element> <alternativeID>[...]</alternativeID> </element> [...] </alternativesSet> </alternativesSets>
Messages or errors generated by this module.
For further technical details on the web service underlying this program, have a look at its documentation here.