{"id":"https://openalex.org/W3203386397","doi":"https://doi.org/10.1109/icee52715.2021.9544302","title":"Multiswarm Binary Butterfly Optimization Algorithm for Solving the Multidimensional Knapsack Problem","display_name":"Multiswarm Binary Butterfly Optimization Algorithm for Solving the Multidimensional Knapsack Problem","publication_year":2021,"publication_date":"2021-05-18","ids":{"openalex":"https://openalex.org/W3203386397","doi":"https://doi.org/10.1109/icee52715.2021.9544302","mag":"3203386397"},"language":"en","primary_location":{"id":"doi:10.1109/icee52715.2021.9544302","doi":"https://doi.org/10.1109/icee52715.2021.9544302","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icee52715.2021.9544302","pdf_url":null,"source":{"id":"https://openalex.org/S4306420382","display_name":"Iranian Conference on Electrical Engineering","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 29th Iranian Conference on Electrical Engineering (ICEE)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5007394444","display_name":"Shakiba Shahbandegan","orcid":"https://orcid.org/0000-0002-3670-630X","observed_orcids":["https://orcid.org/0000-0002-3670-630X"]},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Shakiba Shahbandegan","raw_affiliation_strings":["Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110941983","display_name":"Madjid Naderi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Madjid Naderi","raw_affiliation_strings":["Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67009956"],"apc_list":null,"apc_paid":null,"fwci":0.0932,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.22295542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"545","last_page":"550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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.0005000000237487257,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.0,"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/multidimensional-knapsack-problem","display_name":"multidimensional knapsack problem","score":0.9520000219345093},{"id":"https://openalex.org/keywords/butterfly-optimization-algorithm","display_name":"butterfly optimization algorithm","score":0.8870000243186951},{"id":"https://openalex.org/keywords/binary-optimization","display_name":"binary optimization","score":0.7789999842643738},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.7570000290870667},{"id":"https://openalex.org/keywords/0-1-knapsack-problem","display_name":"0-1 knapsack problem","score":0.875},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8240000009536743},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.8360000252723694}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9333080053329468},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7018236517906189},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.648707389831543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6422475576400757},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6183614730834961},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5354737043380737},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5306210517883301},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5216612815856934},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5080196857452393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4974081814289093},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4901788830757141},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4632616639137268},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2681087851524353},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.1378430426120758},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icee52715.2021.9544302","doi":"https://doi.org/10.1109/icee52715.2021.9544302","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icee52715.2021.9544302","pdf_url":null,"source":{"id":"https://openalex.org/S4306420382","display_name":"Iranian Conference on Electrical Engineering","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 29th Iranian Conference on Electrical Engineering (ICEE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1974542796","https://openalex.org/W2003709487","https://openalex.org/W2059713960","https://openalex.org/W2089131950","https://openalex.org/W2096166399","https://openalex.org/W2102247879","https://openalex.org/W2132829376","https://openalex.org/W2147237268","https://openalex.org/W2168848281","https://openalex.org/W2336349341","https://openalex.org/W2771294257","https://openalex.org/W2790662215","https://openalex.org/W2807637964","https://openalex.org/W2894209947","https://openalex.org/W2937396090","https://openalex.org/W3007689421","https://openalex.org/W3008636692","https://openalex.org/W3014126395","https://openalex.org/W3043260374","https://openalex.org/W3048144852","https://openalex.org/W3083685017","https://openalex.org/W3129985606","https://openalex.org/W4312611609","https://openalex.org/W6791021564"],"related_works":["https://openalex.org/W3129985606","https://openalex.org/W4406906733","https://openalex.org/W2039190904","https://openalex.org/W191777962","https://openalex.org/W2263109335","https://openalex.org/W2769181257","https://openalex.org/W2321885480","https://openalex.org/W3167354162","https://openalex.org/W2106378848","https://openalex.org/W2896000069"],"abstract_inverted_index":{"The":[0],"multidimensional":[1],"knapsack":[2],"problem":[3,11],"(MKP)":[4],"is":[5,60,99,147],"a":[6,32,61,108,118,154],"well-known":[7],"NP-hard":[8,29],"combinatorial":[9],"optimization":[10,82,86],"which":[12],"can":[13],"be":[14],"employed":[15],"to":[16,52,75,101,112,149],"model":[17],"many":[18,46],"practical":[19],"engineering":[20],"problems.":[21,141],"Metaheuristic":[22],"methods":[23,39,48],"are":[24,133],"proven":[25],"efficient":[26],"in":[27,31,88,117,153],"solving":[28],"problems":[30,87],"reasonable":[33],"amount":[34,120,157],"of":[35,71,121,127,158],"time":[36,159],"where":[37],"exact":[38],"face":[40],"limitations.":[41],"In":[42,91],"the":[43,54,69,94,103,114,125,128,151,162],"past":[44],"decades,":[45],"heuristic":[47],"have":[49],"been":[50],"developed":[51,63],"solve":[53,102,150],"MKP.":[55,105],"Butterfly":[56],"Optimization":[57],"Algorithm":[58],"(BOA)":[59],"recently":[62],"metaheuristic":[64],"method":[65],"that":[66,145],"has":[67],"attracted":[68],"attention":[70],"various":[72,89],"researchers":[73],"due":[74],"its":[76],"simplicity":[77],"and":[78,138],"potential":[79],"as":[80],"an":[81],"technique":[83],"for":[84],"global":[85],"applications.":[90],"this":[92],"paper,":[93],"Multiswarm":[95],"Binary":[96],"BOA":[97,165],"(MBBOA)":[98],"introduced":[100],"0\u20131":[104],"MBBOA":[106,146],"employs":[107],"parallel":[109],"search":[110],"strategy":[111],"reach":[113],"optimum":[115],"values":[116],"reduced":[119],"time.":[122],"To":[123],"prove":[124],"efficiency":[126],"proposed":[129],"method,":[130],"two":[131],"experiments":[132],"conducted":[134],"on":[135],"11":[136],"medium-scale":[137],"large-scale":[139],"benchmark":[140],"Obtained":[142],"results":[143],"show":[144],"able":[148],"MKP":[152],"remarkably":[155],"less":[156],"compared":[160],"with":[161],"sequential":[163],"binary":[164],"algorithm.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2021-10-11T00:00:00"}