Analysis of genetic algorithms from a global random search method perspective with techniques for algorithmic improvement
Citations
48 citations
Cites background from "Analysis of genetic algorithms from..."
...Finally, since genetic algorithms (1o not use schema information, there is no basis to conclude that genetic algorithms realize advantages from implicit parallelism (Peck, 1993)....
[...]
...Furthermore, the schema theory an(l ttle building block hyl)othesis are unable to explain how genetic algorithIns systematically generate improve(I candidate solutions, since they depend on the use of implicitly acquired schema information (Peck, 1993, §3.2.5)....
[...]
...It has also been observed that sctmma-I)ased analysis of genetic algorithm behavior is greatly complicated by the difficulties in associating properties to schemata (Forrest & Mitchell, 1993; Grefenstette & Baker, 1989; Grefenstette, 1991; Grefenstette, 1993; Peck, 1993; Peck & Dhawan, 1993)....
[...]
...Therefore, the use of acquired schema information to guide or affect genetic algorithm behavior has no tangible ba.sis and is not well grounded (Peck, 1993, ))....
[...]
...A more thorough summary of these results is presented in (Peck, 1993)....
[...]
31 citations
Cites methods from "Analysis of genetic algorithms from..."
...For instance, Peck [77, 76] followed that methodology to analyze convergence conditions in Genetic Algorithms....
[...]
12 citations
Additional excerpts
..., [273, 2332] Peck, III, Charles Clyde, [224] Pedersen, Lee G....
[...]