A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions

Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the trail communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the desig...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Dréo, Johann, Siarry, Patrick
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Analytical Test Function Applied sciences Biological Notion Communication Channel Computer science control theory systems Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Particle Swarm Optimization Pheromonal Trail Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	221
container_issue
container_start_page	216
container_title
container_volume	2463
creator	Dréo, Johann Siarry, Patrick
description	Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the trail communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communication channels.
doi_str_mv	10.1007/3-540-45724-0_18
format	Book Chapter
fullrecord	<record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_14840872</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3073098_24_229</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2728-d5f852461d7708aad656b4741d912aa65b98307451670b56a373b6ca5a491a3d3</originalsourceid><addsrcrecordid>eNotUctuFDEQNAQQm7B3jr5wnMTvx3G0IgQpkEtytjwe765h1h5sj1D4ejyb9KWl6qpWdTUAnzG6xgjJG9pxhjrGJWEdMli9AZe0IWcAvQUbLDDuKGX6Amy1VOcZw0zwd2CDKCKdlox-ABvNFSeUEv0RbEv5hVpRgimSG1B7-NP_hX2scJemFJ9hPx1SDvV4gk8lxAOsRw_vfPXZZncMzk6NGJ2fK-zDyY_QVvgw13AK_2wNKcK0hz-WaQViONmVXENc0lLg7RLdSimfwPu9nYrfvvYr8HT79XF3190_fPu-6-87RyRR3cj3zTcTeJQSKWtHwcXAJMOjxsRawQet2hGMYyHRwIWlkg7CWW6ZxpaO9Ap8edk729KM77ONLhQz52YsPxvMFENKksa7fuGVNooHn82Q0u9icAu9_cFQ05I159jN-ocmoK-Lc_qz-FKNXxXOx5rt5I52bnkV08xRpJVpMkI0_Q-tFYUM</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3073098_24_229</pqid></control><display><type>book_chapter</type><title>A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions</title><source>Springer Books</source><creator>Dréo, Johann ; Siarry, Patrick</creator><contributor>Dorigo, Marco ; Sampels, Michael ; Di Caro, Gianni ; Sampels, Michael ; Di Caro, Gianni ; Dorigo, Marco</contributor><creatorcontrib>Dréo, Johann ; Siarry, Patrick ; Dorigo, Marco ; Sampels, Michael ; Di Caro, Gianni ; Sampels, Michael ; Di Caro, Gianni ; Dorigo, Marco</creatorcontrib><description>Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the trail communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communication channels.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540441465</identifier><identifier>ISBN: 3540441468</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540457240</identifier><identifier>EISBN: 9783540457244</identifier><identifier>DOI: 10.1007/3-540-45724-0_18</identifier><identifier>OCLC: 958523329</identifier><identifier>LCCallNum: TK5105.5-5105.9</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Analytical Test Function ; Applied sciences ; Biological Notion ; Communication Channel ; Computer science; control theory; systems ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science ; Particle Swarm Optimization ; Pheromonal Trail ; Theoretical computing</subject><ispartof>Ant Algorithms, 2002, Vol.2463, p.216-221</ispartof><rights>Springer-Verlag Berlin Heidelberg 2002</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2728-d5f852461d7708aad656b4741d912aa65b98307451670b56a373b6ca5a491a3d3</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3073098-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45724-0_18$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45724-0_18$$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=14840872$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Dorigo, Marco</contributor><contributor>Sampels, Michael</contributor><contributor>Di Caro, Gianni</contributor><contributor>Sampels, Michael</contributor><contributor>Di Caro, Gianni</contributor><contributor>Dorigo, Marco</contributor><creatorcontrib>Dréo, Johann</creatorcontrib><creatorcontrib>Siarry, Patrick</creatorcontrib><title>A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions</title><title>Ant Algorithms</title><description>Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the trail communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communication channels.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Analytical Test Function</subject><subject>Applied sciences</subject><subject>Biological Notion</subject><subject>Communication Channel</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Particle Swarm Optimization</subject><subject>Pheromonal Trail</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540441465</isbn><isbn>3540441468</isbn><isbn>3540457240</isbn><isbn>9783540457244</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2002</creationdate><recordtype>book_chapter</recordtype><recordid>eNotUctuFDEQNAQQm7B3jr5wnMTvx3G0IgQpkEtytjwe765h1h5sj1D4ejyb9KWl6qpWdTUAnzG6xgjJG9pxhjrGJWEdMli9AZe0IWcAvQUbLDDuKGX6Amy1VOcZw0zwd2CDKCKdlox-ABvNFSeUEv0RbEv5hVpRgimSG1B7-NP_hX2scJemFJ9hPx1SDvV4gk8lxAOsRw_vfPXZZncMzk6NGJ2fK-zDyY_QVvgw13AK_2wNKcK0hz-WaQViONmVXENc0lLg7RLdSimfwPu9nYrfvvYr8HT79XF3190_fPu-6-87RyRR3cj3zTcTeJQSKWtHwcXAJMOjxsRawQet2hGMYyHRwIWlkg7CWW6ZxpaO9Ap8edk729KM77ONLhQz52YsPxvMFENKksa7fuGVNooHn82Q0u9icAu9_cFQ05I159jN-ocmoK-Lc_qz-FKNXxXOx5rt5I52bnkV08xRpJVpMkI0_Q-tFYUM</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Dréo, Johann</creator><creator>Siarry, Patrick</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2002</creationdate><title>A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions</title><author>Dréo, Johann ; Siarry, Patrick</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2728-d5f852461d7708aad656b4741d912aa65b98307451670b56a373b6ca5a491a3d3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Analytical Test Function</topic><topic>Applied sciences</topic><topic>Biological Notion</topic><topic>Communication Channel</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Particle Swarm Optimization</topic><topic>Pheromonal Trail</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dréo, Johann</creatorcontrib><creatorcontrib>Siarry, Patrick</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dréo, Johann</au><au>Siarry, Patrick</au><au>Dorigo, Marco</au><au>Sampels, Michael</au><au>Di Caro, Gianni</au><au>Sampels, Michael</au><au>Di Caro, Gianni</au><au>Dorigo, Marco</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions</atitle><btitle>Ant Algorithms</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2002</date><risdate>2002</risdate><volume>2463</volume><spage>216</spage><epage>221</epage><pages>216-221</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540441465</isbn><isbn>3540441468</isbn><eisbn>3540457240</eisbn><eisbn>9783540457244</eisbn><abstract>Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the trail communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization is proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communication channels.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45724-0_18</doi><oclcid>958523329</oclcid><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Ant Algorithms, 2002, Vol.2463, p.216-221
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_14840872
source	Springer Books
subjects	Algorithmics. Computability. Computer arithmetics Analytical Test Function Applied sciences Biological Notion Communication Channel Computer science control theory systems Exact sciences and technology Flows in networks. Combinatorial problems Operational research and scientific management Operational research. Management science Particle Swarm Optimization Pheromonal Trail Theoretical computing
title	A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T15%3A39%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=A%20New%20Ant%20Colony%20Algorithm%20Using%20the%20Heterarchical%20Concept%20Aimed%20at%20Optimization%20of%20Multiminima%20Continuous%20Functions&rft.btitle=Ant%20Algorithms&rft.au=Dr%C3%A9o,%20Johann&rft.date=2002&rft.volume=2463&rft.spage=216&rft.epage=221&rft.pages=216-221&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540441465&rft.isbn_list=3540441468&rft_id=info:doi/10.1007/3-540-45724-0_18&rft_dat=%3Cproquest_pasca%3EEBC3073098_24_229%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540457240&rft.eisbn_list=9783540457244&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3073098_24_229&rft_id=info:pmid/&rfr_iscdi=true