{"id":"https://openalex.org/W1936224457","doi":"https://doi.org/10.1109/cec.2002.1004411","title":"An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem","display_name":"An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1936224457","doi":"https://doi.org/10.1109/cec.2002.1004411","mag":"1936224457"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2002.1004411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2002.1004411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","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"]},{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"P. Cowling","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and IT, University of Nottingham, Nottingham, UK","[Dept. of Comput., Bradford Univ., UK]"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and IT, University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"[Dept. of Comput., Bradford Univ., UK]","institution_ids":["https://openalex.org/I139894009"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074319022","display_name":"Graham Kendall","orcid":"https://orcid.org/0000-0003-2006-5103"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]},{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB","IR"],"is_corresponding":false,"raw_author_name":"G. Kendall","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and IT, University of Nottingham, Nottingham, UK","Dept. of Electr. Eng., SHARIF Univ. of Technol., Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and IT, University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Dept. of Electr. Eng., SHARIF Univ. of Technol., Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101883145","display_name":"Limin Han","orcid":null},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]},{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["FR","GB"],"is_corresponding":false,"raw_author_name":"Limin Han","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and IT, University of Nottingham, Nottingham, UK","LIFL, Lille Univ., Villeneuve d'Ascq, France#TAB#"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and IT, University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"LIFL, Lille Univ., Villeneuve d'Ascq, France#TAB#","institution_ids":["https://openalex.org/I174424907"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015528995"],"corresponding_institution_ids":["https://openalex.org/I139894009","https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":10.1711,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.98292158,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"2","issue":null,"first_page":"1185","last_page":"1190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9114000201225281,"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.9114000201225281,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.021700000390410423,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.019999999552965164,"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.8084089756011963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6571463942527771},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5876743793487549},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.5641355514526367},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5375565886497498},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.4875042140483856},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4872654676437378},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47006353735923767},{"id":"https://openalex.org/keywords/trainer","display_name":"Trainer","score":0.45614784955978394},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4383198022842407},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4118998050689697},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3797849118709564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36686328053474426},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.29216164350509644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2424982488155365},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.08652293682098389}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8084089756011963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6571463942527771},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5876743793487549},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.5641355514526367},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5375565886497498},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.4875042140483856},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4872654676437378},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47006353735923767},{"id":"https://openalex.org/C2780463512","wikidata":"https://www.wikidata.org/wiki/Q15122700","display_name":"Trainer","level":2,"score":0.45614784955978394},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4383198022842407},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4118998050689697},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3797849118709564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36686328053474426},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29216164350509644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2424982488155365},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.08652293682098389},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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":2,"locations":[{"id":"doi:10.1109/cec.2002.1004411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2002.1004411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.2249","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.2249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/~gxk/papers/cec2002lxh.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W16292936","https://openalex.org/W1531666479","https://openalex.org/W1572910922","https://openalex.org/W1607488343","https://openalex.org/W1608418751","https://openalex.org/W1680972677","https://openalex.org/W1849813686","https://openalex.org/W1976288392","https://openalex.org/W1981097545","https://openalex.org/W1992548724","https://openalex.org/W2004217556","https://openalex.org/W2015097024","https://openalex.org/W2027291572","https://openalex.org/W2064568071","https://openalex.org/W2066671865","https://openalex.org/W2130691671","https://openalex.org/W2140759234","https://openalex.org/W2166843422","https://openalex.org/W3103464856","https://openalex.org/W6600672058","https://openalex.org/W6631854281"],"related_works":["https://openalex.org/W1628567638","https://openalex.org/W2109775141","https://openalex.org/W3186374002","https://openalex.org/W2521454154","https://openalex.org/W2107678394","https://openalex.org/W2521049309","https://openalex.org/W2020754965","https://openalex.org/W3083497736","https://openalex.org/W4297052805","https://openalex.org/W4214899859"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"a":[3,25,40,44,48,58,75,89,105,118],"genetic":[4],"algorithm":[5],"based":[6],"hyperheuristic":[7,69],"(hyper-GA)":[8],"for":[9,28,74,109],"scheduling":[10],"geographically":[11],"distributed":[12],"training":[13],"staff":[14],"and":[15,35,64,80,123],"courses.":[16],"The":[17],"aim":[18],"of":[19,32,50,60,78,92,112,120],"the":[20,33,54,68,98,113],"hyper-GA":[21,114],"is":[22],"to":[23,38,85,126],"evolve":[24],"good-quality":[26],"heuristic":[27],"each":[29],"given":[30],"instance":[31],"problem":[34,93,99],"use":[36],"this":[37],"find":[39],"solution":[41],"by":[42,104],"applying":[43,124],"suitable":[45],"ordering":[46],"from":[47],"set":[49],"low-level":[51,61],"heuristics.":[52],"Since":[53],"user":[55],"only":[56],"supplies":[57],"number":[59],"problem-specific":[62],"heuristics":[63,122],"an":[65],"evaluation":[66],"function,":[67],"can":[70,100],"easily":[71],"be":[72,86,101],"reimplemented":[73],"different":[76],"type":[77],"problem,":[79],"we":[81],"would":[82],"expect":[83],"it":[84],"robust":[87],"across":[88],"wide":[90],"range":[91,119],"instances.":[94],"We":[95],"show":[96],"that":[97],"solved":[102],"successfully":[103],"hyper-GA,":[106],"presenting":[107],"results":[108],"four":[110],"versions":[111],"as":[115,117],"well":[116],"simpler":[121],"them":[125],"five":[127],"test":[128],"data":[129],"set.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}