Interactive Simulated Annealing for Solving Imprecise Discrete Multiattribute Problems under Risk
نویسندگان
چکیده
We consider the multiattribute decision-making problem under risk with partial information of the decision-makers’ preferences modelled through an imprecise vectorial utility function and where the consequences are assumed under uncertainty. In this framework under imprecision, we introduce the appropriate utility efficient set that plays a fundamental role because it is where the decision-maker must look for a solution. However, this set can be difficult to determine. So, we provide a decision support system with a solution strategy based on interactive simulated annealing for generating a subset of efficient solutions that gives a fair representation of the whole set, to progressively derive one or several satisfying solutions to aid the decision-maker in his/her final choice.
منابع مشابه
Solving Fuzzy Optimization Problems: Flexible Approaches using Simulated Annealing
This paper discusses flexible approaches for fuzzy optimization problems. Specifically, it presents a new solving method for fuzzy optimization problems (FOP) when the variables coefficients and/or the constraints limits parameters are imprecise. The new method uses the simulated annealing algorithm as a resolution procedure because it is a well-suited algorithm for solving all forms of fuzzine...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملSolving dominance and potential optimality in imprecise multi-attribute additive problems
We consider the multicriteria decision-making problem where there is partial information on decision maker preferences, represented by means of an imprecise multiattribute additive utility function, and where the consequences of the alternatives or strategies are also possibly imprecise. Under these circumstances we consider how useful problem-solving concepts, namely nondominated, potentially ...
متن کامل