{"id":"https://openalex.org/W2808876175","doi":"https://doi.org/10.1162/evco_a_00233","title":"Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem","display_name":"Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem","publication_year":2018,"publication_date":"2018-06-22","ids":{"openalex":"https://openalex.org/W2808876175","doi":"https://doi.org/10.1162/evco_a_00233","mag":"2808876175","pmid":"https://pubmed.ncbi.nlm.nih.gov/29932364"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00233","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00233","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/A5019690312","display_name":"Mojgan Pourhassan","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":"Mojgan Pourhassan","raw_affiliation_strings":["Optimisation and Logistics, The University of Adelaide, Adelaide, SA 5005, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, The University of Adelaide, Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"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":true,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics, The University of Adelaide, Adelaide, SA 5005, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, The University of Adelaide, Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019690312","https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":1.2317,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8342068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"27","issue":"3","first_page":"525","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9966999888420105,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9919999837875366,"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/local-search","display_name":"Local search (optimization)","score":0.6491515040397644},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5519846081733704},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5215936899185181},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5173317790031433},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5096724033355713},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.488591730594635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48734816908836365},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47170472145080566},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.449688583612442},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44627130031585693},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42380407452583313},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42208749055862427}],"concepts":[{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6491515040397644},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5519846081733704},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5215936899185181},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5173317790031433},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5096724033355713},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.488591730594635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48734816908836365},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47170472145080566},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.449688583612442},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44627130031585693},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42380407452583313},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42208749055862427},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D000067508","descriptor_name":"Computer Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"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":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D011340","descriptor_name":"Problem Solving","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D011340","descriptor_name":"Problem Solving","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D011340","descriptor_name":"Problem Solving","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016000","descriptor_name":"Cluster Analysis","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016000","descriptor_name":"Cluster Analysis","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016000","descriptor_name":"Cluster Analysis","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":3,"locations":[{"id":"doi:10.1162/evco_a_00233","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00233","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:29932364","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/29932364","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/128928","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/128928","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":"https://dl-acm-org.proxy.library.adelaide.edu.au/doi/abs/10.1162/evco_a_00233","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5199999809265137,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W15419430","https://openalex.org/W116475295","https://openalex.org/W1541087579","https://openalex.org/W1552810675","https://openalex.org/W1571087346","https://openalex.org/W1605768620","https://openalex.org/W1631204983","https://openalex.org/W1632066424","https://openalex.org/W1801390969","https://openalex.org/W1982687611","https://openalex.org/W1985225156","https://openalex.org/W1992220653","https://openalex.org/W2005317641","https://openalex.org/W2018269848","https://openalex.org/W2061751517","https://openalex.org/W2075813565","https://openalex.org/W2086054344","https://openalex.org/W2088415500","https://openalex.org/W2146312568","https://openalex.org/W2323986888","https://openalex.org/W2499441210","https://openalex.org/W3122779104","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2807679627","https://openalex.org/W1521720388","https://openalex.org/W1777480463","https://openalex.org/W2794473043","https://openalex.org/W2077549107","https://openalex.org/W90886653","https://openalex.org/W1586280759","https://openalex.org/W4220945639","https://openalex.org/W4312928368","https://openalex.org/W2364426871"],"abstract_inverted_index":{"The":[0],"generalized":[1],"travelling":[2],"salesperson":[3],"problem":[4,11],"is":[5,103],"an":[6,100,176],"important":[7],"NP-hard":[8],"combinatorial":[9],"optimization":[10,182],"for":[12,50,105,188],"which":[13,102],"metaheuristics,":[14],"such":[15],"as":[16],"local":[17,57,75],"search":[18,58,76,116,123],"and":[19,38,47,60],"evolutionary":[20,62,144],"algorithms,":[21,77],"have":[22,42],"been":[23,43],"used":[24],"very":[25],"successfully.":[26],"Two":[27],"hierarchical":[28],"approaches":[29,67,87,107],"with":[30],"different":[31],"neighbourhood":[32,122],"structures,":[33],"namely":[34],"a":[35,39,71,111,120,189],"cluster-based":[36,162],"approach":[37,155,163,187],"node-based":[40,154,186],"approach,":[41],"proposed":[44],"by":[45,88],"Hu":[46],"Raidl":[48],"(2008)":[49],"solving":[51],"this":[52,55],"problem.":[53],"In":[54],"article,":[56],"algorithms":[59,63,145],"simple":[61,143],"based":[64],"on":[65,110,180],"these":[66,148],"are":[68],"investigated":[69],"from":[70],"theoretical":[72],"perspective.":[73],"For":[74],"we":[78,98,134,174],"point":[79,113],"out":[80],"the":[81,85,115,127,140,153,157,161,181,185],"complementary":[82],"abilities":[83],"of":[84,114,142,160,184,191],"two":[86],"presenting":[89],"instances":[90],"where":[91,119],"they":[92],"mutually":[93],"outperform":[94],"each":[95],"other.":[96],"Afterwards,":[97],"introduce":[99],"instance":[101,159],"hard":[104,158],"both":[106],"when":[108],"initialized":[109],"particular":[112],"space,":[117],"but":[118],"variable":[121],"combining":[124],"them":[125],"finds":[126],"optimal":[128],"solution":[129],"in":[130,165,170],"polynomial":[131,171],"time.":[132,172],"Then":[133],"turn":[135],"our":[136],"attention":[137],"to":[138],"analysing":[139],"behaviour":[141],"that":[146,152],"use":[147],"approaches.":[149],"We":[150],"show":[151],"solves":[156],"presented":[164],"Corus":[166],"et":[167],"al.":[168],"(2016)":[169],"Furthermore,":[173],"prove":[175],"exponential":[177],"lower":[178],"bound":[179],"time":[183],"class":[190],"Euclidean":[192],"instances.":[193]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}