We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem.
- Authors
Harifi, Sasan
- Abstract
The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms.
- Subjects
KNAPSACK problems; METAHEURISTIC algorithms; PYRAMIDS; SOFT computing; HEURISTIC algorithms; NP-hard problems; STATISTICS; ALGORITHMS
- Publication
Soft Computing - A Fusion of Foundations, Methodologies & Applications, 2022, Vol 26, Issue 22, p12761
- ISSN
1432-7643
- Publication type
Article
- DOI
10.1007/s00500-022-07285-4