A Selecto-recombinative Genetic Algorithm with Continuous Chromosome Reconfiguration
A good performance of traditional genetic algorithm is determined by its ability to identify building blocks and grow them to larger ones. To attain this objective a properly arranged chromosome is needed to ensure that building blocks will survive the application of recombination operators. The pro...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 968 |
|---|---|
| container_issue | |
| container_start_page | 959 |
| container_title | |
| container_volume | |
| creator | Kubalík, Jiří Pošík, Petr Herold, Jan |
| description | A good performance of traditional genetic algorithm is determined by its ability to identify building blocks and grow them to larger ones. To attain this objective a properly arranged chromosome is needed to ensure that building blocks will survive the application of recombination operators. The proposed algorithm periodically rearranges the order of genes in the chromosome while the actual information about the inter-gene dependencies is calculated on-line through the run. Standard 2-point crossover, operating on the adapted chromosomal structure, is used to generate new solutions. Experimental results show that this algorithm is able to solve separable problems with strong intra building block dependencies among genes as well as the hierarchical problems. |
| doi_str_mv | 10.1007/11844297_97 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19687276</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19687276</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-4e2270beaccd91ade1cd8b023e495490afe7e80f819a3921de3ed1d4f84a2a273</originalsourceid><addsrcrecordid>eNpNkD1PwzAYhM2XRFs68QeyMDAE_NpubY9VBAWpEhKUOXKcN60hsSs7BfHvCSpILHfDPXfDEXIJ9AYolbcASgimZanlERnzmaBcaQ1wTEYwB8g5F_qETLVUfxnlp2REOWW5loKfk3FKb5RSJjUbkfUie8EWbR_yiDZ0lfOmdx-YLdFj72y2aDchun7bZZ-DZkXwvfP7sE9ZsY2hCyl0mD0PVd-4zT4O5eAvyFlj2oTTX5-Q1_u7dfGQr56Wj8Vile8Y6D4XyJikFRpraw2mRrC1qijjKPRMaGoalKhoo0AbrhnUyLGGWjRKGGaY5BNyddjdmWRN20TjrUvlLrrOxK8S9FxJJucDd33g0hD5DcayCuE9lUDLn0_Lf5_yb6x9ZbE</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Selecto-recombinative Genetic Algorithm with Continuous Chromosome Reconfiguration</title><source>Springer Books</source><creator>Kubalík, Jiří ; Pošík, Petr ; Herold, Jan</creator><contributor>Yao, Xin ; Whitley, L. Darrell ; Merelo-Guervós, Juan J. ; Runarsson, Thomas Philip ; Burke, Edmund ; Beyer, Hans-Georg</contributor><creatorcontrib>Kubalík, Jiří ; Pošík, Petr ; Herold, Jan ; Yao, Xin ; Whitley, L. Darrell ; Merelo-Guervós, Juan J. ; Runarsson, Thomas Philip ; Burke, Edmund ; Beyer, Hans-Georg</creatorcontrib><description>A good performance of traditional genetic algorithm is determined by its ability to identify building blocks and grow them to larger ones. To attain this objective a properly arranged chromosome is needed to ensure that building blocks will survive the application of recombination operators. The proposed algorithm periodically rearranges the order of genes in the chromosome while the actual information about the inter-gene dependencies is calculated on-line through the run. Standard 2-point crossover, operating on the adapted chromosomal structure, is used to generate new solutions. Experimental results show that this algorithm is able to solve separable problems with strong intra building block dependencies among genes as well as the hierarchical problems.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540389903</identifier><identifier>ISBN: 3540389903</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540389911</identifier><identifier>EISBN: 9783540389910</identifier><identifier>DOI: 10.1007/11844297_97</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Chromosome Structure ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Critical Heat Flux ; Exact sciences and technology ; Fitness Evaluation ; Genetic Algorithm ; Linkage Group ; Software ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2006, p.959-968</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11844297_97$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11844297_97$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19687276$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Yao, Xin</contributor><contributor>Whitley, L. Darrell</contributor><contributor>Merelo-Guervós, Juan J.</contributor><contributor>Runarsson, Thomas Philip</contributor><contributor>Burke, Edmund</contributor><contributor>Beyer, Hans-Georg</contributor><creatorcontrib>Kubalík, Jiří</creatorcontrib><creatorcontrib>Pošík, Petr</creatorcontrib><creatorcontrib>Herold, Jan</creatorcontrib><title>A Selecto-recombinative Genetic Algorithm with Continuous Chromosome Reconfiguration</title><title>Lecture notes in computer science</title><description>A good performance of traditional genetic algorithm is determined by its ability to identify building blocks and grow them to larger ones. To attain this objective a properly arranged chromosome is needed to ensure that building blocks will survive the application of recombination operators. The proposed algorithm periodically rearranges the order of genes in the chromosome while the actual information about the inter-gene dependencies is calculated on-line through the run. Standard 2-point crossover, operating on the adapted chromosomal structure, is used to generate new solutions. Experimental results show that this algorithm is able to solve separable problems with strong intra building block dependencies among genes as well as the hierarchical problems.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Chromosome Structure</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Critical Heat Flux</subject><subject>Exact sciences and technology</subject><subject>Fitness Evaluation</subject><subject>Genetic Algorithm</subject><subject>Linkage Group</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540389903</isbn><isbn>3540389903</isbn><isbn>3540389911</isbn><isbn>9783540389910</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkD1PwzAYhM2XRFs68QeyMDAE_NpubY9VBAWpEhKUOXKcN60hsSs7BfHvCSpILHfDPXfDEXIJ9AYolbcASgimZanlERnzmaBcaQ1wTEYwB8g5F_qETLVUfxnlp2REOWW5loKfk3FKb5RSJjUbkfUie8EWbR_yiDZ0lfOmdx-YLdFj72y2aDchun7bZZ-DZkXwvfP7sE9ZsY2hCyl0mD0PVd-4zT4O5eAvyFlj2oTTX5-Q1_u7dfGQr56Wj8Vile8Y6D4XyJikFRpraw2mRrC1qijjKPRMaGoalKhoo0AbrhnUyLGGWjRKGGaY5BNyddjdmWRN20TjrUvlLrrOxK8S9FxJJucDd33g0hD5DcayCuE9lUDLn0_Lf5_yb6x9ZbE</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Kubalík, Jiří</creator><creator>Pošík, Petr</creator><creator>Herold, Jan</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>A Selecto-recombinative Genetic Algorithm with Continuous Chromosome Reconfiguration</title><author>Kubalík, Jiří ; Pošík, Petr ; Herold, Jan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-4e2270beaccd91ade1cd8b023e495490afe7e80f819a3921de3ed1d4f84a2a273</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Chromosome Structure</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Critical Heat Flux</topic><topic>Exact sciences and technology</topic><topic>Fitness Evaluation</topic><topic>Genetic Algorithm</topic><topic>Linkage Group</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kubalík, Jiří</creatorcontrib><creatorcontrib>Pošík, Petr</creatorcontrib><creatorcontrib>Herold, Jan</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kubalík, Jiří</au><au>Pošík, Petr</au><au>Herold, Jan</au><au>Yao, Xin</au><au>Whitley, L. Darrell</au><au>Merelo-Guervós, Juan J.</au><au>Runarsson, Thomas Philip</au><au>Burke, Edmund</au><au>Beyer, Hans-Georg</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Selecto-recombinative Genetic Algorithm with Continuous Chromosome Reconfiguration</atitle><btitle>Lecture notes in computer science</btitle><date>2006</date><risdate>2006</risdate><spage>959</spage><epage>968</epage><pages>959-968</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540389903</isbn><isbn>3540389903</isbn><eisbn>3540389911</eisbn><eisbn>9783540389910</eisbn><abstract>A good performance of traditional genetic algorithm is determined by its ability to identify building blocks and grow them to larger ones. To attain this objective a properly arranged chromosome is needed to ensure that building blocks will survive the application of recombination operators. The proposed algorithm periodically rearranges the order of genes in the chromosome while the actual information about the inter-gene dependencies is calculated on-line through the run. Standard 2-point crossover, operating on the adapted chromosomal structure, is used to generate new solutions. Experimental results show that this algorithm is able to solve separable problems with strong intra building block dependencies among genes as well as the hierarchical problems.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11844297_97</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2006, p.959-968 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19687276 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Chromosome Structure Computer science control theory systems Computer systems and distributed systems. User interface Critical Heat Flux Exact sciences and technology Fitness Evaluation Genetic Algorithm Linkage Group Software Theoretical computing |
| title | A Selecto-recombinative Genetic Algorithm with Continuous Chromosome Reconfiguration |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T01%3A21%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Selecto-recombinative%20Genetic%20Algorithm%20with%20Continuous%20Chromosome%20Reconfiguration&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Kubal%C3%ADk,%20Ji%C5%99%C3%AD&rft.date=2006&rft.spage=959&rft.epage=968&rft.pages=959-968&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540389903&rft.isbn_list=3540389903&rft_id=info:doi/10.1007/11844297_97&rft_dat=%3Cpascalfrancis_sprin%3E19687276%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540389911&rft.eisbn_list=9783540389910&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |