A Binary Butterfly Optimization Algorithm for the Multidimensional Knapsack Problem
The Multidimensional knapsack problem (MKP) is a well-known optimization problem with which many real-world engineering problems can be modeled. Due to its NP-hard nature, exact methods of solving the MKP are limited to small-scale problems. Therefore, in the past decade, various meta-heuristics hav...
Uloženo v:
| Vydáno v: | 2020 6th Iranian Conference on Signal Processing and Intelligent Systems (ICSPIS) s. 1 - 5 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
23.12.2020
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The Multidimensional knapsack problem (MKP) is a well-known optimization problem with which many real-world engineering problems can be modeled. Due to its NP-hard nature, exact methods of solving the MKP are limited to small-scale problems. Therefore, in the past decade, various meta-heuristics have been developed to solve the MKP in a reasonable time. Butterfly optimization algorithm (BOA) is a recently developed meta-heuristic that has shown good convergence ability as well as avoiding local optima stagnation. In this paper, a binary version of BOA (BBOA) is proposed to solve the 0-1 MKP. BOA is originally designed for a continuous search space therefore in this paper, we propose six binary versions of BOA using three S-shaped and three V-shaped transfer functions and determine the most effective version through experiments. The proposed BBOA also includes an initial population generator and a repair operator based on the pseudo-utility. To evaluate the proposed method, 11 medium-scale and large-scale benchmark problems are employed and BBOA is compared to other competitive algorithms. |
|---|---|
| AbstractList | The Multidimensional knapsack problem (MKP) is a well-known optimization problem with which many real-world engineering problems can be modeled. Due to its NP-hard nature, exact methods of solving the MKP are limited to small-scale problems. Therefore, in the past decade, various meta-heuristics have been developed to solve the MKP in a reasonable time. Butterfly optimization algorithm (BOA) is a recently developed meta-heuristic that has shown good convergence ability as well as avoiding local optima stagnation. In this paper, a binary version of BOA (BBOA) is proposed to solve the 0-1 MKP. BOA is originally designed for a continuous search space therefore in this paper, we propose six binary versions of BOA using three S-shaped and three V-shaped transfer functions and determine the most effective version through experiments. The proposed BBOA also includes an initial population generator and a repair operator based on the pseudo-utility. To evaluate the proposed method, 11 medium-scale and large-scale benchmark problems are employed and BBOA is compared to other competitive algorithms. |
| Author | Naderi, Madjid Shahbandegan, Amirmohammad |
| Author_xml | – sequence: 1 givenname: Amirmohammad surname: Shahbandegan fullname: Shahbandegan, Amirmohammad email: a.shahbandegan@mail.sbu.ac.ir organization: Shahid Beheshti University,Electrical Engineering Department,Tehran,Iran – sequence: 2 givenname: Madjid surname: Naderi fullname: Naderi, Madjid email: m_naderi@iust.ac.ir organization: Iran University of Science and Technology,Electrical Engineering Department,Tehran,Iran |
| BookMark | eNotj71OwzAYAI0EA5Q-AYtfIME_cRyPacRPRFErBebKcT5TC8epHHcoT0-ldrrldNI9oNswBUAIU5JTStRz23TbthO0pDRnhJFc8UKJSt2gpZIVlayiVckUuUddjVcu6HjCq2NKEK0_4c0hudH96eSmgGv_M0WX9iO2U8RpD_jz6JMb3AhhPgva44-gD7M2v3gbp97D-IjurPYzLK9coO_Xl6_mPVtv3tqmXmeOEZ6yXlA6KM4VMVIYUYA1HJgWEoyyJbCi5NKSQULPiAGlelNWBVRWCioJYYIv0NOl6wBgd4huPH_srqv8H29xT58 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICSPIS51611.2020.9349589 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Statistics |
| EISBN | 9781728186290 1728186293 |
| EndPage | 5 |
| ExternalDocumentID | 9349589 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i203t-b511d93390c75c54efc3e2a57ec9f6e24637f0d7eb20ce99bc684e8f751700253 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000675416100055&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Thu Jun 29 18:38:37 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i203t-b511d93390c75c54efc3e2a57ec9f6e24637f0d7eb20ce99bc684e8f751700253 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_9349589 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-Dec.-23 |
| PublicationDateYYYYMMDD | 2020-12-23 |
| PublicationDate_xml | – month: 12 year: 2020 text: 2020-Dec.-23 day: 23 |
| PublicationDecade | 2020 |
| PublicationTitle | 2020 6th Iranian Conference on Signal Processing and Intelligent Systems (ICSPIS) |
| PublicationTitleAbbrev | ICSPIS |
| PublicationYear | 2020 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.7849133 |
| Snippet | The Multidimensional knapsack problem (MKP) is a well-known optimization problem with which many real-world engineering problems can be modeled. Due to its... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Benchmark testing Butterfly Optimization Algorithm Generators Multidimensional Knapsack Optimization Signal processing algorithms Sociology Statistics Transfer functions |
| Title | A Binary Butterfly Optimization Algorithm for the Multidimensional Knapsack Problem |
| URI | https://ieeexplore.ieee.org/document/9349589 |
| WOSCitedRecordID | wos000675416100055&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMcf2_Cwkz828Tc5eLRbTZomOc7hcAizMIXdRpq-qLh1Y26C_71JWyeCF2-lFAIvlHxe-77fL8ClY3CjDWOBTIUOIs1tkBqNgdLUppIZKSNbhE2I0UhOJiqpwdVWC4OIxfAZdvxl8S8_W5iN_1TWVczhvFR1qAsRl1qt7-GcUHWH_XEyHHOHML7vo2GnevxXbkpxbAx2_7fgHrR_9Hck2Z4s-1DD_ACangtLW-UWjHvkplDSkippevZJHtzbP69klaQ3e164vv9lThyVEkd5pJDaZt7MvzTiIPe5Xr5r8-aX8qEybXga3D7274IqHyF4pSFbB6mDpUwxpkIjuOERWsOQai7QKBsjjWImbJgJ1zyHBpVKTSwjlFZwb8pHOTuERr7I8QiI9yHTjuwoelGCsul1qCV38MTiOM2EOYaWr850WVpgTKvCnPx9-xSafgP81AdlZ9BYrzZ4Djvmw1VpdVHs2xfrdpwm |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3dT8IwFMVvEE3kyQ8wftsHHy3Mdl3bRyQSCIgkYMIb6bpWjTAIgon_ve2YGBNffFuWLE1us_R3t3vOAbh2DK6VphSLmCscKmZxrJXBUhEbC6qFCG0WNsF7PTEayX4BbjZaGGNMNnxmqv4y-5efzPTKfyqrSepwXsgt2PbJWbla63s8J5C1dmPQbw-Ygxjf-ZGgmj_wKzklOziae_9bch8qPwo81N-cLQdQMOkhlDwZro2VyzCoo7tMS4vyrOnJJ3p07_80F1ai-uR55jr_lylyXIoc56FMbJt4O_-1FQfqpGr-rvSbX8rHylTgqXk_bLRwnpCAX0lAlzh2uJRISmWgOdMsNFZTQxTjRksbGRJGlNsg4a59DrSRMtaRCI2wnHlbPsLoERTTWWqOAXknMuXYjhgvS5A2vg2UYA6faBTFCdcnUPbVGc_XJhjjvDCnf9--gt3W8KE77rZ7nTMo-c3wMyCEnkNxuViZC9jRH65ii8tsD78APSafbw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2020+6th+Iranian+Conference+on+Signal+Processing+and+Intelligent+Systems+%28ICSPIS%29&rft.atitle=A+Binary+Butterfly+Optimization+Algorithm+for+the+Multidimensional+Knapsack+Problem&rft.au=Shahbandegan%2C+Amirmohammad&rft.au=Naderi%2C+Madjid&rft.date=2020-12-23&rft.pub=IEEE&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FICSPIS51611.2020.9349589&rft.externalDocID=9349589 |