39,724 research outputs found
A novel hybrid multi-objective metamodel-based evolutionary optimization algorithm
Optimization via Simulation (OvS) is an useful optimization tool to find a solution to an optimization problem that is difficult to model analytically. OvS consists in evaluating potential solutions through simulation executions; however, its high computational cost is a factor that can make its implementation infeasible. This issue also occurs in multi-objective problems, which tend to be expensive to solve. In this work, we present a new hybrid multi-objective OvS algorithm, which uses Kriging-type metamodels to estimate the simulations results and a multi-objective evolutionary algorithm to manage the optimization process. Our proposal succeeds in reducing the computational cost significantly without affecting the quality of the results obtained. The evolutionary part of the hybrid algorithm is based on the popular NSGA-II. The hybrid method is compared to the canonical NSGA-II and other hybrid approaches, showing a good performance not only in the quality of the solutions but also as computational cost saving.Fil: Baquela, Enrique Gabriel. Universidad TecnolĂłgica Nacional. Facultad Regional San NicolĂĄs; ArgentinaFil: Olivera, Ana Carolina. Universidad Nacional de Cuyo. Instituto para las TecnologĂas de la Informacion y las Comunicaciones; Argentina. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas; Argentin
Diversifying Multi-Objective Gradient Techniques and their Role in Hybrid Multi-Objective Evolutionary Algorithms for Deformable Medical Image Registration
Gradient methods and their value in single-objective, real-valued
optimization are well-established. As such, they play
a key role in tackling real-world, hard optimization problems
such as deformable image registration (DIR). A key question
is to which extent gradient techniques can also play a role in
a multi-objective approach to DIR. We therefore aim to exploit
gradient information within an evolutionary-algorithm-based
multi-objective optimization framework for DIR. Although an
analytical description of the multi-objective gradient (the set
of all Pareto-optimal improving directions) is
available, it is nontrivial how to best choose the most
appropriate direction per solution because these directions are
not necessarily uniformly distributed in objective space. To
address this, we employ a Monte-Carlo method to obtain
a discrete, spatially-uniformly distributed approximation of
the set of Pareto-optimal improving directions. We then
apply a diversification technique in which each solution is
associated with a unique direction from this set based on its
multi- as well as single-objective rank. To assess its utility,
we compare a state-of-the-art multi-objective evolutionary
algorithm with three different hybrid versions thereof on
several benchmark problems and two medical DIR problems.
Results show that the diversification strategy successfully
leads to unbiased improvement, helping an adaptive hybrid
scheme solve all problems, but the evolutionary algorithm
remains the most powerful optimization method, providing
the best balance between proximity and diversity
DECMO2: a robust hybrid and adaptive multi-objective evolutionary algorithm.
We describe a hybrid and adaptive coevolutionary optimization method that can efficiently solve a wide range of multi-objective optimization problems (MOOPs) as it successfully combines positive traits from three main classes of multi-objective evolutionary algorithms (MOEAs): classical approaches that use Pareto-based selection for survival criteria, approaches that rely on differential evolution, and decomposition-based strategies. A key part of our hybrid evolutionary approach lies in the proposed fitness sharing mechanism that is able to smoothly transfer information between the coevolved subpopulations without negatively impacting the specific evolutionary process behavior that characterizes each subpopulation. The proposed MOEA also features an adaptive allocation of fitness evaluations between the coevolved populations to increase robustness and favor the evolutionary search strategy that proves more successful for solving the MOOP at hand. Apart from the new evolutionary algorithm, this paper also contains the description of a new hypervolume and racing-based methodology aimed at providing practitioners from the field of multi-objective optimization with a simple means of analyzing/reporting the general comparative run-time performance of multi-objective optimization algorithms over large problem sets
Mean-VaR portfolio optimization: A nonparametric approach
Portfolio optimization involves the optimal assignment of limited capital to different available financial assets to achieve a reasonable trade-off between profit and risk. We consider an alternative Markowitzâs meanâvariance model in which the variance is replaced with an industry standard risk measure, Value-at-Risk (VaR), in order to better assess market risk exposure associated with financial and commodity asset price fluctuations. Realistic portfolio optimization in the mean-VaR framework is a challenging problem since it leads to a non-convex NP-hard problem which is computationally intractable. In this work, an efficient learning-guided hybrid multi-objective evolutionary algorithm (MODE-GL) is proposed to solve mean-VaR portfolio optimization problems with real-world constraints such as cardinality, quantity, pre-assignment, round-lot and class constraints. A learning-guided solution generation strategy is incorporated into the multi-objective optimization process to promote efficient convergence by guiding the evolutionary search towards promising regions of the search space. The proposed algorithm is compared with the Non-dominated Sorting Genetic Algorithm (NSGA-II) and the Strength Pareto Evolutionary Algorithm (SPEA2). Experimental results using historical daily financial market data from S & P 100 and S & P 500 indices are presented. The results show that MODE-GL outperforms two existing techniques for this important class of portfolio investment problems in terms of solution quality and computational time. The results highlight that the proposed algorithm is able to solve the complex portfolio optimization without simplifications while obtaining good solutions in reasonable time and has significant potential for use in practice
Recommended from our members
Artificial Immune Systems - Models, algorithms and applications
Copyright © 2010 Academic Research Publishing Agency.This article has been made available through the Brunel Open Access Publishing Fund.Artificial Immune Systems (AIS) are computational paradigms that belong to the computational intelligence family and are inspired by the biological immune system. During the past decade, they have attracted a lot of interest from researchers aiming to develop immune-based models and techniques to solve complex computational or engineering problems. This work presents a survey of existing AIS models and algorithms with a focus on the last five years.This article is available through the Brunel Open Access Publishing Fun
- âŠ