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 …

As a new attempt to effectively tackle the high-dimensional 0–1 knapsack (01KP) instances
with uncorrelated, weakly-correlated, and strongly-correlated characteristics, in this paper …

The 0–1 Knapsack problem is a non-deterministic polynomial-time-hard combinatorial
optimization problem that cannot be solved in reasonable time using traditional methods …

Nowadays, recycling end-of-life (EoL) products has emerged as a vital approach to address
resource scarcity. Within the recycling process, disassembly plays a pivotal role and has …

The knapsack problem is an NP-hard combinatorial optimization problem for which it is
difficult to find a polynomial-time solution. Many researchers have used metaheuristic …

An uncertain graph (also known as probabilistic graph) is a generic model to represent
many real-world networks from social to biological. In recent times, analysis and mining of …

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 …

Many optimization algorithms have been applied to solve high‐dimensional instances of the
0‐1 knapsack problem. However, these algorithms often fall into a local optimization trap …

For subway regenerative energy optimization, the essential idea is to maximize the amount
of regenerative energy absorption (AREA) between accelerating trains and braking trains by …

Ransomware is a serious security concern to mobile devices, as it prevents the use of the
device and its contents until a ransom is paid, resulting in considerable financial losses for …