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

Clicks: 371
ID: 10923
2019
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #15 of 68 articles by views in mugla journal of science and technology

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
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.
Reference Key
durmus2019comparisonmugla Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Burcu Durmuş;Öznur İşçi Güneri;Aynur İncekırık;
Journal mugla journal of science and technology
Year 2019
DOI
10.22531/muglajsci.469475
URL
http://dergipark.org.tr/download/article-file/688929
Keywords
Integer Programming Classic Algorithms Greedy Algorithm Knapsack Problems

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.