{"id":"https://openalex.org/W2112100376","doi":"https://doi.org/10.1109/cec.2003.1299949","title":"An investigation of a tabu assisted hyper-reuristic genetic algorithm","display_name":"An investigation of a tabu assisted hyper-reuristic genetic algorithm","publication_year":2004,"publication_date":"2004-07-09","ids":{"openalex":"https://openalex.org/W2112100376","doi":"https://doi.org/10.1109/cec.2003.1299949","mag":"2112100376"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2003.1299949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299949","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":"conference-paper","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/A5047324322","display_name":"Limin Ran","orcid":"https://orcid.org/0009-0005-8933-9573"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Limin Ran","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074319022","display_name":"Graham Kendall","orcid":"https://orcid.org/0000-0003-2006-5103"},"institutions":[{"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":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, UK","Sch. of Comput. Sci. & IT, Nottingham Univ., UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and IT, University of Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & IT, Nottingham Univ., UK","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7543,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.96650068,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"2230","last_page":"2237"},"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.9940000176429749,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9871000051498413,"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/tabu-search","display_name":"Tabu search","score":0.7138523459434509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6117362976074219},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5206307768821716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5083932280540466},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09826219081878662}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7138523459434509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6117362976074219},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5206307768821716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5083932280540466},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09826219081878662}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2003.1299949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299949","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/W147602573","https://openalex.org/W197551278","https://openalex.org/W1507159998","https://openalex.org/W1531666479","https://openalex.org/W1549353496","https://openalex.org/W1608418751","https://openalex.org/W1668207500","https://openalex.org/W1680972677","https://openalex.org/W1849813686","https://openalex.org/W1936224457","https://openalex.org/W1981097545","https://openalex.org/W1992548724","https://openalex.org/W2004217556","https://openalex.org/W2056956492","https://openalex.org/W2064568071","https://openalex.org/W2066671865","https://openalex.org/W2130691671","https://openalex.org/W2140759234","https://openalex.org/W2162642735","https://openalex.org/W2807926675","https://openalex.org/W3103464856","https://openalex.org/W3134267570","https://openalex.org/W4381826686","https://openalex.org/W6605928759","https://openalex.org/W6608002675","https://openalex.org/W6629345731","https://openalex.org/W6632897450","https://openalex.org/W6637533551","https://openalex.org/W6639101744"],"related_works":["https://openalex.org/W2317256823","https://openalex.org/W2380129197","https://openalex.org/W1965777597","https://openalex.org/W4243204715","https://openalex.org/W2368709543","https://openalex.org/W2391241553","https://openalex.org/W3171985221","https://openalex.org/W2364439216","https://openalex.org/W2147258893","https://openalex.org/W2343673210"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"a":[3,18,50,65,87],"tabu":[4,51,66],"assisted":[5],"genetic":[6,20],"algorithm":[7,21,85],"based":[8],"hyperheuristic":[9,19],"(hyperTGA)":[10],"for":[11],"personnel":[12],"scheduling":[13,94],"problems.":[14,46],"We":[15,82],"recently":[16],"introduced":[17],"(hyperGA)":[22],"with":[23,101],"an":[24,32],"adaptive":[25],"length":[26],"chromosome":[27],"which":[28],"aims":[29],"to":[30,39,44,68,72,86],"evolve":[31],"ordering":[33],"of":[34,49,55,63,76],"low-level":[35],"heuristics":[36],"in":[37],"order":[38],"find":[40],"good":[41],"quality":[42],"solutions":[43],"given":[45],"The":[47,61],"addition":[48],"method,":[52],"the":[53,69,74,80,84,98],"focus":[54],"this":[56],"paper,":[57],"extends":[58],"that":[59],"work.":[60],"aim":[62],"adding":[64],"list":[67],"hyperGA":[70],"is":[71],"indicate":[73],"efficiency":[75],"each":[77],"gene":[78],"within":[79],"chromosome.":[81],"apply":[83],"geographically":[88],"distributed":[89],"training":[90],"staff":[91],"and":[92,96],"course":[93],"problem":[95],"compare":[97],"computational":[99],"results":[100],"our":[102],"previous":[103],"hyperGA.":[104]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}