{"id":"https://openalex.org/W2138354304","doi":"https://doi.org/10.1109/indin.2009.5195901","title":"An efficient Bee Colony Optimization algorithm for Traveling Salesman Problem using frequency-based pruning","display_name":"An efficient Bee Colony Optimization algorithm for Traveling Salesman Problem using frequency-based pruning","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2138354304","doi":"https://doi.org/10.1109/indin.2009.5195901","mag":"2138354304"},"language":"en","primary_location":{"id":"doi:10.1109/indin.2009.5195901","is_oa":false,"landing_page_url":"https://doi.org/10.1109/indin.2009.5195901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 7th IEEE International Conference on Industrial Informatics","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/A5087764291","display_name":"Li\u2010Pei Wong","orcid":"https://orcid.org/0000-0002-7308-0035"},"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":true,"raw_author_name":"Li-Pei Wong","raw_affiliation_strings":["School of Computer Engineering, Nanyang Technological University, Singapore","[School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798]"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"[School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798]","institution_ids":["https://openalex.org/I172675005"]}]},{"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, Singapore","[School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798]"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"[School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798]","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, Singapore","Singapore Institute of Manufacturing Technology, 71 Nanyang Drive, Singapore 638075"],"affiliations":[{"raw_affiliation_string":"Singapore Institute of Manufacturing Technology, Singapore","institution_ids":["https://openalex.org/I4210091207"]},{"raw_affiliation_string":"Singapore Institute of Manufacturing Technology, 71 Nanyang Drive, Singapore 638075","institution_ids":["https://openalex.org/I4210091207"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087764291"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":5.4195,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.95737065,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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.9988999962806702,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9824000000953674,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9611999988555908,"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.8409013152122498},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6834871768951416},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6006937623023987},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5774360299110413},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5633378624916077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5120115876197815},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4838241934776306},{"id":"https://openalex.org/keywords/foraging","display_name":"Foraging","score":0.45915287733078003},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4580376148223877},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.4298829734325409},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4214632213115692},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39475247263908386}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8409013152122498},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6834871768951416},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6006937623023987},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5774360299110413},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5633378624916077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5120115876197815},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4838241934776306},{"id":"https://openalex.org/C165287380","wikidata":"https://www.wikidata.org/wiki/Q2916569","display_name":"Foraging","level":2,"score":0.45915287733078003},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4580376148223877},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.4298829734325409},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4214632213115692},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39475247263908386},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/indin.2009.5195901","is_oa":false,"landing_page_url":"https://doi.org/10.1109/indin.2009.5195901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 7th IEEE International Conference on Industrial Informatics","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.7883","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.7883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mysites.ntu.edu.sg/yhlow/public/Shared%20Documents/papers/indin2009.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/2","display_name":"Zero hunger"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W5124408","https://openalex.org/W114471871","https://openalex.org/W1490495057","https://openalex.org/W1580085516","https://openalex.org/W1971661364","https://openalex.org/W1996872168","https://openalex.org/W2003509249","https://openalex.org/W2005119019","https://openalex.org/W2035329633","https://openalex.org/W2083967570","https://openalex.org/W2102076751","https://openalex.org/W2108516110","https://openalex.org/W2115358779","https://openalex.org/W2116660052","https://openalex.org/W2118936998","https://openalex.org/W2137321978","https://openalex.org/W2138967646","https://openalex.org/W2143560894","https://openalex.org/W2144317842","https://openalex.org/W2314208533","https://openalex.org/W4241417314"],"related_works":["https://openalex.org/W4200081355","https://openalex.org/W2135179174","https://openalex.org/W1932300341","https://openalex.org/W2294784349","https://openalex.org/W3081944365","https://openalex.org/W2890381285","https://openalex.org/W1979659965","https://openalex.org/W2136432055","https://openalex.org/W301102721","https://openalex.org/W2359502741"],"abstract_inverted_index":{"In":[0],"a":[1,28,79,100,116,126,142],"bee":[2,29],"colony,":[3],"bees":[4],"perform":[5,87],"waggle":[6],"dance":[7],"in":[8,27,54,99,115],"order":[9],"to":[10,17,39,86,140],"communicate":[11],"the":[12,41,48,55,91,112,133,147],"information":[13],"of":[14,81,94,108,118,128],"food":[15],"source":[16],"their":[18],"hive":[19],"mates.":[20],"This":[21],"foraging":[22],"behaviour":[23],"has":[24],"been":[25],"adapted":[26],"colony":[30],"optimization":[31],"(BCO)":[32],"algorithm":[33,57],"together":[34],"with":[35],"2-opt":[36,53,72,88,103,109],"local":[37],"search":[38],"solve":[40],"traveling":[42],"salesman":[43],"problem":[44],"(TSP).":[45],"To":[46],"reduce":[47],"high":[49],"overhead":[50],"incurred":[51],"by":[52],"BCO":[56],"proposed":[58],"previously,":[59],"two":[60],"mechanisms":[61,122],"named":[62],"frequency-based":[63],"pruning":[64],"strategy":[65],"(FBPS)":[66],"and":[67,132],"fixed-radius":[68],"near":[69],"neighbour":[70],"(FRNN)":[71],"are":[73,84,123,138],"presented.":[74],"FBPS":[75],"suggests":[76],"that":[77,136],"only":[78],"subset":[80],"promising":[82],"solutions":[83],"allowed":[85],"based":[89],"on":[90,125],"accumulated":[92],"frequency":[93],"its":[95],"building":[96],"blocks":[97],"recorded":[98],"matrix.":[101],"FRNN":[102],"is":[104],"an":[105],"efficient":[106],"implementation":[107],"which":[110],"exploits":[111],"geometric":[113],"structure":[114],"permutation":[117],"TSP":[119,129],"sequence.":[120],"Both":[121],"tested":[124],"set":[127],"benchmark":[130],"problems":[131],"results":[134],"show":[135],"they":[137],"able":[139],"achieve":[141],"58.42%":[143],"improvement":[144],"while":[145],"maintaining":[146],"solution":[148],"quality":[149],"at":[150],"0.02%":[151],"from":[152],"known":[153],"optimal.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}