Rancangan dan Analisis Model Algoritma Genetika Untuk Menyelesaikan Permasalahan Knapsack 2 Dimensi

  • Devan Bramantya Universitas Udayana
  • 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.

Downloads

Download data is not yet available.
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: 29 mar. 2024. doi: https://doi.org/10.24843/JLK.2022.v11.i02.p18.

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>