{"id":"https://openalex.org/W1983829510","doi":"https://doi.org/10.1109/eals.2014.7009505","title":"An apprenticeship learning hyper-heuristic for vehicle routing in HyFlex","display_name":"An apprenticeship learning hyper-heuristic for vehicle routing in HyFlex","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W1983829510","doi":"https://doi.org/10.1109/eals.2014.7009505","mag":"1983829510"},"language":"en","primary_location":{"id":"doi:10.1109/eals.2014.7009505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eals.2014.7009505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://eprints.nottingham.ac.uk/34399/","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Shahriar Asta","raw_affiliation_strings":["ASAP Research Group, University of Nottingham, Nottingham, UK","ASAP Research Group, School of Computer Science, University of Nottingham, NG8 1BB, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"ASAP Research Group, University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"ASAP Research Group, School of Computer Science, University of Nottingham, NG8 1BB, UK#TAB#","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020026827","display_name":"Ender \u00d6zcan","orcid":"https://orcid.org/0000-0003-0276-1391"},"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":"Ender Ozcan","raw_affiliation_strings":["ASAP Research Group, University of Nottingham, Nottingham, UK","ASAP Research Group, School of Computer Science, University of Nottingham, NG8 1BB, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"ASAP Research Group, University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"ASAP Research Group, School of Computer Science, University of Nottingham, NG8 1BB, UK#TAB#","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003488448"],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":3.1188,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.90950694,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"43","issue":null,"first_page":"65","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9988999962806702,"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.9988999962806702,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.832327127456665},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7824074029922485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.708324670791626},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6896088123321533},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.6005631685256958},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5830085873603821},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.48634082078933716},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4433704614639282},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.4179854393005371},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.41296544671058655},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.3049493432044983},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.18756172060966492},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.12150770425796509},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10656744241714478},{"id":"https://openalex.org/keywords/robot-learning","display_name":"Robot learning","score":0.06962817907333374},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.06722286343574524}],"concepts":[{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.832327127456665},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7824074029922485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.708324670791626},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6896088123321533},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.6005631685256958},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5830085873603821},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.48634082078933716},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4433704614639282},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.4179854393005371},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.41296544671058655},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3049493432044983},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.18756172060966492},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.12150770425796509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10656744241714478},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.06962817907333374},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.06722286343574524},{"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/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/eals.2014.7009505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eals.2014.7009505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Evolving and Autonomous Learning Systems (EALS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.1092","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.1092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://astas.co.uk/papers/IEEESSCIAL.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.nottingham.ac.uk:34399","is_oa":true,"landing_page_url":"http://eprints.nottingham.ac.uk/34399/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402013","display_name":"Nottingham ePrints (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:nottingham-repository.worktribe.com:741265","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/741265","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"}],"best_oa_location":{"id":"pmh:oai:eprints.nottingham.ac.uk:34399","is_oa":true,"landing_page_url":"http://eprints.nottingham.ac.uk/34399/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402013","display_name":"Nottingham ePrints (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W30227017","https://openalex.org/W33990384","https://openalex.org/W111307319","https://openalex.org/W140728773","https://openalex.org/W192263341","https://openalex.org/W1208385249","https://openalex.org/W1504694836","https://openalex.org/W1536647479","https://openalex.org/W1601649239","https://openalex.org/W1604118578","https://openalex.org/W1814515812","https://openalex.org/W1829921621","https://openalex.org/W1925566585","https://openalex.org/W1936224457","https://openalex.org/W1967407013","https://openalex.org/W1972755385","https://openalex.org/W1999874108","https://openalex.org/W2008647976","https://openalex.org/W2009308192","https://openalex.org/W2013821256","https://openalex.org/W2026076687","https://openalex.org/W2031236641","https://openalex.org/W2050462717","https://openalex.org/W2057559819","https://openalex.org/W2072441740","https://openalex.org/W2083777413","https://openalex.org/W2097006520","https://openalex.org/W2111563176","https://openalex.org/W2125055259","https://openalex.org/W2140759234","https://openalex.org/W2148948822","https://openalex.org/W2151019861","https://openalex.org/W2166858694","https://openalex.org/W2996879375","https://openalex.org/W3036035835","https://openalex.org/W4285719527","https://openalex.org/W6601229403","https://openalex.org/W6604528125","https://openalex.org/W6638610016","https://openalex.org/W6640631110","https://openalex.org/W6671510986","https://openalex.org/W6681030992","https://openalex.org/W6779748562"],"related_works":["https://openalex.org/W3111117784","https://openalex.org/W2400861930","https://openalex.org/W2101174032","https://openalex.org/W2617599361","https://openalex.org/W2573689326","https://openalex.org/W1140243306","https://openalex.org/W2146538994","https://openalex.org/W2913108234","https://openalex.org/W2357125654","https://openalex.org/W2591041104"],"abstract_inverted_index":{"Apprenticeship":[0],"learning":[1,19,106],"occurs":[2],"via":[3],"observations":[4],"while":[5,145],"an":[6,88,168],"expert":[7,89,117,143,175],"is":[8,13,55,85,91,134],"in":[9,76],"action.":[10],"A":[11,82],"hyper-heuristic":[12,61,73,84,97,118,132,144,166],"a":[14,18,23,39,50,60,72,77,95,131],"search":[15,122],"method":[16],"or":[17,29],"mechanism":[20],"that":[21,115,163],"controls":[22],"set":[24],"of":[25,94,137,141],"low":[26],"level":[27],"heuristics":[28,36],"combines":[30],"different":[31,113],"heuristic":[32],"components":[33],"to":[34,57,129,173],"generate":[35,59],"for":[37,62],"solving":[38,146],"given":[40],"computationally":[41],"hard":[42],"problem.":[43],"In":[44],"this":[45],"study,":[46],"we":[47],"investigate":[48],"into":[49],"novel":[51],"apprenticeship-learning-based":[52,165],"approach":[53,66,107],"which":[54,74,90,133],"used":[56,128],"automatically":[58],"vehicle":[63,102,154],"routing.":[64],"This":[65],"itself":[67],"can":[68],"be":[69],"considered":[70],"as":[71,87],"operates":[75],"train":[78],"and":[79,176],"test":[80],"fashion.":[81],"state-of-the-art":[83],"chosen":[86],"the":[92,105,116,121,139,142,147,157,164,174],"winner":[93],"previous":[96],"competition.":[98],"Trained":[99],"on":[100,153],"small":[101],"routing":[103,155],"instances,":[104],"yields":[108],"various":[109],"classifiers,":[110],"each":[111],"capturing":[112],"actions":[114,140],"performs":[119],"during":[120],"process.":[123],"Those":[124],"classifiers":[125],"are":[126],"then":[127],"produce":[130],"potentially":[135],"capable":[136],"generalizing":[138],"unseen":[148],"instances.":[149],"The":[150],"experimental":[151],"results":[152],"using":[156],"Hyper-heuristic":[158],"Flexible":[159],"(HyFlex)":[160],"framework":[161],"shows":[162],"delivers":[167],"outstanding":[169],"performance":[170],"when":[171],"compared":[172],"some":[177],"other":[178],"previously":[179],"proposed":[180],"hyper-heuristics.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}