This paper proposes a novel global harmony search algorithm (NGHS) to solve 0–1
knapsack problems. The proposed algorithm includes two important operations: position …

The Knapsack Problems (KPs) are classical NP-hard problems in Operations Research
having a number of engineering applications. Several traditional as well as population …

The 0–1 knapsack problem (KP01) is a well-known combinatorial optimization problem. It is
an NP-hard problem which plays important roles in computing theory and in many real life …

The 0-1 knapsack problem is a classic combinational optimization problem. However, many
exiting algorithms have low precision and easily fall into local optimal solutions to solve the …

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 …

This paper proposes a modified discrete shuffled frog leaping algorithm (MDSFL) to solve 01
knapsack problems. The proposed algorithm includes two important operations: the local …

This article proposes a novel binary version of recently developed Gaining Sharing
knowledge-based optimization algorithm (GSK) to solve binary optimization problems. GSK …

NP-hard problems exist in many real world applications. Ant colony optimization (ACO)
algorithms can provide approximate solutions for those NP-hard problems, but the …

The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays
an important role in real applications. In this paper, a new bio-inspired model is proposed to …

Whale optimization algorithm (WOA) is a recently proposed meta-heuristic algorithm which
imitates the hunting behavior of humpback whales. Due to its characteristic advantages, it …