Application Of The Greedy Algorithm In Multiple Constrain Knapsack Optimization Problems In Goods Transportation

Main Article Content

Gradina Nur Fauziah
Politeknik Kelautan Makassar, Indonesia

Maximization and minimization problems are common problems occurred in commercial activities. One of the methods to solve the problem is by using optimization. The use of optimization has proven to be beneficial in improve productivity performance. Transportation is one of the areas that are related to optimization. Problems related to obtaining maximum profits in transporting goods with the use of limited transport capacity is remain as major problems. This problem is often analogous to using the Knapsack Problem theory. Greedy algorithm applied to Knapsack Multiple Constrain calculations provides better results than manual calculations.


Keywords: Greedy, Optimisasi, Algoritma, Knapsack Proble, Multiple Constrain Knapsack Problem
Similar Articles

You may also start an advanced similarity search for this article.