{"id":"https://openalex.org/W2171097138","doi":"https://doi.org/10.1109/nabic.2010.5716308","title":"ABC-GSX: A hybrid method for solving the Traveling Salesman Problem","display_name":"ABC-GSX: A hybrid method for solving the Traveling Salesman Problem","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2171097138","doi":"https://doi.org/10.1109/nabic.2010.5716308","mag":"2171097138"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2010.5716308","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2010.5716308","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC)","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/A5033488028","display_name":"Anan Banharnsakun","orcid":"https://orcid.org/0000-0003-2004-4070"},"institutions":[{"id":"https://openalex.org/I60837268","display_name":"King Mongkut's University of Technology Thonburi","ror":"https://ror.org/0057ax056","country_code":"TH","type":"education","lineage":["https://openalex.org/I60837268"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"A Banharnsakun","raw_affiliation_strings":["Department of Computer Engineering, King Mongkut's University of Technology Thonburi, Bangkok, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, King Mongkut's University of Technology Thonburi, Bangkok, Thailand","institution_ids":["https://openalex.org/I60837268"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014448123","display_name":"Tiranee Achalakul","orcid":null},"institutions":[{"id":"https://openalex.org/I60837268","display_name":"King Mongkut's University of Technology Thonburi","ror":"https://ror.org/0057ax056","country_code":"TH","type":"education","lineage":["https://openalex.org/I60837268"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"T Achalakul","raw_affiliation_strings":["Department of Computer Engineering, King Mongkut's University of Technology Thonburi, Bangkok, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, King Mongkut's University of Technology Thonburi, Bangkok, Thailand","institution_ids":["https://openalex.org/I60837268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083855056","display_name":"Booncharoen Sirinaovakul","orcid":"https://orcid.org/0000-0001-8541-1922"},"institutions":[{"id":"https://openalex.org/I60837268","display_name":"King Mongkut's University of Technology Thonburi","ror":"https://ror.org/0057ax056","country_code":"TH","type":"education","lineage":["https://openalex.org/I60837268"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"B Sirinaovakul","raw_affiliation_strings":["Department of Computer Engineering, King Mongkut's University of Technology Thonburi, Bangkok, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, King Mongkut's University of Technology Thonburi, Bangkok, Thailand","institution_ids":["https://openalex.org/I60837268"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I60837268"],"apc_list":null,"apc_paid":null,"fwci":3.2696,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.93564845,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"12"},"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.9925000071525574,"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.9901000261306763,"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.7892360687255859},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7427454590797424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7324879169464111},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6675639152526855},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6368539333343506},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6299713850021362},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4696440100669861},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4398803412914276},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4237940311431885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3275679051876068},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24316072463989258},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19207054376602173}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7892360687255859},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7427454590797424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7324879169464111},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6675639152526855},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6368539333343506},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6299713850021362},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4696440100669861},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4398803412914276},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4237940311431885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3275679051876068},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24316072463989258},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19207054376602173},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2010.5716308","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2010.5716308","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1509434256","https://openalex.org/W1885703397","https://openalex.org/W1978433263","https://openalex.org/W1999459553","https://openalex.org/W2035329633","https://openalex.org/W2050876709","https://openalex.org/W2076390593","https://openalex.org/W2081231516","https://openalex.org/W2090435272","https://openalex.org/W2106378689","https://openalex.org/W2117325189","https://openalex.org/W2119091245","https://openalex.org/W2161846621","https://openalex.org/W2163428398","https://openalex.org/W2166928235","https://openalex.org/W2287814884","https://openalex.org/W6650155314"],"related_works":["https://openalex.org/W2153505252","https://openalex.org/W1980226721","https://openalex.org/W2114549389","https://openalex.org/W2031913815","https://openalex.org/W1481410647","https://openalex.org/W4295205538","https://openalex.org/W3119129187","https://openalex.org/W2592478754","https://openalex.org/W4301419164","https://openalex.org/W2189435634"],"abstract_inverted_index":{"An":[0],"optimization":[1,58],"problem":[2,5,59],"is":[3,29,77,117,130],"a":[4,51,56,145],"of":[6,84,138],"finding":[7,89],"the":[8,22,26,62,71,80,85,95,104,110,114,121],"best":[9,27],"solution":[10,28],"from":[11,144],"all":[12],"possible":[13],"solutions.":[14],"In":[15,44,106],"most":[16],"computer":[17],"science":[18],"and":[19,156],"mathematical":[20],"applications,":[21],"decision":[23,81],"to":[24,39,54,102,160],"select":[25],"not":[30],"polynomially":[31],"bounded.":[32],"Heuristics":[33],"approaches":[34],"are":[35],"thus":[36],"often":[37],"considered":[38],"solve":[40,55],"such":[41],"NP-hard":[42],"problems.":[43],"our":[45,139],"work,":[46],"we":[47],"focus":[48],"on":[49],"developing":[50],"heuristic":[52],"method":[53,129],"combinatorial":[57],"known":[60],"as":[61],"Traveling":[63],"Salesman":[64],"Problem":[65],"or":[66],"TSP.":[67],"Our":[68],"technique":[69],"implements":[70],"Artificial":[72],"Bee":[73],"Colony":[74],"algorithm,":[75],"which":[76],"inspired":[78],"by":[79,120],"making":[82],"process":[83,112],"honey":[86],"bees":[87],"in":[88,113,153,163],"optimal":[90],"food":[91],"sources.":[92],"We":[93,133],"extend":[94],"ABC":[96,115],"algorithm":[97,116],"with":[98],"Greedy":[99,122],"Subtour":[100,123],"Crossover":[101,124],"improve":[103],"precision.":[105],"this":[107],"hybrid":[108],"procedure,":[109],"exploitation":[111],"improved":[118],"upon":[119],"method.":[125],"The":[126],"new":[127],"proposed":[128,140],"called":[131],"ABC-GSX.":[132],"then":[134],"empirically":[135],"assess":[136],"performance":[137],"work":[141],"using":[142],"functions":[143],"standard":[146],"TSP":[147],"library.":[148],"Experimental":[149],"results":[150],"show":[151],"improvements":[152],"both":[154],"precision":[155],"computational":[157],"time":[158],"compared":[159],"techniques":[161],"presented":[162],"recent":[164],"literatures.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}