{"id":"https://openalex.org/W2506945462","doi":"https://doi.org/10.1145/2908812.2908942","title":"A Combined Generative and Selective Hyper-heuristic for the Vehicle Routing Problem","display_name":"A Combined Generative and Selective Hyper-heuristic for the Vehicle Routing Problem","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2506945462","doi":"https://doi.org/10.1145/2908812.2908942","mag":"2506945462"},"language":"en","primary_location":{"id":"doi:10.1145/2908812.2908942","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","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/A5059180650","display_name":"Kevin Sim","orcid":"https://orcid.org/0000-0001-6555-7721"},"institutions":[{"id":"https://openalex.org/I251738","display_name":"Edinburgh Napier University","ror":"https://ror.org/03zjvnn91","country_code":"GB","type":"education","lineage":["https://openalex.org/I251738"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kevin Sim","raw_affiliation_strings":["Edinburgh Napier University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Edinburgh Napier University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I251738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006992974","display_name":"Emma Hart","orcid":"https://orcid.org/0000-0002-5405-4413"},"institutions":[{"id":"https://openalex.org/I251738","display_name":"Edinburgh Napier University","ror":"https://ror.org/03zjvnn91","country_code":"GB","type":"education","lineage":["https://openalex.org/I251738"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Emma Hart","raw_affiliation_strings":["Edinburgh Napier University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Edinburgh Napier University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I251738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059180650"],"corresponding_institution_ids":["https://openalex.org/I251738"],"apc_list":null,"apc_paid":null,"fwci":3.7606,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.93208632,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1093","last_page":"1100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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.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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9902999997138977,"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/heuristics","display_name":"Heuristics","score":0.8640766143798828},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6791579127311707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6505721807479858},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.5983071327209473},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5552331805229187},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5469877123832703},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.4862138330936432},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.4430454671382904},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.41200190782546997},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4104841947555542},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3260084092617035},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3076890707015991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.266830176115036}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8640766143798828},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6791579127311707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6505721807479858},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.5983071327209473},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5552331805229187},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5469877123832703},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.4862138330936432},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.4430454671382904},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41200190782546997},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4104841947555542},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3260084092617035},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3076890707015991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.266830176115036},{"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/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2908812.2908942","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G7817878130","display_name":null,"funder_award_id":"EP/J021628/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"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":22,"referenced_works":["https://openalex.org/W111307319","https://openalex.org/W951516105","https://openalex.org/W1501435780","https://openalex.org/W1576818901","https://openalex.org/W1814515812","https://openalex.org/W1829921621","https://openalex.org/W1925566585","https://openalex.org/W1977997977","https://openalex.org/W2025474724","https://openalex.org/W2053029308","https://openalex.org/W2072441740","https://openalex.org/W2096305430","https://openalex.org/W2098553382","https://openalex.org/W2109101401","https://openalex.org/W2111581650","https://openalex.org/W2140003718","https://openalex.org/W2182332102","https://openalex.org/W2275596639","https://openalex.org/W2337250586","https://openalex.org/W2999341115","https://openalex.org/W4245047469","https://openalex.org/W6770081585"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2041180560","https://openalex.org/W2586529194","https://openalex.org/W1628567638","https://openalex.org/W2526745971"],"abstract_inverted_index":{"Hyper-heuristic":[0],"methods":[1,24],"for":[2],"solving":[3],"vehicle":[4],"routing":[5],"problems":[6],"(VRP)":[7],"have":[8],"proved":[9],"promising":[10],"on":[11,84,148,156],"a":[12,31,43,48,62,85,96,123,140,157],"range":[13],"of":[14,19,34,159,165],"data.":[15],"The":[16,58,109],"vast":[17],"majority":[18],"approaches":[20],"apply":[21],"selective":[22],"hyper-heuristic":[23,50,98,126],"that":[25,53,82,143],"iteratively":[26],"choose":[27],"appropriate":[28],"heuristics":[29,37,112,147],"from":[30,105],"fixed":[32],"set":[33,158],"pre-defined":[35],"low-level":[36,118],"to":[38,68,101,115],"either":[39],"build":[40],"or":[41],"perturb":[42],"candidate":[44,86,102],"solution.":[45],"We":[46],"propose":[47],"novel":[49,63],"called":[51],"GP-MHH":[52],"operates":[54],"in":[55],"two":[56],"stages.":[57],"first":[59],"stage":[60],"uses":[61],"Genetic":[64],"Programming":[65],"(GP)":[66],"approach":[67],"evolve":[69],"high":[70],"quality":[71],"constructive":[72,111],"heuristics;":[73],"these":[74],"can":[75],"be":[76],"used":[77],"with":[78,122,134],"any":[79],"existing":[80,117],"method":[81,142],"relies":[83],"solution(s)":[87],"as":[88],"its":[89],"starting":[90],"point.":[91],"In":[92],"the":[93,106,163,166],"second":[94],"stage,":[95],"perturbative":[97,125],"is":[99],"applied":[100],"solutions":[103],"created":[104],"new":[107,110,146],"heuristics.":[108,119],"are":[113,131],"shown":[114],"outperform":[116,139],"When":[120],"combined":[121],"naive":[124],"they":[127],"provide":[128,154],"results":[129,155],"which":[130],"both":[132],"competitive":[133],"known":[135],"optimal":[136],"values":[137],"and":[138],"recent":[141],"also":[144],"designs":[145],"some":[149],"standard":[150],"benchmarks.":[151],"Finally,":[152],"we":[153],"rich":[160],"VRPs,":[161],"showing":[162],"generality":[164],"approach.":[167]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}