Multicriteria decision analysis for sustainable data centers location

This is a PDF file of an unedited manuscript that has been accepted for publication in International Transactions in Operational Research. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. The final version will be available at: http://dx.doi.org/10.1111/j.1475-3995.2012.00874.

Electre Methods: Main Features and Recent Developments

We present main characteristics of Electre family methods, designed for multiple criteria decision aiding. These methods use as a preference model an outranking relation in the set of actions - it is constructed in result of concordance and non-discordance tests involving a specific input preference information. After a brief description of the constructivist conception in which the Electre methods are inserted, we present the main features of these methods. We discuss such characteristic features as: the possibility of taking into account positive and negative reasons in the modeling of preferences, without any need for recoding the data; using of thresholds for taking into account the imperfect knowledge of data; the absence of systematic compensation between "gains" and "losses". The main weaknesses are also presented. Then, some aspects related to new developments are outlined. These are related to some new methodological developments, new procedures, axiomatic analysis, software tools, and several other aspects. The paper ends with conclusions

Inferring parameters of a relational system of preferences from assignment examples using an evolutionary algorithm

Most evolutionary multi-objective algorithms perform poorly in many objective problems. They normally do not make selective pressure towards the Region of Interest (RoI), the privileged zone in the Pareto frontier that contains solutions important to a DM.  Several works have proved that a priori incorporation of preferences improves convergence towards the RoI. The work of (E. Fernandez, E. Lopez, F. Lopez & C.A. Coello Coello, 2011) uses a binary fuzzy outranking relational system to map many-objective problems into a tri-objective optimization problem that searches the RoI; however, it requires the elicitation of many preference parameters, a very hard task. The use of an indirect elicitation approach overcomes such situation by allowing the parameter inference from a battery of examples.  Even though the relational system of Fernandez et al. (2011) is based on binary relations, it is more convenient to elicit its parameters from assignment examples. In this sense, this paper proposes an evolutionary-based indirect parameter elicitation method that uses preference information embedded in assignment examples, and it offers an analysis of their impact in a priori incorporation of DM’s preferences. Results show, through an extensive computer experiment over random test sets, that the method estimates properly the model parameter’s values. First published online 7 May 201

Robust ordinal regression in preference learning and ranking

Multiple Criteria Decision Aiding (MCDA) offers a diversity of approaches designed for providing the decision maker (DM) with a recommendation concerning a set of alternatives (items, actions) evaluated from multiple points of view, called criteria. This paper aims at drawing attention of the Machine Learning (ML) community upon recent advances in a representative MCDA methodology, called Robust Ordinal Regression (ROR). ROR learns by examples in order to rank a set of alternatives, thus considering a similar problem as Preference Learning (ML-PL) does. However, ROR implements the interactive preference construction paradigm, which should be perceived as a mutual learning of the model and the DM. The paper clarifies the specific interpretation of the concept of preference learning adopted in ROR and MCDA, comparing it to the usual concept of preference learning considered within ML. This comparison concerns a structure of the considered problem, types of admitted preference information, a character of the employed preference models, ways of exploiting them, and techniques to arrive at a final ranking