Useful infeasible solutions in engineering optimization with evolutionary algorithms

205Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose an evolutionary-based approach to solve engineering design problems without using penalty functions. The aim is to identify and maintain infeasible solutions close to the feasible region located in promising areas. In this way, using the genetic operators, more solutions will be generated inside the feasible region and also near its boundaries. As a result, the feasible region will be sampled well-enough as to reach better feasible solutions. The proposed approach, which is simple to implement, is tested with respect to typical penalty function techniques as well as against state-of-the-art approaches using four mechanical design problems. The results obtained are discussed and some conclusions are provided. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mezura-Montes, E., & Coello Coello, C. A. (2005). Useful infeasible solutions in engineering optimization with evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3789 LNAI, pp. 652–662). https://doi.org/10.1007/11579427_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free