{"id":"https://openalex.org/W2919805933","doi":"https://doi.org/10.1142/s0218213019500040","title":"Solving Traveling Salesman Problem by Using Combinatorial Artificial Bee Colony Algorithms","display_name":"Solving Traveling Salesman Problem by Using Combinatorial Artificial Bee Colony Algorithms","publication_year":2019,"publication_date":"2019-02-01","ids":{"openalex":"https://openalex.org/W2919805933","doi":"https://doi.org/10.1142/s0218213019500040","mag":"2919805933"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213019500040","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213019500040","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/A5058576703","display_name":"Dervi\u015f Karabo\u011fa","orcid":"https://orcid.org/0000-0003-1439-6969"},"institutions":[{"id":"https://openalex.org/I87673952","display_name":"Erciyes University","ror":"https://ror.org/047g8vk19","country_code":"TR","type":"education","lineage":["https://openalex.org/I87673952"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Dervis Karaboga","raw_affiliation_strings":["Computer Engineering Department, Erciyes University Kayseri, Kayseri 38700/Melikgazi, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Erciyes University Kayseri, Kayseri 38700/Melikgazi, Turkey","institution_ids":["https://openalex.org/I87673952"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056041580","display_name":"Beyza G\u00f6rkemli","orcid":"https://orcid.org/0000-0002-8584-2308"},"institutions":[{"id":"https://openalex.org/I87673952","display_name":"Erciyes University","ror":"https://ror.org/047g8vk19","country_code":"TR","type":"education","lineage":["https://openalex.org/I87673952"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Beyza Gorkemli","raw_affiliation_strings":["Computer Engineering Department, Erciyes University Kayseri, Kayseri 38700/Melikgazi, Turkey"],"raw_orcid":"https://orcid.org/0000-0002-8584-2308","affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Erciyes University Kayseri, Kayseri 38700/Melikgazi, Turkey","institution_ids":["https://openalex.org/I87673952"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056041580"],"corresponding_institution_ids":["https://openalex.org/I87673952"],"apc_list":null,"apc_paid":null,"fwci":6.2161,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.97024895,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"28","issue":"01","first_page":"1950004","last_page":"1950004"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9912999868392944,"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.9900000095367432,"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.8330908417701721},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7246952652931213},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.709550678730011},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6482700109481812},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5396904945373535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5174310803413391},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43335258960723877},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4291081130504608},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20081913471221924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20068755745887756}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8330908417701721},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7246952652931213},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.709550678730011},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6482700109481812},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5396904945373535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5174310803413391},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43335258960723877},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4291081130504608},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20081913471221924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20068755745887756},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218213019500040","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213019500040","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1523750526","https://openalex.org/W1595159159","https://openalex.org/W1968594877","https://openalex.org/W1995714897","https://openalex.org/W1999077811","https://openalex.org/W2024060531","https://openalex.org/W2038950936","https://openalex.org/W2050149390","https://openalex.org/W2055360661","https://openalex.org/W2080822075","https://openalex.org/W2092292680","https://openalex.org/W2093786661","https://openalex.org/W2093825635","https://openalex.org/W2106378689","https://openalex.org/W2106914949","https://openalex.org/W2117954767","https://openalex.org/W2137042221","https://openalex.org/W2144317842","https://openalex.org/W2148736953","https://openalex.org/W2152195021","https://openalex.org/W2154929945","https://openalex.org/W2169064301","https://openalex.org/W2212025799","https://openalex.org/W2287814884","https://openalex.org/W2540697933","https://openalex.org/W3139666781"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2981400081","https://openalex.org/W2359502741","https://openalex.org/W2781474544","https://openalex.org/W2572756133","https://openalex.org/W1563568831"],"abstract_inverted_index":{"Artificial":[0],"bee":[1],"colony":[2],"(ABC)":[3],"is":[4,47,62],"a":[5],"quite":[6],"popular":[7],"optimization":[8,99],"approach":[9],"that":[10],"has":[11],"been":[12],"used":[13],"in":[14,42,121],"many":[15],"fields,":[16],"with":[17,96],"its":[18],"not":[19],"only":[20],"standard":[21,52],"form":[22],"but":[23],"also":[24,117],"improved":[25,64],"versions.":[26],"In":[27,74],"this":[28],"paper,":[29],"new":[30,82,119],"versions":[31],"of":[32,45,51,66,80,129],"ABC":[33,56,123],"algorithm":[34],"to":[35,76],"solve":[36],"TSP":[37,86,115],"are":[38,88,94],"introduced":[39],"and":[40,90,108,116],"described":[41],"detail.":[43],"One":[44],"these":[46],"the":[48,78,81,91,118,126],"combinatorial":[49,55],"version":[50,65],"ABC,":[53],"called":[54,69],"(CABC)":[57],"algorithm.":[58,73],"The":[59,101],"other":[60],"one":[61],"an":[63],"CABC":[67,71,107,130],"algorithm,":[68],"quick":[70,122],"(qCABC)":[72],"order":[75],"see":[77],"efficiency":[79],"versions,":[83],"15":[84],"different":[85,97],"benchmarks":[87],"considered":[89],"results":[92,103],"generated":[93],"compared":[95],"well-known":[98],"methods.":[100],"simulation":[102],"show":[104],"that,":[105],"both":[106],"qCABC":[109],"algorithms":[110],"demonstrate":[111],"good":[112],"performance":[113,128],"for":[114],"definition":[120],"(qABC)":[124],"improves":[125],"convergence":[127],"on":[131],"TSP.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":6}],"updated_date":"2026-06-06T09:05:17.133730","created_date":"2025-10-10T00:00:00"}