{"id":"https://openalex.org/W4308725154","doi":"https://doi.org/10.3390/a15110405","title":"Evolutionary Algorithm-Based Iterated Local Search Hyper-Heuristic for Combinatorial Optimization Problems","display_name":"Evolutionary Algorithm-Based Iterated Local Search Hyper-Heuristic for Combinatorial Optimization Problems","publication_year":2022,"publication_date":"2022-10-31","ids":{"openalex":"https://openalex.org/W4308725154","doi":"https://doi.org/10.3390/a15110405"},"language":"en","primary_location":{"id":"doi:10.3390/a15110405","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110405","pdf_url":"https://www.mdpi.com/1999-4893/15/11/405/pdf?version=1668482594","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/11/405/pdf?version=1668482594","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027056527","display_name":"Stephen A. Adubi","orcid":"https://orcid.org/0000-0003-1950-3727"},"institutions":[{"id":"https://openalex.org/I186771145","display_name":"Covenant University","ror":"https://ror.org/00frr1n84","country_code":"NG","type":"education","lineage":["https://openalex.org/I186771145"]}],"countries":["NG"],"is_corresponding":false,"raw_author_name":"Stephen A. Adubi","raw_affiliation_strings":["Department of Computer and Information Sciences, Covenant University Ota, Ota 112104, Nigeria"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Covenant University Ota, Ota 112104, Nigeria","institution_ids":["https://openalex.org/I186771145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076722247","display_name":"Olufunke Oladipupo","orcid":"https://orcid.org/0000-0003-1309-0159"},"institutions":[{"id":"https://openalex.org/I186771145","display_name":"Covenant University","ror":"https://ror.org/00frr1n84","country_code":"NG","type":"education","lineage":["https://openalex.org/I186771145"]},{"id":"https://openalex.org/I177181097","display_name":"Durban University of Technology","ror":"https://ror.org/0303y7a51","country_code":"ZA","type":"education","lineage":["https://openalex.org/I177181097"]}],"countries":["NG","ZA"],"is_corresponding":false,"raw_author_name":"Olufunke O. Oladipupo","raw_affiliation_strings":["Department of Computer and Information Sciences, Covenant University Ota, Ota 112104, Nigeria","MICT SETA 4IR Center of Excellence, Durban University of Technology, Durban 4001, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Covenant University Ota, Ota 112104, Nigeria","institution_ids":["https://openalex.org/I186771145"]},{"raw_affiliation_string":"MICT SETA 4IR Center of Excellence, Durban University of Technology, Durban 4001, South Africa","institution_ids":["https://openalex.org/I177181097"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050825757","display_name":"Oludayo O. Olugbara","orcid":"https://orcid.org/0000-0003-1633-7583"},"institutions":[{"id":"https://openalex.org/I177181097","display_name":"Durban University of Technology","ror":"https://ror.org/0303y7a51","country_code":"ZA","type":"education","lineage":["https://openalex.org/I177181097"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Oludayo O. Olugbara","raw_affiliation_strings":["MICT SETA 4IR Center of Excellence, Durban University of Technology, Durban 4001, South Africa"],"affiliations":[{"raw_affiliation_string":"MICT SETA 4IR Center of Excellence, Durban University of Technology, Durban 4001, South Africa","institution_ids":["https://openalex.org/I177181097"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050825757"],"corresponding_institution_ids":["https://openalex.org/I177181097"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.9283,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79109669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"15","issue":"11","first_page":"405","last_page":"405"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976999759674072,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9954000115394592,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8710788488388062},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7724661231040955},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6281561851501465},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5433720946311951},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.5426990389823914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5118116736412048},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.49936389923095703},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.49321144819259644},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4749886095523834},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4710051119327545},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.464002788066864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40445899963378906},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20213451981544495}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8710788488388062},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7724661231040955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6281561851501465},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5433720946311951},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5426990389823914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5118116736412048},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.49936389923095703},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.49321144819259644},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4749886095523834},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4710051119327545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.464002788066864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40445899963378906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20213451981544495},{"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/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15110405","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110405","pdf_url":"https://www.mdpi.com/1999-4893/15/11/405/pdf?version=1668482594","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:7490500e40c14f22a720f66b2941e5d0","is_oa":true,"landing_page_url":"https://doaj.org/article/7490500e40c14f22a720f66b2941e5d0","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 11, p 405 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/11/405/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15110405","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"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":"Algorithms; Volume 15; Issue 11; Pages: 405","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15110405","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110405","pdf_url":"https://www.mdpi.com/1999-4893/15/11/405/pdf?version=1668482594","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4308725154.pdf","grobid_xml":"https://content.openalex.org/works/W4308725154.grobid-xml"},"referenced_works_count":71,"referenced_works":["https://openalex.org/W209501560","https://openalex.org/W1415548470","https://openalex.org/W1485930605","https://openalex.org/W1503085769","https://openalex.org/W2003091800","https://openalex.org/W2047937685","https://openalex.org/W2056802132","https://openalex.org/W2083777413","https://openalex.org/W2134067165","https://openalex.org/W2202502706","https://openalex.org/W2264593986","https://openalex.org/W2269913476","https://openalex.org/W2462800345","https://openalex.org/W2521162728","https://openalex.org/W2559741365","https://openalex.org/W2580414719","https://openalex.org/W2587579594","https://openalex.org/W2588209243","https://openalex.org/W2725435222","https://openalex.org/W2731088668","https://openalex.org/W2744012164","https://openalex.org/W2762451727","https://openalex.org/W2764270538","https://openalex.org/W2783585128","https://openalex.org/W2789584774","https://openalex.org/W2801484356","https://openalex.org/W2801955939","https://openalex.org/W2802765707","https://openalex.org/W2804605181","https://openalex.org/W2805382256","https://openalex.org/W2885975332","https://openalex.org/W2889963938","https://openalex.org/W2892397808","https://openalex.org/W2897295437","https://openalex.org/W2900539411","https://openalex.org/W2908569348","https://openalex.org/W2914776042","https://openalex.org/W2928611323","https://openalex.org/W2939749342","https://openalex.org/W2944413817","https://openalex.org/W2945869387","https://openalex.org/W2964082281","https://openalex.org/W2967783393","https://openalex.org/W2970574405","https://openalex.org/W2996113056","https://openalex.org/W2997799421","https://openalex.org/W2998327136","https://openalex.org/W2999840680","https://openalex.org/W3003138392","https://openalex.org/W3005705035","https://openalex.org/W3019703409","https://openalex.org/W3035218439","https://openalex.org/W3035833550","https://openalex.org/W3036220094","https://openalex.org/W3083238983","https://openalex.org/W3083497736","https://openalex.org/W3096282034","https://openalex.org/W3100520057","https://openalex.org/W3111551443","https://openalex.org/W3120876919","https://openalex.org/W3125371829","https://openalex.org/W3127916369","https://openalex.org/W3136536335","https://openalex.org/W3159037482","https://openalex.org/W3190544158","https://openalex.org/W3194152491","https://openalex.org/W3208057219","https://openalex.org/W3210440504","https://openalex.org/W4285734633","https://openalex.org/W4294811557","https://openalex.org/W6772023621"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2964468721","https://openalex.org/W2887485518","https://openalex.org/W2005660029","https://openalex.org/W1996453501","https://openalex.org/W1666350026","https://openalex.org/W2346455737","https://openalex.org/W3081534731","https://openalex.org/W2085086011","https://openalex.org/W2597713582"],"abstract_inverted_index":{"Hyper-heuristics":[0],"are":[1],"widely":[2],"used":[3],"for":[4,33,99,102],"solving":[5],"numerous":[6],"complex":[7],"computational":[8],"search":[9,25,35,80],"problems":[10],"because":[11],"of":[12,28,69,93,126,153],"their":[13],"intrinsic":[14],"capability":[15,168],"to":[16,73,89,109,118,171],"generalize":[17],"across":[18,64,122],"problem":[19,41,65,124],"domains.":[20,42,66],"The":[21,67,105,133],"fair-share":[22],"iterated":[23,78],"local":[24,79],"is":[26],"one":[27],"the":[29,91,113,123,139,144,157,172],"most":[30],"successful":[31],"hyper-heuristics":[32,114],"cross-domain":[34],"with":[36],"outstanding":[37],"performances":[38,48],"on":[39,49,150],"six":[40],"However,":[43],"it":[44,161],"has":[45,162],"recorded":[46],"low":[47],"three":[50],"supplementary":[51],"problems,":[52,59],"namely":[53],"knapsack,":[54,127],"quadratic":[55,128],"assignment,":[56,129],"and":[57,130],"maximum-cut":[58],"which":[60],"undermines":[61],"its":[62,120,166],"credibility":[63],"purpose":[68],"this":[70],"study":[71],"was":[72,107],"design":[74],"an":[75],"evolutionary":[76],"algorithm-based":[77],"(EA-ILS)":[81],"hyper-heuristic":[82,141,175],"that":[83,138],"applies":[84],"a":[85],"novel":[86],"mutation":[87],"operator":[88],"control":[90],"selection":[92],"perturbative":[94],"low-level":[95],"heuristics":[96],"in":[97,112,156,165],"searching":[98],"optimal":[100],"sequences":[101],"performance":[103,121],"improvement.":[104],"algorithm":[106],"compared":[108,170],"existing":[110],"ones":[111],"flexible":[115],"(HyFlex)":[116],"framework":[117],"demonstrate":[119],"domains":[125],"maximum":[131],"cut.":[132],"comparative":[134],"results":[135],"have":[136],"shown":[137],"EA-ILS":[140],"can":[142],"obtain":[143],"best":[145],"median":[146],"objective":[147],"function":[148],"values":[149],"22":[151],"out":[152],"30":[154],"instances":[155],"HyFlex":[158],"framework.":[159],"Moreover,":[160],"achieved":[163],"superiority":[164],"generalization":[167],"when":[169],"reported":[173],"top-performing":[174],"algorithms.":[176]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}