Search results for "Multiobjective optimization problem"
showing 10 items of 20 documents
Decision Making on Pareto Front Approximations with Inherent Nondominance
2011
t Approximating the Pareto fronts of nonlinear multiobjective optimization problems is considered and a property called inherent nondominance is proposed for such approximations. It is shown that an approximation having the above property can be explored by interactively solving a multiobjective optimization problem related to it. This exploration can be performed with available interactive multiobjective optimization methods. The ideas presented are especially useful in solving computationally expensive multiobjective optimization problems with costly function value evaluations. peerReviewed
Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality
2018
As an emerging research field, multiobjective robust optimization employs minmax robustness as the most commonly used concept. Light robustness is a concept in which a parameter, tolerable degradations, can be used to control the loss in the objective function values in the most typical scenario for gaining in robustness. In this paper, we develop a lightly robust interactive multiobjective optimization method, LiRoMo, to support a decision maker to find a most preferred lightly robust efficient solution with a good balance between robustness and the objective function values in the most typical scenario. In LiRoMo, we formulate a lightly robust subproblem utilizing an achievement scalarizi…
Genetic Algorithms: A Decision Tool in Industrial Disassembly
2008
In the recycling process of the Waste Electrical and Electronic Equipment (WEEE) the disassembly process has a central role. Disassembly is not the reverse of the assembly process, real difficulties occur in the tasks assignment process of the disassembly operations. Since this is a multi objective optimization problem, we prove that genetic algorithms provide a useful multi-criteria decision tool in the industrial disassembly process.
On Generalizing Lipschitz Global Methods forMultiobjective Optimization
2015
Lipschitz global methods for single-objective optimization can represent the optimal solutions with desired accuracy. In this paper, we highlight some directions on how the Lipschitz global methods can be extended as faithfully as possible to multiobjective optimization problems. In particular, we present a multiobjective version of the Pijavskiǐ-Schubert algorithm.
NIMBUS — Interactive Method for Nondifferentiable Multiobjective Optimization Problems
1996
An interactive method, NIMBUS, for nondifferentiable multiobjective optimization problems is introduced. We assume that every objective function is to be minimized The idea of NIMBUS is that the decision maker can easily indicate what kind of improvements are desired and what kind of impairments are tolerable at the point considered.
Interactive Nonlinear Multiobjective Optimization Methods
2016
An overview of interactive methods for solving nonlinear multiobjective optimization problems is given. In interactive methods, the decision maker progressively provides preference information so that the most satisfactory Pareto optimal solution can be found for her or his. The basic features of several methods are introduced and some theoretical results are provided. In addition, references to modifications and applications as well as to other methods are indicated. As the role of the decision maker is very important in interactive methods, methods presented are classified according to the type of preference information that the decision maker is assumed to provide. peerReviewed
PAINT : Pareto front interpolation for nonlinear multiobjective optimization
2011
A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g., for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive meth…
A Posteriori Methods
1998
A posteriori methods could also be called methods for generating Pareto optimal solutions. After the Pareto optimal set (or a part of it) has been generated, it is presented to the decision maker, who selects the most preferred among the alternatives. The inconveniences here are that the generation process is usually computationally expensive and sometimes in part, at least, difficult. On the other hand, it is hard for the decision maker to select from a large set of alternatives. One more important question is how to present or display the alternatives to the decision maker in an effective way. The working order in these methods is: 1) analyst, 2) decision maker.
Implementation aspects of interactive multiobjective optimization for modeling environments: The case of GAMS-NIMBUS
2014
Abstract. Interactive multiobjective optimization methods have provided promising results in the literature but still their implementations are rare. Here we introduce a core structure of interactive methods to enable their convenient implementation. We also demonstrate how this core structure can be applied when implementing an interactive method using a modeling environment. Many modeling environments contain tools for single objective optimization but not for interactive multiobjective optimization. Furthermore, as a concrete example, we present GAMS-NIMBUS Tool which is an implementation of the classification-based NIMBUS method for the GAMS modeling environment. So far, interactive met…
Agent assisted interactive algorithm for computationally demanding multiobjective optimization problems
2015
Abstract We generalize the applicability of interactive methods for solving computationally demanding, that is, time-consuming, multiobjective optimization problems. For this purpose we propose a new agent assisted interactive algorithm. It employs a computationally inexpensive surrogate problem and four different agents that intelligently update the surrogate based on the preferences specified by a decision maker. In this way, we decrease the waiting times imposed on the decision maker during the interactive solution process and at the same time decrease the amount of preference information expected from the decision maker. The agent assisted algorithm is not specific to any interactive me…