{"id":"https://openalex.org/W1072516","doi":null,"title":"On Optimal Parameters for Ant Colony Optimization Algorithms.","display_name":"On Optimal Parameters for Ant Colony Optimization Algorithms.","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1072516","mag":"1072516"},"language":"en","primary_location":{"id":"mag:1072516","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/icai/icai2005-1.html#GaertnerC05","pdf_url":null,"source":{"id":"https://openalex.org/S4306419142","display_name":"International Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1072516"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009042838","display_name":"Dorian Gaertner","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dorian Gaertner","raw_affiliation_strings":["Imperial College London,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College London,#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033091818","display_name":"Keith Clark","orcid":"https://orcid.org/0009-0008-1046-1368","observed_orcids":["https://orcid.org/0009-0008-1046-1368"]},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Keith Clark","raw_affiliation_strings":["Imperial College London,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College London,#TAB#","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":3.9253,"has_fulltext":false,"cited_by_count":116,"citation_normalized_percentile":{"value":0.94383855,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"83","last_page":"89"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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":1.0,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.9990000128746033},{"id":"https://openalex.org/keywords/parameter-tuning","display_name":"parameter tuning","score":0.8820000290870667},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.7960000038146973},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8149999976158142},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"hybrid genetic algorithm","score":0.6940000057220459},{"id":"https://openalex.org/keywords/problem-classification","display_name":"problem classification","score":0.4449999928474426},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.7059999704360962},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8529999852180481}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8149634599685669},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7147427797317505},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6724863052368164},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6703853607177734},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6320444345474243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5546883940696716},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5412061214447021},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5334805250167847},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.5318989753723145},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5031031966209412},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4955817461013794},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.47159847617149353},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43989819288253784},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.43620288372039795},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42879438400268555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35179001092910767},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09932491183280945},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1072516","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/icai/icai2005-1.html#GaertnerC05","pdf_url":null,"source":{"id":"https://openalex.org/S4306419142","display_name":"International Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Artificial Intelligence","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.6751","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.6751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tweetypie.doc.ic.ac.uk/~dg00/twiki/data/Publications/ICAI-GaertnerClark-Accepted.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1524454700","https://openalex.org/W1528149415","https://openalex.org/W1530715683","https://openalex.org/W1532654511","https://openalex.org/W1535715099","https://openalex.org/W1551741615","https://openalex.org/W1587263632","https://openalex.org/W1595870065","https://openalex.org/W1664011265","https://openalex.org/W1890949457","https://openalex.org/W2070359394","https://openalex.org/W2107941094","https://openalex.org/W2118051273","https://openalex.org/W2140481494","https://openalex.org/W2154929945","https://openalex.org/W2171211995","https://openalex.org/W3029291419"],"related_works":["https://openalex.org/W7171937553","https://openalex.org/W3157599146","https://openalex.org/W3153582623","https://openalex.org/W2364872207","https://openalex.org/W2358044770","https://openalex.org/W4392839427","https://openalex.org/W2116098622","https://openalex.org/W2021750977","https://openalex.org/W1987450220","https://openalex.org/W2769841005"],"abstract_inverted_index":{"Ant":[0],"Colony":[1],"Optimization":[2],"(ACO)":[3],"is":[4],"a":[5,64,130,138,152,162,173,182,189],"metaheuristic":[6],"introduced":[7],"by":[8],"Dorigo":[9],"et":[10],"al.":[11],"[9]":[12],"which":[13,150],"uses":[14,151],"ideas":[15],"from":[16],"nature":[17],"to":[18,21,59,85,104,120,143,159],"find":[19],"solutions":[20,62],"instances":[22,71],"of":[23,42,50,63,75,89,114,164,185,191],"the":[24,39,43,48,111,115,126,144,156],"Travelling":[25],"Salesman":[26],"Problem":[27],"(TSP)":[28],"and":[29,53,77,108,136],"other":[30],"combinatorial":[31],"optimisation":[32],"problems.":[33],"In":[34],"this":[35],"paper":[36],"we":[37],"analyse":[38],"parameter":[40,93,102,170,196],"settings":[41,94,103,171],"ACO":[44,140],"algorithm.":[45],"These":[46],"determine":[47],"behaviour":[49],"each":[51],"ant":[52],"are":[54],"critical":[55],"for":[56,95,123,129,172,181],"fast":[57,96],"convergence":[58],"near":[60,167],"optimal":[61,101,127,168],"given":[65,131,174,188],"problem":[66],"instance.":[67,133],"We":[68,79,98,134],"classify":[69],"TSP":[70,90,132],"using":[72],"three":[73],"measures":[74],"complexity":[76],"uniformity.":[78],"describe":[80],"experimental":[81],"work":[82],"that":[83],"attempts":[84],"correlate":[86],"\u2018types":[87],"\u2019":[88,161],"problems":[91,186],"with":[92,193],"convergence.":[97],"found":[99],"these":[100],"be":[105],"highly":[106],"problemspecific":[107],"dependent":[109],"on":[110],"required":[112],"accuracy":[113],"solution.":[116],"This":[117,176],"inspired":[118],"us":[119],"explore":[121],"techniques":[122],"automatically":[124],"learning":[125],"parameters":[128],"devised":[135],"implemented":[137],"hybrid":[139,177],"algorithm,":[141],"similar":[142],"one":[145],"independently":[146],"developed":[147],"in":[148,155],"[16],":[149],"genetic":[153],"algorithm":[154,178],"early":[157],"stages":[158],"\u2018breed":[160],"population":[163,190],"ants":[165,192],"possessing":[166],"behavioural":[169,195],"problem.":[175],"converges":[179],"rapidly":[180],"wide":[183],"range":[184],"when":[187],"diverse":[194],"settings.":[197]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1072516","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
