{"id":"https://openalex.org/W4294811348","doi":"https://doi.org/10.1109/cec55065.2022.9870415","title":"A Study of Transfer Learning in an Ant-Based Generation Construction Hyper-Heuristic","display_name":"A Study of Transfer Learning in an Ant-Based Generation Construction Hyper-Heuristic","publication_year":2022,"publication_date":"2022-07-18","ids":{"openalex":"https://openalex.org/W4294811348","doi":"https://doi.org/10.1109/cec55065.2022.9870415"},"language":"en","primary_location":{"id":"doi:10.1109/cec55065.2022.9870415","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870415","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","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/A5011341162","display_name":"Emilio Singh","orcid":"https://orcid.org/0000-0001-8673-2453"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Emilio Singh","raw_affiliation_strings":["University of Pretoria,Department of Computer Science,Pretoria,South Africa","Department of Computer Science, University of Pretoria, Pretoria, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pretoria,Department of Computer Science,Pretoria,South Africa","institution_ids":["https://openalex.org/I69552723"]},{"raw_affiliation_string":"Department of Computer Science, University of Pretoria, Pretoria, South Africa","institution_ids":["https://openalex.org/I69552723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060039893","display_name":"Nelishia Pillay","orcid":"https://orcid.org/0000-0003-3902-5582"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Nelishia Pillay","raw_affiliation_strings":["University of Pretoria,Department of Computer Science,Pretoria,South Africa","Department of Computer Science, University of Pretoria, Pretoria, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pretoria,Department of Computer Science,Pretoria,South Africa","institution_ids":["https://openalex.org/I69552723"]},{"raw_affiliation_string":"Department of Computer Science, University of Pretoria, Pretoria, South Africa","institution_ids":["https://openalex.org/I69552723"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I69552723"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9975000023841858,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.764706015586853},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7050555348396301},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6763871908187866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6616212129592896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5819762945175171},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5649455189704895},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4979429244995117},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4937494695186615},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4828348755836487},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.45878368616104126},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43803054094314575},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4372144639492035},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4345604181289673},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.21557208895683289},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1936320662498474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1843750774860382},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08306878805160522}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.764706015586853},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7050555348396301},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6763871908187866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6616212129592896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5819762945175171},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5649455189704895},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4979429244995117},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4937494695186615},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4828348755836487},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.45878368616104126},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43803054094314575},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4372144639492035},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4345604181289673},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.21557208895683289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1936320662498474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1843750774860382},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08306878805160522},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec55065.2022.9870415","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec55065.2022.9870415","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","score":0.5699999928474426,"display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1538597521","https://openalex.org/W1967715706","https://openalex.org/W1973308356","https://openalex.org/W2009832821","https://openalex.org/W2013067314","https://openalex.org/W2058653357","https://openalex.org/W2153633961","https://openalex.org/W2165698076","https://openalex.org/W2395579298","https://openalex.org/W2736575609","https://openalex.org/W2894900521","https://openalex.org/W2912148519","https://openalex.org/W2967882888","https://openalex.org/W3013276172","https://openalex.org/W3121235808","https://openalex.org/W3178628565","https://openalex.org/W3208727342","https://openalex.org/W3209462923","https://openalex.org/W4207041743","https://openalex.org/W4242474683","https://openalex.org/W4280651928","https://openalex.org/W4299796063","https://openalex.org/W6632372999","https://openalex.org/W6640230129","https://openalex.org/W6643416558"],"related_works":["https://openalex.org/W2061413861","https://openalex.org/W2809969510","https://openalex.org/W1547027981","https://openalex.org/W2295217194","https://openalex.org/W2284694394","https://openalex.org/W2124212704","https://openalex.org/W128408443","https://openalex.org/W1936586576","https://openalex.org/W2071056261","https://openalex.org/W4294811348"],"abstract_inverted_index":{"Generation":[0],"construction":[1,37,48,80,255],"hyper-heuristics":[2,38],"have":[3],"proven":[4],"to":[5,59,84,119,145],"be":[6],"effective":[7],"in":[8,218,246],"solving":[9,26],"discrete":[10],"optimization":[11,23,78,253],"problems.":[12,30],"Previous":[13],"work":[14],"has":[15,52,71,92,170,178],"shown":[16,171],"the":[17,33,40,61,85,88,104,108,116,120,124,133,152,157,164,173,180,186,190,195,201,207,221,224,232,247],"effectiveness":[18],"of":[19,32,64,87,175,223,241,250],"an":[20],"ant":[21,76,98,251],"colony":[22,77,99,252],"hyper-heuristic":[24],"for":[25,75,97,189,194,206,234],"scheduling":[27,155,198],"and":[28,132,163,200,236],"packing":[29,161,211],"One":[31],"challenges":[34],"with":[35,45,123],"generation":[36,67,79,254],"is":[39,107,215,226],"high":[41],"processing":[42],"times":[43],"associated":[44],"creating":[46],"new":[47],"heuristics.":[49],"While":[50],"there":[51,214],"been":[53,73,95],"research":[54,229],"into":[55],"using":[56],"transfer":[57,90,176],"learning":[58,91,177],"reduce":[60],"computational":[62,181,219],"cost":[63,182],"genetic":[65],"programming":[66],"constructive":[68],"hyper-heuristics,":[69],"this":[70,102,235],"not":[72,93,141],"investigated":[74,96],"hyper-heuristics.":[81,256],"In":[82,101],"fact":[83],"knowledge":[86,105,242],"authors":[89],"previously":[94],"optimization.":[100],"study":[103,169],"transferred":[106,114],"pheromone":[109],"map.":[110],"The":[111,147,168],"maps":[112],"are":[113],"from":[115],"source":[117,134],"domain":[118,126,135],"target":[121,125],"domain,":[122],"being":[127],"more":[128,191],"complicated":[129],"problem":[130,137,162,199,212],"instances":[131],"simpler":[136],"instances,":[138],"which":[139],"do":[140],"take":[142],"as":[143],"long":[144],"solve.":[146],"approach":[148],"was":[149],"evaluated":[150],"on":[151],"movie":[153,196],"scene":[154,197],"problem,":[156],"one":[158,208],"dimensional":[159,209],"bin":[160,210],"quadratic":[165,202],"assignment":[166,203],"problem.":[167,204],"that":[172],"use":[174],"reduced":[179],"drastically":[183],"while":[184,213],"maintaining":[185],"same":[187],"performance":[188],"complex":[192],"problems":[193],"However,":[205],"a":[216],"reduction":[217],"cost,":[220],"quality":[222],"solutions":[225],"worse.":[227],"Future":[228],"will":[230],"investigate":[231],"reason":[233],"evaluate":[237],"transferring":[238],"different":[239],"types":[240],"at":[243],"various":[244],"points":[245],"life":[248],"cycle":[249]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}