{"id":"https://openalex.org/W1986602966","doi":"https://doi.org/10.1109/cec.2013.6557809","title":"Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem","display_name":"Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1986602966","doi":"https://doi.org/10.1109/cec.2013.6557809","mag":"1986602966"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557809","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, 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, 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, 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, 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":2.4044,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89663514,"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":"2037","last_page":"2044"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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.9988999962806702,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7847699522972107},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7014890313148499},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5980469584465027},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5811190009117126},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5786597728729248},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5223245024681091},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5192530155181885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4976184666156769},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.43144288659095764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42759254574775696},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.324053019285202},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29979780316352844}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7847699522972107},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7014890313148499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5980469584465027},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5811190009117126},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5786597728729248},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5223245024681091},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5192530155181885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4976184666156769},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.43144288659095764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42759254574775696},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.324053019285202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29979780316352844},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2013.6557809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557809","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/82586","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/82586","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.6557809","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W116475295","https://openalex.org/W1541087579","https://openalex.org/W1631204983","https://openalex.org/W1971483538","https://openalex.org/W1981898306","https://openalex.org/W2055569927","https://openalex.org/W2079247611","https://openalex.org/W2086054344","https://openalex.org/W2088415500","https://openalex.org/W2100137329","https://openalex.org/W2111090561","https://openalex.org/W2144045033","https://openalex.org/W2963098446","https://openalex.org/W4213327093","https://openalex.org/W4234274482","https://openalex.org/W4251391716","https://openalex.org/W4252684946","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W54441500","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2073288620","https://openalex.org/W2356976268"],"abstract_inverted_index":{"Recently,":[0],"Sutton":[1],"and":[2,28,73,150,154],"Neumann":[3],"[1]":[4],"have":[5,35],"studied":[6],"evolutionary":[7,39,76,112],"algorithms":[8,40,77,113],"for":[9,43,78,102,114,143,169],"the":[10,22,29,44,79,98,103,115,120,147,173],"Euclidean":[11,80,116],"traveling":[12],"salesman":[13],"problem":[14,83,138],"by":[15,119,140],"parameterized":[16,118],"runtime":[17],"analyses":[18],"taking":[19],"into":[20],"account":[21],"number":[23,30,99,121],"of":[24,31,122,131,146,158],"inner":[25,100,123,148,174],"points":[26,101,149,175],"k":[27,93],"cities":[32],"n.":[33],"They":[34],"shown":[36],"that":[37,84,167],"simple":[38],"are":[41,109],"XP-algorithms":[42],"problem,":[45],"i.e.,":[46,107],"they":[47,108],"obtain":[48],"an":[49],"optimal":[50],"solution":[51],"in":[52,86],"expected":[53,87],"time":[54,88],"O(n":[55],"<sup":[56],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[57],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">g(k)</sup>":[58],")":[59],"where":[60,92],"g(k)":[61,89],"is":[62,94,129,176],"a":[63,95,152,170,177],"function":[64],"only":[65],"depending":[66],"on":[67,172],"k.":[68],"We":[69],"extend":[70],"these":[71],"investigations":[72],"design":[74],"two":[75],"Traveling":[81],"Salesperson":[82],"run":[85],"\u00b7":[90],"poly(n)":[91],"parameter":[96],"denoting":[97],"given":[104],"TSP":[105,117],"instance,":[106],"fixed-parameter":[110],"tractable":[111],"points.":[124],"While":[125],"our":[126,134],"first":[127],"approach":[128,136],"mainly":[130],"theoretical":[132],"interest,":[133],"second":[135],"leverages":[137],"structure":[139],"directly":[141],"searching":[142,168],"good":[144],"orderings":[145],"provides":[151],"novel":[153],"highly":[155],"effective":[156],"way":[157],"tackling":[159],"this":[160],"important":[161],"problem.":[162],"Our":[163],"experimental":[164],"results":[165],"show":[166],"permutation":[171],"significantly":[178],"powerful":[179],"practical":[180],"strategy.":[181]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}