{"id":"https://openalex.org/W2086054344","doi":"https://doi.org/10.1162/evco_a_00119","title":"Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem","display_name":"Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem","publication_year":2014,"publication_date":"2014-01-30","ids":{"openalex":"https://openalex.org/W2086054344","doi":"https://doi.org/10.1162/evco_a_00119","mag":"2086054344","pmid":"https://pubmed.ncbi.nlm.nih.gov/24479542"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00119","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00119","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/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":true,"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":"middle","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":["Optimisation and Logistics, School of Computer Science, University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer Science, University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","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":false,"raw_author_name":"Samadhi Nallaperuma","raw_affiliation_strings":["Optimisation and Logistics, School of Computer Science, University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer Science, University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004695687"],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":2.8631,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.92108615,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"4","first_page":"595","last_page":"628"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"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.9991999864578247,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7294458150863647},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.7074441313743591},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6239029169082642},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6068377494812012},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5714905858039856},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5125041007995605},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4951392710208893},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48223790526390076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4786030948162079},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3486063778400421},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27975529432296753}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7294458150863647},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.7074441313743591},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6239029169082642},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6068377494812012},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5714905858039856},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5125041007995605},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4951392710208893},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48223790526390076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4786030948162079},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3486063778400421},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27975529432296753},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003205","descriptor_name":"Computing Methodologies","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003205","descriptor_name":"Computing Methodologies","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003205","descriptor_name":"Computing Methodologies","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D013997","descriptor_name":"Time Factors","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":3,"locations":[{"id":"doi:10.1162/evco_a_00119","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00119","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:24479542","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/24479542","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/90677","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/90677","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.1162/evco_a_00119","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W116475295","https://openalex.org/W180909918","https://openalex.org/W1487360687","https://openalex.org/W1497676467","https://openalex.org/W1510977876","https://openalex.org/W1541087579","https://openalex.org/W1552810675","https://openalex.org/W1570425181","https://openalex.org/W1605768620","https://openalex.org/W1631204983","https://openalex.org/W1963865903","https://openalex.org/W1970101133","https://openalex.org/W1971483538","https://openalex.org/W1981898306","https://openalex.org/W1986602966","https://openalex.org/W1992220653","https://openalex.org/W2012174598","https://openalex.org/W2034762222","https://openalex.org/W2066124178","https://openalex.org/W2072008504","https://openalex.org/W2079247611","https://openalex.org/W2079868147","https://openalex.org/W2084149434","https://openalex.org/W2090677529","https://openalex.org/W2099934773","https://openalex.org/W2100137329","https://openalex.org/W2111090561","https://openalex.org/W2152325608","https://openalex.org/W2153401898","https://openalex.org/W2157622572","https://openalex.org/W2159512835","https://openalex.org/W2165220807","https://openalex.org/W2323986888","https://openalex.org/W2582743722","https://openalex.org/W2585305412","https://openalex.org/W2913688336","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/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W2563912921","https://openalex.org/W54441500"],"abstract_inverted_index":{"Parameterized":[0],"runtime":[1,70],"analysis":[2,31,181,210],"seeks":[3],"to":[4,19,63,163,182,186,217],"understand":[5],"the":[6,20,36,45,53,69,74,81,85,106,121,136,160,168,172,176,180,195,218,238,269,285],"influence":[7,52],"of":[8,23,32,56,73,76,84,120,171,277,297],"problem":[9,40,221,286],"structure":[10],"on":[11,132,208],"algorithmic":[12],"runtime.":[13,66],"In":[14,80,167],"this":[15,61,140,278],"paper,":[16,86,173],"we":[17,87,138,174],"contribute":[18],"theoretical":[21],"understanding":[22],"evolutionary":[24,33,57,192,225,279],"algorithms":[25,34,58,193],"and":[26,59,100,154],"carry":[27],"out":[28],"a":[29,89,95,118,145,202,223,257,264,275,295],"parameterized":[30],"for":[35,194,301],"Euclidean":[37,107,197],"traveling":[38,219],"salesperson":[39,220],"(Euclidean":[41],"TSP).":[42],"We":[43,67,199,254,272],"investigate":[44],"structural":[46],"properties":[47],"in":[48,71,94,109,179,229,244,292],"TSP":[49,108,239],"instances":[50],"that":[51,102,149,236,262,274],"optimization":[54],"process":[55],"use":[60,175],"information":[62,177],"bound":[64,142,162],"their":[65],"analyze":[68],"dependence":[72],"number":[75],"inner":[77,242],"points":[78,243],"k.":[79],"first":[82,200],"part":[83,170],"study":[88],"[Formula:":[90,112,124,164,203,245,251,258,288,298],"see":[91,113,125,165,204,246,252,259,289,299],"text]":[92,114,126,205,247,260,290,300],"EA":[93,206,261],"strictly":[96],"black":[97],"box":[98],"setting":[99],"show":[101],"it":[103],"can":[104],"solve":[105],"expected":[110],"time":[111],"where":[115],"A":[116],"is":[117],"function":[119],"minimum":[122],"angle":[123],"between":[127],"any":[128],"three":[129],"points.":[130],"Based":[131],"insights":[133],"provided":[134],"by":[135,143,211,222],"analysis,":[137],"improve":[139],"upper":[141,161],"introducing":[144],"mixed":[146],"mutation":[147,283],"strategy":[148,158],"incorporates":[150,263],"both":[151],"2-opt":[152,282],"moves":[153],"permutation":[155],"jumps.":[156],"This":[157],"improves":[159],"text].":[166,253],"second":[169],"gained":[178],"incorporate":[183],"domain":[184],"knowledge":[185],"design":[187,256],"two":[188],"fixed-parameter":[189],"tractable":[190],"(FPT)":[191],"planar":[196],"TSP.":[198],"develop":[201],"based":[207],"an":[209],"M.":[212],"Theile,":[213],"2009,":[214],"\"Exact":[215],"solutions":[216],"population-based":[224],"algorithm,\"":[226],"Lecture":[227],"notes":[228],"computer":[230],"science,":[231],"Vol.":[232],"5482":[233],"(pp.":[234],"145-155),":[235],"solves":[237,284],"with":[240,249,294],"k":[241],"generations":[248],"probability":[250],"then":[255],"dynamic":[265],"programming":[266],"step":[267],"into":[268],"fitness":[270,303],"evaluation.":[271,304],"prove":[273],"variant":[276],"algorithm":[280],"using":[281],"after":[287],"steps":[291],"expectation":[293],"cost":[296],"each":[302]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}