 | John R. McDonnell, Robert G. Reynolds - Evolutionary programming (Computer science) - 1995 - 840 pages
...eliminating unfeasible solutions from a population may work reasonably well when the feasible search space T is convex and it constitutes a reasonable part of the whole search space (eg, evolution strategies do not allow equality constraints since with such constraints the ratio between... | |
 | Ibrahim H. Osman, James P. Kelly - Business & Economics - 1996 - 712 pages
...strategies or evolutionary programming. The method of eliminating unfeasible solutions from a population may work reasonably well when the feasible search...constitutes a reasonable part of the whole search space (eg, evolution strategies do not allow equality constraints since with such constraints the ratio between... | |
 | Keigo Watanabe, M.M.A. Hashem - Computers - 2004 - 200 pages
...no need to evaluate infeasible solutions and to compare them with feasible ones. Fortunately, this method may work reasonably well when the feasible...search space is convex and it constitutes a reasonable par t of the whole search space. Otherwise, such an approach has serious limitations. For example,... | |
| |
The method may work reasonably well when the feasible search space is convex and it constitutes a reasonable part of the whole search space. 