{"id":"https://openalex.org/W2432842948","doi":"https://doi.org/10.4156/aiss.vol4.issue22.57","title":"Binary Artificial Bee Colony Algorithm for Solving 0-1 Knapsack Problem","display_name":"Binary Artificial Bee Colony Algorithm for Solving 0-1 Knapsack Problem","alternate_titles":[],"publication_year":2012,"publication_date":"2012-12-17","ids":{"openalex":"https://openalex.org/W2432842948","doi":"https://doi.org/10.4156/aiss.vol4.issue22.57","mag":"2432842948"},"language":"en","primary_location":{"id":"doi:10.4156/aiss.vol4.issue22.57","doi":"https://doi.org/10.4156/aiss.vol4.issue22.57","is_oa":false,"landing_page_url":"https://doi.org/10.4156/aiss.vol4.issue22.57","pdf_url":null,"source":{"id":"https://openalex.org/S4210238739","display_name":"INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences","issn_l":"1976-3700","issn":["1976-3700","2233-9345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2432842948"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5100431626","display_name":"Wei Liu","orcid":"https://orcid.org/0000-0001-5384-6462","observed_orcids":["https://orcid.org/0000-0001-5384-6462"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu Wei -","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024053576","display_name":"Ben Niu","orcid":"https://orcid.org/0000-0001-5822-8743","observed_orcids":["https://orcid.org/0000-0001-5822-8743","https://orcid.org/0009-0004-4642-8544"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niu Ben -","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102961733","display_name":"Hanning Chen","orcid":"https://orcid.org/0000-0002-9885-6653","observed_orcids":["https://orcid.org/0000-0002-9885-6653"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen Hanning -","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":0.467,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.6366911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":"4","issue":"22","first_page":"464","last_page":"470"},"is_retracted":false,"is_pulled":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/T12176","display_name":"Optimization and Packing Problems","score":9.999999747378752e-05,"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/T12391","display_name":"Artificial Immune Systems Applications","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/0-1-knapsack-problem","display_name":"0-1 knapsack problem","score":0.996999979019165},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"discrete optimization","score":0.5950000286102295},{"id":"https://openalex.org/keywords/employed-bees","display_name":"employed bees","score":0.45899999141693115},{"id":"https://openalex.org/keywords/onlooker-bees","display_name":"onlooker bees","score":0.7850000262260437},{"id":"https://openalex.org/keywords/scout-bees","display_name":"scout bees","score":0.9940000176429749},{"id":"https://openalex.org/keywords/binary-particle-swarm-optimization","display_name":"binary particle swarm optimization","score":0.7910000085830688},{"id":"https://openalex.org/keywords/binary-genetic-algorithm","display_name":"binary genetic algorithm","score":0.8199999928474426},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8399999737739563}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.968032717704773},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6856993436813354},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.467242032289505},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.456439346075058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42292356491088867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3705400824546814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35350799560546875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3300463557243347},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27436959743499756},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11865988373756409}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4156/aiss.vol4.issue22.57","doi":"https://doi.org/10.4156/aiss.vol4.issue22.57","is_oa":false,"landing_page_url":"https://doi.org/10.4156/aiss.vol4.issue22.57","pdf_url":null,"source":{"id":"https://openalex.org/S4210238739","display_name":"INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences","issn_l":"1976-3700","issn":["1976-3700","2233-9345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences","raw_type":"journal-article"},{"id":"pmh:oai:ir.sia.cn/:173321/10581","doi":null,"is_oa":false,"landing_page_url":"http://ir.sia.cn/handle/173321/10581","pdf_url":null,"source":{"id":"https://openalex.org/S4377196984","display_name":"SIA OpenIR (Chinese Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I19820366","host_organization_name":"Chinese Academy of Sciences","host_organization_lineage":["https://openalex.org/I19820366"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu W,Niu B,Chen HN. Binary artificial bee colony algorithm for solving 0-1 knapsack problem[J]. Advances in Information Sciences and Service Sciences,2012,4(22):464-470.","raw_type":"\u671f\u520a\u8bba\u6587"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2808679283","https://openalex.org/W7096717323","https://openalex.org/W2924306436","https://openalex.org/W2748796848","https://openalex.org/W2964082281","https://openalex.org/W2390199896","https://openalex.org/W2039148220","https://openalex.org/W2744012164","https://openalex.org/W2440230504","https://openalex.org/W4385988464"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,27,31,55,60,75],"binary":[4,33,86],"artificial":[5],"bee":[6],"colony":[7],"(BABC)":[8],"algorithm":[9,94],"is":[10],"proposed":[11,24,71,81,102],"to":[12,39],"solve":[13],"the":[14,19,23,41,45,52,67,70,80,84,92,101,105],"0-1":[15],"Knapsack":[16],"problem.":[17],"Unlike":[18],"original":[20],"ABC":[21],"algorithm,":[22],"BABC":[25,82],"represents":[26],"food":[28],"source":[29],"as":[30],"discrete":[32,37],"variable":[34],"and":[35,49,91,107],"applies":[36],"operators":[38],"change":[40],"foraging":[42],"trajectories":[43],"of":[44,69,79,111,113],"employed":[46],"bees,":[47],"onlookers":[48],"scouts":[50],"in":[51,109],"probability":[53],"that":[54,100],"coordinate":[56],"will":[57],"take":[58],"on":[59],"zero":[61],"or":[62],"one":[63],"value.":[64],"To":[65],"verify":[66],"performance":[68],"algorithms,":[72],"we":[73],"made":[74],"comparison":[76,97],"between":[77],"algorithms":[78,103],"with":[83],"standard":[85],"particle":[87],"swarm":[88],"optimizer":[89],"(BPSO)":[90],"genetic":[93],"(BGA).":[95],"The":[96],"results":[98],"showed":[99],"outperform":[104],"BPSO":[106],"BGA":[108],"terms":[110],"quality":[112],"solution":[114],"found.":[115]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2432842948","counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
