Comprehensive Analysis of Recent Studies on Using Genetic Algorithms for Optimizing Solutions to the 0/1 Knapsack Problem

Abstract

Translate Article

This study presents a comprehensive analysis of recent studies that explore the application of genetic algorithms (GAs) for optimizing solutions to the 0/1 Knapsack Problem (KP). The 0/1 Knapsack Problem, a classic combinatorial optimization challenge, involves selecting a subset of items with given weights and values to maximize the total value without exceeding a specified weight limit. Genetic algorithms, inspired by the principles of natural selection and genetics, have emerged as a powerful heuristic for tackling this NP-hard problem. Our review synthesizes findings from contemporary research, highlighting the effectiveness of various GA approaches, including standard GAs, hybrid models, and enhanced techniques incorporating local search and other optimization strategies. We evaluate the performance metrics, computational efficiency, and solution quality achieved by these methods. Additionally, we discuss the strengths and limitations of GAs in addressing the 0/1 Knapsack Problem, providing insights into their practical applications and potential improvements. The paper concludes with recommendations for future research directions, aiming to advance the state-of-the-art in genetic algorithm-based optimization for the 0/1 Knapsack Problem.