共查询到20条相似文献,搜索用时 46 毫秒
1.
Multiple criteria sorting aims at assigning alternatives evaluated on several criteria to predefined ordered categories. In this paper, we consider a well known multiple criteria sorting method, Electre Tri, which involves three types of preference parameters: (1) category limits defining the frontiers between consecutive categories, (2) weights and majority level specifying which coalitions form a majority, and (3) veto thresholds characterizing discordance effects. We propose an elicitation procedure to infer category limits from assignment examples provided by multiple decision makers. The procedure computes a set of category limits and vetoes common to all decision makers, with variable weights for each decision maker. Hence, the method helps reaching a consensus among decision makers on the category limits and veto thresholds, whereas finding a consensus on weights is left aside. The inference procedure is based on mixed integer linear programming and performs well even for datasets corresponding to real-world decision problems. We provide an illustrative example of the use of the method and analyze the performance of the proposed algorithms. 相似文献
2.
The paper considers a discrete stochastic multiple criteria decision making problem. This problem is defined by a finite set of actions A, a set of attributes X and a set of evaluations of actions with respect to attributes E. In stochastic case the evaluation of each action with respect to each attribute takes form of a probability distribution. Thus, the comparison of two actions leads to the comparison of two vectors of probability distributions. In the paper a new procedure for solving this problem is proposed. It is based on three concepts: stochastic dominance, interactive approach, and preference threshold. The idea of the procedure comes from the interactive multiple objective goal programming approach. The set of actions is progressively reduced as the decision maker specifies additional requirements. At the beginning the decision maker is asked to define preference threshold for each attribute. Next, at each iteration the decision maker is confronted with the set of considered actions. If the decision maker is able to make a final choice then the procedure ends, otherwise he/she is asked to specify aspiration level. A didactical example is presented to illustrate the proposed technique. 相似文献
3.
Rafael Lazimy 《Mathematical Programming》1986,35(3):334-361
An interactive decomposition method is developed for solving the multiple criteria (MC) problem. Based on nonlinear programming duality theory, the MC problem is decomposed into a series of subproblems and relaxed master problems. Each subproblem is a bicriterion problem, and each relaxed master problem is a standard linear program. The prime objective of the decomposition is to simplify and facilitate the process of making preference assessments and tradeoffs across many conflicting objectives. Therefore, the decision-maker's preference function is not assumed to be known explicitly; rather, the decision maker is required to make only limited local preference assessments in the context of feasible and nondominated alternatives. Also, the preference assessments are of the form of ordinal paired comparisons, and in most of them only two criteria are allowed to change their values simultaneously, while the remaining (l–2) criteria are held fixed at certain levels. 相似文献
4.
This paper addresses multiple criteria group decision making problems where each group member offers imprecise information on his/her preferences about the criteria. In particular we study the inclusion of this partial information in the decision problem when the individuals’ preferences do not provide a vector of common criteria weights and a compromise preference vector of weights has to be determined as part of the decision process in order to evaluate a finite set of alternatives. We present a method where the compromise is defined by the lexicographical minimization of the maximum disagreement between the value assigned to the alternatives by the group members and the evaluation induced by the compromise weights. 相似文献
5.
We present a new multiple criteria sorting method that aims at assigning actions evaluated on multiple criteria to p pre-defined and ordered classes. The preference information supplied by the decision maker (DM) is a set of assignment examples on a subset of actions relatively well known to the DM. These actions are called reference actions. Each assignment example specifies a desired assignment of a corresponding reference action to one or several contiguous classes. The set of assignment examples is used to build a preference model of the DM represented by a set of general additive value functions compatible with the assignment examples. For each action a, the method computes two kinds of assignments to classes, concordant with the DM’s preference model: the necessary assignment and the possible assignment. The necessary assignment specifies the range of classes to which the action can be assigned considering all compatible value functions simultaneously. The possible assignment specifies, in turn, the range of classes to which the action can be assigned considering any compatible value function individually. The compatible value functions and the necessary and possible assignments are computed through the resolution of linear programs. 相似文献
6.
Rough set approach to multiple criteria classification with imprecise evaluations and assignments 总被引:2,自引:0,他引:2
Krzysztof Dembczyński Salvatore Greco Roman Słowiński 《European Journal of Operational Research》2009
Dominance-based Rough Set Approach (DRSA) has been introduced to deal with multiple criteria classification (also called multiple criteria sorting, or ordinal classification with monotonicity constraints), where assignments of objects may be inconsistent with respect to dominance principle. In this paper, we consider an extension of DRSA to the context of imprecise evaluations of objects on condition criteria and imprecise assignments of objects to decision classes. The imprecisions are given in the form of intervals of possible values. In order to solve the problem, we reformulate the dominance principle and introduce second-order rough approximations. The presented methodology preserves well-known properties of rough approximations, such as rough inclusion, complementarity, identity of boundaries and precisiation. Moreover, the meaning of the precisiation property is extended to the considered case. The paper presents also a way to reduce decision tables and to induce decision rules from rough approximations. 相似文献
7.
We consider a problem of ranking alternatives based on their deterministic performance evaluations on multiple criteria. We apply additive value theory and assume the Decision Maker’s (DM) preferences to be representable with general additive monotone value functions. The DM provides indirect preference information in form of pair-wise comparisons of reference alternatives, and we use this to derive the set of compatible value functions. Then, this set is analyzed to describe (1) the possible and necessary preference relations, (2) probabilities of the possible relations, (3) ranges of ranks the alternatives may obtain, and (4) the distributions of these ranks. Our work combines previous results from Robust Ordinal Regression, Extreme Ranking Analysis and Stochastic Multicriteria Acceptability Analysis under a unified decision support framework. We show how the four different results complement each other, discuss extensions of the main proposal, and demonstrate practical use of the approach by considering a problem of ranking 20 European countries in terms of 4 criteria reflecting the quality of their universities. 相似文献
8.
9.
Inferring an ELECTRE TRI Model from Assignment Examples 总被引:11,自引:0,他引:11
Given a finite set of alternatives, the sorting problem consists in the assignment of each alternative to one of the pre-defined categories. In this paper, we are interested in multiple criteria sorting problems and, more precisely, in the existing method ELECTRE TRI. This method requires the elicitation of parameters (weights, thresholds, category limits,...) in order to construct the Decision Maker's (DM) preference model. A direct elicitation of these parameters being rather difficult, we proceed to solve this problem in a way that requires from the DM much less cognitive effort. We elicit these parameters indirectly using holistic information given by the DM through assignment examples. We propose an interactive approach that infers the parameters of an ELECTRE TRI model from assignment examples. The determination of an ELECTRE TRI model that best restitutes the assignment examples is formulated through an optimization problem. The interactive aspect of this approach lies in the possibility given to the DM to revise his/her assignment examples and/or to give additional information before the optimization phase restarts. 相似文献
10.
We present a method called Generalized Regression with Intensities of Preference (GRIP) for ranking a finite set of actions evaluated on multiple criteria. GRIP builds a set of additive value functions compatible with preference information composed of a partial preorder and required intensities of preference on a subset of actions, called reference actions. It constructs not only the preference relation in the considered set of actions, but it also gives information about intensities of preference for pairs of actions from this set for a given decision maker (DM). Distinguishing necessary and possible consequences of preference information on the considered set of actions, GRIP answers questions of robustness analysis. The proposed methodology can be seen as an extension of the UTA method based on ordinal regression. GRIP can also be compared to the AHP method, which requires pairwise comparison of all actions and criteria, and yields a priority ranking of actions. As for the preference information being used, GRIP can be compared, moreover, to the MACBETH method which also takes into account a preference order of actions and intensity of preference for pairs of actions. The preference information used in GRIP does not need, however, to be complete: the DM is asked to provide comparisons of only those pairs of reference actions on particular criteria for which his/her judgment is sufficiently certain. This is an important advantage comparing to methods which, instead, require comparison of all possible pairs of actions on all the considered criteria. Moreover, GRIP works with a set of general additive value functions compatible with the preference information, while other methods use a single and less general value function, such as the weighted-sum. 相似文献
11.
In this paper, we present a new preference disaggregation method for multiple criteria sorting problems, called DIS-CARD. Real-life experience indicates the need of considering decision making situations in which a decision maker (DM) specifies a desired number of alternatives to be assigned to single classes or to unions of some classes. These situations require special methods for multiple criteria sorting subject to desired cardinalities of classes. DIS-CARD deals with such a problem, using the ordinal regression approach to construct a model of DM’s preferences from preference information provided in terms of exemplary assignments of some reference alternatives, together with the above desired cardinalities. We develop a mathematical model for incorporating such preference information via mixed integer linear programming (MILP). Then, we adapt the MILP model to two types of preference models: an additive value function and an outranking relation. Illustrative example is solved to illustrate the methodology. 相似文献
12.
In this paper, we propose the THESEUS method, a new approach based on fuzzy outranking relations to multi-criteria sorting problems. Compared with other outranking-based methods, THESEUS is inspired by another view of multi-criteria classification problems. It utilizes a new way of evaluating the assignment of an object to an element of the set of ordered categories that were previously defined. This way is based on comparing every possible assignment with the information from various preference relations that are derived from a fuzzy outranking relation defined on the universe of objects. The appropriate assignment is determined by solving a simple selection problem.The capacity of a reference set for making appropriate assignments is related to a good characterization of the categories. A single reference action characterizing a category may be insufficient to achieve well-determined assignments. In this paper, the reference set capacity to perform appropriate assignments is characterized by some new concepts. This capacity may be increased when more objects are added to the reference set. THESEUS is a method for handling the preference information contained in such larger reference sets. 相似文献
13.
Conjoint measurement studies binary relations defined on product sets and investigates the existence and uniqueness of, usually additive, numerical representations of such relations. It has proved to be quite a powerful tool to analyze and compare MCDM techniques designed to build a preference relation between multiattributed alternatives and has been an inspiring guide to many assessment protocols. The aim of this paper is to show that additive representations can be obtained on the basis of much poorer information than a preference relation. We will suppose here that the decision maker only specifies for each object if he/she finds it “attractive” (better than the status quo), “unattractive” (worse than the status quo) or “neutral” (equivalent to the status quo). We show how to build an additive representation, with tight uniqueness properties, using such an ordered partition of the set of objects. On a theoretical level, this paper shows that classical results of additive conjoint measurement can be extended to cover the case of ordered partitions and wishes to be a contribution to the growing literature on the foundations of sorting techniques in MCDM. On a more practical level, our results suggest an assessment strategy of an additive model on the basis of an ordered partition. 相似文献
14.
15.
Decisions about the acquisition and maintenance of military equipment serve to build long-term capabilities in preparation of military conflicts. Typically, these decisions involve large investments which need to be supported by adequate cost-efficiency analyses. Yet the cost-efficiency analysis of weapon systems involves several challenges: for example, it is necessary to account for the possible interactions among different weapon systems; the relevance of several impact criteria; and the variety of combat situations in which these systems may be used. In this paper, we develop a portfolio methodology where these challenges are addressed by evaluating the cost-efficiencies of entire portfolios consisting of individual weapon systems. Our methodology accounts for possible interactions among systems by synthesizing impact assessment results that are either generated by combat simulation models or elicited from experts. It also admits incomplete preference information about the relative importance of different impact criteria. This methodology guides decision making by identifying which combinations of weapon systems are efficient with respect to multiple evaluation criteria in different combat situations at different cost levels. It can also be extended to settings where multiple combat situations are addressed simultaneously. The methodology is generic and can therefore be applied also in civilian settings when portfolios of activities (such as mitigation of harmful environmental emissions) may exhibit interactions. 相似文献
16.
In the context of multiple attribute decision making, preference models making use of reference points in an ordinal way have recently been introduced in the literature. This text proposes an axiomatic analysis of such models, with a particular emphasis on the case in which there is only one reference point. Our analysis uses a general conjoint measurement model resting on the study of traces induced on attributes by the preference relation and using conditions guaranteeing that these traces are complete. Models using reference points are shown to be a particular case of this general model. The number of reference points is linked to the number of equivalence classes distinguished by the traces. When there is only one reference point, the induced traces are quite rough, distinguishing at most two distinct equivalence classes. We study the relation between the model using a single reference point and other preference models proposed in the literature, most notably models based on concordance and models based on a discrete Sugeno integral. 相似文献
17.
Within the multicriteria aggregation–disaggregation framework, ordinal regression aims at inducing the parameters of a decision model, for example those of a utility function, which have to represent some holistic preference comparisons of a Decision Maker (DM). Usually, among the many utility functions representing the DM’s preference information, only one utility function is selected. Since such a choice is arbitrary to some extent, recently robust ordinal regression has been proposed with the purpose of taking into account all the sets of parameters compatible with the DM’s preference information. Until now, robust ordinal regression has been implemented to additive utility functions under the assumption of criteria independence. In this paper we propose a non-additive robust ordinal regression on a set of alternatives A, whose utility is evaluated in terms of the Choquet integral which permits to represent the interaction among criteria, modelled by the fuzzy measures, parameterizing our approach. 相似文献
18.
In complex domains it is usually quite difficult to introduce context information. However, sometimes that information should be taken into account to make decisions, because it provides some relevant knowledge that cannot be expressed using an attribute-value representation. This is the case of the determination of risk of contamination of soils. In this paper, we propose to use conjunctive rules to introduce additional background knowledge to a MCDM sorting method called ClusDM. ClusDM is based on the aggregation of the data with unsupervised clustering techniques. The paper presents a new algorithm to incorporate rules to guide the clustering process in a semi-supervised way. The paper also describes how it works in the case sorting a set of possible contaminated soils, and compares the results obtained by ClusDM when rules are used or not. 相似文献
19.
Multiple criteria analysis (MCA) is a framework for evaluating decision options against multiple criteria. Numerous techniques for solving an MCA problem are available. This paper applies MCA to six water management decision problems. The MCA methods tested include weighted summation, range of value, PROMTHEE II, Evamix and compromise programming. We show that different MCA methods were in strong agreement with high correlations amongst rankings. In the few cases where strong disagreement between MCA methods did occur it was due to presence of mixed ordinal-cardinal data in the evaluation matrix. The results suggest that whilst selection of the MCA technique is important more emphasis is needed on the initial structuring of the decision problem, which involves choosing criteria and decision options. 相似文献
20.
Jyri Mustajoki 《European Journal of Operational Research》2012,218(1):193-201
Preference programming is a general term for multi-criteria decision analytical approaches allowing incomplete preference information. In the PAIRS method, interval judgments are assigned to weight ratios between attributes to model imprecision in multi-attribute value trees. This paper studies the effects of a hierarchical model structure on the overall imprecision, as the form of the hierarchy also affects the form of imprecision that can be assigned to the model. The aim is to find out good procedural practices for reducing overall imprecision descending inherently from the model structure. The study provides simulation results about the ability of various weighting schemes to identify dominated alternatives, which are discussed with respect to other issues related to the weighting process. According to the results, a hierarchical model is structurally somewhat more unable to identify dominances than a corresponding nonhierarchical model, but its cognitive advantages often cancel out this. The results also suggest paying reasonable attention to the precision of the lower level judgments and to identifying possible correlations between the criteria. 相似文献