Search results for "multiobjective optimization"

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 Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization

2018

We propose a surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed evolutionary algorithm for many-objective optimization that relies on a set of adaptive reference vectors for selection. The proposed surrogateassisted evolutionary algorithm uses Kriging to approximate each objective function to reduce the computational cost. In managing the Kriging models, the algorithm focuses on the balance of diversity and convergence by making use of the uncertainty information in the approximated objective values given by the Kriging models, the distr…

Integrating risk management tools for regional forest planning : an interactive multiobjective value at risk approach

2018

In this paper, we present an approach employing multiobjective optimization to support decision making in forest management planning under risk. The primary objectives are biodiversity and timber cash flow, evaluated from two perspectives: the expected value and the value-at-risk (VaR). In addition, the risk level for both the timber cash flow and biodiversity values are included as objectives. With our approach, we highlight the trade-off between the expected value and the VaR, as well as between the VaRs of the two objectives of interest. We employ an interactive method in which a decision maker iteratively provides preference information to find the most preferred management plan and lea…

Approximation through interpolation in nonconvex multiobjective optimization

2011

Approximation method for computationally expensive nonconvex multiobjective optimization problems

2012

On solving computationally expensive multiobjective optimization problems with interactive methods

2014

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.

Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA

2010

Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.

Constrained Robust MultiObjective Optimization for Reactive Design in Distribution Systems

2006

This paper presents a new formulation including robustness of solution of constrained multiobjective design or reactive power compensation. The algorithm used for optimization is the NSGA-II (Non dominated Sorting Genetic Algorithm II) with a special crowded comparison operator for constraints handling. The need for including the issue of robustness of solutions derives from the simple observation that loads are uncertain in distribution systems and their estimation is often affected by errors. In design problems it is desirable to consider the loads with a certain range of variation. In this paper the NSGA-II algorithm is applied to efficiently solve the issue and the solutions attained co…

Multiobjective Optimal Reconfiguration of MV Networks with Different Earthing Systems

2010

The paper deals with the traditional problem of multiobjective optimal reconfiguration applied to power distribution systems considering the safety issue in the formulation. The applications are devoted to the solution of the posed problem in networks in which coexist energy sources with unearthed neutral point and resonant earthed neutral point. After a brief review of the most recent papers on optimal reconfiguration, the paper outlines the safety problem and provides a solution to the multiobjective problem using the Non dominated Sorting Genetic Algorithm II aiming at: minimal power losses operation, safety check at distribution substations and load balancing among the HV/MV transformer…