Abstract
In this chapter, after introducing genetic algorithms for nonlinear programming including the original GEnetic algorithm for Numerical Optimization of COnstrained Problems (GENOCOP) system for linear constraints, the coevolutionary genetic algorithm, called GENOCOP III, proposed by Michalewicz et al. is discussed in detail. Realizing some drawbacks of GENOCOP III, the coevolutionary genetic algorithm, called the revised GENOCOP III, is presented through the introduction of a generating method of an initial reference point by minimizing the sum of squares of violated nonlinear constraints and a bisection method for generating a new feasible point on the line segment between a search point and a reference point efficiently. Illustrative numerical examples are provided to demonstrate the feasibility and efficiency of the revised GENOCOP III.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
