Sakawa, Masatoshi; Yauchi, Katsuhiro Coevolutionary genetic algorithms for nonconvex nonlinear programming problems: Revised GENOCOP III. (English) Zbl 1051.68557 Cybern. Syst. 29, No. 8, 885-899 (1998). Summary: We focus on general nonconvex nonlinear programming problems and consider an applicability of genetic algorithms. For such problems, Z. Michalewicz and G. Nazhiyath [Genocop III: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. In Proceedings of the Second IEEE International Conference Evolutionary Computation, 647–651. Piscataway, NJ: IEEE Press (1995)] recently proposed the coevolutionary genetic algorithm called GENOCOP III, by introducing the concepts of search points and reference points which, respectively, satisfy the linear constraints and all of the constraints. Unfortunately, however, in GENOCOP III, since an initial population is randomly generated, it is quite difficult to generate reference points. Furthermore, a new search point is randomly generated on the line segment between a search point and a reference point and effectiveness and speed of search may be quite low. Realizing such difficulties, in this paper we propose the revised GENOCOP III by introducing a method for generating a reference point by minimizing the sum of squares of violated nonlinear constraints and a bisection method for generating a new search point on the line segment between a search point and a reference point. Through a lot of numerical experiments, both feasibility and effectiveness of the proposed method are demonstrated. Cited in 1 Document MSC: 68T05 Learning and adaptive systems in artificial intelligence 90C30 Nonlinear programming 68W05 Nonnumerical algorithms 90C26 Nonconvex programming, global optimization Software:Genocop PDFBibTeX XMLCite \textit{M. Sakawa} and \textit{K. Yauchi}, Cybern. Syst. 29, No. 8, 885--899 (1998; Zbl 1051.68557) Full Text: DOI