Search results for "Pareto-tehokkuus"
showing 10 items of 23 documents
A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms
2017
Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, also referred to as surrogates or metamodels are commonly used in the literature to reduce the computation time. This paper presents a survey of 45 different recent algorithms proposed in the literature between 2008 and 2016 to handle computationally expensive multiobjective optimization problems. Several algorithms are discussed based on what kind of an approximation such as problem, function or fitness approximation they use. Most emphasis is given to function approxim…
DESDEO: The Modular and Open Source Framework for Interactive Multiobjective Optimization
2021
Interactive multiobjective optimization methods incorporate preferences from a human decision maker in the optimization process iteratively. This allows the decision maker to focus on a subset of solutions, learn about the underlying trade-offs among the conflicting objective functions in the problem and adjust preferences during the solution process. Incorporating preference information allows computing only solutions that are interesting to the decision maker, decreasing computation time significantly. Thus, interactive methods have many strengths making them viable for various applications. However, there is a lack of existing software frameworks to apply and experiment with interactive …
Interactive Multiobjective Robust Optimization with NIMBUS
2018
In this paper, we introduce the MuRO-NIMBUS method for solving multiobjective optimization problems with uncertain parameters. The concept of set-based minmax robust Pareto optimality is utilized to tackle the uncertainty in the problems. We separate the solution process into two stages: the pre-decision making stage and the decision making stage. We consider the decision maker’s preferences in the nominal case, i.e., with the most typical or undisturbed values of the uncertain parameters. At the same time, the decision maker is informed about the objective function values in the worst case to support her/him to make an informed decision. To help the decision maker to understand the behavio…
A Simple Indicator Based Evolutionary Algorithm for Set-Based Minmax Robustness
2018
For multiobjective optimization problems with uncertain parameters in the objective functions, different variants of minmax robustness concepts have been defined in the literature. The idea of minmax robustness is to optimize in the worst case such that the solutions have the best objective function values even when the worst case happens. However, the computation of the minmax robust Pareto optimal solutions remains challenging. This paper proposes a simple indicator based evolutionary algorithm for robustness (SIBEA-R) to address this challenge by computing a set of non-dominated set-based minmax robust solutions. In SIBEA-R, we consider the set of objective function values in the worst c…
Multi-scenario multi-objective robust optimization under deep uncertainty: A posteriori approach
2021
This paper proposes a novel optimization approach for multi-scenario multi-objective robust decision making, as well as an alternative way for scenario discovery and identifying vulnerable scenarios even before any solution generation. To demonstrate and test the novel approach, we use the classic shallow lake problem. We compare the results obtained with the novel approach to those obtained with previously used approaches. We show that the novel approach guarantees the feasibility and robust efficiency of the produced solutions under all selected scenarios, while decreasing computation cost, addresses the scenario-dependency issues, and enables the decision-makers to explore the trade-off …
Interactive Nonconvex Pareto Navigator for Multiobjective Optimization
2019
Abstract We introduce a new interactive multiobjective optimization method operating in the objective space called Nonconvex Pareto Navigator . It extends the Pareto Navigator method for nonconvex problems. An approximation of the Pareto optimal front in the objective space is first generated with the PAINT method using a relatively small set of Pareto optimal outcomes that is assumed to be given or computed prior to the interaction with the decision maker. The decision maker can then navigate on the approximation and direct the search for interesting regions in the objective space. In this way, the decision maker can conveniently learn about the interdependencies between the conflicting ob…
Design of a Permanent Magnet Synchronous Generator using Interactive Multiobjective Optimization
2017
We consider an analytical model of a permanent magnet synchronous generator and formulate a mixed-integer constrained multiobjective optimization problem with six objective functions. We demonstrate the usefulness of solving such a problem by applying an interactive multiobjective optimization method called NIMBUS. In the NIMBUS method, a decision is iteratively involved in the optimization process and directs the solution process in order to find her/his most preferred Pareto optimal solution for the problem. We also employ a commonly used noninteractive evolutionary multiobjective optimization method NSGA-II to generate a set of solutions that approximates the Pareto set and demonstrate t…
ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization
2018
Real-world optimization problems may involve a number of computationally expensive functions with a large number of input variables. Metamodel-based optimization methods can reduce the computational costs of evaluating expensive functions, but this does not reduce the dimension of the search domain nor mitigate the curse of dimensionality effects. The dimension of the search domain can be reduced by functional anova decomposition involving Sobol' sensitivity indices. This approach allows one to rank decision variables according to their impact on the objective function values. On the basis of the sparsity of effects principle, typically only a small number of decision variables significantl…
Treed Gaussian Process Regression for Solving Offline Data-Driven Continuous Multiobjective Optimization Problems
2023
Abstract For offline data-driven multiobjective optimization problems (MOPs), no new data is available during the optimization process. Approximation models (or surrogates) are first built using the provided offline data and an optimizer, e.g. a multiobjective evolutionary algorithm, can then be utilized to find Pareto optimal solutions to the problem with surrogates as objective functions. In contrast to online data-driven MOPs, these surrogates cannot be updated with new data and, hence, the approximation accuracy cannot be improved by considering new data during the optimization process. Gaussian process regression (GPR) models are widely used as surrogates because of their ability to pr…
Potential of interactive multiobjective optimization in supporting the design of a groundwater biodenitrification process
2019
The design of water treatment plants requires simultaneous analysis of technical, economic and environmental aspects, identified by multiple conflicting objectives. We demonstrated the advantages of an interactive multiobjective optimization (MOO) method over a posteriori methods in an unexplored field, namely the design of a biological treatment plant for drinking water production, that tackles the process drawbacks, contrarily to what happens in a traditional volumetric-load-driven design procedure. Specifically, we consider a groundwater denitrification biofilter, simulated by the Activated Sludge Model modified with two-stage denitrification kinetics. Three objectives were defined (nitr…