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

Year 2019, , 34 - 42, 30.06.2019

Burcu Durmuş , Öznur İşçi Güneri , Aynur İncekırık

https://doi.org/10.22531/muglajsci.469475

Cited By: 2

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.

Keywords

Integer Programming, Classic Algorithms, Greedy Algorithm, Knapsack Problems

References

• [1] Bakır, M. A. and Altunkaynak, B., Tamsayılı Programlama Teori, Modeller ve Algoritmaları, Nobel Yayın Dağıtım, Ankara, 2003.
• [2] Başkaya, Z., Tamsayılı Programlama Algoritmaları ve Bilgisayar Uygulamalı Problem Çözümleri, Başak Matbaacılık, Ankara, 2005.
• [3] Güler, A., Tamsayılı Programlama Problemleri İçin Garanti Değerli Algoritmalar, Ege University, Graduate School of Natural and Applied Sciences, Master Thesis, İzmir, 2008.
• [4] Winston, W. L., Operations Research Applications and Algorithms, Canada, 2004.
• [5] Taha, H. Yöneylem Araştırması, Literatür Yayıncılık, İstanbul, 2000.
• [6] Hillier, F. S. and Lieberman, G. J., Introduction to Operations Research, McGraw-Hill, New York, 2001.
• [7] Schrijver, A., Theory of Linear and Integer Programming, A Wiley-Interscience Publication, Amsterdam, 1999.
• [8] Keskintürk, T., Topuk, N. and Özyeşil, O., “Araç Rotalama Problemleri İle Çözüm Yöntemlerinin Sınıflandırılması ve Bir Uygulama”, The Journal of Business Science, 3(2), 77-107, 2015.
• [9] Sağır, M., Öztürk, A. and Öztürk, Ö., Yöneylem Araştırması-2, Anadolu Üniversitesi Açıköğretim Yayınları, Eskişehir, 2013.
• [10] Yıldırım, T., Kalaycı, C. B. and Mutlu, Ö., “Gezgin Satıcı Problemi İçin Yeni Bir Meta Sezgisel: Kör Fare Algoritması”, Pamukkale University Journal of Engineering Sciences, 22(1), 64-70, 2016.
• [11] Pearl, J., Heuristics Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley Publishing Company, 1984.
• [12] Durmuş, B., Tamsayılı Programlamada Klasik ve Greedy Sezgisel Algoritma Sonuçlarının Karşılaştırılması, Muğla Sıtkı Koçman University, Graduate School of Natural and Applied Sciences, Master Thesis, Muğla, 2018.
• [13] Alwan, H. O. and Farhan, N. M., “Load Restoration Methodology Considering Renewable Energies and Combined Heat and Power Systems”, International Journal of Engineering and Technology, 7(2.6), 130-134, 2018.