Authors:

Devan Bramantya, I Gede Santi Astawa, I Wayan Supriana, Luh Gede Astuti, Ngurah Agus Sanjaya ER, I Gusti Agung Gede Arya Kadyanan

Abstract:

“The knapsack problem is problem that is still often found in everyday life, one of which is the problem of selecting goods to be transported into containers for delivery of goods. This knapsack problem can be solved by using various optimization algorithms, one of which is the genetic algorithm. This study aims to design a genetic algorithm model to solve the 2-dimensional knapsack problem. 2-dimensional knapsack problem is a knapsack problem that has 2 constraints and in this study, the constraints used were weight and volume.. The evaluation results of the genetic algorithm will be compared with dynamic programming. From the evaluation results that have been carried out, it can be concluded that genetic algorithms can produce near-optimal results with faster computational times than dynamic programming.”

Keywords

Keyword Not Available

Downloads:

Download data is not yet available.

References

References Not Available

PDF:

https://jurnal.harianregional.com/jlk/full-89116

Published

2022-07-16

How To Cite

BRAMANTYA, Devan et al. Rancangan dan Analisis Model Algoritma Genetika Untuk Menyelesaikan Permasalahan Knapsack 2 Dimensi.JELIKU (Jurnal Elektronik Ilmu Komputer Udayana), [S.l.], v. 11, n. 2, p. 395-404, july 2022. ISSN 2654-5101. Available at: https://ojs.unud.ac.id/index.php/JLK/article/view/89116. Date accessed: 28 Aug. 2025. doi:https://doi.org/10.24843/JLK.2022.v11.i02.p18.

Citation Format

ABNT, APA, BibTeX, CBE, EndNote - EndNote format (Macintosh & Windows), MLA, ProCite - RIS format (Macintosh & Windows), RefWorks, Reference Manager - RIS format (Windows only), Turabian

Issue

Vol 11 No 2 (2022): JELIKU Volume 11 No 2, November 2022

Section

Articles

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License