Designing regular graphs with the use of evolutionary algorithms
The paper deals with a fundamental problem arising in the design of optimal networks-the maximization of the number of spanning trees. To make the problem computationally tractable, we consider a class of regular graphs. The problem is solved with the use of the evolutionary algorithm and compared t...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1839 Vol. 3 |
|---|---|
| container_issue | |
| container_start_page | 1832 |
| container_title | |
| container_volume | 3 |
| creator | Sawionek, B. Wojciechowski, J. Arabas, J. |
| description | The paper deals with a fundamental problem arising in the design of optimal networks-the maximization of the number of spanning trees. To make the problem computationally tractable, we consider a class of regular graphs. The problem is solved with the use of the evolutionary algorithm and compared to the 2-opt method. The problem-specific genetic operators are introduced, Various experiments with different graph structures have been performed, the results are reported and discussed. The influence of introducing some preliminary knowledge about the problem on the algorithm effectiveness is studied. |
| doi_str_mv | 10.1109/CEC.1999.785497 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_785497</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>785497</ieee_id><sourcerecordid>785497</sourcerecordid><originalsourceid>FETCH-LOGICAL-i89t-be539a653190b7891abbb1c88e91ba0dc2daa9afb77ed642fc15ea5ade0fba593</originalsourceid><addsrcrecordid>eNotj1FLwzAUhQMiTOeeBz7lD7QmTdPkvil1TmHgy97HTXvbRrp2JK3iv7cwz8t5-Th8h7GtFKmUAp7KXZlKAEiN1TmYG3YvjBVKa1XAim1i_BJLFORGZXfs-ZWibwc_tDxQO_cYeBvw0kX-46eOTx3xORIfG07fYz9Pfhww_HLs2zEswDk-sNsG-0ib_16z49vuWL4nh8_9R_lySLyFKXGkFWChlQThjAWJzjlZWUsgHYq6ympEwMYZQ3WRZ00lNaHGmkTjUINas8frrCei0yX486Jxul5Uf4XvSNg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Designing regular graphs with the use of evolutionary algorithms</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Sawionek, B. ; Wojciechowski, J. ; Arabas, J.</creator><creatorcontrib>Sawionek, B. ; Wojciechowski, J. ; Arabas, J.</creatorcontrib><description>The paper deals with a fundamental problem arising in the design of optimal networks-the maximization of the number of spanning trees. To make the problem computationally tractable, we consider a class of regular graphs. The problem is solved with the use of the evolutionary algorithm and compared to the 2-opt method. The problem-specific genetic operators are introduced, Various experiments with different graph structures have been performed, the results are reported and discussed. The influence of introducing some preliminary knowledge about the problem on the algorithm effectiveness is studied.</description><identifier>ISBN: 0780355369</identifier><identifier>ISBN: 9780780355361</identifier><identifier>DOI: 10.1109/CEC.1999.785497</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Capacitive sensors ; Closed-form solution ; Encoding ; Evolutionary computation ; Genetics ; Optimized production technology ; Symmetric matrices ; Telecommunication network reliability ; Tree graphs</subject><ispartof>Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 1999, Vol.3, p.1832-1839 Vol. 3</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/785497$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,4036,4037,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/785497$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sawionek, B.</creatorcontrib><creatorcontrib>Wojciechowski, J.</creatorcontrib><creatorcontrib>Arabas, J.</creatorcontrib><title>Designing regular graphs with the use of evolutionary algorithms</title><title>Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)</title><addtitle>CEC</addtitle><description>The paper deals with a fundamental problem arising in the design of optimal networks-the maximization of the number of spanning trees. To make the problem computationally tractable, we consider a class of regular graphs. The problem is solved with the use of the evolutionary algorithm and compared to the 2-opt method. The problem-specific genetic operators are introduced, Various experiments with different graph structures have been performed, the results are reported and discussed. The influence of introducing some preliminary knowledge about the problem on the algorithm effectiveness is studied.</description><subject>Algorithm design and analysis</subject><subject>Capacitive sensors</subject><subject>Closed-form solution</subject><subject>Encoding</subject><subject>Evolutionary computation</subject><subject>Genetics</subject><subject>Optimized production technology</subject><subject>Symmetric matrices</subject><subject>Telecommunication network reliability</subject><subject>Tree graphs</subject><isbn>0780355369</isbn><isbn>9780780355361</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj1FLwzAUhQMiTOeeBz7lD7QmTdPkvil1TmHgy97HTXvbRrp2JK3iv7cwz8t5-Th8h7GtFKmUAp7KXZlKAEiN1TmYG3YvjBVKa1XAim1i_BJLFORGZXfs-ZWibwc_tDxQO_cYeBvw0kX-46eOTx3xORIfG07fYz9Pfhww_HLs2zEswDk-sNsG-0ib_16z49vuWL4nh8_9R_lySLyFKXGkFWChlQThjAWJzjlZWUsgHYq6ympEwMYZQ3WRZ00lNaHGmkTjUINas8frrCei0yX486Jxul5Uf4XvSNg</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Sawionek, B.</creator><creator>Wojciechowski, J.</creator><creator>Arabas, J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1999</creationdate><title>Designing regular graphs with the use of evolutionary algorithms</title><author>Sawionek, B. ; Wojciechowski, J. ; Arabas, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i89t-be539a653190b7891abbb1c88e91ba0dc2daa9afb77ed642fc15ea5ade0fba593</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithm design and analysis</topic><topic>Capacitive sensors</topic><topic>Closed-form solution</topic><topic>Encoding</topic><topic>Evolutionary computation</topic><topic>Genetics</topic><topic>Optimized production technology</topic><topic>Symmetric matrices</topic><topic>Telecommunication network reliability</topic><topic>Tree graphs</topic><toplevel>online_resources</toplevel><creatorcontrib>Sawionek, B.</creatorcontrib><creatorcontrib>Wojciechowski, J.</creatorcontrib><creatorcontrib>Arabas, J.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library Online</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sawionek, B.</au><au>Wojciechowski, J.</au><au>Arabas, J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Designing regular graphs with the use of evolutionary algorithms</atitle><btitle>Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)</btitle><stitle>CEC</stitle><date>1999</date><risdate>1999</risdate><volume>3</volume><spage>1832</spage><epage>1839 Vol. 3</epage><pages>1832-1839 Vol. 3</pages><isbn>0780355369</isbn><isbn>9780780355361</isbn><abstract>The paper deals with a fundamental problem arising in the design of optimal networks-the maximization of the number of spanning trees. To make the problem computationally tractable, we consider a class of regular graphs. The problem is solved with the use of the evolutionary algorithm and compared to the 2-opt method. The problem-specific genetic operators are introduced, Various experiments with different graph structures have been performed, the results are reported and discussed. The influence of introducing some preliminary knowledge about the problem on the algorithm effectiveness is studied.</abstract><pub>IEEE</pub><doi>10.1109/CEC.1999.785497</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0780355369 |
| ispartof | Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 1999, Vol.3, p.1832-1839 Vol. 3 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_785497 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Capacitive sensors Closed-form solution Encoding Evolutionary computation Genetics Optimized production technology Symmetric matrices Telecommunication network reliability Tree graphs |
| title | Designing regular graphs with the use of evolutionary algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T19%3A14%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Designing%20regular%20graphs%20with%20the%20use%20of%20evolutionary%20algorithms&rft.btitle=Proceedings%20of%20the%201999%20Congress%20on%20Evolutionary%20Computation-CEC99%20(Cat.%20No.%2099TH8406)&rft.au=Sawionek,%20B.&rft.date=1999&rft.volume=3&rft.spage=1832&rft.epage=1839%20Vol.%203&rft.pages=1832-1839%20Vol.%203&rft.isbn=0780355369&rft.isbn_list=9780780355361&rft_id=info:doi/10.1109/CEC.1999.785497&rft_dat=%3Cieee_6IE%3E785497%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=785497&rfr_iscdi=true |