Constrained Optimization Via Genetic Algorithms
Abdollah Homaifar, Charlene X. Qi, Steven H.-Y. Lai · SIMULATION · 1994
This paper presents an application of genetic algorithms (GAs) to nonlinear constrained optimization. GAs are general purpose optimization algorithms which apply the rules of natural genetics to explore a given search space. When GAs are applied to nonlinear constrained problems, constraint handling becomes an important issue. The proposed search algorithm is realized by GAs which utilize a penalty function in the objective function to account for violation. This extension is based on systematic multi-stage assignments of weights in the penalty method as opposed to single-stage assignments in sequential unconstrained minimization. The experimental results are satisfactory and agree well with those of the gradient type methods.
Cited by 802 works. doi:10.1177/003754979406200405
Authors
References
- Genetic algorithms in search, optimization, and machine learning
- Adaptation in Natural and Artificial Systems
- Methods of Mathematical Physics
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Applied Nonlinear Programming
- Artificial Intelligence through Simulated Evolution
- Variational methods for the solution of problems of equilibrium and vibrations
- Traveling Salesman Problem
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination