JayaX: Jaya algorithm with xor operator for binary optimization
Jaya is a population-based heuristic optimization algorithm proposed for solving constrained
and unconstrained optimization problems. The peculiar distinct feature of Jaya from the …
and unconstrained optimization problems. The peculiar distinct feature of Jaya from the …
Novel binary differential evolution algorithm for knapsack problems
The capability of the conventional differential evolution algorithm to solve optimization
problems in continuous spaces has been well demonstrated and documented in the …
problems in continuous spaces has been well demonstrated and documented in the …
Cuckoo search algorithm: A review of recent variants and engineering applications
Metaheuristic algorithms, in the field of engineering, have attracted researchers for problem-
solving of complex and non-linear optimization. Many algorithms have been designed to …
solving of complex and non-linear optimization. Many algorithms have been designed to …
[PDF][PDF] Island-based cuckoo search with highly disruptive polynomial mutation
BH Abed-alguni - International Journal of Artificial Intelligence, 2019 - researchgate.net
The island model is one of the most well-known structured population strategies used to
control the diversity in evolutionary algorithms. The population of an islandbased …
control the diversity in evolutionary algorithms. The population of an islandbased …
New binary bat algorithm for solving 0–1 knapsack problem
RM Rizk-Allah, AE Hassanien - Complex & Intelligent Systems, 2018 - Springer
This paper presents a novel binary bat algorithm (NBBA) to solve 0–1 knapsack problems.
The proposed algorithm combines two important phases: binary bat algorithm (BBA) and …
The proposed algorithm combines two important phases: binary bat algorithm (BBA) and …
Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance
MA Medvedeva, VN Katsikis… - … Methods in the …, 2021 - Wiley Online Library
The knapsack problem is a problem in combinatorial optimization, and in many such
problems, exhaustive search is not tractable. In this paper, we describe and analyze the …
problems, exhaustive search is not tractable. In this paper, we describe and analyze the …
[HTML][HTML] Intelligent hybrid cuckoo search and β-hill climbing algorithm
One of the major problems that is usually associated with any optimization algorithm
including the Cuckoo Search (CS) algorithm is the premature convergence to suboptimal …
including the Cuckoo Search (CS) algorithm is the premature convergence to suboptimal …
A modified artificial bee colony approach for the 0-1 knapsack problem
J Cao, B Yin, X Lu, Y Kang, X Chen - Applied Intelligence, 2018 - Springer
Abstract The 0-1 knapsack problem (KP01) is one of the classical NP-hard problems in
operation research and has a number of engineering applications. In this paper, the BABC …
operation research and has a number of engineering applications. In this paper, the BABC …
A hybrid cuckoo search and simulated annealing algorithm
Simulated annealing (SA) proved its success as a single-state optimization search algorithm
for both discrete and continuous problems. On the contrary, cuckoo search (CS) is one of the …
for both discrete and continuous problems. On the contrary, cuckoo search (CS) is one of the …
[PDF][PDF] Binary particle swarm optimization algorithm based on z-shaped probability transfer function to solve 0-1 knapsack problem
WZ Sun, M Zhang, JS Wang, SS Guo, M Wang… - IAENG Int. J. Comput …, 2021 - iaeng.org
Binary particle swarm optimization (BPSO) algorithm can map the original continuous
searching space to the binary searching space by introducing a new velocity transfer …
searching space to the binary searching space by introducing a new velocity transfer …