Comparison of Classic and Greedy Heuristic Algorithm Results in Integer Programming: Knapsack Problems

Abstract

This paper focus on comparing the differences and similarities between the results obtained from Greedy and classical algorithms for integer linear programming (ILP) problems. For this purpose, the solution of the problems related to different models with the purpose function and constraints has been provided by developing a software (Java Program) which solves the Knapsack problems (KP) with Greedy algorithm. Both the classical algorithm and the results obtained from Greedy algorithm are compared for the problems considered here. In this context, the results obtained from algorithms are found to be the same for small-sized pure and 0-1 binary Knapsack problems. Since packet programs are limited in dimension and number of constraints, it becomes difficult to obtain appropriate results from classical algorithms as the dimension of the problem grows. However, Greedy algorithm gives the appropriate results regardless of the dimension and the number of constraints.

A Greedy Scheduling Approach for Peripheral Mobile Intelligent Systems

“…In their study, Durmus et al [54] aimed to support the assumption that the classic algorithms generate optimal solutions while the greedy heuristic algorithms generate proximate solutions. They argued that not only do the dimensions of problems increase, but the dimensions and number of constraints in packet programs are also limited, so it is difficult for the classic algorithms to provide the appropriate results.…”

“…Indeed, greedy algorithms are more efficient in comparison with other complex algorithms; they produce solutions to everyday problems within a reasonable time. Durmus et al [54] applied greedy and some classical algorithms to the problems of integer linear programming and then compared the differences and similarities of the obtained results. Throughout this work, they classified the most-used algorithms in the literature, as displayed in Table 4, to which we added other greedy approaches and algorithms [51,57].…”

Internet-of-Things (IoT) Shortest Path Algorithms and Communication Case Studies for Maintaining Connectivity in Harsh Environements

“…A Greedy algorithm constructs a path one-step at a time, at each step choosing the locally best option. However, understanding correctness issues for greedy algorithms is more challenging, as it is difficult to prove why a particular algorithm is correct [3,4]. This algorithm will be discussed in a future paper.…”

Data driven storage location assignment problem considering order picking frequencies: A heuristic approach

“…En yüksek katsayıyı, kazancı en çok sağlayacak olana atamaya odaklıdır. Açgözlü algoritma, kolay kullanımından, düşük hesaplama maliyetlerinden ve çok sayıda probleme uyarlanabilir olmasından dolayı oldukça sık kullanılır[21].Bu adımlar izlenerek, aynı projeye ait ürünler birbirine yakın tutulmaktadır. Belirli bir projeye ait olmayan genel ürünler için, küme grupları göz önünde bulundurularak onlar da birbirlerine yakın tutulmaktadır.…”