{"id":"https://openalex.org/W1988607827","doi":"https://doi.org/10.1109/cec.2013.6557810","title":"Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem","display_name":"Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1988607827","doi":"https://doi.org/10.1109/cec.2013.6557810","mag":"1988607827"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","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/A5081060064","display_name":"Samadhi Nallaperuma","orcid":null},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Samadhi Nallaperuma","raw_affiliation_strings":["Evolutionary Computation Group School of Computer Science, University of Adelaide, Adelaide, SA, Australia","Evolutionary Comput. Group, Univ. of Adelaide, Adelaide, SA, Australia"],"affiliations":[{"raw_affiliation_string":"Evolutionary Computation Group School of Computer Science, University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"Evolutionary Comput. Group, Univ. of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["Department of Computer Science, Colorado State University, Fort Collins, CO, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Evolutionary Computation Group School of Computer Science, University of Adelaide, Adelaide, SA, Australia","Evolutionary Comput. Group, Univ. of Adelaide, Adelaide, SA, Australia"],"affiliations":[{"raw_affiliation_string":"Evolutionary Computation Group School of Computer Science, University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"Evolutionary Comput. Group, Univ. of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081060064"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":0.4809,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74599035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2045","last_page":"2052"},"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.9905999898910522,"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.9857000112533569,"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.7023558020591736},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6705882549285889},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.6377929449081421},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5932015180587769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5759376287460327},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5664349794387817},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.53891521692276},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5303894877433777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.525033712387085},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40810444951057434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35006260871887207}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7023558020591736},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6705882549285889},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6377929449081421},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5932015180587769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5759376287460327},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5664349794387817},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.53891521692276},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5303894877433777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.525033712387085},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40810444951057434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35006260871887207},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2013.6557810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/83854","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/83854","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1109/cec.2013.6557810","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W116475295","https://openalex.org/W1605768620","https://openalex.org/W1683332710","https://openalex.org/W1801849579","https://openalex.org/W1992220653","https://openalex.org/W2011904305","https://openalex.org/W2039865013","https://openalex.org/W2042096932","https://openalex.org/W2050441104","https://openalex.org/W2088415500","https://openalex.org/W2100137329","https://openalex.org/W2111090561","https://openalex.org/W2143945515","https://openalex.org/W2144045033","https://openalex.org/W2963098446","https://openalex.org/W4234274482","https://openalex.org/W4236296313","https://openalex.org/W4252684946","https://openalex.org/W4292230561","https://openalex.org/W4292408555"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2981400081"],"abstract_inverted_index":{"We":[0,65],"propose":[1],"a":[2],"new":[3],"construction":[4,68],"procedure":[5,35,69],"for":[6,41],"ant":[7],"colony":[8],"optimization":[9,86],"(ACO)":[10],"algorithms":[11,44],"working":[12],"on":[13,24,50,87],"the":[14,22,25,29,32,53,59,67,71,90],"Euclidean":[15],"traveling":[16],"salesperson":[17],"problem":[18],"(TSP)":[19],"that":[20,45,80],"preserves":[21],"ordering":[23],"convex":[26],"hull":[27],"of":[28,55,58,92],"points":[30,57,94],"in":[31],"instance.":[33],"The":[34],"is":[36,61,95],"inspired":[37],"by":[38],"theoretical":[39],"analyses":[40],"simple":[42],"evolutionary":[43],"are":[46],"provably":[47],"more":[48,84],"efficient":[49,85],"instances":[51,88],"where":[52,89],"number":[54,91],"inner":[56,93],"instance":[60],"not":[62,96],"too":[63,97],"large.":[64],"integrate":[66],"into":[70],"well-known":[72],"MaxMin":[73],"Ant":[74],"System":[75],"(MMAS)":[76],"and":[77],"empirically":[78],"show":[79],"it":[81],"leads":[82],"to":[83],"high.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}