{"id":"https://openalex.org/W4318604560","doi":"https://doi.org/10.1109/ssci51031.2022.10022101","title":"A Parameter-Based Analysis of Ant-Based Generation Hyper-Heuristics","display_name":"A Parameter-Based Analysis of Ant-Based Generation Hyper-Heuristics","publication_year":2022,"publication_date":"2022-12-04","ids":{"openalex":"https://openalex.org/W4318604560","doi":"https://doi.org/10.1109/ssci51031.2022.10022101"},"language":"en","primary_location":{"id":"doi:10.1109/ssci51031.2022.10022101","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci51031.2022.10022101","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","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 Symposium Series on Computational Intelligence (SSCI)","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":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"812","last_page":"819"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8781846761703491},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.7385843992233276},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6363734006881714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6206912398338318},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.619002640247345},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.49486106634140015},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47681280970573425},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.46691349148750305},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.41794902086257935},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3179815411567688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2645930349826813}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8781846761703491},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.7385843992233276},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6363734006881714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6206912398338318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.619002640247345},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.49486106634140015},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47681280970573425},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.46691349148750305},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.41794902086257935},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3179815411567688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2645930349826813},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci51031.2022.10022101","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci51031.2022.10022101","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","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 Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W999207820","https://openalex.org/W1547788791","https://openalex.org/W1595882479","https://openalex.org/W1820078070","https://openalex.org/W1995875735","https://openalex.org/W2132196970","https://openalex.org/W2137654273","https://openalex.org/W2141755357","https://openalex.org/W2163428398","https://openalex.org/W2165207629","https://openalex.org/W2275596639","https://openalex.org/W2894900521","https://openalex.org/W2953681220","https://openalex.org/W3047874280","https://openalex.org/W3202704036","https://openalex.org/W4280651928","https://openalex.org/W4285149810"],"related_works":["https://openalex.org/W2291505919","https://openalex.org/W2149437250","https://openalex.org/W1936586576","https://openalex.org/W2221935446","https://openalex.org/W3082025941","https://openalex.org/W2282089202","https://openalex.org/W4200460889","https://openalex.org/W2017066479","https://openalex.org/W1562604685","https://openalex.org/W4318604560"],"abstract_inverted_index":{"Recently,":[0],"ant":[1],"algorithms":[2,22],"have":[3],"been":[4,17],"employed":[5],"by":[6,121],"generation":[7,10,41,123,127,194],"constructive":[8],"and":[9,28,62,146,162,175,184],"perturbative":[11],"hyper-heuristics.":[12],"However,":[13],"no":[14],"research":[15],"has":[16],"conducted":[18],"to":[19,73,108,209],"study":[20,38,134,155,189],"these":[21],"in":[23,81,117],"terms":[24],"of":[25,39,47,77,96,112,153,159,173,177],"their":[26],"parameters":[27,49,80],"the":[29,45,75,78,86,110,130,138,154,171,188],"heuristics":[30,119,200],"that":[31,43,103,157,192,206],"they":[32],"generate.":[33],"This":[34,65,133],"paper":[35,91],"presents":[36,93],"a":[37,105],"ant-based":[40,122,193],"hyper-heuristics":[42,124,195],"examines":[44],"effect":[46],"different":[48,56,79,87,126],"for":[50,54,85,168,182],"achieving":[51],"good":[52,83],"performance":[53,84],"three":[55,101,136],"assessment":[57,88],"criteria":[58],"namely,":[59],"generality,":[60,169],"optimality":[61,183],"computational":[63,185],"effort.":[64,186],"is":[66],"done":[67],"via":[68,100],"an":[69,94],"elementary":[70],"effects":[71],"analysis":[72,95],"assess":[74,109],"importance":[76],"producing":[82],"criteria.":[89],"The":[90,151],"also":[92,190],"generated":[97,118],"heuristics,":[98],"assessed":[99],"metrics":[102],"define":[104],"compactness":[106],"criterion,":[107],"potential":[111],"bloat,":[113],"i.e.":[114],"redundant":[115],"code,":[116],"produced":[120],"under":[125],"size":[128],"limits,":[129],"operator":[131,163,204],"limit.":[132],"considers":[135],"domains,":[137],"travelling":[139],"salesman":[140],"problem,":[141],"movie":[142],"scene":[143],"scheduling":[144],"problem":[145],"capacitated":[147],"vehicle":[148],"routing":[149],"problem.":[150],"results":[152],"showed":[156],"type":[158],"pheromone":[160],"map":[161],"limits":[164,205],"were":[165],"most":[166,180],"important":[167,181],"with":[170,202],"number":[172,176],"ants":[174],"iterations":[178],"being":[179],"Additionally,":[187],"demonstrated":[191],"produce":[196],"highly":[197],"compact,":[198],"readable":[199],"even":[201],"large":[203],"demonstrate":[207],"resistance":[208],"bloat.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}