Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/164756
Title: Diversified sine–cosine algorithm based on differential evolution for multidimensional knapsack problem
Authors: Gupta, Shubham
Su, Rong
Singh, Shitu
Keywords: Science::Mathematics::Applied mathematics::Optimization
Issue Date: 2022
Source: Gupta, S., Su, R. & Singh, S. (2022). Diversified sine–cosine algorithm based on differential evolution for multidimensional knapsack problem. Applied Soft Computing, 130, 109682-. https://dx.doi.org/10.1016/j.asoc.2022.109682
Project: A19D6a0053 
Journal: Applied Soft Computing 
Abstract: The sine–cosine algorithm (SCA) is one of the simplest and efficient stochastic search algorithms in the field of metaheuristics. It has shown its efficacy in solving several real-life applications. However, in some cases, it shows stagnation at local optima and premature convergence issues due to low exploitation ability and insufficient diversity skills. To overcome these issues from the SCA, its enhanced version named ISCA is developed in this paper. The proposed ISCA is designed based on modifying the original search mechanism of the SCA and hybridizing it with a differential evolution (DE) algorithm. The search procedure in the ISCA switches between the modified search mechanism of the SCA and DE based on the evolutionary states of candidate solutions and a parameter called the switch parameter. The modified SCA enhances the exploitation ability and convergence speed, while the DE maintains the diversity of the population to avoid local optimal solutions. The parameters of the ISCA are tuned in such as way that they could balance the exploration and exploitation features. Validation of the ISCA is conducted on a benchmark set of 23 continuous optimization problems through different performance measures, which reveals its effectiveness as a better optimizer for continuous optimization problems. Furthermore, the proposed ISCA is extended to develop its efficient binary version named BISCA for solving multidimensional knapsack problems. A benchmark collection of 49 instances is used for the performance evaluation of the BISCA. Comparison of results produced by the BISCA with other algorithms and previous studies indicates its better search efficiency and verifies it as an effective alternative for solving the MKP.
URI: https://hdl.handle.net/10356/164756
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2022.109682
Schools: School of Electrical and Electronic Engineering 
Rights: © 2022 Elsevier B.V. All rights reserved. This paper was published in Applied Soft Computing and is made available with permission of Elsevier B.V.
Fulltext Permission: embargo_20241207
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

Files in This Item:
File Description SizeFormat 
SCA_MKP.pdf
  Until 2024-12-07
1.94 MBAdobe PDFUnder embargo until Dec 07, 2024

SCOPUSTM   
Citations 20

9
Updated on Jun 4, 2024

Web of ScienceTM
Citations 50

4
Updated on Oct 24, 2023

Page view(s)

126
Updated on Jun 11, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.