COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS

This study is designed to investigate the comparison of Greedy and classic algorithm solution results and the results of solution algorithms for integer linear programming (ILP) problems. The purpose of the study is to examine the heuristic Greedy algorithm that solves the ILP problems and to reveal the differences and similarities between the classic and heuristic Greedy algorithms on the application. For this purpose, a software (JAVA Program) which solves Knapsack Problems (KP) with Greedy terminology has been developed and problems in different models have been solved with objective function and constraints. The problems are solved by both the conventional classic algorithm and the Greedy algorithm and the solution results are compared. In the study, the results of pure and (0-1) binary backpack problems were found to be the same as those of heuristic algorithms for small problems. In addition, the developed program solves single and two-dimensional KP in the literature.