{"id":"https://openalex.org/W2000889506","doi":"https://doi.org/10.4304/jcp.6.5.841-848","title":"Differential Artificial Bee Colony Algorithm for Global Numerical Optimization","display_name":"Differential Artificial Bee Colony Algorithm for Global Numerical Optimization","publication_year":2011,"publication_date":"2011-05-03","ids":{"openalex":"https://openalex.org/W2000889506","doi":"https://doi.org/10.4304/jcp.6.5.841-848","mag":"2000889506"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.6.5.841-848","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.5.841-848","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","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/A5043114890","display_name":"Bin Wu","orcid":"https://orcid.org/0000-0001-5787-9536"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073506125","display_name":"Cun hua Qian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cun hua Qian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.3334,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.9695684,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"5","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.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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9921000003814697,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9901999831199646,"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/differential-evolution","display_name":"Differential evolution","score":0.7420812249183655},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.7073612213134766},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6736992001533508},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6729994416236877},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6244310736656189},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5820906758308411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5721644163131714},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5453916192054749},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4271537661552429},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.41965818405151367},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4152567982673645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.350408136844635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.329639732837677}],"concepts":[{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.7420812249183655},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.7073612213134766},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6736992001533508},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6729994416236877},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6244310736656189},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5820906758308411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5721644163131714},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5453916192054749},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4271537661552429},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.41965818405151367},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4152567982673645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.350408136844635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.329639732837677},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/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},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.6.5.841-848","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.5.841-848","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Zero hunger","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1635451898","https://openalex.org/W1971583942","https://openalex.org/W1991374817","https://openalex.org/W2019617030","https://openalex.org/W2020239997","https://openalex.org/W2020381385","https://openalex.org/W2079991732","https://openalex.org/W2082555634","https://openalex.org/W2143560894","https://openalex.org/W2144317842","https://openalex.org/W2169064301","https://openalex.org/W2358495864","https://openalex.org/W2380622731","https://openalex.org/W2393194540","https://openalex.org/W2495009916","https://openalex.org/W2797272670","https://openalex.org/W2997337171","https://openalex.org/W6636583135","https://openalex.org/W6772672672"],"related_works":["https://openalex.org/W2382755429","https://openalex.org/W2793899073","https://openalex.org/W2028692034","https://openalex.org/W2061105161","https://openalex.org/W2139372187","https://openalex.org/W2069663777","https://openalex.org/W2242387338","https://openalex.org/W2137252459","https://openalex.org/W2477353957","https://openalex.org/W3182909153"],"abstract_inverted_index":{"Artificial":[0],"bee":[1],"colony":[2],"(ABC)":[3],"is":[4,37],"the":[5,8,19,25,54,58,72,99,107,112,118],"one":[6],"of":[7,60,64,74,80,88],"newest":[9],"nature":[10],"inspired":[11],"heuristics":[12],"for":[13],"optimization":[14,92],"problem.In":[15],"order":[16],"to":[17,23,27],"improve":[18,117],"convergence":[20],"characteristics":[21],"and":[22,45,62,96,102,115],"prevent":[24],"ABC":[26,35,101],"get":[28],"stuck":[29],"on":[30,85],"local":[31],"solutions,":[32],"a":[33,78,86],"differential":[34,40],"(DABC)":[36],"proposed.":[38],"The":[39],"operator":[41],"obeys":[42],"uniform":[43],"distribution":[44],"creates":[46],"candidate":[47],"food":[48],"position":[49],"that":[50,106],"can":[51,109],"fully":[52],"represent":[53],"solution":[55],"space.":[56],"So":[57],"diversity":[59],"populations":[61],"capability":[63],"global":[65],"search":[66],"will":[67],"be":[68],"enhanced.":[69],"To":[70],"show":[71,105],"performance":[73],"our":[75],"proposed":[76],"DABC,":[77],"number":[79],"experiments":[81],"are":[82],"carried":[83],"out":[84],"set":[87],"well-known":[89],"benchmark":[90],"continuous":[91],"problems.":[93],"Simulation":[94],"results":[95],"comparisons":[97],"with":[98],"standard":[100],"several":[103],"meta-heuristics":[104],"DABC":[108],"effectively":[110],"enhance":[111],"searching":[113,119],"efficiency":[114],"greatly":[116],"quality.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}