{"id":"https://openalex.org/W2131422526","doi":"https://doi.org/10.1162/evco_a_00121","title":"A Lifelong Learning Hyper-heuristic Method for Bin Packing","display_name":"A Lifelong Learning Hyper-heuristic Method for Bin Packing","publication_year":2014,"publication_date":"2014-02-10","ids":{"openalex":"https://openalex.org/W2131422526","doi":"https://doi.org/10.1162/evco_a_00121","mag":"2131422526","pmid":"https://pubmed.ncbi.nlm.nih.gov/24512321"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00121","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00121","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://napier-surface.worktribe.com/173422/1/A%20lifelong%20learning%20hyper-heuristic%20method%20for%20bin%20packing","any_repository_has_fulltext":true},"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":["Institute for Informatics and Digital Innovation, Edinburgh Napier University, Edinburgh, EH10, UK"],"affiliations":[{"raw_affiliation_string":"Institute for Informatics and Digital Innovation, Edinburgh Napier University, Edinburgh, EH10, UK","institution_ids":["https://openalex.org/I251738"]}]},{"author_position":"middle","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":["Institute for Informatics and Digital Innovation, Edinburgh Napier University, Edinburgh, EH10, UK"],"affiliations":[{"raw_affiliation_string":"Institute for Informatics and Digital Innovation, Edinburgh Napier University, Edinburgh, EH10, UK","institution_ids":["https://openalex.org/I251738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015586991","display_name":"Ben Paechter","orcid":"https://orcid.org/0000-0002-4841-0805"},"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":"Ben Paechter","raw_affiliation_strings":["Institute for Informatics and Digital Innovation, Edinburgh Napier University, Edinburgh, EH10, UK"],"affiliations":[{"raw_affiliation_string":"Institute for Informatics and Digital Innovation, Edinburgh Napier University, Edinburgh, EH10, UK","institution_ids":["https://openalex.org/I251738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059180650"],"corresponding_institution_ids":["https://openalex.org/I251738"],"apc_list":null,"apc_paid":null,"fwci":5.2311,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.95988264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"23","issue":"1","first_page":"37","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12391","display_name":"Artificial Immune Systems Applications","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T12391","display_name":"Artificial Immune Systems Applications","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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.9381999969482422,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8547391891479492},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7432231307029724},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7233552932739258},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7085394263267517},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6910921335220337},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.46917158365249634},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4552631676197052},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43248656392097473},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.42871496081352234},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.41772258281707764},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39608824253082275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23452699184417725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18029624223709106},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.06971427798271179}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8547391891479492},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7432231307029724},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7233552932739258},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7085394263267517},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6910921335220337},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.46917158365249634},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4552631676197052},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43248656392097473},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.42871496081352234},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.41772258281707764},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39608824253082275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23452699184417725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18029624223709106},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06971427798271179},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000069550","descriptor_name":"Machine Learning","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":4,"locations":[{"id":"doi:10.1162/evco_a_00121","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00121","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:24512321","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/24512321","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:napier-surface.worktribe.com:173422","is_oa":true,"landing_page_url":"https://napier-surface.worktribe.com/173422/1/A%20lifelong%20learning%20hyper-heuristic%20method%20for%20bin%20packing","pdf_url":null,"source":{"id":"https://openalex.org/S4306400544","display_name":"Research Output (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"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":"","raw_type":"Journal Article"},{"id":"pmh:oai:repository@napier.ac.uk:173422","is_oa":true,"landing_page_url":"http://researchrepository.napier.ac.uk/id/eprint/6640","pdf_url":null,"source":{"id":"https://openalex.org/S4306402591","display_name":"Edinburgh Napier Research Repository (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:napier-surface.worktribe.com:173422","is_oa":true,"landing_page_url":"https://napier-surface.worktribe.com/173422/1/A%20lifelong%20learning%20hyper-heuristic%20method%20for%20bin%20packing","pdf_url":null,"source":{"id":"https://openalex.org/S4306400544","display_name":"Research Output (Edinburgh Napier University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I251738","host_organization_name":"Edinburgh Napier University","host_organization_lineage":["https://openalex.org/I251738"],"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":"","raw_type":"Journal Article"},"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production"}],"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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W26704448","https://openalex.org/W81293824","https://openalex.org/W99485931","https://openalex.org/W197747737","https://openalex.org/W199153045","https://openalex.org/W1504056704","https://openalex.org/W1505683126","https://openalex.org/W1512387364","https://openalex.org/W1519626139","https://openalex.org/W1527172735","https://openalex.org/W1536647479","https://openalex.org/W1540481058","https://openalex.org/W1543543863","https://openalex.org/W1547788791","https://openalex.org/W1551186452","https://openalex.org/W1566766802","https://openalex.org/W1576818901","https://openalex.org/W1604262696","https://openalex.org/W1668207500","https://openalex.org/W1789156271","https://openalex.org/W1814515812","https://openalex.org/W1820078070","https://openalex.org/W1824538363","https://openalex.org/W1967428069","https://openalex.org/W1977638894","https://openalex.org/W2001514005","https://openalex.org/W2009363335","https://openalex.org/W2011039300","https://openalex.org/W2013067314","https://openalex.org/W2026524380","https://openalex.org/W2058653357","https://openalex.org/W2065329645","https://openalex.org/W2076526693","https://openalex.org/W2097006520","https://openalex.org/W2110218658","https://openalex.org/W2117082171","https://openalex.org/W2120501001","https://openalex.org/W2132592694","https://openalex.org/W2137654273","https://openalex.org/W2138522309","https://openalex.org/W2140003718","https://openalex.org/W2140832539","https://openalex.org/W2150336375","https://openalex.org/W2152382740","https://openalex.org/W2152709940","https://openalex.org/W2155312717","https://openalex.org/W2155434512","https://openalex.org/W2162155330","https://openalex.org/W2171341281","https://openalex.org/W2280269595","https://openalex.org/W2344265714","https://openalex.org/W2497935614","https://openalex.org/W2525579820","https://openalex.org/W2915410163","https://openalex.org/W3004042307","https://openalex.org/W3022839551","https://openalex.org/W4232872328","https://openalex.org/W4249571003","https://openalex.org/W4253067835","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W138116057","https://openalex.org/W4255148175","https://openalex.org/W2161940019","https://openalex.org/W2001915926","https://openalex.org/W2096053066","https://openalex.org/W2104955674","https://openalex.org/W2971368033","https://openalex.org/W2949755993"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,13,37,102,158,168],"novel":[3],"hyper-heuristic":[4],"system":[5,18,98,176],"that":[6,166],"continuously":[7,19],"learns":[8],"over":[9,93],"time":[10],"to":[11,61,73,80,141,149,156,180],"solve":[12],"combinatorial":[14],"optimisation":[15],"problem.":[16],"The":[17,50,97],"generates":[20],"new":[21,81,107],"heuristics":[22,33,165],"and":[23,29,32,58,87,138,164,184],"samples":[24],"problems":[25,31,82,112,119,163],"from":[26,120],"its":[27,56],"environment;":[28],"representative":[30,169],"are":[34],"incorporated":[35],"into":[36],"self-sustaining":[38],"network":[39,51,72,154],"of":[40,91,105,109,129,132,145,161,171],"interacting":[41],"entities":[42],"inspired":[43],"by":[44],"methods":[45],"in":[46,54,70,127,139],"artificial":[47],"immune":[48],"systems.":[49],"is":[52,89,99,177],"plastic":[53],"both":[55,162],"structure":[57],"content,":[59],"leading":[60],"the":[62,71,94,121,130,136,153,172,175],"following":[63],"properties:":[64],"it":[65,77,88,123],"exploits":[66],"existing":[67,118],"knowledge":[68],"captured":[69],"rapidly":[74],"produce":[75],"solutions;":[76],"can":[78],"adapt":[79],"with":[83],"widely":[84],"differing":[85],"characteristics;":[86],"capable":[90],"generalising":[92],"problem":[95,146,173],"space.":[96],"tested":[100],"on":[101,116],"large":[103],"corpus":[104],"3,968":[106],"instances":[108,147],"1D":[110],"bin-packing":[111],"as":[113,115],"well":[114],"1,370":[117],"literature;":[122],"shows":[124],"excellent":[125],"performance":[126],"terms":[128],"quality":[131],"solutions":[133],"obtained":[134],"across":[135],"datasets":[137],"adapting":[140],"dynamically":[142],"changing":[143],"sets":[144],"compared":[148],"previous":[150],"approaches.":[151],"As":[152],"self-adapts":[155],"sustain":[157],"minimal":[159],"repertoire":[160],"form":[167],"map":[170],"space,":[174],"further":[178],"shown":[179],"be":[181],"computationally":[182],"efficient":[183],"therefore":[185],"scalable.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}