{"id":"https://openalex.org/W2026856444","doi":"https://doi.org/10.1145/1389095.1389100","title":"Scaling ant colony optimization with hierarchical reinforcement learning partitioning","display_name":"Scaling ant colony optimization with hierarchical reinforcement learning partitioning","publication_year":2008,"publication_date":"2008-07-12","ids":{"openalex":"https://openalex.org/W2026856444","doi":"https://doi.org/10.1145/1389095.1389100","mag":"2026856444"},"language":"en","primary_location":{"id":"doi:10.1145/1389095.1389100","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5042890112","display_name":"Erik J. Dries","orcid":null},"institutions":[{"id":"https://openalex.org/I55061410","display_name":"U.S. Air Force Institute of Technology","ror":"https://ror.org/03f9f1d95","country_code":"US","type":"education","lineage":["https://openalex.org/I1294991024","https://openalex.org/I1330347796","https://openalex.org/I1330347796","https://openalex.org/I2802362820","https://openalex.org/I4210089612","https://openalex.org/I4210102105","https://openalex.org/I4210102105","https://openalex.org/I55061410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik J. Dries","raw_affiliation_strings":["Air Force Institute of Technology, Wright-Patterson AFB, OH, USA","Air Force Institute of Technology, Wright Patterson AFB, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Air Force Institute of Technology, Wright-Patterson AFB, OH, USA","institution_ids":["https://openalex.org/I55061410"]},{"raw_affiliation_string":"Air Force Institute of Technology, Wright Patterson AFB, OH, USA","institution_ids":["https://openalex.org/I55061410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085916845","display_name":"Gilbert L. Peterson","orcid":"https://orcid.org/0000-0002-6241-3084"},"institutions":[{"id":"https://openalex.org/I55061410","display_name":"U.S. Air Force Institute of Technology","ror":"https://ror.org/03f9f1d95","country_code":"US","type":"education","lineage":["https://openalex.org/I1294991024","https://openalex.org/I1330347796","https://openalex.org/I1330347796","https://openalex.org/I2802362820","https://openalex.org/I4210089612","https://openalex.org/I4210102105","https://openalex.org/I4210102105","https://openalex.org/I55061410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gilbert L. Peterson","raw_affiliation_strings":["Air Force Institute of Technology, Wright-Patterson AFB, OH, USA","Air Force Institute of Technology, Wright Patterson AFB, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Air Force Institute of Technology, Wright-Patterson AFB, OH, USA","institution_ids":["https://openalex.org/I55061410"]},{"raw_affiliation_string":"Air Force Institute of Technology, Wright Patterson AFB, OH, USA","institution_ids":["https://openalex.org/I55061410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55061410"],"apc_list":null,"apc_paid":null,"fwci":0.5036,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.59388697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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.9983000159263611,"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.998199999332428,"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.9853000044822693,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.862289547920227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8065367937088013},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6952594518661499},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5827526450157166},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5813624858856201},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5168164968490601},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4693281054496765},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3957369923591614},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3640391528606415},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36208346486091614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11626487970352173}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.862289547920227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8065367937088013},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6952594518661499},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5827526450157166},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5813624858856201},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5168164968490601},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4693281054496765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3957369923591614},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3640391528606415},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36208346486091614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11626487970352173},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1389095.1389100","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:ADA476631","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA476631","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1515851193","https://openalex.org/W1566652554","https://openalex.org/W1573676079","https://openalex.org/W1585610988","https://openalex.org/W1592847719","https://openalex.org/W1930648503","https://openalex.org/W2109910161","https://openalex.org/W2120348968","https://openalex.org/W2121517924","https://openalex.org/W2126554879","https://openalex.org/W2127218421","https://openalex.org/W2150753219","https://openalex.org/W2154929945","https://openalex.org/W2158548602","https://openalex.org/W2165131254","https://openalex.org/W3011120880","https://openalex.org/W4292083457","https://openalex.org/W6682346614"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2981400081","https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W1997193297"],"abstract_inverted_index":{"This":[0,25,94,110,156],"paper":[1,26,111,157],"merges":[2],"hierarchical":[3,47],"reinforcement":[4,83],"learning":[5],"(HRL)":[6],"with":[7,57,86,145,170,178],"ant":[8,48,89],"colony":[9,49,90],"optimization":[10,91],"(ACO)":[11],"to":[12,39,59,77,98,116,128,149,185],"produce":[13],"a":[14,37,46,130],"HRL":[15,42,114,127],"ACO":[16,76,118,147],"algorithm":[17,80,141,148,169],"capable":[18],"of":[19,31,66,75,107,188],"generating":[20],"solutions":[21,67,99,174],"for":[22,68,135],"large":[23],"domains.":[24,72],"describes":[27],"two":[28,159],"specific":[29],"implementations":[30,53],"the":[32,35,44,64,69,78,82,87,108,117,136,151,168,186],"new":[33],"algorithm:":[34],"first":[36],"modification":[38],"Dietterich's":[40],"MAXQ-Q":[41,79,104],"algorithm,":[43,95],"second":[45],"system":[50],"algorithm.":[51],"These":[52],"generate":[54],"faster":[55,177],"results,":[56],"little":[58],"no":[60],"significant":[61],"change":[62],"in":[63,105,181],"quality":[65,183],"tested":[70],"problem":[71,123],"The":[73,165],"application":[74],"replaces":[81],"learning,":[84],"Q-learning,":[85],"modified":[88],"method,":[92],"Ant-Q.":[93],"MAXQ-AntQ,":[96],"converges":[97],"not":[100],"significantly":[101],"different":[102],"from":[103],"88%":[106],"time.":[109],"then":[112],"transfers":[113],"techniques":[115],"domain":[119],"and":[120,153,163],"traveling":[121],"salesman":[122],"(TSP).":[124],"To":[125],"apply":[126],"ACO,":[129],"hierarchy":[131],"must":[132],"be":[133],"created":[134],"TSP.":[137],"A":[138],"data":[139,171],"clustering":[140,160,172],"creates":[142],"these":[143],"subtasks,":[144],"an":[146],"solve":[150],"individual":[152],"complete":[154],"problems.":[155],"tests":[158],"algorithms,":[161],"k-means":[162],"G-means.":[164],"results":[166],"demonstrate":[167],"produces":[173],"20":[175],"times":[176],"5-10%":[179],"decrease":[180],"solution":[182],"due":[184],"effects":[187],"clustering.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}