{"id":"https://openalex.org/W4385188696","doi":"https://doi.org/10.1145/3583133.3590673","title":"Phased Genetic Programming for Application to the Traveling Salesman Problem","display_name":"Phased Genetic Programming for Application to the Traveling Salesman Problem","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4385188696","doi":"https://doi.org/10.1145/3583133.3590673"},"language":"en","primary_location":{"id":"doi:10.1145/3583133.3590673","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3590673","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 Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10871/133741","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019091531","display_name":"Darren M. Chitty","orcid":"https://orcid.org/0000-0003-2566-1182"},"institutions":[{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Darren Chitty","raw_affiliation_strings":["University of Exeter, Exeter, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Exeter, Exeter, United Kingdom","institution_ids":["https://openalex.org/I23923803"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109516336","display_name":"Ed Keedwell","orcid":null},"institutions":[{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ed Keedwell","raw_affiliation_strings":["University of Exeter, Exeter, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Exeter, Exeter, United Kingdom","institution_ids":["https://openalex.org/I23923803"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019091531"],"corresponding_institution_ids":["https://openalex.org/I23923803"],"apc_list":null,"apc_paid":null,"fwci":0.3474,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64940368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"547","last_page":"550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998999834060669,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9976999759674072,"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.9132165908813477},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8237097859382629},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.6921091675758362},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6770318746566772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6414498090744019},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6012808084487915},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.566314160823822},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5368542671203613},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5157947540283203},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4971175491809845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2549661099910736},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15785488486289978}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9132165908813477},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8237097859382629},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.6921091675758362},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6770318746566772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6414498090744019},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6012808084487915},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.566314160823822},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5368542671203613},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5157947540283203},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4971175491809845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2549661099910736},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15785488486289978},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3583133.3590673","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3590673","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 Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:ore.exeter.ac.uk:10871/133741","is_oa":true,"landing_page_url":"http://hdl.handle.net/10871/133741","pdf_url":null,"source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"},{"id":"pmh:oai:figshare.com:article/29797352","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"}],"best_oa_location":{"id":"pmh:oai:ore.exeter.ac.uk:10871/133741","is_oa":true,"landing_page_url":"http://hdl.handle.net/10871/133741","pdf_url":null,"source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2638703846","display_name":"Hyper-heuristic Optimisation for Advanced Zero Carbon Public Transport Planning","funder_award_id":"10007532","funder_id":"https://openalex.org/F4320335087","funder_display_name":"Innovate UK"}],"funders":[{"id":"https://openalex.org/F4320335087","display_name":"Innovate UK","ror":"https://ror.org/05ar5fy68"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2031963750","https://openalex.org/W2067107194","https://openalex.org/W2072441740","https://openalex.org/W2073870328","https://openalex.org/W2107899042","https://openalex.org/W2140425706","https://openalex.org/W2148673189","https://openalex.org/W2154929945","https://openalex.org/W2376316028","https://openalex.org/W2953681220"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2362402143","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2308371765","https://openalex.org/W2171568915","https://openalex.org/W2265604726","https://openalex.org/W1183061632"],"abstract_inverted_index":{"The":[0,115],"Traveling":[1],"Salesman":[2],"Problem":[3],"(TSP)":[4],"is":[5,25,86,100,111,129],"a":[6,32,47,79,96,104],"difficult":[7,88],"permutation-based":[8],"optimisation":[9],"problem":[10,21],"typically":[11,54],"solved":[12],"using":[13,143],"heuristics":[14,43],"or":[15,57],"meta-heuristics":[16],"which":[17,34],"search":[18,39],"the":[19,75,84,108],"solution":[20,33],"space.":[22],"An":[23],"alternative":[24],"to":[26,31,36,46,68,72,82,90,164],"find":[27],"sets":[28],"of":[29,106,152,156],"manipulations":[30],"lead":[35],"optimality.":[37],"Hyper-heuristics":[38],"this":[40,122],"space":[41],"applying":[42],"sequentially,":[44],"similar":[45],"program.":[48],"Genetic":[49],"Programming":[50],"(GP)":[51],"evolves":[52],"programs":[53,71],"for":[55,154],"classification":[56],"regression":[58],"problems.":[59],"This":[60],"paper":[61],"hypothesizes":[62],"that":[63,134],"GP":[64,98,137],"can":[65,147],"be":[66],"used":[67],"evolve":[69],"heuristic":[70],"directly":[73],"solve":[74,83,139],"TSP.":[76],"However,":[77],"evolving":[78],"full":[80,127],"program":[81,110,124,128],"TSP":[85,140],"likely":[87],"due":[89],"required":[91],"length":[92],"and":[93,113],"complexity.":[94],"Consequently,":[95],"phased":[97],"method":[99],"proposed":[101],"whereby":[102],"after":[103],"phase":[105,118],"generations":[107],"best":[109],"saved":[112,123],"executed.":[114],"subsequent":[116],"generation":[117],"restarts":[119],"operating":[120],"on":[121],"output.":[125],"A":[126],"evolved":[130],"piecemeal.":[131],"Experiments":[132],"demonstrate":[133],"whilst":[135],"pure":[136,169],"cannot":[138],"instances":[141],"when":[142],"simple":[144],"operators,":[145],"Phased-GP":[146,161],"obtain":[148],"solutions":[149],"within":[150],"4%":[151],"optimal":[153],"TSPs":[155],"several":[157],"hundred":[158],"cities.":[159],"Moreover,":[160],"operates":[162],"up":[163],"nine":[165],"times":[166],"faster":[167],"than":[168],"GP.":[170]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}