MCS—A new algorithm for multicriteria optimisation in constraint programming

In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch & Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search.     

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.     

Cone contraction and reference point methods for multi-criteria mixed integer optimization

Interactive approaches employing cone contraction for multi-criteria mixed integer optimization are introduced. In each iteration, the decision maker (DM) is asked to give a reference point (new aspiration levels). The subsequent Pareto optimal point is the reference point projected on the set of admissible objective vectors using a suitable scalarizing function. Thereby, the procedures solve a sequence of optimization problems with integer variables. In such a process, the DM provides additional preference information via pair-wise comparisons of Pareto optimal points identified. Using such preference information and assuming a quasiconcave and non-decreasing value function of the DM we restrict the set of admissible objective vectors by excluding subsets, which cannot improve over the solutions already found. The procedures terminate if all Pareto optimal solutions have been either generated or excluded. In this case, the best Pareto point found is an optimal solution. Such convergence is expected in the special case of pure integer optimization; indeed, numerical simulation tests with multi-criteria facility location models and knapsack problems indicate reasonably fast convergence, in particular, under a linear value function. We also propose a procedure to test whether or not a solution is a supported Pareto point (optimal under some linear value function).     

Extension of VIKOR method for multi-criteria group decision making problem with linguistic information

A new method is proposed to solve multi-criteria group decision making problems in which both the criteria values and criteria weights take the form of linguistic information based on the traditional idea of VIKOR method. Firstly, the linguistic criteria weights given by all decision makers are transformed into trapezoidal fuzzy numbers, and then aggregated and defuzzified to crisp values. Secondly, the individual linguistic decision matrix given by each decision maker (DM) is transformed into 2-tuple linguistic decision matrix, and then aggregated into collective 2-tuple linguistic decision matrix by 2-tuple linguistic arithmetic mean operation. Thirdly, the 2-tuple linguistic values (_Si,_αi),$(S_i\text{,}{\alpha }_i)\text{,}$(_Ri,_αi)$(R_i\text{,}{\alpha }_i)$ and (_Qi,_αi)$(Q_i\text{,}{\alpha }_i)$ are calculated by defining the 2-tuple linguistic positive ideal solution (TL-PIS) and 2-tuple linguistic negative ideal solution (TL-NIS). Furthermore, the compromise solution can be obtained. Finally, a numerical example is used to illustrate the application of the proposed approach, and the method is verified by comparing the evaluation result with that of 2-tuple linguistic TOPSIS (TL-TOPSIS) method.     

On the maximum number of feasible ranking sequences in multi-criteria decision making problems

In many decision problems the focus is on ranking a set of m alternatives in terms of a number, say n, of decision criteria. Given are the performance values of the alternatives for each one of the criteria and the weights of importance of the criteria. This paper demonstrates that if one assumes that the criteria weights are changeable, then the number of all possible rankings may be significantly less than the upper limit of m!. As a matter of fact, this paper demonstrates that the number of possible rankings is a function of the number of alternatives and the number of criteria. These findings are important from a sensitivity analysis point of view or when a group decision making environment is considered.     

Extension of VIKOR method for decision making problem with interval numbers

The VIKOR method was developed for multi-criteria optimization of complex systems. It determines the compromise ranking list and the compromise solution obtained with the initial (given) weights. This method focuses on ranking and selecting from a set of alternatives in the presence of conflicting criteria. It introduces the multi-criteria ranking index based on the particular measure of “closeness” to the “ideal” solution. The aim of this paper is to extend the VIKOR method for decision making problems with interval number. The extended VIKOR method’s ranking is obtained through comparison of interval numbers and for doing the comparisons between intervals, we introduce α as optimism level of decision maker. Finally, a numerical example illustrates and clarifies the main results developed in this paper.     

Multi-criteria decision making approaches for supplier evaluation and selection: A literature review

Supplier evaluation and selection problem has been studied extensively. Various decision making approaches have been proposed to tackle the problem. In contemporary supply chain management, the performance of potential suppliers is evaluated against multiple criteria rather than considering a single factor-cost. This paper reviews the literature of the multi-criteria decision making approaches for supplier evaluation and selection. Related articles appearing in the international journals from 2000 to 2008 are gathered and analyzed so that the following three questions can be answered: (i) Which approaches were prevalently applied? (ii) Which evaluating criteria were paid more attention to? (iii) Is there any inadequacy of the approaches? Based on the inadequacy, if any, some improvements and possible future work are recommended. This research not only provides evidence that the multi-criteria decision making approaches are better than the traditional cost-based approach, but also aids the researchers and decision makers in applying the approaches effectively.     

Integrating operations research in constraint programming

This paper presents constraint programming (CP) as a natural formalism for modelling problems, and as a flexible platform for solving them. CP has a range of techniques for handling constraints including several forms of propagation and tailored algorithms for global constraints. It also allows linear programming to be combined with propagation and novel and varied search techniques which can be easily expressed in CP. The paper describes how CP can be used to exploit linear programming within different kinds of hybrid algorithm. In particular it can enhance techniques such as Lagrangian relaxation, Benders decomposition and column generation.     

A general decomposition approach for multi-criteria decision trees

In this paper, we address the dynamic and multi-criteria decision-making problems under uncertainty, generally represented by multi-criteria decision trees. Decision-making consists of choosing, at each period, a decision that maximizes the decision-maker outcomes. These outcomes should often be measured against a set of heterogeneous and conflicting criteria. Generating the set of non-dominated solutions is a common approach considered in the literature to solve the multi-criteria decision trees, but it becomes very challenging for large problems. We propose a new approach to solve multi-criteria decision trees without generating the set of all non-dominated solutions, which should reduce the computation time and the cardinality of the solution set. In particular, the proposed approach combines the advantages of decomposition with the application of multi-criteria decision aid (MCDA) methods at each decision node. A generalization of the Bellman’s principle of decomposition to the multi-criteria context is put forward. A decomposition theorem is therefore proposed. Under the sufficient conditions stated by the theorem, the principle of decomposition will generate the set of best compromise strategies. Seven MCDA methods are then characterized (lexicographic, weighted sum, multi-attribute value theory, TOPSIS, ELECTRE III, and PROMETHEE II) against the conditions of the theorem of decomposition and against other properties (neutrality, anonymous, fidelity, dominance, independency), in order to confirm or infirm their applicability with the proposed decomposition principle. Moreover, the relationship between independency and temporal consistence is discussed as well as the effects of incomparableness, rank reversals, and use of thresholds. Two conjectures resulted from this characterization.     

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.     

Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming

In this paper, we investigate relations between constraint qualifications in quasiconvex programming. At first, we show a necessary and sufficient condition for the closed cone constraint qualification for quasiconvex programming (Q-CCCQ), and investigate some sufficient conditions for the Q-CCCQ. Also, we consider a relation between the Q-CCCQ and the basic constraint qualification for quasiconvex programming (Q-BCQ) and we compare the Q-BCQ with some constraint qualifications.     

A constraint programming approach for a batch processing problem with non-identical job sizes

This paper presents a constraint programming approach for a batch processing machine on which a finite number of jobs of non-identical sizes must be scheduled. A parallel batch processing machine can process several jobs simultaneously and the objective is to minimize the maximal lateness. The constraint programming formulation proposed relies on the decomposition of the problem into finding an assignment of the jobs to the batches, and then minimizing the lateness of the batches on a single machine. This formulation is enhanced by a new optimization constraint which is based on a relaxed problem and applies cost-based domain filtering techniques. Experimental results demonstrate the efficiency of cost-based domain filtering techniques. Comparisons to other exact approaches clearly show the benefits of the proposed approach: it can optimally solve problems that are one order of magnitude greater than those solved by a mathematical formulation or by a branch-and-price.     

Decision making in multiobjective optimization aided by the multicriteria tournament decision method

This paper proposes a new method for multicriteria analysis, named Multicriteria Tournament Decision (MTD). It provides the ranking of alternatives from best to worst, according to the preferences of a human decision-maker (DM). It has some positive aspects such as: it has a simple algorithm with intuitive appeal; it involves few input parameters (just the importance weight of each criterion).The helpfulness of MTD is demonstrated by using it to select the final solution of multiobjective optimization problems in an a posteriori decision making approach. Having at hand a discrete approximation of the Pareto front (provided by a multiobjective evolutionary search algorithm), the choice of the preferred Pareto-optimal solution is performed using MTD.A simple method, named Gain Analysis method (GAM), for verifying the existence of a better solution (a solution associated to higher marginal rates of return) than the one originally chosen by the DM, is also introduced here. The usefulness of MTD and GAM methods is confirmed by the suitable results shown in this paper.     

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.     

On the structure and properties of a linear multilevel programming problem

Many decision-making situations involve multiple planners with different, and sometimes conflicting, objective functions. One type of model that has been suggested to represent such situations is the linear multilevel programming problem. However, it appears that theoretical and algorithmic results for linear multilevel programming have been limited, to date, to the bounded case or the case of when only two levels exist. In this paper, we investigate the structure and properties of a linear multilevel programming problem that may be unbounded. We study the geometry of the problem and its feasible region. We also give necessary and sufficient conditions for the problem to be unbounded, and we show how the problem is related to a certain parametric concave minimization problem. The algorithmic implications of the results are also discussed.This research was supported by National Science Foundation Grant No. ECS-85-15231.     

Multiple criteria decision making combined with finance: A categorized bibliographic study

This paper provides a categorized bibliography on the application of the techniques of multiple criteria decision making (MCDM) to problems and issues in finance. A total of 265 references have been compiled and classified according to the methodological approaches of goal programming, multiple objective programming, the analytic hierarchy process, etc., and to the application areas of capital budgeting, working capital management, portfolio analysis, etc. The bibliography provides an overview of the literature on “MCDM combined with finance,” shows how contributions to the area have come from all over the world, facilitates access to the entirety of this heretofore fragmented literature, and underscores the often multiple criterion nature of many problems in finance.     

A multi-criteria decision making model for advanced repair-to-order and disassembly-to-order system

Sensor-embedded products (SEPs) eliminate a majority of uncertainties involved in product recovery by providing item-based life-cycle information. This information includes the content of each product and component conditions, and enables the estimation of remaining useful life of the components. Once the data on the products are captured, it is possible to make optimal recovery decisions without any preliminary disassembly or inspection operations.     

Branch-and-price and constraint programming for solving a real-life technician dispatching problem

We consider a real problem faced by a large company providing repair services of office machines in Santiago, Chile. In a typical day about twenty technicians visit seventy customers in a predefined service area in Santiago. We design optimal routes for technicians by considering travel times, soft time windows for technician arrival times at client locations, and fixed repair times. A branch-and-price algorithm was developed, using a constraint branching strategy proposed by Ryan and Foster along with constraint programming in the column generation phase. The column generation takes advantage of the fact that each technician can satisfy no more than five to six service requests per day. Different instances of the problem were solved to optimality in a reasonable computational time, and the results obtained compare favorably with the current practice.     

Transparent prioritisation,budgeting and resource allocation with multi-criteria decision analysis and decision conferencing

Managers in both for-profit and not-for-profit organisations continually face the task of allocating resources by balancing costs, benefits and risks and gaining commitment by a wide constituency of stakeholders to those decisions. This task is complex and difficult because many options are present, benefits and risks are rarely expressed as single objectives, multiple stakeholders with different agendas compete for limited resources, individually optimal resource allocations to organisational units are rarely collectively optimal, and those dissatisfied with the decisions taken may resist implementation. We first explain three current approaches to resource allocation taken from corporate finance, operational research and decision analysis, and we identify a common mistake organisations make in allocating resources. The paper then presents a technical process, multi-criteria portfolio analysis, for balancing the conflicting elements of the problem, and a social process, decision conferencing, which engages all the key players during the modelling process, ensuring their ownership of the model and the subsequent implementation. This socio-technical process improves communication within the organisation, develops shared understanding of the portfolio and generates a sense of common purpose about those projects that will best realise the organisation’s objectives. The paper concludes with lessons we have learned from actual practice. The authors want to thank Allergan and FCT (Portuguese Science Foundation) for their support.