{"id":"https://openalex.org/W4207074981","doi":"https://doi.org/10.1109/ssci50451.2021.9660169","title":"A Greedy Approach to Ant Colony Optimisation Inspired Mutation for Permutation Type Problems","display_name":"A Greedy Approach to Ant Colony Optimisation Inspired Mutation for Permutation Type Problems","publication_year":2021,"publication_date":"2021-12-05","ids":{"openalex":"https://openalex.org/W4207074981","doi":"https://doi.org/10.1109/ssci50451.2021.9660169"},"language":"en","primary_location":{"id":"doi:10.1109/ssci50451.2021.9660169","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9660169","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 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":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5019091531","display_name":"Darren M. Chitty","orcid":"https://orcid.org/0000-0003-2566-1182"},"institutions":[{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Darren M. Chitty","raw_affiliation_strings":["University of Exeter,College of Engineering, Mathematics and Physical Sciences,Exeter,UK,EX4 4QF"],"affiliations":[{"raw_affiliation_string":"University of Exeter,College of Engineering, Mathematics and Physical Sciences,Exeter,UK,EX4 4QF","institution_ids":["https://openalex.org/I23923803"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019091531"],"corresponding_institution_ids":["https://openalex.org/I23923803"],"apc_list":null,"apc_paid":null,"fwci":0.5026,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67676201,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"89","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9940999746322632,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7991752624511719},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.711105227470398},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6955046653747559},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.677385687828064},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6771054863929749},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6547240018844604},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.6444456577301025},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5690796375274658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5313400030136108},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5220672488212585},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4581441581249237},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4320530891418457},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.41030097007751465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34835195541381836},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06717917323112488},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06348663568496704},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.06018257141113281}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7991752624511719},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.711105227470398},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6955046653747559},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.677385687828064},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6771054863929749},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6547240018844604},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.6444456577301025},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5690796375274658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5313400030136108},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5220672488212585},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4581441581249237},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4320530891418457},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.41030097007751465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34835195541381836},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06717917323112488},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06348663568496704},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.06018257141113281},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci50451.2021.9660169","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9660169","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 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":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W99032621","https://openalex.org/W164837994","https://openalex.org/W1519886767","https://openalex.org/W1528149415","https://openalex.org/W1535715099","https://openalex.org/W1589975099","https://openalex.org/W1890949457","https://openalex.org/W1976595943","https://openalex.org/W1990326157","https://openalex.org/W2031149134","https://openalex.org/W2042986967","https://openalex.org/W2063160149","https://openalex.org/W2086717587","https://openalex.org/W2106378689","https://openalex.org/W2111563176","https://openalex.org/W2113543617","https://openalex.org/W2140425706","https://openalex.org/W2148736953","https://openalex.org/W2154929945","https://openalex.org/W2491363582","https://openalex.org/W2750711431","https://openalex.org/W2943490696","https://openalex.org/W3181543052","https://openalex.org/W3188865867","https://openalex.org/W6604038483","https://openalex.org/W6606690120","https://openalex.org/W6631572363","https://openalex.org/W6635336068","https://openalex.org/W6681218740","https://openalex.org/W6723024466","https://openalex.org/W7035853150"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2981400081","https://openalex.org/W2347951034","https://openalex.org/W4301419164","https://openalex.org/W2592478754","https://openalex.org/W2189435634","https://openalex.org/W1997193297"],"abstract_inverted_index":{"Meta-heuristics":[0],"have":[1,30],"demonstrated":[2],"relative":[3],"success":[4],"when":[5],"applied":[6],"to":[7,55,70,76,100,107,120],"permutation":[8],"problems":[9],"such":[10],"as":[11],"the":[12,49],"Traveling":[13],"Salesman":[14],"Problem":[15],"(TSP).":[16],"Two":[17],"successful":[18],"meta-heuristics":[19],"are":[20,63],"Genetic":[21],"Algorithms":[22],"(GAs)":[23],"and":[24,90],"Ant":[25],"Colony":[26],"Optimisation":[27],"(ACO)":[28],"but":[29],"widely":[31],"differing":[32],"methodologies,":[33],"combining":[34],"both":[35],"could":[36],"be":[37,121],"beneficial.":[38],"This":[39],"paper":[40],"achieves":[41],"this":[42],"using":[43],"a":[44,56,80,86,97,115],"mutation":[45,67,78,102],"operator":[46],"based":[47],"on":[48],"novel":[50],"ACO":[51,91,101],"variant":[52],"Partial-ACO.":[53],"Applied":[54],"range":[57],"of":[58,110,118],"TSP":[59,108],"instances":[60,109],"significant":[61],"gains":[62],"achieved":[64,122],"over":[65],"standard":[66],"operators.":[68],"Furthermore,":[69],"increase":[71],"performance":[72],"consideration":[73],"is":[74],"given":[75],"operating":[77],"in":[79],"greedy":[81,98],"manner":[82],"enabling":[83,105],"constant":[84],"use,":[85],"fully":[87],"combined":[88],"GA":[89],"meta-heuristic":[92],"solution.":[93],"Experiments":[94],"demonstrate":[95],"that":[96],"approach":[99],"improves":[103],"results":[104],"solutions":[106],"several":[111],"thousand":[112],"cities":[113],"within":[114],"few":[116],"percent":[117],"optimal":[119],"without":[123],"any":[124],"local":[125],"search":[126],"methods.":[127]},"counts_by_year":[{"year":2022,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}