{"id":"https://openalex.org/W1963982795","doi":"https://doi.org/10.1145/2739482.2768459","title":"Generating Human-readable Algorithms for the Travelling Salesman Problem using Hyper-Heuristics","display_name":"Generating Human-readable Algorithms for the Travelling Salesman Problem using Hyper-Heuristics","publication_year":2015,"publication_date":"2015-07-10","ids":{"openalex":"https://openalex.org/W1963982795","doi":"https://doi.org/10.1145/2739482.2768459","mag":"1963982795"},"language":"en","primary_location":{"id":"doi:10.1145/2739482.2768459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2768459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5048376037","display_name":"Patricia Ryser-Welch","orcid":"https://orcid.org/0000-0002-0070-0264"},"institutions":[{"id":"https://openalex.org/I52099693","display_name":"University of York","ror":"https://ror.org/04m01e293","country_code":"GB","type":"education","lineage":["https://openalex.org/I52099693"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Patricia Ryser-Welch","raw_affiliation_strings":["University of York, York, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of York, York, United Kingdom","institution_ids":["https://openalex.org/I52099693"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077881387","display_name":"Julian F. Miller","orcid":"https://orcid.org/0000-0002-7692-9655"},"institutions":[{"id":"https://openalex.org/I52099693","display_name":"University of York","ror":"https://ror.org/04m01e293","country_code":"GB","type":"education","lineage":["https://openalex.org/I52099693"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Julian F. Miller","raw_affiliation_strings":["University of York, York, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of York, York, United Kingdom","institution_ids":["https://openalex.org/I52099693"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003488448","display_name":"Shahriar Asta","orcid":"https://orcid.org/0000-0002-7733-2500"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shahriar Asta","raw_affiliation_strings":["Nottingham University, Nottingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nottingham University, Nottingham, United Kingdom","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0491,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.84044636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1067","last_page":"1074"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9987999796867371,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/metaheuristic","display_name":"Metaheuristic","score":0.7853165864944458},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7304385900497437},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6938937902450562},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6900885105133057},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.6555067896842957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.623955488204956},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6013340950012207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5199198126792908},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.49863386154174805},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.49063411355018616},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.4437685012817383},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4417880177497864},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4168277084827423},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40990665555000305},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29203206300735474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2912690043449402},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.2592875063419342}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7853165864944458},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7304385900497437},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6938937902450562},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6900885105133057},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.6555067896842957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.623955488204956},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6013340950012207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5199198126792908},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.49863386154174805},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.49063411355018616},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.4437685012817383},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4417880177497864},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4168277084827423},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40990665555000305},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29203206300735474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2912690043449402},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.2592875063419342},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2739482.2768459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2768459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.44999998807907104,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W95015354","https://openalex.org/W187767610","https://openalex.org/W247606769","https://openalex.org/W325535439","https://openalex.org/W1010887924","https://openalex.org/W1271512945","https://openalex.org/W1486894692","https://openalex.org/W1502125971","https://openalex.org/W1507638523","https://openalex.org/W1516301787","https://openalex.org/W1546457065","https://openalex.org/W1550531341","https://openalex.org/W1829921621","https://openalex.org/W1917710033","https://openalex.org/W1968594877","https://openalex.org/W1976595943","https://openalex.org/W1990227306","https://openalex.org/W1998264267","https://openalex.org/W2008029472","https://openalex.org/W2017708378","https://openalex.org/W2023947722","https://openalex.org/W2042354250","https://openalex.org/W2042986967","https://openalex.org/W2047003964","https://openalex.org/W2060400398","https://openalex.org/W2063160149","https://openalex.org/W2068878490","https://openalex.org/W2072441740","https://openalex.org/W2104635975","https://openalex.org/W2111949939","https://openalex.org/W2138522309","https://openalex.org/W2143095460","https://openalex.org/W2166843422","https://openalex.org/W2277865894","https://openalex.org/W2604796233","https://openalex.org/W2798467024","https://openalex.org/W2976664243","https://openalex.org/W3202642340","https://openalex.org/W4233183865","https://openalex.org/W4251343851","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2493097192","https://openalex.org/W1998981559","https://openalex.org/W181653686","https://openalex.org/W4205193211","https://openalex.org/W2140187183","https://openalex.org/W2140340835","https://openalex.org/W1585894761","https://openalex.org/W1963982795","https://openalex.org/W1493992103"],"abstract_inverted_index":{"Hyper-heuristics":[0],"search":[1],"the":[2,23,63,82,109],"space":[3],"of":[4,20,33,54,79,85,106,111],"heuristics":[5,56],"and":[6,39,46,92,124],"metaheuristics,":[7],"so":[8],"that":[9,57],"it":[10],"can":[11,58],"generate":[12],"high-quality":[13],"algorithms.":[14],"It":[15],"is":[16],"a":[17,76,103,112],"growing":[18],"area":[19],"interest":[21],"in":[22,62,129],"research":[24],"community.":[25],"Algorithms":[26],"have":[27,69,122],"been":[28],"constructed":[29],"iteratively":[30],"using":[31,114],"\"templates":[32],"operations\"":[34],"based":[35],"on":[36,101],"well-known":[37],"heuristic":[38,86],"metaheuristic":[40],"methods":[41],"(i.e.":[42],"Iterated":[43],"Local":[44],"Search":[45],"Memetic":[47],"algorithms).":[48],"These":[49],"hyper-heuristic":[50],"algorithms":[51,128],"choose":[52],"sequences":[53,84],"problem-specific":[55],"find":[59],"good":[60],"solutions":[61],"problem":[64],"domain.":[65],"Such":[66],"\"adaptive":[67],"algorithms\"":[68],"solved":[70],"several":[71],"well-established":[72],"combinatorial":[73],"problems,":[74],"with":[75],"high":[77],"level":[78],"generality.":[80],"However,":[81],"evolved":[83,127],"operations":[87],"are":[88],"often":[89],"very":[90],"long":[91],"defy":[93],"human":[94],"comprehension.":[95],"In":[96],"this":[97],"paper,":[98],"we":[99],"focus":[100],"evolving":[102],"fixed":[104],"sequence":[105],"operators":[107],"inside":[108],"loop":[110],"metaheuristic,":[113],"an":[115],"innovative":[116],"automatic":[117],"algorithm":[118],"creation":[119],"method.":[120],"We":[121],"extracted":[123],"hard-coded":[125],"these":[126],"new":[130],"independent":[131],"solvers":[132],"for":[133],"Travelling":[134],"Salesman":[135],"Problems.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}