{"id":"https://openalex.org/W2774617531","doi":"https://doi.org/10.1109/smc.2017.8122629","title":"An artificial bee colony algorithm with a modified choice function for the Traveling Salesman Problem","display_name":"An artificial bee colony algorithm with a modified choice function for the Traveling Salesman Problem","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2774617531","doi":"https://doi.org/10.1109/smc.2017.8122629","mag":"2774617531"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2017.8122629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/An_artificial_bee_colony_algorithm_with_a_Modified_Choice_Function_for_the_traveling_salesman_problem/20794612","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073110448","display_name":"Shin Siang Choong","orcid":"https://orcid.org/0000-0001-5116-3473"},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":true,"raw_author_name":"Shin Siang Choong","raw_affiliation_strings":["School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087764291","display_name":"Li\u2010Pei Wong","orcid":"https://orcid.org/0000-0002-7308-0035"},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Li-Pei Wong","raw_affiliation_strings":["School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072923302","display_name":"Chee Peng Lim","orcid":"https://orcid.org/0000-0003-4191-9083"},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Chee Peng Lim","raw_affiliation_strings":["School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073110448"],"corresponding_institution_ids":["https://openalex.org/I139322472"],"apc_list":null,"apc_paid":null,"fwci":1.0392,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.83902131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"357","last_page":"362"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994000196456909,"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.9991999864578247,"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.7776361107826233},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7699083089828491},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.678011417388916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6152002811431885},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6033769249916077},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5832874774932861},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5399093627929688},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5125298500061035},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.4742673635482788},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.4573388397693634},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4486791491508484},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43652141094207764},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.41475972533226013},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35013145208358765},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.2998432517051697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2834814488887787}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7776361107826233},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7699083089828491},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.678011417388916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6152002811431885},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6033769249916077},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5832874774932861},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5399093627929688},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5125298500061035},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.4742673635482788},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.4573388397693634},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4486791491508484},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43652141094207764},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.41475972533226013},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35013145208358765},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.2998432517051697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2834814488887787},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/smc.2017.8122629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30113269","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401102","display_name":"Own your potential (DEAKIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:figshare.com:article/20794612","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/An_artificial_bee_colony_algorithm_with_a_Modified_Choice_Function_for_the_traveling_salesman_problem/20794612","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:figshare.com:article/20808118","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/An_artificial_bee_colony_algorithm_with_a_modified_choice_function_for_the_traveling_salesman_problem/20808118","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/20794612","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/An_artificial_bee_colony_algorithm_with_a_Modified_Choice_Function_for_the_traveling_salesman_problem/20794612","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W78763269","https://openalex.org/W187252670","https://openalex.org/W626292722","https://openalex.org/W1047235366","https://openalex.org/W1481976097","https://openalex.org/W1503369191","https://openalex.org/W1508459370","https://openalex.org/W1531666479","https://openalex.org/W1745341198","https://openalex.org/W1814515812","https://openalex.org/W1817667747","https://openalex.org/W1829921621","https://openalex.org/W1968594877","https://openalex.org/W1991649500","https://openalex.org/W1993747225","https://openalex.org/W2015277739","https://openalex.org/W2026566141","https://openalex.org/W2044466855","https://openalex.org/W2072441740","https://openalex.org/W2074281851","https://openalex.org/W2114652055","https://openalex.org/W2117325189","https://openalex.org/W2118618548","https://openalex.org/W2128995918","https://openalex.org/W2140759234","https://openalex.org/W2144317842","https://openalex.org/W2148736953","https://openalex.org/W2169209574","https://openalex.org/W2171097138","https://openalex.org/W2287814884","https://openalex.org/W2314023735","https://openalex.org/W2797272670","https://openalex.org/W6603227577","https://openalex.org/W6631854281","https://openalex.org/W6681030992","https://openalex.org/W6696126189"],"related_works":["https://openalex.org/W2128995918","https://openalex.org/W4246557197","https://openalex.org/W2359502741","https://openalex.org/W2946024655","https://openalex.org/W2653294936","https://openalex.org/W1981626956","https://openalex.org/W2592065458","https://openalex.org/W2758988501","https://openalex.org/W2188749193","https://openalex.org/W2469984263"],"abstract_inverted_index":{"The":[0,44,109,142],"Artificial":[1],"Bee":[2],"Colony":[3],"(ABC)":[4],"algorithm":[5],"is":[6,67,87,114,150],"a":[7,24,68,78,82],"swarm":[8],"intelligence":[9],"approach":[10],"which":[11],"has":[12],"initially":[13],"been":[14,140],"proposed":[15,110,128,148],"to":[16,39,50,59,152],"solve":[17],"optimization":[18,42,63,163],"of":[19,71,96,126,157],"mathematical":[20],"test":[21],"functions":[22],"with":[23,53],"unique":[25],"neighbourhood":[26,31,98],"search":[27,32,99],"mechanism.":[28],"However,":[29,65],"this":[30,76],"mechanism":[33],"could":[34],"not":[35],"be":[36,51],"directly":[37],"applied":[38,88],"combinatorial":[40,61],"discrete":[41,62],"problems.":[43,64],"employed":[45,104],"and":[46,105],"onlooker":[47,106],"bees":[48,107],"need":[49],"equipped":[52],"problem-specific":[54,73],"perturbative":[55],"heuristics":[56,100],"in":[57,137],"order":[58],"tackle":[60],"there":[66],"large":[69],"variety":[70],"available":[72,136],"heuristics.":[74],"In":[75],"paper,":[77],"hyper-heuristic":[79],"method,":[80],"namely":[81],"Modified":[83],"Choice":[84],"Function":[85],"(MCF),":[86],"such":[89],"that":[90,146],"it":[91],"can":[92],"regulate":[93],"the":[94,97,103,117,124,127,147,162],"selection":[95],"adopted":[101],"by":[102],"automatically.":[108],"MCF-based":[111],"ABC":[112,159],"model":[113,149],"implemented":[115],"using":[116],"Hyper-heuristic":[118],"Flexible":[119],"Framework":[120],"(HyFlex).":[121],"To":[122],"demonstrate":[123],"effectiveness":[125],"model,":[129],"ten":[130],"Traveling":[131],"Salesman":[132],"Problem":[133],"(TSP)":[134],"instances":[135],"HyFlex":[138],"have":[139],"evaluated.":[141],"empirical":[143],"results":[144],"show":[145],"able":[151],"statistically":[153],"outperform":[154],"four":[155],"out":[156],"five":[158],"variants":[160],"throughout":[161],"process.":[164]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}