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.
Highlights
Along with the development of technology, the completion of a problem that was originally done manually, can be done systematically through the application
Based on the results of the calculation by two algorithms, it can be seen that the solution of making goods using Dynamic Programming Algorithm is better when compared with Greedy Algorithm or choose randomly without Algoritma. This can be seen from the calculation result obtained by Dynamic Programming Algorithm, that is total weight of 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
Summary
Along with the development of technology, the completion of a problem that was originally done manually, can be done systematically through the application. Problem solving process can be done by Algorithm on an application. Starting from a start condition and initial input, the instructions describe a computation that when executed or processed through a limited number of sequence conditions can be well defined and produce output [1]. At this time the delivery of goods become familiar things because the business is a lot of transact on the internet. Business opportunities and prospects for freight forwarding services are still very good and growing [2]. Knapsack problems can be solved using the Greedy Algorithm or the Dynamic Programming Algorithm [4,6,15]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
