{"id":"https://openalex.org/W2135957232","doi":"https://doi.org/10.1109/cec.2010.5586348","title":"Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem","display_name":"Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2135957232","doi":"https://doi.org/10.1109/cec.2010.5586348","mag":"2135957232"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2010.5586348","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/267296","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024551178","display_name":"Mustafa M\u0131s\u0131r","orcid":"https://orcid.org/0000-0002-6885-6775"},"institutions":[{"id":"https://openalex.org/I4210164873","display_name":"AZ Sint-Lucas","ror":"https://ror.org/05pzxer45","country_code":"BE","type":"healthcare","lineage":["https://openalex.org/I4210164873"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Mustafa Misir","raw_affiliation_strings":["CODeS, KaHo Sint-Lieven, Gent, Belgium","CODeS, KaHo Sint-Lieven, Gebroeders Desmeetstraat 1, 9000 Gent, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CODeS, KaHo Sint-Lieven, Gent, Belgium","institution_ids":["https://openalex.org/I4210164873"]},{"raw_affiliation_string":"CODeS, KaHo Sint-Lieven, Gebroeders Desmeetstraat 1, 9000 Gent, Belgium","institution_ids":["https://openalex.org/I4210164873"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013075653","display_name":"Katja Verbeeck","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164873","display_name":"AZ Sint-Lucas","ror":"https://ror.org/05pzxer45","country_code":"BE","type":"healthcare","lineage":["https://openalex.org/I4210164873"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Katja Verbeeck","raw_affiliation_strings":["CODeS, KaHo Sint-Lieven, Gent, Belgium","CODeS, KaHo Sint-Lieven, Gebroeders Desmeetstraat 1, 9000 Gent, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CODeS, KaHo Sint-Lieven, Gent, Belgium","institution_ids":["https://openalex.org/I4210164873"]},{"raw_affiliation_string":"CODeS, KaHo Sint-Lieven, Gebroeders Desmeetstraat 1, 9000 Gent, Belgium","institution_ids":["https://openalex.org/I4210164873"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074966723","display_name":"Patrick De Causmaecker","orcid":"https://orcid.org/0000-0002-6763-1945"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Patrick De Causmaecker","raw_affiliation_strings":["Department of Computer Science, Katholieke Universiteit Leuven, Kortrijk, Belgium","CODeS, Department of Computer Science, Katholieke Universiteit Leuven, Campus Kortrijk, Etienne Sabbelaan 53, 8500 Kortrijk, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Katholieke Universiteit Leuven, Kortrijk, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"CODeS, Department of Computer Science, Katholieke Universiteit Leuven, Campus Kortrijk, Etienne Sabbelaan 53, 8500 Kortrijk, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088025499","display_name":"Greet Van den Berghe","orcid":"https://orcid.org/0000-0002-5320-1362"},"institutions":[{"id":"https://openalex.org/I4210164873","display_name":"AZ Sint-Lucas","ror":"https://ror.org/05pzxer45","country_code":"BE","type":"healthcare","lineage":["https://openalex.org/I4210164873"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Greet Vanden Berghe","raw_affiliation_strings":["CODeS, KaHo Sint-Lieven, Gent, Belgium","CODeS, KaHo Sint-Lieven, Gebroeders Desmeetstraat 1, 9000 Gent, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CODeS, KaHo Sint-Lieven, Gent, Belgium","institution_ids":["https://openalex.org/I4210164873"]},{"raw_affiliation_string":"CODeS, KaHo Sint-Lieven, Gebroeders Desmeetstraat 1, 9000 Gent, Belgium","institution_ids":["https://openalex.org/I4210164873"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.0759,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.97152806,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983000159263611,"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.8891009092330933},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6345592141151428},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.6339689493179321},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.562931478023529},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5622820854187012},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5071389675140381},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49556291103363037},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.4645976722240448},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.4484637677669525},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3509905934333801},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2390756607055664},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.23473110795021057},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22894597053527832},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19230607151985168}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8891009092330933},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6345592141151428},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.6339689493179321},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.562931478023529},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5622820854187012},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5071389675140381},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49556291103363037},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4645976722240448},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.4484637677669525},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3509905934333801},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2390756607055664},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.23473110795021057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22894597053527832},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19230607151985168},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2010.5586348","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/267296","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/267296","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Congress on evolutionary computation, Barcelona, Spain, 18-23 July 2010","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/267296","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/267296","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Congress on evolutionary computation, Barcelona, Spain, 18-23 July 2010","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W120448894","https://openalex.org/W159706599","https://openalex.org/W618486057","https://openalex.org/W1507057216","https://openalex.org/W1547788791","https://openalex.org/W1549353496","https://openalex.org/W1568673319","https://openalex.org/W1572150798","https://openalex.org/W1601464705","https://openalex.org/W1606498431","https://openalex.org/W1668207500","https://openalex.org/W1745341198","https://openalex.org/W1773641489","https://openalex.org/W1814515812","https://openalex.org/W1820078070","https://openalex.org/W1936224457","https://openalex.org/W1971985512","https://openalex.org/W1972291640","https://openalex.org/W1975009200","https://openalex.org/W2022194097","https://openalex.org/W2022681178","https://openalex.org/W2030910540","https://openalex.org/W2038557808","https://openalex.org/W2046084157","https://openalex.org/W2055164984","https://openalex.org/W2056956492","https://openalex.org/W2064104291","https://openalex.org/W2077310141","https://openalex.org/W2096305430","https://openalex.org/W2098544346","https://openalex.org/W2108293653","https://openalex.org/W2112100376","https://openalex.org/W2133734201","https://openalex.org/W2138442882","https://openalex.org/W2140759234","https://openalex.org/W2148948822","https://openalex.org/W2156416674","https://openalex.org/W2161393961","https://openalex.org/W2165207629","https://openalex.org/W2238166365","https://openalex.org/W2397851245","https://openalex.org/W2733271008","https://openalex.org/W2982764604","https://openalex.org/W4248813438","https://openalex.org/W4285719527","https://openalex.org/W6606570324","https://openalex.org/W6619365924","https://openalex.org/W6635815512","https://openalex.org/W6640631110","https://openalex.org/W6680432837","https://openalex.org/W6683101223","https://openalex.org/W6741326176","https://openalex.org/W6983729378"],"related_works":["https://openalex.org/W2108779411","https://openalex.org/W3111117784","https://openalex.org/W4302010637","https://openalex.org/W2101174032","https://openalex.org/W1140243306","https://openalex.org/W2913108234","https://openalex.org/W1620286322","https://openalex.org/W4285606966","https://openalex.org/W1611862752","https://openalex.org/W1973512232"],"abstract_inverted_index":{"A":[0],"hyper-heuristic":[1],"performs":[2],"search":[3,9,27],"over":[4,92],"a":[5,34,46,53,62],"set":[6,63,91],"of":[7,45,55,64,80],"other":[8],"mechanisms.":[10,28],"During":[11],"the":[12,58,74,78,81,89,93],"search,":[13],"it":[14],"does":[15],"not":[16],"require":[17],"any":[18],"problem-dependent":[19],"data.":[20],"This":[21],"structure":[22],"makes":[23],"hyper-heuristics":[24,56,83],"problem-independent":[25],"indirect":[26],"In":[29],"this":[30],"study,":[31],"we":[32,51],"propose":[33],"learning":[35,75],"strategy":[36,76],"to":[37,61],"explore":[38],"elite":[39],"heuristic":[40,90],"subsets":[41],"for":[42],"different":[43,82],"phases":[44],"search.":[47],"For":[48],"that":[49,73],"purpose,":[50],"apply":[52],"number":[54],"with":[57],"proposed":[59],"approach":[60],"home":[65],"care":[66],"scheduling":[67],"problem":[68,95],"instances.":[69,96],"The":[70],"results":[71],"show":[72],"increases":[77],"performance":[79],"by":[84],"excluding":[85],"some":[86],"heuristics":[87],"from":[88],"tested":[94]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}