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

INVESTIGATION ON THE PYROLYSISKINETICS AND MECHANISM OF DATE STONE USING THERMOGRAVIMETRIC ANALYSIS

The aim of this work was to investigate the physiochemical properties and thermal behavior of date stone in order to find an appropriate of these materials for energy production. The physiochemical properties such as pro...

Revolutionizing Computational Efficiency: A Comprehensive Analysis of Virtual Machine Optimization Strategies

This study undertakes a systematic exploration of contemporary virtual machine optimization strategies, aiming to unravel the intricate dynamics that shape computational efficiency in virtualized environments. The resear...

Python source code Analysis for Bug Detection using Transformers

Effective bug detection is pivotal in software development, with the identification and localization of defects being crucial for robust applications. In Python-based programs, the conventional bug detection process reli...

The Future of Solar Investments in MOROCCO

The future of solar investments in Morocco looks bright, thanks to the country's significant solar capacity and favorable geographic conditions. This study offers a thorough examination of the potential for solar energy...

CNN-Based Classification of Infectious Lung Diseases using Thorax X-Ray Analysis

Lung diseases are common throughout the world, including chronic obstructive pulmonary disease, asthma, tuberculosis, fibrosis and pneumonia. The risk of death for people with lung disease is 18.7%, meaning that this typ...

Download PDF file
  • EP ID EP740342
  • DOI 10.47191/etj/v9i07.10
  • Views 26
  • 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