Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art

CAC Coello - Computer methods in applied mechanics and …, 2002 - Elsevier
This paper provides a comprehensive survey of the most popular constraint-handling
techniques currently used with evolutionary algorithms. We review approaches that go from …

Computational methodologies for optimal sensor placement in structural health monitoring: A review

Y Tan, L Zhang - Structural Health Monitoring, 2020 - journals.sagepub.com
Structural health monitoring plays an increasingly significant role in detecting damages for
large and complex structures to ensure their serviceability and sustainability. Optimal sensor …

[图书][B] How to solve it: modern heuristics

Z Michalewicz, DB Fogel - 2013 - books.google.com
No pleasure lasts long unless there is variety in it. Publilius Syrus, Moral Sayings We've
been very fortunate to receive fantastic feedback from our readers during the last four years …

Use of a self-adaptive penalty approach for engineering optimization problems

CAC Coello - Computers in Industry, 2000 - Elsevier
This paper introduces the notion of using co-evolution to adapt the penalty factors of a
fitness function incorporated in a genetic algorithm (GA) for numerical optimization. The …

Constraint-handling in genetic algorithms through the use of dominance-based tournament selection

CAC Coello, EM Montes - Advanced Engineering Informatics, 2002 - Elsevier
In this paper, we propose a dominance-based selection scheme to incorporate constraints
into the fitness function of a genetic algorithm used for global optimization. The approach …

Penalty function methods for constrained optimization with genetic algorithms

Ö Yeniay - Mathematical and computational Applications, 2005 - mdpi.com
Genetic Algorithms are most directly suited to unconstrained optimization. Application of
Genetic Algorithms to constrained optimization problems is often a challenging effort …

Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization

S Koziel, Z Michalewicz - Evolutionary computation, 1999 - ieeexplore.ieee.org
During the last five years, several methods have been proposed for handling nonlinear
constraints using evolutionary algorithms (EAs) for numerical optimization problems. Recent …

Genetic algorithms in computer aided design

G Renner, A Ekárt - Computer-aided design, 2003 - Elsevier
Design is a complex engineering activity, in which computers are more and more involved.
The design task can often be seen as an optimization problem in which the parameters or …

A new crossover operator for real coded genetic algorithms

K Deep, M Thakur - Applied mathematics and computation, 2007 - Elsevier
In this paper, a new real coded crossover operator, called the Laplace Crossover (LX) is
proposed. LX is used in conjunction with two well known mutation operators namely the …

A new mutation operator for real coded genetic algorithms

K Deep, M Thakur - Applied mathematics and Computation, 2007 - Elsevier
In this paper, a new mutation operator called power mutation (PM) is introduced for real
coded genetic algorithms (RCGA). The performance of PM is compared with two other …