{"id":"https://openalex.org/W1972400833","doi":"https://doi.org/10.1142/s1469026803000938","title":"THE ACCUMULATED EXPERIENCE ANT COLONY FOR THE TRAVELING SALESMAN PROBLEM","display_name":"THE ACCUMULATED EXPERIENCE ANT COLONY FOR THE TRAVELING SALESMAN PROBLEM","publication_year":2003,"publication_date":"2003-06-01","ids":{"openalex":"https://openalex.org/W1972400833","doi":"https://doi.org/10.1142/s1469026803000938","mag":"1972400833"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026803000938","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026803000938","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.bond.edu.au/ws/files/30066888/AM_The_accumulated_experience_ant_colony_for_the_travelling_salesman_problem.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024921295","display_name":"James Montgomery","orcid":"https://orcid.org/0000-0002-5360-7514"},"institutions":[{"id":"https://openalex.org/I120125038","display_name":"Bond University","ror":"https://ror.org/006jxzx88","country_code":"AU","type":"education","lineage":["https://openalex.org/I120125038"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"JAMES MONTGOMERY","raw_affiliation_strings":["School of Information Technology,  Bond University, QLD 4229, Australia","School of Information Technology, Bond University, Qld 4229, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology,  Bond University, QLD 4229, Australia","institution_ids":["https://openalex.org/I120125038"]},{"raw_affiliation_string":"School of Information Technology, Bond University, Qld 4229, Australia","institution_ids":["https://openalex.org/I120125038"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073782726","display_name":"Marcus Randall","orcid":"https://orcid.org/0000-0003-2325-1032"},"institutions":[{"id":"https://openalex.org/I120125038","display_name":"Bond University","ror":"https://ror.org/006jxzx88","country_code":"AU","type":"education","lineage":["https://openalex.org/I120125038"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"MARCUS RANDALL","raw_affiliation_strings":["School of Information Technology,  Bond University, QLD 4229, Australia","School of Information Technology, Bond University, Qld 4229, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology,  Bond University, QLD 4229, Australia","institution_ids":["https://openalex.org/I120125038"]},{"raw_affiliation_string":"School of Information Technology, Bond University, Qld 4229, Australia","institution_ids":["https://openalex.org/I120125038"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3442,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.8935701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"03","issue":"02","first_page":"189","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9295642375946045},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8360005021095276},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6389738917350769},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5920947790145874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5841650366783142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5737296938896179},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5491734147071838},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5074836611747742},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.49342837929725647},{"id":"https://openalex.org/keywords/ant","display_name":"ANT","score":0.45933499932289124},{"id":"https://openalex.org/keywords/rest","display_name":"Rest (music)","score":0.4187442660331726},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3425270915031433},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.33882489800453186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24423083662986755}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9295642375946045},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8360005021095276},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6389738917350769},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5920947790145874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5841650366783142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5737296938896179},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5491734147071838},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5074836611747742},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.49342837929725647},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.45933499932289124},{"id":"https://openalex.org/C77265313","wikidata":"https://www.wikidata.org/wiki/Q879844","display_name":"Rest (music)","level":2,"score":0.4187442660331726},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3425270915031433},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33882489800453186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24423083662986755},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C164705383","wikidata":"https://www.wikidata.org/wiki/Q10379","display_name":"Cardiology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1142/s1469026803000938","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026803000938","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"},{"id":"pmh:oai:https://pure.bond.edu.au/:publications/42615eeb-8ae6-4b33-860c-4f0ee907ff46","is_oa":true,"landing_page_url":"https://research.bond.edu.au/en/publications/42615eeb-8ae6-4b33-860c-4f0ee907ff46","pdf_url":"https://pure.bond.edu.au/ws/files/30066888/AM_The_accumulated_experience_ant_colony_for_the_travelling_salesman_problem.pdf","source":{"id":"https://openalex.org/S4306402608","display_name":"Bond University Research Portal (Bond University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I120125038","host_organization_name":"Bond University","host_organization_lineage":["https://openalex.org/I120125038"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Randall, M & Montgomery, J 2003, 'The accumulated experience ant colony for the travelling salesman problem', International Journal of Computational Intelligence and Applications, vol. 3, no. 2, pp. 189-198. https://doi.org/10.1142/S1469026803000938","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ecite.utas.edu.au:97254","is_oa":false,"landing_page_url":"http://ecite.utas.edu.au/97254","pdf_url":null,"source":{"id":"https://openalex.org/S4306401569","display_name":"eCite Digital Repository (University of Tasmania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129801699","host_organization_name":"University of Tasmania","host_organization_lineage":["https://openalex.org/I129801699"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Refereed Article"},{"id":"pmh:oai:https://pure.bond.edu.au/:Publications/42615eeb-8ae6-4b33-860c-4f0ee907ff46","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402608","display_name":"Bond University Research Portal (Bond University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I120125038","host_organization_name":"Bond University","host_organization_lineage":["https://openalex.org/I120125038"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:researchbank.swinburne.edu.au:9220fbc6-e230-4e29-94a0-3a1404af5530/1","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.3/26111","pdf_url":null,"source":{"id":"https://openalex.org/S4306401157","display_name":"Swinburne Research Bank (Swinburne University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I57093077","host_organization_name":"Swinburne University of Technology","host_organization_lineage":["https://openalex.org/I57093077"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computational Intelligence and Applications, Vol. 3, no. 2 (June 2003), pp. 189-198","raw_type":""}],"best_oa_location":{"id":"pmh:oai:https://pure.bond.edu.au/:publications/42615eeb-8ae6-4b33-860c-4f0ee907ff46","is_oa":true,"landing_page_url":"https://research.bond.edu.au/en/publications/42615eeb-8ae6-4b33-860c-4f0ee907ff46","pdf_url":"https://pure.bond.edu.au/ws/files/30066888/AM_The_accumulated_experience_ant_colony_for_the_travelling_salesman_problem.pdf","source":{"id":"https://openalex.org/S4306402608","display_name":"Bond University Research Portal (Bond University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I120125038","host_organization_name":"Bond University","host_organization_lineage":["https://openalex.org/I120125038"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Randall, M & Montgomery, J 2003, 'The accumulated experience ant colony for the travelling salesman problem', International Journal of Computational Intelligence and Applications, vol. 3, no. 2, pp. 189-198. https://doi.org/10.1142/S1469026803000938","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1972400833.pdf","grobid_xml":"https://content.openalex.org/works/W1972400833.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W149009998","https://openalex.org/W1565321533","https://openalex.org/W1587263632","https://openalex.org/W2072360297","https://openalex.org/W2154929945","https://openalex.org/W2163428398"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W4245157707","https://openalex.org/W1547053391","https://openalex.org/W2908391583","https://openalex.org/W1521781013","https://openalex.org/W2208777194","https://openalex.org/W2369428395","https://openalex.org/W1997193297","https://openalex.org/W2462483068"],"abstract_inverted_index":{"Ant":[0,82],"colony":[1,90],"optimization":[2],"techniques":[3],"are":[4,36,114],"usually":[5,31],"guided":[6],"by":[7],"pheromone":[8,105],"and":[9,106,118],"heuristic":[10,107],"cost":[11],"information":[12],"when":[13],"choosing":[14],"the":[15,65,68,85,89,94,103,112,116,133,147],"next":[16],"element":[17,27],"to":[18,20,91,102],"add":[19],"a":[21,43,47,60],"solution.":[22],"However,":[23],"while":[24,146],"an":[25,55,119],"individual":[26],"may":[28,51,70],"be":[29,52,71],"attractive,":[30],"its":[32],"long":[33],"term":[34],"consequences":[35],"neither":[37],"known":[38],"nor":[39],"considered.":[40],"For":[41],"instance,":[42],"short":[44],"link":[45,76],"in":[46,93,100],"traveling":[48],"salesman":[49],"problem":[50],"incorporated":[53],"into":[54],"ant's":[56],"solution,":[57],"yet,":[58],"as":[59],"consequence":[61],"of":[62,67,88,96,111,126],"this":[63],"link,":[64],"rest":[66],"path":[69],"longer":[72],"than":[73,143],"if":[74],"another":[75],"was":[77],"chosen.":[78],"The":[79,129],"Accumulated":[80],"Experience":[81],"Colony":[83],"uses":[84],"previous":[86],"experiences":[87],"guide":[92],"choice":[95],"elements.":[97],"This":[98],"is":[99],"addition":[101],"normal":[104],"costs.":[108],"Two":[109],"versions":[110],"algorithm":[113,135,149],"presented,":[115],"original":[117,134],"improved":[120,137,148],"AEAC":[121],"that":[122,132],"makes":[123],"greater":[124],"use":[125],"accumulated":[127],"experience.":[128],"results":[130],"indicate":[131],"finds":[136,150],"solutions":[138,152],"on":[139,153],"problems":[140],"with":[141],"less":[142],"100":[144],"cities,":[145],"better":[151],"larger":[154],"problems.":[155]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}