File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: An improved ant colony optimization algorithm for solving the TSP problem

TitleAn improved ant colony optimization algorithm for solving the TSP problem
Authors
KeywordsAnt colony algorithm
Magnetic force
Traveling salesman problem
Issue Date2010
Citation
Applied Mechanics and Materials, 2010, v. 26-28, p. 620-624 How to Cite?
AbstractThis paper presents a modified Ant Colony Algorithm(ACA) called route-update ant colony algorithm(RUACA). The research attention is focused on improving the computational efficiency in the TSP problem. A new impact factor is introduced and proved to be effective for reducing the convergence time in the RUACA performance. In order to assess the RUACA performance, a simply supported data set of cities, which was taken as the source data in previous research using traditional ACA and genetic algorithm(GA), is chosen as a benchmark case study. Comparing with the ACA and GA results, it is shown that the presented RUACA has successfully solved the TSP problem. The results of the proposed algorithm are found to be satisfactory. © (2010) Trans Tech Publications.
Persistent Identifierhttp://hdl.handle.net/10722/296232
ISSN
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorDu, Zhanwei-
dc.contributor.authorYang, Yongjian-
dc.contributor.authorSun, Yongxiong-
dc.contributor.authorZhang, Chijun-
dc.contributor.authorLi, Tuanliang-
dc.date.accessioned2021-02-11T04:53:07Z-
dc.date.available2021-02-11T04:53:07Z-
dc.date.issued2010-
dc.identifier.citationApplied Mechanics and Materials, 2010, v. 26-28, p. 620-624-
dc.identifier.issn1660-9336-
dc.identifier.urihttp://hdl.handle.net/10722/296232-
dc.description.abstractThis paper presents a modified Ant Colony Algorithm(ACA) called route-update ant colony algorithm(RUACA). The research attention is focused on improving the computational efficiency in the TSP problem. A new impact factor is introduced and proved to be effective for reducing the convergence time in the RUACA performance. In order to assess the RUACA performance, a simply supported data set of cities, which was taken as the source data in previous research using traditional ACA and genetic algorithm(GA), is chosen as a benchmark case study. Comparing with the ACA and GA results, it is shown that the presented RUACA has successfully solved the TSP problem. The results of the proposed algorithm are found to be satisfactory. © (2010) Trans Tech Publications.-
dc.languageeng-
dc.relation.ispartofApplied Mechanics and Materials-
dc.subjectAnt colony algorithm-
dc.subjectMagnetic force-
dc.subjectTraveling salesman problem-
dc.titleAn improved ant colony optimization algorithm for solving the TSP problem-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.4028/www.scientific.net/AMM.26-28.620-
dc.identifier.scopuseid_2-s2.0-78650888637-
dc.identifier.volume26-28-
dc.identifier.spage620-
dc.identifier.epage624-
dc.identifier.eissn1662-7482-
dc.identifier.isiWOS:000303181700125-
dc.identifier.issnl1660-9336-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats