Show simple item record

dc.contributor.authorAbdel-Basset, Mohamed
dc.contributor.authorEl-Shahat, Doaa
dc.contributor.authorFaris, Hossam
dc.contributor.authorMirjalili, Seyedali
dc.date.accessioned2019-09-02T03:08:49Z
dc.date.available2019-09-02T03:08:49Z
dc.date.issued2019
dc.identifier.issn0360-8352
dc.identifier.doi10.1016/j.cie.2019.04.025
dc.identifier.urihttp://hdl.handle.net/10072/386843
dc.description.abstractThis work proposes a new Modified Multi-Verse Optimization (MMVO) algorithm for solving the 0-1 knapsack (0-1 KP) and multidimensional knapsack problems (MKP). MMVO incorporates a two-step repair strategy for handling constraints. In addition, a barrier function is employed for assigning negative values to the infeasible solutions so that their fitness cannot outperform the fitness of the feasible ones. MMVO avoids local optima by re-initializing the population every predetermined number of iterations while keeping the best solution obtained so far. For discretizing the solutions, MMVO employs a V-shaped transfer function (tanh). The research applies the proposed method to several knapsack case studies and demonstrates its application in resource allocation of Adaptive Multimedia Systems (AMS). The results show the benefits of the MMVO algorithm in solving binary test and real-world problems.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherElsevier
dc.relation.ispartofpagefrom187
dc.relation.ispartofpageto206
dc.relation.ispartofjournalComputers & Industrial Engineering
dc.relation.ispartofvolume132
dc.subject.fieldofresearchMathematical Sciences
dc.subject.fieldofresearchInformation and Computing Sciences
dc.subject.fieldofresearchEngineering
dc.subject.fieldofresearchcode01
dc.subject.fieldofresearchcode08
dc.subject.fieldofresearchcode09
dc.subject.keywordsScience & Technology
dc.subject.keywordsTechnology
dc.subject.keywordsComputer Science, Interdisciplinary Applications
dc.subject.keywordsEngineering, Industrial
dc.subject.keywordsComputer Science
dc.titleA binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems
dc.typeJournal article
dc.type.descriptionC1 - Articles
dcterms.bibliographicCitationAbdel-Basset, M; El-Shahat, D; Faris, H; Mirjalili, S, A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems, Computers & Industrial Engineering, 2019, 132, pp. 187-206
dcterms.licensehttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.date.updated2019-09-02T02:57:43Z
dc.description.versionAccepted Manuscript (AM)
gro.rights.copyright© 2019 Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International Licence, which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited.
gro.hasfulltextFull Text
gro.griffith.authorMirjalili, Seyedali


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record