Multi-parent recombination to overcome premaature convergence in genetic algorithms:
Abstract: "Recent research shows that enlarging the arity of recombination operators in a Genetic Algorithm lowers the probability of premature convergence. This results in more robust genetic function optimizers. In this paper we try to give an explanation why these multi- parent operators are...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1995
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,49 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Recent research shows that enlarging the arity of recombination operators in a Genetic Algorithm lowers the probability of premature convergence. This results in more robust genetic function optimizers. In this paper we try to give an explanation why these multi- parent operators are better. In particular, we discuss two operators: the uniform scanning crossover and the diagonal crossover operator. First we show that these operators are better than the standard ones by testing them on an extensive test-suite of function optimization problems. Second, we explain the empirical results by first looking at the influence that the operators have on the evolution of populations and then by using a new kind of description we are able to explain the convergence curves and rates of success as obtained in the experiments." |
| Beschreibung: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011064166 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961118s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)34780459 | ||
| 035 | |a (DE-599)BVBBV011064166 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kemenade, C. H. M. van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Multi-parent recombination to overcome premaature convergence in genetic algorithms |c C. H. M. van Kemenade ; A. E. Eiben |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 8 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 95,49 | |
| 520 | 3 | |a Abstract: "Recent research shows that enlarging the arity of recombination operators in a Genetic Algorithm lowers the probability of premature convergence. This results in more robust genetic function optimizers. In this paper we try to give an explanation why these multi- parent operators are better. In particular, we discuss two operators: the uniform scanning crossover and the diagonal crossover operator. First we show that these operators are better than the standard ones by testing them on an extensive test-suite of function optimization problems. Second, we explain the empirical results by first looking at the influence that the operators have on the evolution of populations and then by using a new kind of description we are able to explain the convergence curves and rates of success as obtained in the experiments." | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Genetic algorithms | |
| 700 | 1 | |a Eiben, Agoston E. |d 1961- |e Verfasser |0 (DE-588)143480626 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,49 |w (DE-604)BV008928356 |9 95,49 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007410152 | ||
Datensatz im Suchindex
| _version_ | 1804125553073061888 |
|---|---|
| any_adam_object | |
| author | Kemenade, C. H. M. van Eiben, Agoston E. 1961- |
| author_GND | (DE-588)143480626 |
| author_facet | Kemenade, C. H. M. van Eiben, Agoston E. 1961- |
| author_role | aut aut |
| author_sort | Kemenade, C. H. M. van |
| author_variant | c h m v k chmv chmvk a e e ae aee |
| building | Verbundindex |
| bvnumber | BV011064166 |
| ctrlnum | (OCoLC)34780459 (DE-599)BVBBV011064166 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01968nam a2200313 cb4500</leader><controlfield tag="001">BV011064166</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961118s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34780459</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011064166</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kemenade, C. H. M. van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multi-parent recombination to overcome premaature convergence in genetic algorithms</subfield><subfield code="c">C. H. M. van Kemenade ; A. E. Eiben</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">95,49</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Recent research shows that enlarging the arity of recombination operators in a Genetic Algorithm lowers the probability of premature convergence. This results in more robust genetic function optimizers. In this paper we try to give an explanation why these multi- parent operators are better. In particular, we discuss two operators: the uniform scanning crossover and the diagonal crossover operator. First we show that these operators are better than the standard ones by testing them on an extensive test-suite of function optimization problems. Second, we explain the empirical results by first looking at the influence that the operators have on the evolution of populations and then by using a new kind of description we are able to explain the convergence curves and rates of success as obtained in the experiments."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Genetic algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Eiben, Agoston E.</subfield><subfield code="d">1961-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)143480626</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">95,49</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,49</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007410152</subfield></datafield></record></collection> |
| id | DE-604.BV011064166 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007410152 |
| oclc_num | 34780459 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 8 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Kemenade, C. H. M. van Verfasser aut Multi-parent recombination to overcome premaature convergence in genetic algorithms C. H. M. van Kemenade ; A. E. Eiben Amsterdam 1995 8 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,49 Abstract: "Recent research shows that enlarging the arity of recombination operators in a Genetic Algorithm lowers the probability of premature convergence. This results in more robust genetic function optimizers. In this paper we try to give an explanation why these multi- parent operators are better. In particular, we discuss two operators: the uniform scanning crossover and the diagonal crossover operator. First we show that these operators are better than the standard ones by testing them on an extensive test-suite of function optimization problems. Second, we explain the empirical results by first looking at the influence that the operators have on the evolution of populations and then by using a new kind of description we are able to explain the convergence curves and rates of success as obtained in the experiments." Combinatorial optimization Genetic algorithms Eiben, Agoston E. 1961- Verfasser (DE-588)143480626 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,49 (DE-604)BV008928356 95,49 |
| spellingShingle | Kemenade, C. H. M. van Eiben, Agoston E. 1961- Multi-parent recombination to overcome premaature convergence in genetic algorithms Combinatorial optimization Genetic algorithms |
| title | Multi-parent recombination to overcome premaature convergence in genetic algorithms |
| title_auth | Multi-parent recombination to overcome premaature convergence in genetic algorithms |
| title_exact_search | Multi-parent recombination to overcome premaature convergence in genetic algorithms |
| title_full | Multi-parent recombination to overcome premaature convergence in genetic algorithms C. H. M. van Kemenade ; A. E. Eiben |
| title_fullStr | Multi-parent recombination to overcome premaature convergence in genetic algorithms C. H. M. van Kemenade ; A. E. Eiben |
| title_full_unstemmed | Multi-parent recombination to overcome premaature convergence in genetic algorithms C. H. M. van Kemenade ; A. E. Eiben |
| title_short | Multi-parent recombination to overcome premaature convergence in genetic algorithms |
| title_sort | multi parent recombination to overcome premaature convergence in genetic algorithms |
| topic | Combinatorial optimization Genetic algorithms |
| topic_facet | Combinatorial optimization Genetic algorithms |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kemenadechmvan multiparentrecombinationtoovercomepremaatureconvergenceingeneticalgorithms AT eibenagostone multiparentrecombinationtoovercomepremaatureconvergenceingeneticalgorithms |