{"id":"https://openalex.org/W2011590156","doi":"https://doi.org/10.1109/icnc.2014.6975884","title":"A hybrid artificial bee colony optimization algorithm","display_name":"A hybrid artificial bee colony optimization algorithm","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2011590156","doi":"https://doi.org/10.1109/icnc.2014.6975884","mag":"2011590156"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2014.6975884","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2014.6975884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Natural Computation (ICNC)","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/A5103633705","display_name":"Yanhua Yuan","orcid":null},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yanhua Yuan","raw_affiliation_strings":["Department of Applied Mathematics, Nanjing University of Science and Technology, Nanjing, Jiangsu, China","Department of Applied Mathematics, Nanjing University of Science, and Technology Nanjing, Jiangsu 210094, China"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Nanjing University of Science and Technology, Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I36399199"]},{"raw_affiliation_string":"Department of Applied Mathematics, Nanjing University of Science, and Technology Nanjing, Jiangsu 210094, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029155705","display_name":"Yuanguo Zhu","orcid":"https://orcid.org/0000-0003-3176-4428"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanguo Zhu","raw_affiliation_strings":["Department of Applied Mathematics, Nanjing University of Science and Technology, Nanjing, Jiangsu, China","Department of Applied Mathematics, Nanjing University of Science, and Technology Nanjing, Jiangsu 210094, China"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Nanjing University of Science and Technology, Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I36399199"]},{"raw_affiliation_string":"Department of Applied Mathematics, Nanjing University of Science, and Technology Nanjing, Jiangsu 210094, China","institution_ids":["https://openalex.org/I36399199"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103633705"],"corresponding_institution_ids":["https://openalex.org/I36399199"],"apc_list":null,"apc_paid":null,"fwci":1.227,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84173175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"492","last_page":"496"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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.9961000084877014,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.8950875997543335},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7897894978523254},{"id":"https://openalex.org/keywords/bees-algorithm","display_name":"Bees algorithm","score":0.6351408958435059},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.6170126795768738},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6085942983627319},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6083007454872131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5731997489929199},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5424370169639587},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.5084520578384399},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.5029730200767517},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.48463350534439087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48355361819267273},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.4532639682292938},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4286783039569855},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.42071881890296936},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.41419756412506104},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4134260416030884},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31561219692230225},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.30524593591690063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24453774094581604}],"concepts":[{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.8950875997543335},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7897894978523254},{"id":"https://openalex.org/C143574069","wikidata":"https://www.wikidata.org/wiki/Q3497720","display_name":"Bees algorithm","level":3,"score":0.6351408958435059},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.6170126795768738},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6085942983627319},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6083007454872131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5731997489929199},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5424370169639587},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.5084520578384399},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.5029730200767517},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.48463350534439087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48355361819267273},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.4532639682292938},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4286783039569855},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.42071881890296936},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.41419756412506104},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4134260416030884},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31561219692230225},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.30524593591690063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24453774094581604},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2014.6975884","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2014.6975884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Natural Computation (ICNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1975299303","https://openalex.org/W1998645161","https://openalex.org/W2010461097","https://openalex.org/W2024060531","https://openalex.org/W2052150600","https://openalex.org/W2082001290","https://openalex.org/W2093505798","https://openalex.org/W2107537724","https://openalex.org/W2125757417","https://openalex.org/W2138936402","https://openalex.org/W2142507131","https://openalex.org/W2143560894","https://openalex.org/W2152195021","https://openalex.org/W2161846621","https://openalex.org/W2287814884","https://openalex.org/W3023540311","https://openalex.org/W6676066497","https://openalex.org/W6696126189"],"related_works":["https://openalex.org/W2053666994","https://openalex.org/W2011590156","https://openalex.org/W2142507131","https://openalex.org/W2384368905","https://openalex.org/W1966574952","https://openalex.org/W2130815404","https://openalex.org/W2367488864","https://openalex.org/W2589803800","https://openalex.org/W2007716860","https://openalex.org/W1536736031"],"abstract_inverted_index":{"Artificial":[0],"bee":[1,17,43],"colony":[2,44],"(ABC)":[3],"algorithm":[4,45,64,68,84,91,114],"introduced":[5,86],"by":[6,11,31],"D.":[7],"Karaboga":[8],"was":[9],"inspired":[10],"the":[12,22,28,37,73,76,89,98,100,112],"behaviors":[13],"of":[14,21,82],"real":[15],"honey":[16],"colonies.":[18],"The":[19,40],"routes":[20],"swarm":[23,48],"are":[24,85],"exploited":[25],"according":[26],"to":[27,87],"neighbor":[29],"information":[30],"employed":[32],"bees":[33],"and":[34,69,79,106],"onlookers":[35],"in":[36,54,92,122],"ABC":[38,67,90],"algorithm.":[39,71],"classic":[41],"artificial":[42],"as":[46],"a":[47,62],"optimization":[49,95,108],"method":[50],"is":[51,115],"sometimes":[52],"trapped":[53],"local":[55],"optima.":[56],"In":[57,72,97],"this":[58],"paper":[59],"we":[60],"propose":[61],"hybrid":[63,74],"based":[65],"on":[66],"genetic":[70,83],"procedure,":[75],"crossover":[77],"operator":[78,81],"mutation":[80],"improve":[88],"solving":[93],"complex":[94],"problems.":[96],"paper,":[99],"experiments":[101],"for":[102],"Traveling":[103],"Salesman":[104],"Problem":[105],"function":[107],"problems":[109],"show":[110],"that":[111],"proposed":[113],"more":[116],"efficient":[117],"compared":[118],"with":[119],"other":[120],"techniques":[121],"recent":[123],"literature.":[124]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}