Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika

  • I Wayan Supriana Jurusan Ilmu Komputer, Fakultas MIPA, Universitas Udayana, Bali


Knapsack problems is a problem that often we encounter in everyday life. Knapsack problem itself is a problem where a person faced with the problems of optimization on the selection of objects that can be inserted into the container which has limited space or capacity. Problems knapsack problem can be solved by various optimization algorithms, one of which uses a genetic algorithm. Genetic algorithms in solving problems mimicking the theory of evolution of living creatures. The components of the genetic algorithm is composed of a population consisting of a collection of individuals who are candidates for the solution of problems knapsack. The process of evolution goes dimulasi of the selection process, crossovers and mutations in each individual in order to obtain a new population. The evolutionary process will be repeated until it meets the criteria o f an optimum of the resulting solution. The problems highlighted in this research is how to resolve the problem by applying a genetic algorithm knapsack. The results obtained by the testing of the system is built, that the knapsack problem can optimize the placement of goods in containers or capacity available. Optimizing the knapsack problem can be maximized with the appropriate input parameters.


Download data is not yet available.


[1] K. Setemen, “Implementasi Algoritma Genetika Pada Knapsack Problem Untuk Optimasi Pemilihan Buah Kemasan Kotak,” Seminar Nasional Aplikasi Teknologi Informasi, 2010, pp. 21–25.
[2] K. D. KW, M. Fadhli, and C. Sutanto, “Penyelesaian Knapsack Problem Menggunakan Algoritma Genetika,” Seminar Nasional Informatika, 2010, pp. 28–33.
[3] Suyanto, Evolutionary Computation: Komputasi Berbasis Evolusi dan Genetika. Bandung: Informatika, 2008.
[4] M. Hristakeva and D. Shrestha, “Solving the 0-1 knapsack problem with genetic algorithms,” Proceedings of the 37 Midwest Instruction and Computing Symposium, 2004, Morris, MN.
[5] S. Kusumadewi, Artificial Intelligence (Teknik dan Aplikasinya). Yogyakarta: Graha Ilmu, 2003.
How to Cite
SUPRIANA, I Wayan. Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika. Lontar Komputer : Jurnal Ilmiah Teknologi Informasi, [S.l.], p. 182-192, dec. 2016. ISSN 2541-5832. Available at: <https://ojs.unud.ac.id/index.php/lontar/article/view/25460>. Date accessed: 25 sep. 2021. doi: https://doi.org/10.24843/LKJITI.2016.v07.i03.p06.


Knapsack Problem; Algoritma Genetika; Optimalisasi; Populasi