Ebola optimization search algorithm: A new nature-inspired metaheuristic optimization algorithm
Nature computing has evolved with exciting performance to solve complex real-world
combinatorial optimization problems. These problems span across engineering, medical …
combinatorial optimization problems. These problems span across engineering, medical …
Learning combinatorial optimization on graphs: A survey with applications to networking
Existing approaches to solving combinatorial optimization problems on graphs suffer from
the need to engineer each problem algorithmically, with practical problems recurring in …
the need to engineer each problem algorithmically, with practical problems recurring in …
Dynamic group-based cooperative optimization algorithm
Several optimization problems from various types of applications have been efficiently
resolved using available meta-heuristic algorithms such as Particle Swarm Optimization and …
resolved using available meta-heuristic algorithms such as Particle Swarm Optimization and …
Binary aquila optimizer for 0–1 knapsack problems
E Baş - Engineering Applications of Artificial Intelligence, 2023 - Elsevier
The optimization process entails determining the best values for various system
characteristics in order to finish the system design at the lowest possible cost. In general …
characteristics in order to finish the system design at the lowest possible cost. In general …
New binary marine predators optimization algorithms for 0–1 knapsack problems
Recently, a novel meta-heuristic algorithm known as the marine predators algorithm (MPA)
has been proposed for solving continuous optimization problems. Despite the significant …
has been proposed for solving continuous optimization problems. Despite the significant …
A binary equilibrium optimization algorithm for 0–1 knapsack problems
In this paper, a binary version of equilibrium optimization (BEO) is proposed for the tackling
0–1 knapsack problem characterized as a discrete problem. Because the standard …
0–1 knapsack problem characterized as a discrete problem. Because the standard …
A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0–1 knapsack problems
Abstract The Reptile Search Algorithm (RSA), inspired by crocodiles' hunting behavior, is a
recently introduced nature-inspired algorithm. Although the original version of the RSA …
recently introduced nature-inspired algorithm. Although the original version of the RSA …
Joint computation offloading and multi-dimensional resource allocation in air-ground integrated vehicular edge computing network
The integration of vehicle edge computing (VEC) and air-ground integrated network is
considered as a key technology to achieve autonomous driving. It exploits the ubiquitous …
considered as a key technology to achieve autonomous driving. It exploits the ubiquitous …
An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem
The slime mould algorithm (SMA) has recently been introduced to solve continuous
engineering problems, which has been employed to solve a wide range of various problems …
engineering problems, which has been employed to solve a wide range of various problems …
[HTML][HTML] Binary light spectrum optimizer for knapsack problems: an improved model
M Abdel-Basset, R Mohamed, M Abouhawwash… - Alexandria Engineering …, 2023 - Elsevier
This paper presents a binary variant of a novel physics-based meta-heuristic optimization
algorithm, namely Light spectrum optimizer (LSO), for tackling both the 0–1 knapsack (KP01) …
algorithm, namely Light spectrum optimizer (LSO), for tackling both the 0–1 knapsack (KP01) …