Improving ant systems using a local updating rule

An algorithm based on ant colony system for solving traveling salesman problem is proposed. The new algorithm, introduces in ant colony system an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved to...

Full description

Saved in:
Bibliographic Details
Main Authors: Pintea, C.-M., Dumitrescu, D.
Format: Conference Proceeding
Language:English
Subjects:
Ant colony optimization
Chemicals
Educational institutions
Feedback
NP-hard problem
Partitioning algorithms
Routing
Scheduling algorithm
Traveling salesman problems
Vehicles
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page 4 pp.
container_title
container_volume
creator Pintea, C.-M.
Dumitrescu, D.
description An algorithm based on ant colony system for solving traveling salesman problem is proposed. The new algorithm, introduces in ant colony system an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved tours.
doi_str_mv 10.1109/SYNASC.2005.38
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1595863</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1595863</ieee_id><sourcerecordid>1595863</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-270f546823df6115109ac7de5f24aa8eaa1459a31cf65872dc76daaa55b2db773</originalsourceid><addsrcrecordid>eNotjjtrwzAURgWlkDbJmiWL_oBdXclXjzGYPgKhHZIOncKNJQUXOzGWXci_b_o4ywdn-DiMLUDkAMI9bD9eV9syl0JgruwNuxdGO5QFKjlh85Q-xRXltDL6jsG67frzV306cjoNPF3SENrEx_RreHOuqOFj52n4Ef3YhBm7jdSkMP_fKXt_etyVL9nm7XldrjZZDQaHTBoRsdBWKh81AF7LqDI-YJQFkQ1EUKAjBVXUaI30ldGeiBAP0h-MUVO2_PutQwj7rq9b6i97QIdWK_UNvalB8Q</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Improving ant systems using a local updating rule</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Pintea, C.-M. ; Dumitrescu, D.</creator><creatorcontrib>Pintea, C.-M. ; Dumitrescu, D.</creatorcontrib><description>An algorithm based on ant colony system for solving traveling salesman problem is proposed. The new algorithm, introduces in ant colony system an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved tours.</description><identifier>ISBN: 0769524532</identifier><identifier>ISBN: 9780769524535</identifier><identifier>DOI: 10.1109/SYNASC.2005.38</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ant colony optimization ; Chemicals ; Educational institutions ; Feedback ; NP-hard problem ; Partitioning algorithms ; Routing ; Scheduling algorithm ; Traveling salesman problems ; Vehicles</subject><ispartof>Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005, p.4 pp.</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/1595863$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1595863$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Pintea, C.-M.</creatorcontrib><creatorcontrib>Dumitrescu, D.</creatorcontrib><title>Improving ant systems using a local updating rule</title><title>Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)</title><addtitle>SYNASC</addtitle><description>An algorithm based on ant colony system for solving traveling salesman problem is proposed. The new algorithm, introduces in ant colony system an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved tours.</description><subject>Ant colony optimization</subject><subject>Chemicals</subject><subject>Educational institutions</subject><subject>Feedback</subject><subject>NP-hard problem</subject><subject>Partitioning algorithms</subject><subject>Routing</subject><subject>Scheduling algorithm</subject><subject>Traveling salesman problems</subject><subject>Vehicles</subject><isbn>0769524532</isbn><isbn>9780769524535</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjjtrwzAURgWlkDbJmiWL_oBdXclXjzGYPgKhHZIOncKNJQUXOzGWXci_b_o4ywdn-DiMLUDkAMI9bD9eV9syl0JgruwNuxdGO5QFKjlh85Q-xRXltDL6jsG67frzV306cjoNPF3SENrEx_RreHOuqOFj52n4Ef3YhBm7jdSkMP_fKXt_etyVL9nm7XldrjZZDQaHTBoRsdBWKh81AF7LqDI-YJQFkQ1EUKAjBVXUaI30ldGeiBAP0h-MUVO2_PutQwj7rq9b6i97QIdWK_UNvalB8Q</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Pintea, C.-M.</creator><creator>Dumitrescu, D.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Improving ant systems using a local updating rule</title><author>Pintea, C.-M. ; Dumitrescu, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-270f546823df6115109ac7de5f24aa8eaa1459a31cf65872dc76daaa55b2db773</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Ant colony optimization</topic><topic>Chemicals</topic><topic>Educational institutions</topic><topic>Feedback</topic><topic>NP-hard problem</topic><topic>Partitioning algorithms</topic><topic>Routing</topic><topic>Scheduling algorithm</topic><topic>Traveling salesman problems</topic><topic>Vehicles</topic><toplevel>online_resources</toplevel><creatorcontrib>Pintea, C.-M.</creatorcontrib><creatorcontrib>Dumitrescu, D.</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/IET Electronic Library (IEL)</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>Pintea, C.-M.</au><au>Dumitrescu, D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Improving ant systems using a local updating rule</atitle><btitle>Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)</btitle><stitle>SYNASC</stitle><date>2005</date><risdate>2005</risdate><spage>4 pp.</spage><pages>4 pp.-</pages><isbn>0769524532</isbn><isbn>9780769524535</isbn><abstract>An algorithm based on ant colony system for solving traveling salesman problem is proposed. The new algorithm, introduces in ant colony system an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved tours.</abstract><pub>IEEE</pub><doi>10.1109/SYNASC.2005.38</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769524532
ispartof Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005, p.4 pp.
issn
language eng
recordid cdi_ieee_primary_1595863
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Ant colony optimization
Chemicals
Educational institutions
Feedback
NP-hard problem
Partitioning algorithms
Routing
Scheduling algorithm
Traveling salesman problems
Vehicles
title Improving ant systems using a local updating rule
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T18%3A04%3A26IST&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=Improving%20ant%20systems%20using%20a%20local%20updating%20rule&rft.btitle=Seventh%20International%20Symposium%20on%20Symbolic%20and%20Numeric%20Algorithms%20for%20Scientific%20Computing%20(SYNASC'05)&rft.au=Pintea,%20C.-M.&rft.date=2005&rft.spage=4%20pp.&rft.pages=4%20pp.-&rft.isbn=0769524532&rft.isbn_list=9780769524535&rft_id=info:doi/10.1109/SYNASC.2005.38&rft_dat=%3Cieee_6IE%3E1595863%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-270f546823df6115109ac7de5f24aa8eaa1459a31cf65872dc76daaa55b2db773%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1595863&rfr_iscdi=true