0-1 Knapsack Problem Solving using Genetic Optimization Algorithm

Journal Title: Engineering and Technology Journal - Year 2024, Vol 9, Issue 07

Abstract

A 0-1 knapsack problem with m constraints is known as the 0-1 multidimensional knapsack problem, and it is challenging to solve using standard techniques like branch and bound algorithms or dynamic programming. The goal of the Knapsack problem is to maximize the utility of the items in a knapsack while staying within its carrying capacity. This paper presents a genetic algorithm with Python code that can solve publicly available instances of the multidimensional knapsack problem in a very quick computational time. By identifying the significant genes, the attribute reduction method that uses the rough set theory reduces the search space and guarantees that useful information is not lost. To regulate convergence, the algorithm makes use of many additional hyperparameters that can be adjusted in the code.

Authors and Affiliations

Mubarak Altamimi , Nehad Ramaha ,

Keywords

Related Articles

LETTERS EXTRACTION IN SIGN BOARD USING VARIOUS OPTIMIZATION TECHNIQUES

Accurate localization of randomly deployed sensor nodes is critically important in wireless sensor networks (WSNs) deployed for monitoring and tracking applications. The localization challenge has been posed as a multidi...

Multivariate Statistical Interpretation of Airborne Diseases using Principal Components Analysis

Accurate and timely determination of relationships among communicable diseases is crucial in taking precautionary measures to control and prevent the transmission of infectious diseases. This will inform the government t...

AI-Driven Student Support in GCC Higher Education

Higher education institutions continue to incorporate Artificial Intelligence (AI) into their different sectors of operation. The implementation of AI in academic advising helps universities worldwide, including institut...

DESIGN & SIMULATION OF CIRCULAR RECTANGULAR MICROSTRIP PATCH ANTENNA FOR WIRELESS APPLICATIONS

Over the past one decade, there is a rapid growth in development of wireless communication applications. The performance of all such wireless systems depends on the design of the antenna. Microstrip antennas are preferre...

RAINFALL AND RUNOFF RELATIONSHIP FOR DETERMINATION OF WATER ABSTRACTION POTENTIAL OF RIVER OSUN, SOUTHWESTERN, NIGERIA

The hydrological regime is characterized by high variability of rainfall and runoff distribution. The hydrologist finds it difficult to make accurate prediction of water abstraction by various dams. Inspite that Osun is...

Download PDF file
  • EP ID EP740342
  • DOI 10.47191/etj/v9i07.10
  • Views 61
  • Downloads 1

How To Cite

Mubarak Altamimi, Nehad Ramaha, (2024). 0-1 Knapsack Problem Solving using Genetic Optimization Algorithm. Engineering and Technology Journal, 9(07), -. https://europub.co.uk/articles/-A-740342