{"id":"https://openalex.org/W2138967646","doi":"https://doi.org/10.1142/s0218213010000200","title":"BEE COLONY OPTIMIZATION WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM","display_name":"BEE COLONY OPTIMIZATION WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2138967646","doi":"https://doi.org/10.1142/s0218213010000200","mag":"2138967646"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213010000200","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213010000200","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-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/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"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["MY","SG"],"is_corresponding":false,"raw_author_name":"LI-PEI WONG","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore","School of Computer Sciences, Universiti Sains Malaysia, 11800 USM, Pulau Pinang, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Computer Sciences, Universiti Sains Malaysia, 11800 USM, Pulau Pinang, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038383727","display_name":"Malcolm Yoke Hean Low","orcid":"https://orcid.org/0000-0002-5371-0896"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"MALCOLM YOKE HEAN LOW","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112792138","display_name":"Chin Soon Chong","orcid":null},"institutions":[{"id":"https://openalex.org/I4210091207","display_name":"Singapore Institute of Manufacturing Technology","ror":"https://ror.org/00f44np30","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I4210091207","https://openalex.org/I91275662"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"CHIN SOON CHONG","raw_affiliation_strings":["Singapore Institute of Manufacturing Technology, 71 Nanyang Drive, Singapore 638075, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Singapore Institute of Manufacturing Technology, 71 Nanyang Drive, Singapore 638075, Singapore","institution_ids":["https://openalex.org/I4210091207"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0512,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.95270315,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"19","issue":"03","first_page":"305","last_page":"334"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9959999918937683,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7291345596313477},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7158719301223755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6841199398040771},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.6367315053939819},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5788065195083618},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5611997842788696},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.503224790096283},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.48938602209091187},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.46871060132980347},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.46384480595588684},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4579251706600189},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4286397695541382},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.41829913854599},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.30772829055786133},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2744225859642029},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22063302993774414}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7291345596313477},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7158719301223755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6841199398040771},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.6367315053939819},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5788065195083618},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5611997842788696},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.503224790096283},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.48938602209091187},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.46871060132980347},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.46384480595588684},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4579251706600189},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4286397695541382},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.41829913854599},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.30772829055786133},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2744225859642029},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22063302993774414},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218213010000200","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213010000200","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W5124408","https://openalex.org/W114471871","https://openalex.org/W1490495057","https://openalex.org/W1497465974","https://openalex.org/W1499265623","https://openalex.org/W1548319595","https://openalex.org/W1559574141","https://openalex.org/W1571087346","https://openalex.org/W1580085516","https://openalex.org/W1591368026","https://openalex.org/W1595598027","https://openalex.org/W1748133846","https://openalex.org/W1968594877","https://openalex.org/W1971661364","https://openalex.org/W1978354018","https://openalex.org/W1996872168","https://openalex.org/W2003509249","https://openalex.org/W2011039300","https://openalex.org/W2017708378","https://openalex.org/W2018994930","https://openalex.org/W2022179164","https://openalex.org/W2035329633","https://openalex.org/W2036001116","https://openalex.org/W2042986967","https://openalex.org/W2054706926","https://openalex.org/W2063137505","https://openalex.org/W2076520672","https://openalex.org/W2079012818","https://openalex.org/W2079868147","https://openalex.org/W2081231516","https://openalex.org/W2083967570","https://openalex.org/W2089962093","https://openalex.org/W2096648407","https://openalex.org/W2101753085","https://openalex.org/W2102076751","https://openalex.org/W2107631366","https://openalex.org/W2108516110","https://openalex.org/W2115358779","https://openalex.org/W2117325189","https://openalex.org/W2118936998","https://openalex.org/W2125613881","https://openalex.org/W2129006915","https://openalex.org/W2135149549","https://openalex.org/W2137321978","https://openalex.org/W2143560894","https://openalex.org/W2143969246","https://openalex.org/W2144317842","https://openalex.org/W2145366458","https://openalex.org/W2156885886","https://openalex.org/W2164267739","https://openalex.org/W2314208533","https://openalex.org/W2956015669"],"related_works":["https://openalex.org/W2051623074","https://openalex.org/W1977042441","https://openalex.org/W2808804076","https://openalex.org/W2930891413","https://openalex.org/W2362117675","https://openalex.org/W2093786661","https://openalex.org/W1945506659","https://openalex.org/W2614708361","https://openalex.org/W2128995918","https://openalex.org/W2994879757"],"abstract_inverted_index":{"Many":[0],"real":[1],"world":[2],"industrial":[3],"applications":[4],"involve":[5],"the":[6,67,95,100,104,121,131,150],"Traveling":[7],"Salesman":[8],"Problem":[9],"(TSP),":[10],"which":[11],"is":[12,62,77,111,153,173],"a":[13,17,50,80,107,118,139],"problem":[14,40],"that":[15,26,171],"finds":[16],"Hamiltonian":[18],"path":[19],"with":[20,79,135],"minimum":[21],"cost.":[22],"Examples":[23],"of":[24,120,141,162],"problems":[25,143],"belong":[27],"to":[28,88,124,155,175],"this":[29],"category":[30],"are":[31,144],"transportation":[32],"routing":[33],"problem,":[34],"scan":[35],"chain":[36],"optimization":[37],"and":[38,45,183],"drilling":[39],"in":[41,71],"integrated":[42,78],"circuit":[43],"testing":[44],"production.":[46],"This":[47],"paper":[48],"presents":[49],"Bee":[51],"Colony":[52,181],"Optimization":[53,182],"(BCO)":[54],"algorithm":[55,76,134,152],"for":[56],"symmetrical":[57],"TSP.":[58],"The":[59,75,113,167],"BCO":[60,96,133,151],"model":[61],"constructed":[63],"algorithmically":[64],"based":[65],"on":[66,138],"collective":[68],"intelligence":[69],"shown":[70],"bee":[72],"foraging":[73],"behaviour.":[74],"fixed-radius":[81],"near":[82],"neighbour":[83],"2-opt":[84],"(FRNN":[85],"2-opt)":[86],"heuristic":[87],"further":[89],"improve":[90],"prior":[91],"solutions":[92,123],"generated":[93],"by":[94,103],"model.":[97],"To":[98],"limit":[99],"overhead":[101],"incurred":[102],"FRNN":[105],"2-opt,":[106],"frequency-based":[108],"pruning":[109,114],"strategy":[110,115],"proposed.":[112],"allows":[116],"only":[117],"subset":[119],"promising":[122],"undergo":[125],"local":[126],"optimization.":[127],"Experimental":[128],"results":[129,168],"comparing":[130],"proposed":[132],"existing":[136],"approaches":[137],"set":[140],"benchmark":[142,148],"presented.":[145],"For":[146],"84":[147],"problems,":[149],"able":[154],"obtain":[156],"an":[157],"overall":[158],"average":[159],"solution":[160],"quality":[161],"0.31%":[163],"from":[164],"known":[165],"optimum.":[166],"also":[169],"show":[170],"it":[172],"comparable":[174],"other":[176],"algorithms":[177],"such":[178],"as":[179],"Ant":[180],"Particle":[184],"Swarm":[185],"Optimization.":[186]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}