返回
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem
DOI:10.1007/s00500-022-07285-4.png)
摘要
En 中文
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.
Keyword:
Giza Pyramids Construction metaheuristic algorithm
GPC algorithm
Combinational optimization problem
Knapsack problem
Binary GPC algorithm
Penalty function
Ancient-inspired metaheuristics
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Neural Knapsack: A Neural Network Based Solver for the Knapsack Problem神经背包: 基于神经网络的背包问题求解器
IEEE ACCESS
IF3.6
Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm
APPLIED INTELLIGENCE
IF3.5
Changes in gene expression in the permissive larval host lightbrown apple moth (Epiphyas postvittana, Tortricidae) in response to EppoNPV (Baculoviridae) infection在易感幼虫宿主淡褐苹果蛀蛾 (Epiphyas postvittana, Tortricidae) 中,对EppoNPV (Baculoviridae) 感染的基因表达变化
An optimized evacuation model with compatibility constraints in the context of disability: an ancient-inspired Giza Pyramids Construction metaheuristic approach
APPLIED INTELLIGENCE
IF3.5
An immune-based response particle swarm optimizer for knapsack problems in dynamic environments
SOFT COMPUTING
IF2.5

