{"id":"https://openalex.org/W4385196253","doi":"https://doi.org/10.1145/3583133.3596340","title":"Using a Parallel Ensemble of Sequence-Based Selection Hyper-Heuristics for Electric Bus Scheduling","display_name":"Using a Parallel Ensemble of Sequence-Based Selection Hyper-Heuristics for Electric Bus Scheduling","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4385196253","doi":"https://doi.org/10.1145/3583133.3596340"},"language":"en","primary_location":{"id":"doi:10.1145/3583133.3596340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3596340","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/133740","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":"middle","author":{"id":"https://openalex.org/A5102842899","display_name":"James B. Lewis","orcid":"https://orcid.org/0009-0002-4169-4988"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James Lewis","raw_affiliation_strings":["City Science, Exeter, United Kingdom"],"affiliations":[{"raw_affiliation_string":"City Science, Exeter, United Kingdom","institution_ids":[]}]},{"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":3,"corresponding_author_ids":["https://openalex.org/A5019091531"],"corresponding_institution_ids":["https://openalex.org/I23923803"],"apc_list":null,"apc_paid":null,"fwci":0.2015,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56951258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1712","last_page":"1720"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","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/T10551","display_name":"Scheduling and Optimization Algorithms","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.9950000047683716,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937000274658203,"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/heuristics","display_name":"Heuristics","score":0.8394704461097717},{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.8097505569458008},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7710888981819153},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5673985481262207},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5514383316040039},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5280321836471558},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5228312611579895},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4811186194419861},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.43631312251091003},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.37858226895332336},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18591716885566711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10451585054397583}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8394704461097717},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.8097505569458008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7710888981819153},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5673985481262207},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5514383316040039},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5280321836471558},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5228312611579895},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4811186194419861},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43631312251091003},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.37858226895332336},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18591716885566711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10451585054397583},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3583133.3596340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583133.3596340","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/133740","is_oa":true,"landing_page_url":"http://hdl.handle.net/10871/133740","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/29797355","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/133740","is_oa":true,"landing_page_url":"http://hdl.handle.net/10871/133740","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":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W313310535","https://openalex.org/W1829921621","https://openalex.org/W1963637785","https://openalex.org/W2026890163","https://openalex.org/W2067503240","https://openalex.org/W2072441740","https://openalex.org/W2109364787","https://openalex.org/W2135293965","https://openalex.org/W2154929945","https://openalex.org/W2157371713","https://openalex.org/W2280269595","https://openalex.org/W2341491644","https://openalex.org/W2462800345","https://openalex.org/W2498466390","https://openalex.org/W2902894010","https://openalex.org/W2910739712","https://openalex.org/W2945562209","https://openalex.org/W2967783393","https://openalex.org/W3178952615","https://openalex.org/W3181543052","https://openalex.org/W4285805308"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W803550684","https://openalex.org/W2007032764","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W4352977312","https://openalex.org/W2041180560"],"abstract_inverted_index":{"A":[0],"Sequence-based":[1],"Selection":[2],"Hyper-Heuristic":[3],"(SSHH)":[4],"utilises":[5],"a":[6,20,42,59,142],"hidden":[7],"Markov":[8],"model":[9],"(HMM)":[10],"to":[11,17,19,34,62,100],"generate":[12,63],"sequences":[13,64],"of":[14,85,113,136,155],"low-level":[15],"heuristics":[16],"apply":[18],"given":[21],"problem.":[22,148],"The":[23,134],"HMM":[24,44,61,129],"represents":[25],"learnt":[26,49],"probabilistic":[27],"relationships":[28],"in":[29,67,74,102],"transitioning":[30],"from":[31],"one":[32,48],"heuristic":[33],"the":[35,81,120,137],"next":[36],"for":[37],"generating":[38],"good":[39],"sequences.":[40],"However,":[41],"single":[43,60],"will":[45,97],"only":[46],"represent":[47],"behaviour":[50],"pattern":[51],"which":[52],"may":[53],"not":[54],"be":[55,88,98],"ideal.":[56],"Furthermore,":[57],"using":[58,91,141],"is":[65],"sequential":[66,166],"manner":[68],"but":[69],"most":[70],"processors":[71],"are":[72,117,139],"parallel":[73,103,114],"nature.":[75],"Consequently,":[76],"this":[77],"paper":[78],"proposes":[79],"that":[80,158],"effectiveness":[82,135],"and":[83],"speed":[84],"SSHH":[86,116,125,132,156,167],"can":[87],"improved":[89,164],"by":[90],"multiple":[92],"SSHH,":[93],"an":[94],"ensemble.":[95],"These":[96],"able":[99],"operate":[101],"exploiting":[104],"multi-core":[105],"processor":[106],"resources":[107],"facilitating":[108],"faster":[109],"optimisation.":[110],"Two":[111],"methods":[112,138],"ensemble":[115],"investigated,":[118],"sharing":[119],"best":[121,150],"found":[122,151],"solution":[123],"amongst":[124],"instantiations":[126],"or":[127],"combining":[128],"information":[130],"between":[131,153],"models.":[133],"assessed":[140],"real-world":[143],"electric":[144],"bus":[145],"scheduling":[146],"optimisation":[147],"Sharing":[149],"solutions":[152],"ensembles":[154],"models":[157],"have":[159],"differing":[160],"sequence":[161],"behaviours":[162],"significantly":[163],"upon":[165],"results":[168],"with":[169],"much":[170],"lower":[171],"run-times.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}