PENERAPAN ALGORITMA DYNAMIC PROGRAMMING PADA PERMASALAHAN KNAPSACK 0-1 (Proseding)
| Main Authors: | Irmeilyana, Irmeilyana, Bangun, Putra Bahtera Jaya, Pratamawati, Dian, Septiani, Winda Herfia |
|---|---|
| Format: | Proceeding PeerReviewed Book |
| Bahasa: | eng |
| Subjects: | |
| Online Access: |
http://repository.unsri.ac.id/22757/1/16.Penerapan%20algoritma%20dynamic%20programming%20-2017.pdf http://repository.unsri.ac.id/22757/ http://semirata2017.mipa.unja.ac.id/wp-content/uploads/2017/11/Prosiding-MTK_Updated.pdf |
Daftar Isi:
- Knapsack problem is a optimization problem in the process of selection of goods loaded in container with maximum capacity restrictions that can be accommodated in a knapsack. The selected goods may not exceed the capacity of the knapsack, but they can maximize the total profit. In this research, the knapsack problem is solved by Dynamic Programming algorithm with forward recursive and backward recursive calculations. The algorithm is applied to the transport of agricultural goods by using a truck at UD. Subur Tani haul trucks with a maximum capacity of 6,000 kg. Optimal gains obtained by Dynamic Programming algorithm with forward recursive calculation is Rp 118,096,500 with a total by weight of goods transported is 5,981 kg. It is 99.683% of truck capacity. While the optimal profit gained by using Dynamic Programming algorithm with backward recursive equation is Rp 86,246,500 with a total weight of goods transported is 5,881 kg. It is 98.017% of truck capacity.