{"id":"https://openalex.org/W2129071786","doi":"https://doi.org/10.1109/nabic.2009.5393726","title":"Parallel artificial bee colony (PABC) algorithm","display_name":"Parallel artificial bee colony (PABC) algorithm","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2129071786","doi":"https://doi.org/10.1109/nabic.2009.5393726","mag":"2129071786"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2009.5393726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature &amp; Biologically Inspired Computing (NaBIC)","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/A5077482746","display_name":"Harikrishna Narasimhan","orcid":"https://orcid.org/0009-0007-0476-6635"},"institutions":[{"id":"https://openalex.org/I33585257","display_name":"Anna University, Chennai","ror":"https://ror.org/01qhf1r47","country_code":"IN","type":"education","lineage":["https://openalex.org/I33585257"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Harikrishna Narasimhan","raw_affiliation_strings":["Department of Computer Science and Engineering, College of Engineering, Anna University, Chennai, Tamil Nadu, India","Department of Computer Science and Engineering, College of Engineering, Guindy, Anna University, Chennai - 600 025, Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, College of Engineering, Anna University, Chennai, Tamil Nadu, India","institution_ids":["https://openalex.org/I33585257"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, College of Engineering, Guindy, Anna University, Chennai - 600 025, Tamil Nadu, India","institution_ids":["https://openalex.org/I33585257"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077482746"],"corresponding_institution_ids":["https://openalex.org/I33585257"],"apc_list":null,"apc_paid":null,"fwci":3.4894,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.93069661,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"306","last_page":"311"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9977999925613403,"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.9973000288009644,"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/computer-science","display_name":"Computer science","score":0.7745513916015625},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.6714821457862854},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6714314222335815},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.658035397529602},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6275057196617126},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5599690079689026},{"id":"https://openalex.org/keywords/foraging","display_name":"Foraging","score":0.5177385210990906},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.43430641293525696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3007291555404663},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22613608837127686},{"id":"https://openalex.org/keywords/ecology","display_name":"Ecology","score":0.06499764323234558}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7745513916015625},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6714821457862854},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6714314222335815},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.658035397529602},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6275057196617126},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5599690079689026},{"id":"https://openalex.org/C165287380","wikidata":"https://www.wikidata.org/wiki/Q2916569","display_name":"Foraging","level":2,"score":0.5177385210990906},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.43430641293525696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3007291555404663},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22613608837127686},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.06499764323234558},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2009.5393726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature &amp; Biologically Inspired Computing (NaBIC)","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":29,"referenced_works":["https://openalex.org/W645403","https://openalex.org/W8274832","https://openalex.org/W68587524","https://openalex.org/W117128401","https://openalex.org/W1529965533","https://openalex.org/W1544076857","https://openalex.org/W1568834902","https://openalex.org/W1635451898","https://openalex.org/W1792616196","https://openalex.org/W1971583942","https://openalex.org/W1991374817","https://openalex.org/W2020381385","https://openalex.org/W2090883236","https://openalex.org/W2134816084","https://openalex.org/W2143560894","https://openalex.org/W2144317842","https://openalex.org/W2161114097","https://openalex.org/W2169064301","https://openalex.org/W2287814884","https://openalex.org/W3138355580","https://openalex.org/W4255486187","https://openalex.org/W6600033466","https://openalex.org/W6604608670","https://openalex.org/W6636583135","https://openalex.org/W6638366967","https://openalex.org/W6655590859","https://openalex.org/W6679782657","https://openalex.org/W6696126189","https://openalex.org/W6792741644"],"related_works":["https://openalex.org/W4200081355","https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W3081944365","https://openalex.org/W2135179174","https://openalex.org/W1932300341","https://openalex.org/W2294784349","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671"],"abstract_inverted_index":{"The":[0,37],"artificial":[1],"bee":[2],"colony":[3,39],"(ABC)":[4],"algorithm":[5,9,32],"is":[6,14,42,53,67,118],"a":[7,27,71,83],"metaheuristic":[8],"for":[10,33],"numerical":[11],"optimization.":[12],"It":[13,117],"based":[15],"on":[16],"the":[17,31,46,56,78,86,89,93,96,98,103,107,121,128],"intelligent":[18],"foraging":[19],"behavior":[20],"of":[21,30,40,51,59,64,80,95,130],"honey":[22],"bees.":[23,116],"This":[24],"paper":[25],"presents":[26],"parallel":[28],"version":[29],"shared":[34,73,108],"memory":[35,58,109],"architectures.":[36],"entire":[38],"bees":[41,81],"divided":[43],"equally":[44],"among":[45],"available":[47,112],"processors.":[48],"A":[49,62],"set":[50,79],"solutions":[52,87,99,131],"placed":[54],"in":[55,70,88,106],"local":[57,90],"each":[60,65,76],"processor.":[61],"copy":[63],"solution":[66],"also":[68],"maintained":[69],"global":[72],"memory.":[74,91],"During":[75],"cycle,":[77,97],"at":[82],"processor":[84],"improves":[85],"At":[92],"end":[94],"are":[100],"copied":[101],"into":[102],"corresponding":[104],"slots":[105],"and":[110],"made":[111],"to":[113],"all":[114],"other":[115],"shown":[119],"that":[120],"proposed":[122],"parallelization":[123],"strategy":[124],"does":[125],"not":[126],"degrade":[127],"quality":[129],"obtained,":[132],"but":[133],"achieves":[134],"substantial":[135],"speedup.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
