A naïve approach for solving MCDM problems: the GUESS method

We present a simple multiple criteria decision making solution technique called the GUESS method. This method has been used in MCDM experiments where different solution methods have been compared. The GUESS method is an interactive solution method designed to be used with continuous multiple criteria decision problems. It is based on a class of solution methods called reference point methods whereby the decision maker generates a sequence of solutions based on a sequence of guesses or aspiration vectors. In this paper we explain the basic concepts of the GUESS method and describe the algorithm of the solution method. An illustrative example is provided, along with a discussion of the method from a behavioural decision making perspective.     

Nonessential objectives within network approaches for MCDM

In Gal and Hanne [Eur. J. Oper. Res. 119 (1999) 373] the problem of using several methods to solve a multiple criteria decision making (MCDM) problem with linear objective functions after dropping nonessential objectives is analyzed. It turned out that the solution does not need be the same when using various methods for solving the system containing the nonessential objectives or not. In this paper we consider the application of network approaches for multicriteria decision making such as neural networks and an approach for combining MCDM methods (called MCDM networks). We discuss questions of comparing the results obtained with several methods as applied to the problem with or without nonessential objectives. Especially, we argue for considering redundancies such as nonessential objectives as a native feature in complex information processing. In contrast to previous results on nonessential objectives, the current paper focuses on discrete MCDM problems which are also denoted as multiple attribute decision making (MADM).     

The aspiration level interactive method (AIM) reconsidered: Robustness of solutions

In this paper we explore theory and practice for the aspiration-level interactive model (AIM), a useful decision tool that takes advantage of the concepts of satisficing as well as other concepts of multiple criteria decision making (MCDM). We examine the relationship between aspiration levels and their mapped-to solutions in the MCDM context using AIM.We extend the concept of robustness in decision making, by defining a solution to be robust if many (suitably defined) aspiration levels map to it. We use simulation to help explore robustness, by generating three groups of random test problems. Each problem has twenty alternatives. For each group of problems, the top 5 (most-mapped-to) alternatives out of 20 are mapped to by at least 50% of the aspiration levels. We also relate the concept of robustness in decision making to the ideas of simply ranking alternatives using equal weights. There is a strong correlation between the robustness ranking and the equal-weights ranking. Based on our analyses, we then randomly generate additional problems to explore certain other factors. We also discuss practical aspects of robustness.     

Interactive outranking approaches for multicriteria decision-making problems with imprecise information

PROMETHEE is a powerful method, which can solve many multiple criteria decision making (MCDM) problems. It involves sophisticated preference modelling techniques but requires too much a priori precise information about parameter values (such as criterion weights and thresholds). In this paper, we consider a MCDM problem where alternatives are evaluated on several conflicting criteria, and the criterion weights and/or thresholds are imprecise or unknown to the decision maker (DM). We build robust outranking relations among the alternatives in order to help the DM to rank the alternatives and select the best alternative. We propose interactive approaches based on PROMETHEE method. We develop a decision aid tool called INTOUR, which implements the developed approaches.     

Graph-based multi-agent decision making

In lots of practical multi-criteria decision making (MCDM) problems, there exist various and changeable relations among the criteria which cannot be handled well by means of the existing methods. Considering that graphic or netlike structures can be used to describe the relationships among several individuals, we first introduce the graphic structure into MCDM and formalize the relations among criteria. Then, we develop a new tool, called graph-based multi-agent decision making (GMADM) model, to deal with a kind of MCDM problems with the interrelated criteria. In the model, the graphic structure is paid sufficient attention to in two main aspects: (1) how the graphic structure has influence on the benefits of agents (or the criteria values); and (2) the relation between the graphic structure and the importance weights of agents (criteria). In this case, we can select the best plan(s) (or alternative(s)) according to the overall benefits (the overall criteria values) resulting from the model. Moreover, a fuzzy graph-based multi-agent decision making (FGMADM) method is developed to solve a common kind of situations where the graphic structure of agents is uncertain (confidential or false). Three examples are used to illustrate the feasibility of these two developed methods.     

Extended VIKOR method in comparison with outranking methods

The VIKOR method was developed to solve MCDM problems with conflicting and noncommensurable (different units) criteria, assuming that compromising is acceptable for conflict resolution, the decision maker wants a solution that is the closest to the ideal, and the alternatives are evaluated according to all established criteria. This method focuses on ranking and selecting from a set of alternatives in the presence of conflicting criteria, and on proposing compromise solution (one or more). The VIKOR method is extended with a stability analysis determining the weight stability intervals and with trade-offs analysis. The extended VIKOR method is compared with three multicriteria decision making methods: TOPSIS, PROMETHEE, and ELECTRE. A numerical example illustrates an application of the VIKOR method, and the results by all four considered methods are compared.     

Extension of VIKOR method for decision making problem based on hesitant fuzzy set

The multiple criteria decision making (MCDM) methods VIKOR and TOPSIS are all based on an aggregating function representing “closeness to the ideal”, which originated in the compromise programming method. The VIKOR method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum of an “individual regret” for the “opponent”, which is an effective tool in multi-criteria decision making, particularly in a situation where the decision maker is not able, or does not know to express his/her preference at the beginning of system design. The TOPSIS method determines a solution with the shortest distance to the ideal solution and the greatest distance from the negative-ideal solution, but it does not consider the relative importance of these distances. And, the hesitant fuzzy set is a very useful tool to deal with uncertainty, which can be accurately and perfectly described in terms of the opinions of decision makers. In this paper, we develop the E-VIKOR method and TOPSIS method to solve the MCDM problems with hesitant fuzzy set information. Firstly, the hesitant fuzzy set information and corresponding concepts are described, and the basic essential of the VIKOR method is introduced. Then, the problem on multiple attribute decision marking is described, and the principles and steps of the proposed E-VIKOR method and TOPSIS method are presented. Finally, a numerical example illustrates an application of the E-VIKOR method, and the result by the TOPSIS method is compared.     

Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization

In this paper, we present a new general formulation for multiobjective optimization that can accommodate several interactive methods of different types (regarding various types of preference information required from the decision maker). This formulation provides a comfortable implementation framework for a general interactive system and allows the decision maker to conveniently apply several interactive methods in one solution process. In other words, the decision maker can at each iteration of the solution process choose how to give preference information to direct the interactive solution process, and the formulation enables changing the type of preferences, that is, the method used, whenever desired. The first general formulation, GLIDE, included eight interactive methods utilizing four types of preferences. Here we present an improved version where we pay special attention to the computational efficiency (especially significant for large and complex problems), by eliminating some constraints and parameters of the original formulation. To be more specific, we propose two new formulations, depending on whether the multiobjective optimization problem to be considered is differentiable or not. Some computational tests are reported showing improvements in all cases. The generality of the new improved formulations is supported by the fact that they can accommodate six interactive methods more, that is, a total of fourteen interactive methods, just by adjusting parameter values.     

Portfolio selection in the Spanish stock market by interactive multiobjective programming

This study examines new versions of two interactive methods to address multiobjective problems, the aim of which is to enable the decision maker to reach a solution within the range of those considered efficient in a portfolio selection model, in which several objectives are pursued concerning risk and return and given that these are clearly conflicting objectives, the profile of the model proposed is multicriteria. Normally the range of efficient portfolios is fairly extensive thus making the selection of a single one an onerous task. In order to facilitate this process, interactive methods are used aimed at guiding the decision maker towards the optimal solution based on his preferences. Several adaptations were carried out on the original methods in order to facilitate the interactive process, improving the quality of the obtained portfolios, and these were applied to data obtained from the Madrid Stock Market, interaction taking place with two decision makers, one of whom was more aggressive than the other in their selections made.     

Interactive multiobjective decision making by the sequential proxy optimization technique: SPOT

In this paper, we propose a new interactive multiobjective decision making technique, which we call the Sequential Proxy Optimization Technique (SPOT), in order to overcome the drawbacks of the conventional multiobjective decision making methods. Our method combines the desirable features of both the Surrogate Worth Trade-off (SWT) method and the Multiattribute Utility Function (MUF) method. We can interactively derive the preferred solution of the decision maker efficiently by assessing his marginal rate of substitution and maximizing sequentially the local proxy preference function. A numerical example illustrates the feasibility and efficiency of the proposed method.     

Research on AHP with interval-valued intuitionistic fuzzy sets and its application in multi-criteria decision making problems

This paper investigates an approach for multi-criterion decision making (MCDM) problems with interval-valued intuitionistic fuzzy preference relations (IVIFPRs). Based on the novel interval score function, some extended concepts associated with IVIFPRs are defined, including the score matrix, the approximate optimal transfer matrix and the possibility degree matrix. By using these new matrixes, a prioritization method for IVIFPRs is proposed. Then, we investigate an interval-valued intuitionistic fuzzy AHP method for multi-criteria decision making (MCDM) problems. In the end, a numerical example is provided to illustrate the application of the proposed approach.     

A review of interactive methods for multiobjective integer and mixed-integer programming

This paper makes a review of interactive methods devoted to multiobjective integer and mixed-integer programming (MOIP/MOMIP) problems. The basic concepts concerning the characterization of the non-dominated solution set are first introduced, followed by a remark about non-interactive methods vs. interactive methods. Then, we focus on interactive MOIP/MOMIP methods, including their characterization according to the type of preference information required from the decision maker, the computing process used to determine non-dominated solutions and the interactive protocol used to communicate with the decision maker. We try to draw out some contrasts and similarities of the different types of methods.     

Searching for psychologically stable solutions of multiple criteria decision problems

In interactive decision making, a choice behavior of the decision maker may differ depending on proximity of a current solution to satisfactory values of objectives. An interactive approach proposed in this paper allows the decision maker to use different search principles depending on his/her perception of the achieved values of objectives and trade-offs. While an analysis of the values of objectives may guide the initial search for a final solution, it can be replaced by trade-off evaluations at some later stages. Such an approach allows the decision maker to change search principles, and to identify a psychologically stable solution to the multiple criteria decision problem.     

An algorithm for systems welfare interactive goal programming modelling

Every human system is faced with the problem of choosing between alternative options, and methods of interactive programming have been suggested as the best way to lead decision makers reach decisions that are consistent with their preferences. However, even though a large number of interactive algorithms have been proposed for multiobjective decision making (MODM), there is yet no truly interactive goal programming (GP) algorithm, despite the preference of GP over other MODM methodologies. The current paper presents an algorithm for interactive GP modelling called SWIGP (systems welfare interactive GP) which ensures that the overall welfare of the system under consideration is adequately taken into account in the interactive process. To achieve this, this paper distinguishes between technical, allocative and economic efficiencies and combines an economic efficiency index with interactive GP process. Besides being of wide applicability, the algorithm exerts little cognitive burden on the decision maker (DM). Indeed, even if the DM is assumed to operate under conditions of complete ignorance, SWIGP provides the direction for searching the “best” compromise solution. Moreover, the algorithm converges very fast because of the economic efficiency index that complements the interactive process in aiding the DM arrive at a most preferred solution.     

Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS

The multiple criteria decision making (MCDM) methods VIKOR and TOPSIS are based on an aggregating function representing “closeness to the ideal”, which originated in the compromise programming method. In VIKOR linear normalization and in TOPSIS vector normalization is used to eliminate the units of criterion functions. The VIKOR method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum of an individual regret for the “opponent”. The TOPSIS method determines a solution with the shortest distance to the ideal solution and the greatest distance from the negative-ideal solution, but it does not consider the relative importance of these distances. A comparative analysis of these two methods is illustrated with a numerical example, showing their similarity and some differences.     

Developing a Visual Interactive Model for Corporate Cash Management

The operational research/management science journals contain an extensive literature that addresses the corporate cash management problem; yet few, if any, companies make use of any of this published work in their daily cash-management decision making. A review of the literature suggests that the reason for this lack of applications may well be poor problem formulation—the problems that are solved in the literature as ‘cash management’ problems evolve from a ‘hard systems’ view of real-world cash management. However, the problem as perceived by cash managers involves both dynamic and loosely structured components which are difficult to model using classical (i.e. ‘hard systems’) approaches.We therefore decided to approach the cash management problem as an experiment in the use of a novel visual interactive problem solving (VIPS) methodology. The aim of the experiment was to develop an implementable, visual interactive model to support daily cash management decision making. Working closely with a corporate cash manager, we first developed a visual model of his daily decision problem and then agreed on the feasible options and the interactive requirements. At this stage, the problem was sufficiently well defined for a mathematical model to be built and the visual model made ‘smart’.This paper discusses the results of this experiment and suggests that VIPS may have distinct advantages as a problem-solving technique in loosely structured, ‘messy’ problem situations.     

A new decision support model in multi-criteria decision making with intuitionistic fuzzy sets based on risk preferences and criteria reduction

In this paper, we propose a new model for decision support to address the ‘large decision table’ (eg, many criteria) challenge in intuitionistic fuzzy sets (IFSs) multi-criteria decision-making (MCDM) problems. This new model involves risk preferences of decision makers (DMs) based on the prospect theory and criteria reduction. First, we build three relationship models based on different types of DMs’ risk preferences. By building different discernibility matrices according to relationship models, we find useful criteria for IFS MCDM problems. Second, we propose a technique to obtain weights through discernibility matrix. Third, we also propose a new method to rank and select the most desirable choice(s) according to weighted combinatorial advantage values of alternatives. Finally, we use a realistic voting example to demonstrate the practicality and effectiveness of the proposed method and construct a new decision support model for IFS MCDM problems.     

Selection of technology acquisition mode using the analytic network process

Selecting the appropriate acquisition mode for a required technology, is one of the critical strategic decisions in formulating a technology strategy. Although a number of factors were found to be influential in the choice of technology acquisition mode, it still remains a void in the literature how to make a strategic decision, based on a huge set of those factors with the help of a systematic approach. This study deals with the selection of technology acquisition mode as a multiple criteria decision making (MCDM) problem. The proposed solution to the problem in this study, is the analytic network process (ANP) approach. Since the ANP is a MCDM method that can accommodate interdependency among decision attributes, it is capable of providing priorities of alternatives with consideration of interrelationships among strategic factors. The 21 influential factors identified from the empirical studies are included as sub-criteria in the ANP model, and they are grouped into five criteria: capability, strategy, technology, market, and environment. The final decision can be made based on the resulting priorities of the alternative acquisition modes. The proposed approach is expected to effectively aid decision making on which mode is adopted for acquisition of required technologies. A case of a software company is presented for the illustration of the proposed approach.     

A fuzzy-stochastic OWA model for robust multi-criteria decision making

All realistic Multi-Criteria Decision Making (MCDM) problems face various kinds of uncertainty. Since the evaluations of alternatives with respect to the criteria are uncertain they will be assumed to have stochastic nature. To obtain the uncertain optimism degree of the decision maker fuzzy linguistic quantifiers will be used. Then a new approach for fuzzy-stochastic modeling of MCDM problems will be introduced by merging the stochastic and fuzzy approaches into the OWA operator. The results of the new approach, entitled FSOWA, give the expected value and the variance of the combined goodness measure for each alternative. Robust decision depends on the combined goodness measures of alternatives and also on the variations of these measures under uncertainty. In order to combine these two characteristics a composite goodness measure will be defined. The theoretical results will be illustrated in a watershed management problem. By using this measure will give more sensitive decisions to the stakeholders whose optimism degrees are different than that of the decision maker. FSOWA can be used for robust decision making on the competitive alternatives under uncertainty.     

Modeling subjective evaluation for fuzzy group multicriteria decision making

This paper presents a new fuzzy multicriteria decision making (MCDM) approach for evaluating decision alternatives involving subjective judgements made by a group of decision makers. A pairwise comparison process is used to help individual decision makers make comparative judgements, and a linguistic rating method is used for making absolute judgements. A hierarchical weighting method is developed to assess the weights of a large number of evaluation criteria by pairwise comparisons. To reflect the inherent imprecision of subjective judgements, individual assessments are aggregated as a group assessment using triangular fuzzy numbers. To obtain a cardinal preference value for each decision alternative, a new fuzzy MCDM algorithm is developed by extending the concept of the degree of optimality to incorporate criteria weights in the distance measurement. An empirical study of aircraft selection is presented to illustrate the effectiveness of the approach.