{"id":"https://openalex.org/W2037716978","doi":"https://doi.org/10.1109/ukci.2013.6651323","title":"A grouping hyper-heuristic framework based on linear linkage encoding for graph coloring","display_name":"A grouping hyper-heuristic framework based on linear linkage encoding for graph coloring","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2037716978","doi":"https://doi.org/10.1109/ukci.2013.6651323","mag":"2037716978"},"language":"en","primary_location":{"id":"doi:10.1109/ukci.2013.6651323","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2013.6651323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 13th UK Workshop on Computational Intelligence (UKCI)","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/A5005452490","display_name":"Anas Elhag","orcid":"https://orcid.org/0000-0002-3044-1515"},"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":true,"raw_author_name":"Anas Elhag","raw_affiliation_strings":["ASAP Research Group, Jubilee Campus, Nottingham, UK","(ASAP) Res. Group, Univ. of Nottingham, Nottingham, UK"],"affiliations":[{"raw_affiliation_string":"ASAP Research Group, Jubilee Campus, Nottingham, UK","institution_ids":[]},{"raw_affiliation_string":"(ASAP) Res. Group, Univ. of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020026827","display_name":"Ender \u00d6zcan","orcid":"https://orcid.org/0000-0003-0276-1391"},"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":"Ender Ozcan","raw_affiliation_strings":["ASAP Research Group, Jubilee Campus, Nottingham, UK","(ASAP) Res. Group, Univ. of Nottingham, Nottingham, UK"],"affiliations":[{"raw_affiliation_string":"ASAP Research Group, Jubilee Campus, Nottingham, UK","institution_ids":[]},{"raw_affiliation_string":"(ASAP) Res. Group, Univ. of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005452490"],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1367745,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"321","last_page":"326"},"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.9965000152587891,"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.9810000061988831,"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/heuristics","display_name":"Heuristics","score":0.7954260110855103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5922247171401978},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5758228302001953},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5489755272865295},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4598245918750763},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45979711413383484},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4491644501686096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43242591619491577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3674894869327545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29611706733703613},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23925942182540894},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0707024335861206}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7954260110855103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5922247171401978},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5758228302001953},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5489755272865295},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4598245918750763},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45979711413383484},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4491644501686096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43242591619491577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3674894869327545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29611706733703613},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23925942182540894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0707024335861206}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ukci.2013.6651323","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2013.6651323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 13th UK Workshop on Computational Intelligence (UKCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.368.6241","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.6241","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/~exo/docs/publications/ukci2013_grouping.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6414137052","display_name":null,"funder_award_id":"EP/H000968/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W147602573","https://openalex.org/W185205693","https://openalex.org/W206238023","https://openalex.org/W345637930","https://openalex.org/W1552927435","https://openalex.org/W1558758677","https://openalex.org/W1561886765","https://openalex.org/W1593056502","https://openalex.org/W1745341198","https://openalex.org/W1969577093","https://openalex.org/W1971493157","https://openalex.org/W1972291640","https://openalex.org/W2026566141","https://openalex.org/W2053544685","https://openalex.org/W2072441740","https://openalex.org/W2109775141","https://openalex.org/W2125899728","https://openalex.org/W2128193809","https://openalex.org/W2135474087","https://openalex.org/W2140759234","https://openalex.org/W2146868736","https://openalex.org/W2153638045","https://openalex.org/W2166843422","https://openalex.org/W2168000780","https://openalex.org/W2238166365","https://openalex.org/W2324827308","https://openalex.org/W2476848496","https://openalex.org/W2607539118","https://openalex.org/W3116687967","https://openalex.org/W4241582122","https://openalex.org/W4285719527","https://openalex.org/W6605928759","https://openalex.org/W6607564919","https://openalex.org/W6642630038","https://openalex.org/W6681030992","https://openalex.org/W6788166385"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"Grouping":[0],"problems":[1,8,128],"are":[2,57],"a":[3,21,26,34,67,90,115,130,133],"class":[4],"of":[5,20,23,28,37,69,114,118,139],"combinatorial":[6],"optimization":[7],"in":[9],"which":[10,64],"the":[11,17,112,137,152],"task":[12],"is":[13,141],"to":[14,73,100],"search":[15,55],"for":[16,105],"best":[18],"partition":[19],"set":[22,36,68,117],"objects":[24],"into":[25],"collection":[27],"mutually":[29],"disjoint":[30],"subsets":[31],"while":[32],"satisfying":[33],"given":[35,134],"constraints.":[38],"Typical":[39],"examples":[40],"include":[41],"data":[42],"clustering,":[43],"graph":[44,147],"coloring":[45,148],"and":[46,82,136],"exam":[47],"timetabling":[48],"problems.":[49,108],"Selection":[50],"hyper-heuristics":[51],"based":[52,94],"on":[53,66,95,125,146],"iterative":[54],"frameworks":[56],"high":[58,160],"level":[59,71,120],"general":[60],"problem":[61,149],"solving":[62],"methodologies":[63],"operate":[65],"low":[70,119],"heuristics":[72,121],"improve":[74],"an":[75,96],"initially":[76],"generated":[77],"solution":[78],"via":[79],"heuristic":[80],"selection":[81,91],"move":[83],"acceptance.":[84],"In":[85],"this":[86],"paper,":[87],"we":[88],"describe":[89],"hyper-heuristic":[92,155],"framework":[93,110,156],"efficient":[97],"representation":[98],"referred":[99],"as":[101],"linear":[102],"linkage":[103],"encoding":[104],"multi-objective":[106],"grouping":[107,127,154],"This":[109],"provides":[111],"implementation":[113],"fixed":[116],"that":[122,151],"can":[123,157],"work":[124],"all":[126],"where":[129],"trade-off":[131],"between":[132],"objective":[135],"number":[138],"groups":[140],"sought.":[142],"The":[143],"empirical":[144],"results":[145],"indicate":[150],"proposed":[153],"indeed":[158],"provide":[159],"quality":[161],"solutions.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}