{"id":"https://openalex.org/W2109775141","doi":"https://doi.org/10.1109/cec.2003.1299807","title":"Hyperheuristics for managing a large collection of low level heuristics to schedule personnel","display_name":"Hyperheuristics for managing a large collection of low level heuristics to schedule personnel","publication_year":2004,"publication_date":"2004-07-09","ids":{"openalex":"https://openalex.org/W2109775141","doi":"https://doi.org/10.1109/cec.2003.1299807","mag":"2109775141"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2003.1299807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015528995","display_name":"Peter Cowling","orcid":"https://orcid.org/0000-0003-1310-6683"},"institutions":[{"id":"https://openalex.org/I139894009","display_name":"University of Bradford","ror":"https://ror.org/00vs8d940","country_code":"GB","type":"education","lineage":["https://openalex.org/I139894009"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"P. Cowling","raw_affiliation_strings":["Modelling Optimisation Scheduling and Intelligent Computing (MOSAIC) Research Centre, Department of Computing, University of Bradford, Bradford, UK","[Dept. of Comput., Bradford Univ., UK]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modelling Optimisation Scheduling and Intelligent Computing (MOSAIC) Research Centre, Department of Computing, University of Bradford, Bradford, UK","institution_ids":["https://openalex.org/I139894009"]},{"raw_affiliation_string":"[Dept. of Comput., Bradford Univ., UK]","institution_ids":["https://openalex.org/I139894009"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030148571","display_name":"Konstantin Chakhlevitch","orcid":null},"institutions":[{"id":"https://openalex.org/I139894009","display_name":"University of Bradford","ror":"https://ror.org/00vs8d940","country_code":"GB","type":"education","lineage":["https://openalex.org/I139894009"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"K. Chakhlevitch","raw_affiliation_strings":["Modelling Optimisation Scheduling and Intelligent Computing (MOSAIC) Research Centre, Department of Computing, University of Bradford, Bradford, UK","[Dept. of Comput., Bradford Univ., UK]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modelling Optimisation Scheduling and Intelligent Computing (MOSAIC) Research Centre, Department of Computing, University of Bradford, Bradford, UK","institution_ids":["https://openalex.org/I139894009"]},{"raw_affiliation_string":"[Dept. of Comput., Bradford Univ., UK]","institution_ids":["https://openalex.org/I139894009"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015528995"],"corresponding_institution_ids":["https://openalex.org/I139894009"],"apc_list":null,"apc_paid":null,"fwci":3.6071,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.92476269,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":null,"first_page":"1214","last_page":"1221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"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":1.0,"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.9968000054359436,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.9438436031341553},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.6791791319847107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6447333097457886},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5387111902236938},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4892747104167938},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.45115670561790466},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42865189909935},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.408452570438385},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.388746052980423},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.340182900428772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19598469138145447},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09770849347114563}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.9438436031341553},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.6791791319847107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6447333097457886},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5387111902236938},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4892747104167938},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.45115670561790466},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42865189909935},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.408452570438385},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.388746052980423},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.340182900428772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19598469138145447},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09770849347114563},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2003.1299807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W16292936","https://openalex.org/W20267955","https://openalex.org/W197551278","https://openalex.org/W1507159998","https://openalex.org/W1508785365","https://openalex.org/W1531666479","https://openalex.org/W1549353496","https://openalex.org/W1572910922","https://openalex.org/W1668207500","https://openalex.org/W1849813686","https://openalex.org/W1936224457","https://openalex.org/W1976288392","https://openalex.org/W1981097545","https://openalex.org/W1992548724","https://openalex.org/W2004217556","https://openalex.org/W2069657950","https://openalex.org/W2112788256","https://openalex.org/W2114712485","https://openalex.org/W2130691671","https://openalex.org/W2140759234","https://openalex.org/W2339500526","https://openalex.org/W3103464856","https://openalex.org/W4212899374","https://openalex.org/W4285719527","https://openalex.org/W6600822077","https://openalex.org/W6608002675","https://openalex.org/W6630317591","https://openalex.org/W6631854281","https://openalex.org/W6639101744","https://openalex.org/W6681030992"],"related_works":["https://openalex.org/W3204654320","https://openalex.org/W1628567638","https://openalex.org/W3186374002","https://openalex.org/W2109775141","https://openalex.org/W2521454154","https://openalex.org/W2107678394","https://openalex.org/W2521049309","https://openalex.org/W3083497736","https://openalex.org/W2020754965","https://openalex.org/W4297052805"],"abstract_inverted_index":{"We":[0,41,89,106,128,174],"investigate":[1],"the":[2,22,82,91,95,102,148,178],"performance":[3,70],"of":[4,24,84,93,97,111,147,180,183],"several":[5],"hyperheuristics":[6],"applied":[7],"to":[8,34,44,53,57,77,122,132,170],"a":[9,16,30,55,72,78,108,117,133,141,158],"real-world":[10,39,160],"personnel-scheduling":[11],"problem.":[12,61],"A":[13],"hyperheuristic":[14,56,63,130,153],"is":[15,75],"high-level":[17],"search":[18],"method":[19],"which":[20,119],"manages":[21],"choice":[23,179],"low":[25,47,85,98,112,125,164,184],"level":[26,48,86,99,113,126,165,185],"heuristics,":[27],"making":[28],"it":[29],"robust":[31],"and":[32,50],"easy":[33],"implement":[35],"approach":[36],"for":[37,71,101],"complex":[38,159],"problems.":[40],"need":[42],"only":[43],"develop":[45],"new":[46,60],"heuristics":[49,87,100,114,166,186],"objective":[51],"functions":[52],"apply":[54,129],"an":[58],"entirely":[59],"Although":[62],"methods":[64,131],"require":[65],"limited":[66],"problem-specific":[67],"information,":[68],"their":[69],"particular":[73],"problem":[74,103,136,161],"determined":[76],"great":[79],"extent":[80],"by":[81,115],"quality":[83],"used.":[88],"address":[90],"question":[92],"designing":[94],"set":[96,110],"under":[104],"consideration.":[105],"construct":[107],"large":[109,142],"using":[116,137],"technique":[118],"allows":[120],"us":[121],"\"multiply\"":[123],"partial":[124],"heuristics.":[127],"trainer":[134],"scheduling":[135],"commercial":[138],"data":[139],"from":[140],"financial":[143],"institution.":[144],"The":[145],"results":[146],"experiments":[149],"show":[150],"that":[151,163],"simple":[152],"approaches":[154],"can":[155],"successfully":[156],"tackle":[157],"provided":[162],"are":[167],"carefully":[168],"selected":[169],"treat":[171],"various":[172],"constraints.":[173],"also":[175],"examine":[176],"how":[177],"different":[181],"sets":[182],"affects":[187],"solution":[188],"quality.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}