Real Royal Road Functions - Where Crossover Provably is Essential
| dc.contributor.author | Wegener, Ingo | de |
| dc.date.accessioned | 2004-12-07T08:20:42Z | |
| dc.date.available | 2004-12-07T08:20:42Z | |
| dc.date.created | 2001 | de |
| dc.date.issued | 2001-10-29 | de |
| dc.description.abstract | Mutation and crossov r are th main s arch op rators of different variants of evolutionary algorithms. Despite the many discussions on the importance of crossover nobody has proved rigorously for some explicitly defined fitness functions fn : {0 , 1 }n -> R that a genetic algorithm with crossover (but without idealization)can optimize fn in expected polynomial time while all volution strategies based only on mutation (and selection) need expected exponential time. Here such functions and proofs are presented. For some functions one-point crossover is appropriate while for others uniform crossover is the right choice. | en |
| dc.format.extent | 152314 bytes | |
| dc.format.extent | 301722 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5403 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15285 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Reihe Computational Intelligence ; 104 | de |
| dc.subject.ddc | 004 | de |
| dc.title | Real Royal Road Functions - Where Crossover Provably is Essential | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |