Using Genetic Algorithms in Engineering Design Optimization with Non-Linear Constraints

TL;DR: A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach and is capable of obtaining high-quality solutions for problems of various characteristics.

TL;DR: The purpose of this paper is to summarize and organize the information on current evolutionary-based approaches, emphasizing the importance of analyzing the operations research techniques in which most of them are based, in an attempt to motivate researchers to look into these mathematical programming approaches for new ways of exploiting the search capabilities of evolutionary algorithms.

TL;DR: A new approach for solving constrained numerical optimization problems which incorporates a homomorphous mapping between n-dimensional cube and a feasible search space and constitutes an example of the fifth decoder-based category of constraint handling techniques.

TL;DR: These penalty-based methods for handling constraints in Genetic Algorithms are presented and discussed and their strengths and weaknesses are discussed.