COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS
| dc.contributor.author | Burcu DURMUŞ | |
| dc.contributor.author | Öznur İŞÇİ GÜNERİ | |
| dc.contributor.author | Aynur İNCEKIRIK | |
| dc.date.accessioned | 2024-07-24T09:09:52Z | |
| dc.date.available | 2024-07-24T09:09:52Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | This paper focus on comparing the differences and similarities between the results obtained from Greedy and classicalalgorithms for integer linear programming (ILP) problems. For this purpose, the solution of the problems related todifferent 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 obtainedfrom Greedy algorithm are compared for the problems considered here. In this context, the results obtained from algorithmsare found to be the same for small-sized pure and 0-1 binary Knapsack problems. Since packet programs are limited indimension and number of constraints, it becomes difficult to obtain appropriate results from classical algorithms as thedimension of the problem grows. However, Greedy algorithm gives the appropriate results regardless of the dimension andthe number of constraints. | |
| dc.identifier.DOI-ID | 10.22531/muglajsci.469475 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/22416 | |
| dc.language.iso | eng | |
| dc.title | COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS | |
| dc.type | Araştırma Makalesi |