Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation

Abstract

At this time the delivery of goods to be familiar because the use of delivery of goods services greatly facilitate customers. PT Post Indonesia is one of the delivery of goods. On the delivery of goods, we often encounter the selection of goods which entered first into the transportation and held from the delivery. At the time of the selection, there are Knapsack problems that require optimal selection of solutions. Knapsack is a place used as a means of storing or inserting an object. The purpose of this research is to know how to get optimal solution result in solving Integer Knapsack problem on freight transportation by using Dynamic Programming Algorithm and Greedy Algorithm at PT Post Indonesia Semarang. This also knowing the results of the implementation of Greedy Algorithm with Dynamic Programming Algorithm on Integer Knapsack problems on the selection of goods transport in PT Post Indonesia Semarang by applying on the mobile application. The results of this research are made from the results obtained by the Dynamic Programming Algorithm with total weight 5022 kg in 7 days. While the calculation result obtained by Greedy Algorithm, that is total weight of delivery equal to 4496 kg in 7 days. It can be concluded that the calculation results obtained by Dynamic Programming Algorithm in 7 days has a total weight of 526 kg is greater when compared with Greedy Algorithm.

Dynamic Programming Analysis for Measuring the Optimization of the Manpower per Shift PT. XYZ

“…The amount of labor required according to the analysis of the Dynamic Programming method with forward recursive and backward recursive calculations is the same, namely: 1) Morning shift = 105 people 2) Day shift = 104 people 3) Night shift = 104 people The number of workers generated through the calculation of the Dynamic Programming method is the allocation of labor that is estimated to be maximum and optimal who can work every day. If this calculation is applied to the production process, it will provide benefits for the company, where the labor can be allocated to each shift precisely according to the number of lens orders available [30,31]. Labor that can be used or worked every day at PT.…”

Constrained portfolio optimization with discrete variables: An algorithmic method based on dynamic programming

“…Thus, greedy algorithms can provide a hypothesis that seems optimal at the time but does not guarantee a global optimization in the future. However, dynamic programming finds the optimal solution for the sub-problems and makes an informed choice to find the most optimal solution by combining the results of these sub-problems [ 32 ].…”

Implementation of Knapsack Problem - Fuzzy Inference System Tsukamoto in the Admission of New Students Based on Zone System

“…In the admission of this year, there are 575 applicants who register via zone system and 218 applicants will be selected as candidate of new students of SMAN 12 Semarang. In order to solve the problem, dynamic programming is chosen since according to [5], dynamic programming algorithm has better performance in terms of the optimal solution than Greedy algorithm. Dynamic Programming is a mathematical technique used to optimize the decision-making process in phases.…”

“…In order to compute the value of 𝑧𝑧 𝑡𝑡 , consider the domain range of final score. Since the minimum and the maximum value of final score's domain range are 0 and 100 respectively, 𝑧𝑧 𝑡𝑡 can be computed by using equation ( 4) or (5). Now, reconsider the predicate of final score in the previous step.…”

“…The result shows that the built model can be used to make decisions in investment. Sampurno, et.al [5] and Al Etawi & Aburomman [6] studied about comparison of dynamic programming algorithm and greedy algorithm on integer knapsack problem. Based on the results, dynamic programming algorithm outperforms greedy algorithm in terms of the optimized solution, while greedy algorithm is better than dynamic programming with respect to runtime and space requirements.…”