Algoritma Genetika Untuk Menyelesaikan Coin Problem: Aplikasi Pada Mesin Atm

Elliana Gautama
Journal article Jurnal Sistem Informasi Universitas Sriwijaya • Oktober 2016 Indonesia

Unduh teks lengkap
(Bahasa Indonesia, 13 pages)


At the present in Indonesia an Automatic Teller Machine (ATM) only able to withdraw specific denomination, such as Rp. 50.000 or Rp. 100.000. Sometimes, client wants to withdraw specific denomination but the ATM only provides Rp. 100.000 or other denomination, then the client have to switch to other ATM and sometime they have to walk so far to withdraw specific denomination in ATM as they wants. The main obstacle at present is the absence of an algorithm application of ATM that can cope problem to solve value of money to combination of denomination of money as client wants. This problem was called Coin Change Problem and it is usually used to find optimal combination from many different money combinations. This paper will use the theory of Genetic Algorithms to solve the Coin Change Problem. Genetic algorithm is computational algorithm was inspired by evolution theory then was adopted from it self and it was become computational algorithm to find solution from problem in nature's way. One of application genetic algorithm is the combination of optimization problems, which get a value of an optimal solution to a problem that has many possible solutions. With this Genetic Algorithm in this paper is the resolve to the Coin Change Problem on application of ATM, so that an ATM can issued a optimal combination from many different money combinations. In this study developed an algorithm using Genetic Algorithm which can solve the problems of Coin Problem in ATM applications, resulting in an ATM can issue some money with a optimum combination specific denomination.


  • 388 kali dilihat
  • 460 kali diunduh


Jurnal Sistem Informasi Universitas Sriwijaya

Jurnal Sistem Informasi Universitas Sriwijaya diterbitkan oleh Fakultas Ilmu Komputer di Universi... tampilkan semua