{"id":"https://openalex.org/W2946111340","doi":"https://doi.org/10.1145/3321707.3321832","title":"Scaling techniques for parallel ant colony optimization on large problem instances","display_name":"Scaling techniques for parallel ant colony optimization on large problem instances","publication_year":2019,"publication_date":"2019-07-03","ids":{"openalex":"https://openalex.org/W2946111340","doi":"https://doi.org/10.1145/3321707.3321832","mag":"2946111340"},"language":"en","primary_location":{"id":"doi:10.1145/3321707.3321832","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321832","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://e-space.mmu.ac.uk/622804/1/gecco-2019-aco.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017282514","display_name":"Joshua Peake","orcid":"https://orcid.org/0000-0002-9462-9496"},"institutions":[{"id":"https://openalex.org/I11983389","display_name":"Manchester Metropolitan University","ror":"https://ror.org/02hstj355","country_code":"GB","type":"education","lineage":["https://openalex.org/I11983389"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Joshua Peake","raw_affiliation_strings":["Manchester Metropolitan University, Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Manchester Metropolitan University, Manchester, United Kingdom","institution_ids":["https://openalex.org/I11983389"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075723057","display_name":"Martyn Amos","orcid":"https://orcid.org/0000-0003-1680-5535"},"institutions":[{"id":"https://openalex.org/I32394136","display_name":"Northumbria University","ror":"https://ror.org/049e6bc10","country_code":"GB","type":"education","lineage":["https://openalex.org/I32394136"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martyn Amos","raw_affiliation_strings":["Northumbria University, Newcastle upon Tyne, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Northumbria University, Newcastle upon Tyne, United Kingdom","institution_ids":["https://openalex.org/I32394136"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010537832","display_name":"Paraskevas Yiapanis","orcid":"https://orcid.org/0000-0003-4924-2214"},"institutions":[{"id":"https://openalex.org/I11983389","display_name":"Manchester Metropolitan University","ror":"https://ror.org/02hstj355","country_code":"GB","type":"education","lineage":["https://openalex.org/I11983389"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paraskevas Yiapanis","raw_affiliation_strings":["Manchester Metropolitan University, Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Manchester Metropolitan University, Manchester, United Kingdom","institution_ids":["https://openalex.org/I11983389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069957801","display_name":"Huw Lloyd","orcid":"https://orcid.org/0000-0001-6537-4036"},"institutions":[{"id":"https://openalex.org/I11983389","display_name":"Manchester Metropolitan University","ror":"https://ror.org/02hstj355","country_code":"GB","type":"education","lineage":["https://openalex.org/I11983389"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Huw Lloyd","raw_affiliation_strings":["Manchester Metropolitan University, Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Manchester Metropolitan University, Manchester, United Kingdom","institution_ids":["https://openalex.org/I11983389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017282514"],"corresponding_institution_ids":["https://openalex.org/I11983389"],"apc_list":null,"apc_paid":null,"fwci":0.5318,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.72195946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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.9991000294685364,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9945999979972839,"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.8529062271118164},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7951757907867432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7018721103668213},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6688420176506042},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5737023949623108},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5246660709381104},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4856163561344147},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.48150834441185},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4621925950050354},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4598011374473572},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.44836023449897766},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4265917241573334},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4230627417564392},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.324262797832489},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2655782997608185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24625322222709656},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06680196523666382}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8529062271118164},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7951757907867432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7018721103668213},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6688420176506042},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5737023949623108},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5246660709381104},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4856163561344147},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.48150834441185},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4621925950050354},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4598011374473572},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.44836023449897766},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4265917241573334},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4230627417564392},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.324262797832489},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2655782997608185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24625322222709656},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06680196523666382},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3321707.3321832","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3321707.3321832","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:e-space.mmu.ac.uk:622804","is_oa":true,"landing_page_url":"https://e-space.mmu.ac.uk/view/authors/e1c382993556e8d94ce28df733679152.html>","pdf_url":"https://e-space.mmu.ac.uk/622804/1/gecco-2019-aco.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:nrl.northumbria.ac.uk:39016","is_oa":true,"landing_page_url":null,"pdf_url":"http://nrl.northumbria.ac.uk/id/eprint/39016/1/Peake%20et%20al%20-%20Scaling%20Techniques%20for%20Parallel%20Ant%20Colony%20Optimization%20on%20Large%20Problem%20Instances%20AAM.pdf","source":{"id":"https://openalex.org/S4306401884","display_name":"Northumbria Research Link (Northumbria University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I32394136","host_organization_name":"Northumbria University","host_organization_lineage":["https://openalex.org/I32394136"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":{"id":"pmh:oai:e-space.mmu.ac.uk:622804","is_oa":true,"landing_page_url":"https://e-space.mmu.ac.uk/view/authors/e1c382993556e8d94ce28df733679152.html>","pdf_url":"https://e-space.mmu.ac.uk/622804/1/gecco-2019-aco.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2946111340.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W180330198","https://openalex.org/W1504935863","https://openalex.org/W1515415125","https://openalex.org/W1606281225","https://openalex.org/W1890949457","https://openalex.org/W1941416453","https://openalex.org/W1981338192","https://openalex.org/W1983815113","https://openalex.org/W2003386930","https://openalex.org/W2020982711","https://openalex.org/W2063769328","https://openalex.org/W2071828883","https://openalex.org/W2089890700","https://openalex.org/W2090435272","https://openalex.org/W2106371135","https://openalex.org/W2115541969","https://openalex.org/W2154487696","https://openalex.org/W2154815356","https://openalex.org/W2164987379","https://openalex.org/W2167920923","https://openalex.org/W2171211995","https://openalex.org/W2253862598","https://openalex.org/W2289260069","https://openalex.org/W2345839474","https://openalex.org/W2421912678","https://openalex.org/W2588872537","https://openalex.org/W2593334699","https://openalex.org/W2726676844","https://openalex.org/W2749367091","https://openalex.org/W2750711431","https://openalex.org/W2795276451","https://openalex.org/W2849597502","https://openalex.org/W3151889050","https://openalex.org/W4210989800"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W2462483068","https://openalex.org/W2590879814","https://openalex.org/W3134118207","https://openalex.org/W4251004240","https://openalex.org/W2085856772","https://openalex.org/W2961293269","https://openalex.org/W1540230954","https://openalex.org/W4200602616","https://openalex.org/W2559478821"],"abstract_inverted_index":{"Ant":[0,147],"Colony":[1],"Optimization":[2],"(ACO)":[3],"is":[4,31,59],"a":[5,15,22,60,73,92,111,119,142],"nature-inspired":[6],"optimization":[7],"metaheuristic":[8],"which":[9,40,84],"has":[10],"been":[11],"successfully":[12],"applied":[13],"to":[14],"wide":[16],"range":[17],"of":[18,28,76,91,95,113,141,145,151,181],"different":[19],"problems.":[20],"However,":[21],"significant":[23],"limiting":[24,61],"factor":[25],"in":[26,34,118],"terms":[27],"its":[29],"scalability":[30],"memory":[32,57,82],"complexity;":[33],"many":[35],"problems,":[36],"the":[37,49,77,107,122,130,138,165,182],"pheromone":[38,78,86],"matrix":[39,79],"encodes":[41],"trails":[42],"left":[43],"by":[44,127,168],"ants":[45],"grows":[46],"quadratically":[47],"with":[48,80],"instance":[50],"size.":[51],"For":[52],"very":[53],"large":[54],"instances,":[55,136],"this":[56,69,152],"requirement":[58],"factor,":[62],"making":[63],"ACO":[64,128,161],"an":[65],"impractical":[66],"technique.":[67],"In":[68],"paper":[70],"we":[71,116,172],"propose":[72],"restricted":[74],"variant":[75],"linear":[81],"complexity,":[83],"stores":[85],"values":[87],"only":[88],"for":[89,104],"members":[90],"candidate":[93,108],"set":[94],"next":[96],"moves.":[97],"We":[98,157],"also":[99],"evaluate":[100],"two":[101],"selection":[102],"methods":[103],"moves":[105],"outside":[106],"set.":[109],"Using":[110],"combination":[112],"these":[114],"techniques":[115],"achieve,":[117],"reasonable":[120],"time,":[121],"best":[123,183],"solution":[124],"qualities":[125],"recorded":[126],"on":[129,149],"Art":[131],"TSP":[132],"Traveling":[133],"Salesman":[134],"Problem":[135],"and":[137],"first":[139],"evaluation":[140],"parallel":[143],"implementation":[144],"MAX-MIN":[146],"System":[148],"instances":[150],"scale":[153],"(\u2265":[154],"105":[155],"vertices).":[156],"find":[158,174],"that,":[159],"although":[160],"cannot":[162],"yet":[163],"achieve":[164],"solutions":[166,176],"found":[167],"state-of-the-art":[169],"genetic":[170],"algorithms,":[171],"rapidly":[173],"approximate":[175],"within":[177],"1":[178],"--":[179],"2%":[180],"known.":[184]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}