2022
DOI: 10.1007/s00500-022-07285-4
|View full text |Cite
|
Sign up to set email alerts
|

A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 41 publications
0
1
0
Order By: Relevance
“…Ali et al proposed a new binary technique that makes a simple differential evolution algorithm adequate for solving binary optimization issues (Ali, Essam and Kasmarik, 2021). The Giza Pyramids Construction (GPC) algorithm was proposed with accumulative and multiplicative penalty functions to determine infeasible solutions in the binary version of GPC (Harifi, 2022). On the other hand binary version of Slime Mould Algorithm (SMA) was presented to convert a continuous variable to a binary by employing eight different transfer functions (Abdollahzadeh et al, 2021).…”
Section: Introductionmentioning
confidence: 99%
“…Ali et al proposed a new binary technique that makes a simple differential evolution algorithm adequate for solving binary optimization issues (Ali, Essam and Kasmarik, 2021). The Giza Pyramids Construction (GPC) algorithm was proposed with accumulative and multiplicative penalty functions to determine infeasible solutions in the binary version of GPC (Harifi, 2022). On the other hand binary version of Slime Mould Algorithm (SMA) was presented to convert a continuous variable to a binary by employing eight different transfer functions (Abdollahzadeh et al, 2021).…”
Section: Introductionmentioning
confidence: 99%