#### Filter Results:

#### Publication Year

2005

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The proposed operator, named CQA (Constraint Quadratic Approximation), can be interpreted as both a local search engine (that employs quadratic approximations of both objective and constraint… (More)

— In this paper, we propose a local search methodology to be coupled with a Genetic Algorithm to solve optimization problems with non-linear constraints. This methodology uses quadratic approximations for both objective function and constraints. In the local search phase, these quadratic approximations define an associated problem that is solved using a… (More)

This paper proposes a local search optimizer that, employed as an additional operator in multiobjective evolutionary techniques, can help to find more precise estimates of the Pareto-optimal surface with a smaller cost of function evaluation. The new operator employs quadratic approximations of the objective functions and constraints, which are built using… (More)

The Maximum Diversity Problem (MDP) consists in finding a subset of elements which have maximum diversity between each other. It is a very important problem due to its general aspect, that implies many practical applications such as facility location, genetics, and product design. We propose a method based on Evolution Strategies (ES) with Local Search and… (More)