Identifying and eliminating dominated alternatives in multi-attribute decision making with intuitionistic fuzzy information

Multi-attribute decision making under uncertainty is a usual task in our daily life. In the decision making process, the decision information provided by the decision maker (or expert) over alternatives may take the form of intuitionistic fuzzy numbers, and the weight information on attributes is usually incomplete. To this issue, we first transform the original decision matrix, whose elements are intuitionistic fuzzy numbers expressed by pairs of satisfaction degrees and dissatisfaction degrees, into its expected decision matrix, whose elements are composed of satisfaction degrees and hesitation degrees. We introduce the concept of dominated alternative, and give a method to identify the dominated alternatives. Then we develop an interactive method for eliminating any dominated alternatives by updating the decision maker's preferences gradually so as to find out the optimal one eventually. A further extension of the interactive method to interval-valued intuitionistic fuzzy situations is given, and the solution process of this interactive method is shown in detail through an illustrative example.     

Integrated evidential reasoning approach in the presence of cardinal and ordinal preferences and its applications in software selection

A combination of cardinal and ordinal preferences in multiple-attribute decision making (MADM) demonstrates more reliability and flexibility compared with sole cardinal or ordinal preferences derived from a decision maker. This situation occurs particularly when the knowledge and experience of the decision maker, as well as the data regarding specific alternatives on certain attributes, are insufficient or incomplete. This paper proposes an integrated evidential reasoning (IER) approach to analyze uncertain MADM problems in the presence of cardinal and ordinal preferences. The decision maker provides complete or incomplete cardinal and ordinal preferences of each alternative on each attribute. Ordinal preferences are expressed as unknown distributed assessment vectors and integrated with cardinal preferences to form aggregated preferences of alternatives. Three optimization models considering cardinal and ordinal preferences are constructed to determine the minimum and maximum minimal satisfaction of alternatives, simultaneous maximum minimal satisfaction of alternatives, and simultaneous minimum minimal satisfaction of alternatives. The minimax regret rule, the maximax rule, and the maximin rule are employed respectively in the three models to generate three kinds of value functions of alternatives, which are aggregated to find solutions. The attribute weights in the three models can be precise or imprecise (i.e., characterized by six types of constraints). The IER approach is used to select the optimum software for product lifecycle management of a famous Chinese automobile manufacturing enterprise.     

三种基于偏好的区间多目标进化算法及应用

区间参数多目标优化问题是普遍存在且非常重要的。目前直接求解该类问题的进化优化方法非常少,且已有方法的目的是找到收敛性好且分布均匀的Pareto最优解集。为得到符合决策者偏好的最满意解,本文综述3种基于偏好的区间多目标进化算法,并将其应用于特定环境下机器人路径规划问题,比较3种算法的性能。研究结果可丰富特定环境下机器人路径规划的求解方法,提高机器人路径优化效果。     

An interactive computer system for multicriteria facility location

A computer system developed to assist a decision maker in finding his most preferred efficient solution to a multicriteria location model is described. The system requires interaction between the decision maker and optimization software to conduct a heuristic search of the set of efficient solutions to the location model. A command language developed to give the user control over the system and an optimization algorithm developed for finding efficient solutions are presented.     

自适应偏好半径划分区域的多目标进化方法

偏好多目标进化算法是一类帮助决策者找到感兴趣的Pareto最优解的算法.目前,在以参考点位置作为偏好信息载体的偏好多目标进化算法中,不合适的参考点位置往往会严重影响算法的收敛性能,偏好区域的大小难以控制,在高维问题上效果较差.针对以上问题,通过计算基于种群的自适应偏好半径,利用自适应偏好半径构造一种新的偏好关系模型,通过对偏好区域进行划分,提出基于偏好区域划分的偏好多目标进化算法.将所提算法与4种常用的以参考点为偏好信息载体的多目标进化算法g-NSGA-II、r-NSGA-II、角度偏好算法、MOEA/D-PRE进行对比实验,结果表明,所提算法具有较好的收敛性能和分布性能,决策者可以控制偏好区域大小,在高维问题上也具有较好的收敛效果.     

基于Vague集模糊推理的多评价指标模糊决策方法

目前在智能领域中对Vague集的研究已越来越广泛与深入，并运用于决策问题中，有学者已把Vague集用于多评价指标的模糊决策中，但其决策方法在某些时候却难以得到目标。为此，本文提出了一个基于Vague集模糊推理的多评价指标模糊决策方法。在这个方法中，从基于Vague集的模糊推理的观点来看待模糊决策问题。将评价指标和候选方案之间的关系用一组基于Vague集的推理规则来表示，将决策者的要求用一组Vague集来表示，经过模糊推理等过程最后得到决策结果。然后还给出了一个实例说明这种多评价指标模糊决策方法。这个基于Vague集模糊推理的多评价指标模糊决策方法的提出为决策系统提供了一个有用的工具。     

A stochastic multicriteria acceptability analysis–evidential reasoning method for uncertain multiattribute decision‐making problems

Evidential reasoning (ER) is an effective approach for assessing alternatives with uncertain attribute values in the context of decision making. For the ER approach to be able to handle variations in the weights of uncertain attributes in an appropriate manner, this paper proposes a method to solve problems of uncertain multiattribute decision making that involve both uncertain attribute values and uncertain attribute weights, which this method does by combining the ER approach and stochastic multicriteria acceptability analysis‐2 (SMAA‐2). First, the uncertainty in attribute values is described by using a belief decision matrix as in the ER approach. The analytical ER algorithm is then used to create the utility function in the SMAA‐2 model, and that function is used to calculate the probability of different sorting positions of the decision units under weight‐related restrictions. Finally, the results of ranking are obtained by combining the sorting weights. An example is provided to verify the effectiveness of the proposed method.     

Multicriteria fuzzy decision making based on interval-valued intuitionistic fuzzy sets

In this paper, we present a new method for multicriteria fuzzy decision making based on interval-valued intuitionistic fuzzy sets, where interval-valued intuitionistic fuzzy values are used to represent evaluating values of the decision-maker with respect to alternatives. First, we propose a new method for ranking interval-valued intuitionistic fuzzy values. Based on the proposed fuzzy ranking method of interval-valued intuitionistic fuzzy values, we propose a new method for multicriteria fuzzy decision making. The proposed multicriteria fuzzy decision making method outperforms Ye’s method (2009) due to the fact that the proposed method can overcome the drawback of Ye’s method (2009), where the drawback of Ye’s method is that it can not distinguish the ranking order between alternatives in some situations. The proposed method provides us with a useful way for dealing with multicriteria fuzzy decision making problems based on interval-valued intuitionistic fuzzy sets.     

Computing leximin-optimal solutions in constraint networks

In many real-world multiobjective optimization problems one needs to find solutions or alternatives that provide a fair compromise between different conflicting objective functions—which could be criteria in a multicriteria context, or agent utilities in a multiagent context—while being efficient (i.e. informally, ensuring the greatest possible overall agents' satisfaction). This is typically the case in problems implying human agents, where fairness and efficiency requirements must be met. Preference handling, resource allocation problems are another examples of the need for balanced compromises between several conflicting objectives. A way to characterize good solutions in such problems is to use the leximin preorder to compare the vectors of objective values, and to select the solutions which maximize this preorder. In this article, we describe five algorithms for finding leximin-optimal solutions using constraint programming. Three of these algorithms are original. Other ones are adapted, in constraint programming settings, from existing works. The algorithms are compared experimentally on three benchmark problems.     

Preference representation using Gaussian functions on a hyperplane in evolutionary multi-objective optimization

Many-objective optimization has attracted much attention in evolutionary multi-objective optimization (EMO). This is because EMO algorithms developed so far often degrade their search ability for optimization problems with four or more objectives, which are frequently referred to as many-objective problems. One of promising approaches to handle many objectives is to incorporate the preference of a decision maker (DM) into EMO algorithms. With the preference, EMO algorithms can focus the search on regions preferred by the DM, resulting in solutions close to the Pareto front around the preferred regions. Although a number of preference-based EMO algorithms have been proposed, it is not trivial for the DM to reflect his/her actual preference in the search. We previously proposed to represent the preference of the DM using Gaussian functions on a hyperplane. The DM specifies the center and spread vectors of the Gaussian functions so as to represent his/her preference. The preference handling is integrated into the framework of NSGA-II. This paper extends our previous work so that obtained solutions follow the distribution of Gaussian functions specified. The performance of our proposed method is demonstrated mainly for benchmark problems and real-world applications with a few objectives in this paper. We also show the applicability of our method to many-objective problems.     

A Multicriteria Collaborative Filtering Approach Using the Indifference Relation and its Application to Initiator Recommendation for Group-Buying

For recommender systems, the main aim of the popular collaborative filtering approaches is to recommend items that users with similar preferences have liked in the past. Single-criterion recommender systems have been successfully used in several applications. Because leveraging multicriteria information can potentially improve recommendation accuracy, multicriteria rating systems that allow users to assign ratings to various content attributes of items they have consumed have become the focus in recommendation systems. By treating the recommendation of items as a multicriteria decision problem, it is interesting to incorporate the preference relation of users of multicriteria decision making (MCDM) into the similarity measure for a collaborative filtering approach. For this, the well-known indifference relation can justify a discrimination or similarity between any two users, if outranking relation theory is incorporated. The applicability of the proposed single-criterion and multicriteria recommendation approaches to the recommendation of initiators on a group-buying website was examined. Experimental results have demonstrated that the generalization ability of the proposed multicriteria recommendation approach performs well in comparison to other single-criterion and multicriteria collaborative filtering approaches.     

Group decision making model and approach based on interval preference orderings

In group decision making under uncertainty, interval preference orderings as a type of simple uncertain preference structure, can be easily and conveniently used to express the experts’ evaluations over the considered alternatives. In this paper, we investigate group decision making problems with interval preference orderings on alternatives. We start by fusing all individual interval preference orderings given by the experts into the collective interval preference orderings through the uncertain additive weighted averaging operator. Then we establish a nonlinear programming model by minimizing the divergences between the individual uncertain preferences and the group’s opinions, from which we derive an exact formula to determine the experts’ relative importance weights. After that, we calculate the distances of the collective interval preference orderings to the positive and negative ideal solutions, respectively, based on which we use a TOPSIS based approach to rank and select the alternatives. All these results are also reduced to solve group decision making problems where the experts’ evaluations over the alternatives are expressed in exact preference orderings. A numerical analysis of our model and approach is finally carried out using two illustrative examples.     

Interpretation of criteria weights in multicriteria decision making

Multicriteria decision making models are characterized by the need to evaluate a finite set of alternatives with respect to multiple criteria. The criteria weights in different aggregation rules have different interpretations and implications which have been misunderstood and neglected by many decision makers and researchers. By analyzing the aggregation rules, identifying partial values, specifying explicit measurement units and explicating direct statements of pairwise comparisons of preferences, we identify several plausible interpretations of criteria weights and their appropriate roles in different multicriteria decision making models. The underlying issues of scale validity, commensurability, criteria importance and rank consistency are examined.     

Constructing,evaluating and visualizing value and utility functions for decision support

Formal methods of decision analysis can help to structure a decision making process and to communicate reasons for decisions transparently. Objectives hierarchies and associated value and utility functions are useful instruments for supporting such decision making processes by structuring and quantifying the preferences of decision makers or stakeholders. Common multi-attribute decision analysis software products support such decision making processes but they can often not represent complex preference structures and visualize uncertainty induced by uncertain predictions of the consequences of decision alternatives. To stimulate strengthening these aspects in decision support processes, we propose a set of visualization tools and provide a software package for constructing, evaluating and visualizing value and utility functions. In these tools we emphasize flexibility in value aggregation schemes and consideration and communication of prediction uncertainty. The use of these tools is demonstrated with an illustrative example of river management decision support.     

A generic multi-attribute analysis system

This paper describes a generic decision support system based on an additive multiattribute utility model that is intended to allay many of the operational difficulties involved in the multicriteria decision-making process. The system accounts for uncertainty about the alternative consequences and admits incomplete information about the decision-makers’ preferences, which leads to classes of utility functions and weight intervals. The additive model is used to assess, on the one hand, average overall utilities, on which the ranking of alternatives is based and, on the other, minimum and maximum overall utilities, which give further insight into the robustness of this ranking. When the information obtained is not meaningful enough so as to definitively recommend an alternative, an iteration process can be carried out by tightening the imprecise parameters and assessing the non-dominated and potentially optimal alternatives or using Monte Carlo simulation techniques to determine useful information about dominance among the alternatives.     

Ordering based decision making – A survey

Decision making is the crucial step in many real applications such as organization management, financial planning, products evaluation and recommendation. Rational decision making is to select an alternative from a set of different ones which has the best utility (i.e., maximally satisfies given criteria, objectives, or preferences). In many cases, decision making is to order alternatives and select one or a few among the top of the ranking. Orderings provide a natural and effective way for representing indeterminate situations which are pervasive in commonsense reasoning. Ordering based decision making is then to find the suitable method for evaluating candidates or ranking alternatives based on provided ordinal information and criteria, and this in many cases is to rank alternatives based on qualitative ordering information. In this paper, we discuss the importance and research aspects of ordering based decision making, and review the existing ordering based decision making theories and methods providing future research directions.     

Integrated value function construction with application to impact assessments

In this article, an integrated structure is provided for processing various forms of imprecise preference information in the context of multicriteria impact assessments. Linear programing formulations generate best‐fit value function models and associated ranking of alternatives, both when preferences are overdetermined (leading to potential inconsistencies) or when preference information is incomplete. In the latter context, the algorithm identifies a range of possible rank orders for the decision alternatives under consideration, consistent with the information provided. The approach is primarily aimed at structuring opinions of experts concerning the desirability of different actions in terms of technical aspects, intended as input into the final political decision‐making process. It is demonstrated that the approach described here can be implemented with modest levels of effort by the experts. Experience is reported with the approach in the context of soil sanitation problem in the Netherlands, in which experts expressed satisfaction with the resulting rank ordering of alternatives.     

An incremental approach to genetic-algorithms-based classification.

Incremental learning has been widely addressed in the machine learning literature to cope with learning tasks where the learning environment is ever changing or training samples become available over time. However, most research work explores incremental learning with statistical algorithms or neural networks, rather than evolutionary algorithms. The work in this paper employs genetic algorithms (GAs) as basic learning algorithms for incremental learning within one or more classifier agents in a multiagent environment. Four new approaches with different initialization schemes are proposed. They keep the old solutions and use an "integration" operation to integrate them with new elements to accommodate new attributes, while biased mutation and crossover operations are adopted to further evolve a reinforced solution. The simulation results on benchmark classification data sets show that the proposed approaches can deal with the arrival of new input attributes and integrate them with the original input space. It is also shown that the proposed approaches can be successfully used for incremental learning and improve classification rates as compared to the retraining GA. Possible applications for continuous incremental training and feature selection are also discussed.     

Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming problems

This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferential behavior. The DM is requested to respond to a set of questions in the form of paired comparison of alternatives. The approach is different than other methods that consider the centrist preferential behavior.In this paper, an interactive approach is presented to solve the multiple objective linear programming (MOLP) problem. The DM's underlying preferential function is represented by a quasi-convex value (utility) function, which is to be maximized. The method presented in this paper solves MOLP problems with quasi-convex value (utility) functions by using paired comparison of alternatives in the objective space. From the mathematical point of view, maximizing a quasi-convex (or a convex) function over a convex set is considered a difficult problem to solve, while solutions for quasi-concave (or concave) functions are currently available. We prove that our proposed approach converges to the most preferred alternative.We demonstrate that the most preferred alternative is an extreme point of the MOLP problem, and we develop an interactive method that guarantees obtaining the global most preferred alternative for the MOLP problem. This method requires only a finite number of pivoting operations using a simplex-based method, and it asks only a limited number of paired comparison questions of alternatives in the objective space. We develop a branch and bound algorithm that extends a tree of solutions at each iteration until the MOLP problem is solved. At each iteration, the decision maker has to identify the most preferred alternatives from a given subset of efficient alternatives that are adjacent extreme points to the current basis. Through the branch and bound algorithm, without asking many questions from the decision maker, all branches of the tree are implicitly enumerated until the most preferred alternative is obtained. An example is provided to show the details of the algorithm. Some computational experiments are also presented.Scope and purposeThis paper presents the fundamental theory, algorithm, and examples for identifying the most preferred alternative (solution) for a decision maker (DM) having a non-centrist (or extremist) preferential behavior for Multiple Objective Linear Programming (MOLP) problems. The DM is requested to respond to a set of questions in the form of paired comparison of alternatives.Although widely applied, Linear Programming is limited to a single objective function. In many real world situations, DMs are faced with multiple objective problems in that several competing and conflicting objectives have to be considered. For these problems, there exist many alternatives that are feasible and acceptable. However, the DM is interested in finding “the most preferred alternative”. In the past three decades, many methods have been developed for solving MOLP problems.One class of these methods is called “interactive”, in which the DM responds to a set of questions interactively so that his/her most preferred alternative can be obtained. In most of these methods, the value (utility) function (that presents the DM's preference) is assumed to be linear or additive, concave, pseudo-concave, or quasi-concave. However, for MOLP problems, there has not been any effort to recognize and solve the quasi-convex utility functions, which are among the most difficult class of problems to solve. The quasi-convex class of utility functions represents an extremist preferential behavior, while the other aforementioned methods (such as quasi-concave) represent a conservative behavioral preference. It is shown that the method converges to the optimal (the most preferred) alternative. The approach is computationally feasible for moderately sized problems.     

Representing and reasoning about preferences in requirements engineering

The priorities that stakeholders associate with requirements may vary from stakeholder to stakeholder and from one situation to the next. Differing priorities, in turn, imply different design decisions for the system to be. While elicitation of requirement priorities is a well-studied activity, modeling and reasoning with prioritization has not enjoyed equal attention. In this paper, we address this problem by extending a state-of-the-art goal modeling notation to support the representation of preference (??nice-to-have??) requirements. In our extension, preference goals are distinguished from mandatory ones. Then, quantitative prioritizations of the former are constructed and used as criteria for evaluating alternative ways to achieve the latter. To generate solutions, an existing preference-based planner is utilized to efficiently search for alternatives that best satisfy a given set of mandatory and preferred requirements. With such a planning tool, analysts can acquire a better understanding of the impact of high-level stakeholder preferences on low-level design decisions.