A New Approach to Solving Nonlinear Programming
摘要
A method for solving nonlinear programming using genetic algorithm is presented. In the operations of crossover and mutation in each generation, to ensure the new solutions are all feasible, we present a method in which the bounds of every variable in the solution are estimated beforehand according to the constrained conditions. For the operation of mutation, we present two methods of cube bounding and variable bounding. The experimental results are given and analyzed. They show that the method is efficient and can obtain the results in less generation.
引用本文(GB/T 7714)
Jie Shen. A New Approach to Solving Nonlinear Programming[J]. 系统科学与系统工程学报(英文版), 2002.
引文网络
本站仅收录题录与摘要供学习参考,全文版权归属出版方;如有侵权请联系我们删除。