{"id":"https://openalex.org/W2321885480","doi":null,"title":"Bee Colony Algorithm for the Multidimensional Knapsack Problem","display_name":"Bee Colony Algorithm for the Multidimensional Knapsack Problem","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2321885480","mag":"2321885480"},"language":"en","primary_location":{"id":"mag:2321885480","doi":null,"is_oa":false,"landing_page_url":"http://www.iaeng.org/publication/IMECS2008/IMECS2008_pp84-88.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2321885480"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5024259930","display_name":"L\u00ea V\u01cen Th\u00e0nh","orcid":"https://orcid.org/0000-0003-0739-1385","observed_orcids":["https://orcid.org/0000-0003-0739-1385"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"L\u00ea V\u01cen Th\u00e0nh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5024259930"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9653000235557556,"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.9653000235557556,"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":0.032499998807907104,"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/T10551","display_name":"Scheduling and Optimization Algorithms","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"}}],"keywords":[{"id":"https://openalex.org/keywords/bee-colony-optimization","display_name":"bee colony optimization","score":0.9459999799728394},{"id":"https://openalex.org/keywords/multidimensional-knapsack-problem","display_name":"multidimensional knapsack problem","score":0.9990000128746033},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8730000257492065},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8870000243186951},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"resource constraints","score":0.8880000114440918},{"id":"https://openalex.org/keywords/ant-colony-optimization-comparison","display_name":"ant colony optimization comparison","score":0.8669999837875366},{"id":"https://openalex.org/keywords/solution-generation","display_name":"solution generation","score":0.8130000233650208}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9591083526611328},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6885892748832703},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6749606132507324},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6682245135307312},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6152352690696716},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5752413272857666},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4999654293060303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47337645292282104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.434325635433197},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43378445506095886},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41291341185569763},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.390392541885376},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2321885480","doi":null,"is_oa":false,"landing_page_url":"http://www.iaeng.org/publication/IMECS2008/IMECS2008_pp84-88.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.7454","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.7454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iaeng.org/publication/IMECS2008/IMECS2008_pp84-88.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W16088600","https://openalex.org/W1489512665","https://openalex.org/W1674834782","https://openalex.org/W2314208533","https://openalex.org/W3016885447"],"related_works":["https://openalex.org/W2791780221","https://openalex.org/W1504826621","https://openalex.org/W3016885447","https://openalex.org/W3083685017","https://openalex.org/W2134956171","https://openalex.org/W3203386397","https://openalex.org/W2375021608","https://openalex.org/W83815730","https://openalex.org/W2079350534","https://openalex.org/W4401384048"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"In":[2],"this":[3],"paper":[4],"we":[5,70],"present":[6],"a":[7,31,37],"new":[8,50,78],"algorithm":[9,51,74],"based":[10],"on":[11,61],"the":[12,19,24],"Bee":[13],"Colony":[14,57],"Optimization":[15,58],"(BCO)":[16],"meta-heuristic":[17],"for":[18],"Multidimensional":[20],"Knapsack":[21],"Problem":[22],"(MKP),":[23],"goal":[25],"of":[26,33],"which":[27],"is":[28],"to":[29,75],"find":[30],"subset":[32],"objects":[34],"that":[35,48],"maximizes":[36],"given":[38],"objective":[39],"function":[40],"while":[41],"satisfying":[42],"some":[43],"resource":[44],"constraints.":[45],"We":[46],"show":[47],"our":[49],"obtains":[52],"better":[53],"results":[54],"than":[55],"Ant":[56],"algorithms":[59],"and":[60],"most":[62],"instances":[63],"it":[64],"reaches":[65],"best":[66],"known":[67],"solutions.":[68,79],"Especially":[69],"propose":[71],"an":[72],"efficient":[73],"produce":[76],"randomly":[77]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2321885480","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
