Fuzzy preference orderings in group decision making

In this paper, some use of fuzzy preference orderings in group decision making is discussed. First, fuzzy preference orderings are defined as fuzzy binary relations satisfying reciprocity and max-min transitivity. Then, particularly in the case where individual preferences are represented by utility functions (utility values), group fuzzy preference orderings of which fuzziness is caused by differences or diversity of individual opinions are defined. Those orderings might be useful for proceeding the group decision making process smoothly, in the same manner as the extended contributive rule method.     

Electric load forecasting methods: Tools for decision making

For decision makers in the electricity sector, the decision process is complex with several different levels that have to be taken into consideration. These comprise for instance the planning of facilities and an optimal day-to-day operation of the power plant. These decisions address widely different time-horizons and aspects of the system. For accomplishing these tasks load forecasts are very important. Therefore, finding an appropriate approach and model is at core of the decision process. Due to the deregulation of energy markets, load forecasting has gained even more importance. In this article, we give an overview over the various models and methods used to predict future load demands.     

Risk averse decision making under catastrophic risk

A nonstandard probabilistic setting for modeling of the risk of catastrophic events is presented. It allows random variables to take on infinitely large negative values with non-zero probability, which correspond to catastrophic consequences unmeasurable in monetary terms, e.g. loss of human lives. Thanks to this extension, the safety-first principle is proved to be consistent with traditional axioms on a preference relation, such as monotonicity, continuity, and risk aversion. Also, a robust preference relation is introduced, and an example of a monotone robust preference relation, sensitive to catastrophic events in the sense of Chichilnisky (2002), is provided. The suggested setting is demonstrated in evaluating nuclear power plant projects when the probability of a catastrophe is itself a random variable.     

Self-consistency of decision rules for group decision making

The author treats, in this paper, a group of decision makers, where each of them already has preference on a given set of alternatives but the group as a whole does not have a decision rule to make their group decision, yet. Then, the author examines which decision rules are appropriate. As a criterion of “appropriateness” the author proposes the concepts of self-consistency and universal self-consistency of decision rules. Examining the existence of universally self-consistent decision rules in two cases: (1) decision situations with three decision makers and two alternatives, and (2) those with three decision makers and three alternatives, the author has found that all decision rules are universally self-consistent in the case (1), whereas all universally self-consistent decision rules have one and just one vetoer in the essential cases in (2). The result in the case (2) implies incompatibility of universal self-consistency with symmetry. An example of applications of the concept of self-consistency to a bankruptcy problem is also provided in this paper, where compatibility of self-consistency with symmetry in a particular decision situation is shown.     

The aggregation operations for decision making in probabilistic fuzzy environment

This paper deals with some important classes of aggregation operations on various kinds of sets applied to decision making problems.These operations are mainly based on general concepts such as triangular norms (t- and s-norms). In this paper we focus particularly on operations on probabilistic sets and their distribution function representation. The considerations are illustrated by means of numerical examples.     

Interactive fuzzy decision making method for solving bilevel programming problem

In this paper, an interactive fuzzy decision making method is proposed for solving bilevel programming problem. Introducing a new balance function, we consider the overall satisfactory balance between the leader and the follower. Then, a satisfactory solution can be obtained by the proposed method. Finally, numerical examples are reported to illustrate the feasibility of the proposed method.     

Hesitant fuzzy information aggregation in decision making

As a generalization of fuzzy set, hesitant fuzzy set is a very useful tool in situations where there are some difficulties in determining the membership of an element to a set caused by a doubt between a few different values. The aim of this paper is to develop a series of aggregation operators for hesitant fuzzy information. We first discuss the relationship between intutionistic fuzzy set and hesitant fuzzy set, based on which we develop some operations and aggregation operators for hesitant fuzzy elements. The correlations among the aggregation operators are further discussed. Finally, we give their application in solving decision making problems.     

The multi-fuzzy soft set and its application in decision making

Molodtsov’s soft set theory was originally proposed as a general mathematical tool for dealing with uncertainty. By combining the multi-fuzzy set and soft set models, the purpose of this paper is to introduce the concept of multi-fuzzy soft sets. Some operations on a multi-fuzzy soft set are defined, such as complement operation, “AND” and “OR” operations, Union and Intersection operations. Then, the DeMorgan’s laws are proved. Finally, by means of level soft set, an algorithm is presented, and a decision problem is analyzed using multi-fuzzy soft set.     

The analytic hierarchy process in medical and health care decision making: A literature review

This paper presents a literature review of the application of the analytic hierarchy process (AHP) to important problems in medical and health care decision making. The literature is classified by year of publication, health care category, journal, method of analyzing alternatives, participants, and application type. Very few articles were published prior to 1988 and the level of activity has increased to about three articles per year since 1997. The 50 articles reviewed were classified in seven categories: diagnosis, patient participation, therapy/treatment, organ transplantation, project and technology evaluation and selection, human resource planning, and health care evaluation and policy. The largest number of articles was found in the project and technology evaluation and selection category (14) with substantial activity in patient participation (9), therapy/treatment (8), and health care evaluation and policy (8). The AHP appears to be a promising support tool for shared decision making between patient and doctor, evaluation and selection of therapies and treatments, and the evaluation of health care technologies and policies. We expect that AHP research will continue to be an important component of health care and medical research.     

Possibilistic sequential decision making

When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one to consider. The development of possibilistic decision theory has lead to the proposition a series of possibilistic criteria, namely: optimistic and pessimistic possibilistic qualitative criteria [7], possibilistic likely dominance [2], [9], binary possibilistic utility [11] and possibilistic Choquet integrals [24]. This paper focuses on sequential decision making in possibilistic decision trees. It proposes a theoretical study on the complexity of the problem of finding an optimal strategy depending on the monotonicity property of the optimization criteria – when the criterion is transitive, this property indeed allows a polytime solving of the problem by Dynamic Programming. We show that most possibilistic decision criteria, but possibilistic Choquet integrals, satisfy monotonicity and that the corresponding optimization problems can be solved in polynomial time by Dynamic Programming. Concerning the possibilistic likely dominance criteria which is quasi-transitive but not fully transitive, we propose an extended version of Dynamic Programming which remains polynomial in the size of the decision tree. We also show that for the particular case of possibilistic Choquet integrals, the problem of finding an optimal strategy is NP-hard. It can be solved by a Branch and Bound algorithm. Experiments show that even not necessarily optimal, the strategies built by Dynamic Programming are generally very good.     

An adjustable approach to intuitionistic fuzzy soft sets based decision making

Molodtsov initiated the concept of soft set theory, which can be used as a generic mathematical tool for dealing with uncertainty. There has been some progress concerning practical applications of soft set theory, especially the use of soft sets in decision making. In this paper we generalize the adjustable approach to fuzzy soft sets based decision making. Concretely, we present an adjustable approach to intuitionistic fuzzy soft sets based decision making by using level soft sets of intuitionistic fuzzy soft sets and give some illustrative examples. The properties of level soft sets are presented and discussed. Moreover, we also introduce the weighted intuitionistic fuzzy soft sets and investigate its application to decision making.     

Aggregation and decision making using ranked data

Nonparametric procedures are frequently used to rank order alternatives. Often, information from several data sets must be aggregated to derive an overall ranking. When using nonparametric procedures, Simpson-like paradoxes can occur in which the conclusion drawn from the aggregate ranked data set seems contradictory to the conclusions drawn from the individual data sets. Extending previous results found in the literature for the Kruskal–Wallis test, this paper presents a strict condition that ranked data must satisfy in order to avoid this type of inconsistency when using nonparametric pairwise procedures or Bhapkar’s V procedure to extract an overall ranking. Aggregating ranked data poses further difficulties because there exist numerous ways to combine ranked data sets. This paper illustrates these difficulties and derives an upper bound for the number of possible ways that two ranked data sets can be combined.     

Group decision making methods based on intuitionistic fuzzy soft matrices

Soft set theory was originally proposed by Molodtsov as a general mathematical tool for dealing with uncertainty in 1999. Recently, researches of decision making based on soft sets have got some progress, but few people consider multi-experts situation. As such, this paper discusses multi-experts group decision making problems. Firstly, we give a concept of intuitionistic fuzzy soft matrix (IFSM) and prove some relevant properties of IFSM. Then, an adjustable approach is presented by means of median level soft set and p-quantile level soft set for dealing with decision making problems based on IFSM. Thirdly, we study aggregation methods of IFSM, give two kinds of aggregation operators and methods that how to determine experts’ weights under different situation with programming models, four corresponding algorithms have been proposed, too. Finally, a practical example has been demonstrated the reasonability and efficiency of these new algorithms.     

Approximate credal network updating by linear programming with applications to decision making

Credal nets are probabilistic graphical models which extend Bayesian nets to cope with sets of distributions. An algorithm for approximate credal network updating is presented. The problem in its general formulation is a multilinear optimization task, which can be linearized by an appropriate rule for fixing all the local models apart from those of a single variable. This simple idea can be iterated and quickly leads to accurate inferences. A transformation is also derived to reduce decision making in credal networks based on the maximality criterion to updating. The decision task is proved to have the same complexity of standard inference, being NP^PP-complete for general credal nets and NP-complete for polytrees. Similar results are derived for the E-admissibility criterion. Numerical experiments confirm a good performance of the method.     

Structures in decision making: On the subjective geometry of hierarchies and networks

In the field of decision making, creating a structure is the first step in organizing, representing and solving a problem. A structure is a model, an abstraction of a problem. It helps us visualize and understand the relevant elements within it that we know from the real world and then use our understanding to solve the problem represented in the structure with greater confidence. In general, there are two kinds of structures used to represent problems: hierarchies and networks. Both rely to a varying degree on the interactions. Some examples are given followed by a discussion about how to structure the problem. At a minimum, a structure must satisfy two requirements: that it be logical in identifying and grouping similar things together, and that it relates them accurately according to the flow of influence among them. It must be complete with nothing left out that has an important influence. The structure is then tested as to whether it helps solve the problem to one’s satisfaction.     

A technological,organisational, and environmental analysis of decision making methodologies and satisfaction in the context of IT induced business transformations

Although Operational Research (OR) has successfully provided many methodologies to address complex decision problems, in particular based on the rationality principle, there has been too little discussion regarding their limited consideration in IT evaluation practice and associated decision making satisfaction levels in an organisational context. The aim of this paper is to address these issues through providing a current account of diffusion and infusion of OR methodologies in IT decision making practice, and by analysing factors affecting decision making satisfaction from a Technological, Organisational, and Environmental (TOE) framework in the context of IT induced business transformations. We developed a structural equation model and conducted an empirical survey, which supported four out of five developed research hypotheses. Our results show that while Decision Support Systems (DSSs), holistic IT evaluation methods, and management support seem to positively affect individual satisfaction, legislative regulation has an adverse effect. Results also revealed a persistent methodology diffusion and infusion gap. The paper discusses implications in each of these aspects and presents opportunities for future work.     

Aggregation of fuzzy preference relations to multicriteria decision making

Weighted aggregation of fuzzy preference relations on the set of alternatives by several criteria in decision-making problems is considered. Pairwise comparisons with respect to importance of the criteria are given in fuzzy preference relation as well. The aggregation procedure uses the composition between each two relations of the alternatives. The membership function of the newly constructed fuzzy preference relation includes t-norms and t-conorms to take into account the relation between the criteria importance. Properties of the composition and new relation, giving a possibility to make a consistent choice or to rank the alternatives, are proved. An illustrative numerical study and comparative examples are presented.     

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem

This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible. Given an undirected labelled connected graph, the minimum labelling spanning tree problem seeks a spanning tree whose edges have the smallest number of distinct labels. This problem has been shown to be NP-hard. A Greedy Randomized Adaptive Search Procedure (GRASP) and a Variable Neighbourhood Search (VNS) are proposed in this paper. They are compared with other algorithms recommended in the literature: the Modified Genetic Algorithm and the Pilot Method. Nonparametric statistical tests show that the heuristics based on GRASP and VNS outperform the other algorithms tested. Furthermore, a comparison with the results provided by an exact approach shows that we may quickly obtain optimal or near-optimal solutions with the proposed heuristics.     

An adjustable approach to fuzzy soft set based decision making

Molodtsov’s soft set theory was originally proposed as a general mathematical tool for dealing with uncertainty. Recently, decision making based on (fuzzy) soft sets has found paramount importance. This paper aims to give deeper insights into decision making based on fuzzy soft sets. We discuss the validity of the Roy-Maji method and show its true limitations. We point out that the choice value designed for the crisp case is no longer fit to solve decision making problems involving fuzzy soft sets. By means of level soft sets, we present an adjustable approach to fuzzy soft set based decision making and give some illustrative examples. Moreover, the weighted fuzzy soft set is introduced and its application to decision making is also investigated.