Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Udayana University, Institute for Research and Community Services
2016-12-01
|
| Series: | Lontar Komputer |
| Subjects: | |
| Online Access: | https://ojs.unud.ac.id/index.php/lontar/article/view/25460 |
| _version_ | 1811248202948542464 |
|---|---|
| author | I Wayan Supriana |
| author_facet | I Wayan Supriana |
| author_sort | I Wayan Supriana |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-12T15:22:52Z |
| format | Article |
| id | doaj.art-770d77ab6b1d4501bec9a2b7c53c664d |
| institution | Directory Open Access Journal |
| issn | 2088-1541 2541-5832 |
| language | English |
| last_indexed | 2024-04-12T15:22:52Z |
| publishDate | 2016-12-01 |
| publisher | Udayana University, Institute for Research and Community Services |
| record_format | Article |
| series | Lontar Komputer |
| spelling | doaj.art-770d77ab6b1d4501bec9a2b7c53c664d2022-12-22T03:27:22ZengUdayana University, Institute for Research and Community ServicesLontar Komputer2088-15412541-58322016-12-0118219210.24843/LKJITI.2016.v07.i03.p0625460Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma GenetikaI Wayan Supriana0Jurusan Ilmu Komputer, Fakultas MIPA, Universitas Udayana, BaliKnapsack 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.https://ojs.unud.ac.id/index.php/lontar/article/view/25460Knapsack ProblemAlgoritma GenetikaOptimalisasiPopulasi |
| spellingShingle | I Wayan Supriana Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika Lontar Komputer Knapsack Problem Algoritma Genetika Optimalisasi Populasi |
| title | Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika |
| title_full | Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika |
| title_fullStr | Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika |
| title_full_unstemmed | Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika |
| title_short | Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika |
| title_sort | optimalisasi penyelesaian knapsack problem dengan algoritma genetika |
| topic | Knapsack Problem Algoritma Genetika Optimalisasi Populasi |
| url | https://ojs.unud.ac.id/index.php/lontar/article/view/25460 |
| work_keys_str_mv | AT iwayansupriana optimalisasipenyelesaianknapsackproblemdenganalgoritmagenetika |