Research Article
PDF Mendeley EndNote BibTex Cite

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

Year 2019, Volume 5, Issue 1, 34 - 42, 30.06.2019
https://doi.org/10.22531/muglajsci.469475

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.

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.

Year 2019, Volume 5, Issue 1, 34 - 42, 30.06.2019
https://doi.org/10.22531/muglajsci.469475

Abstract

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.

Details

Primary Language English
Subjects Engineering
Journal Section Journals
Authors

Burcu DURMUŞ (Primary Author)
MUGLA SITKI KOCMAN UNIVERSITY
0000-0002-0298-0802
Türkiye


Öznur İŞÇİ GÜNERİ
MUGLA SITKI KOCMAN UNIVERSITY
0000-0003-3677-7121
Türkiye


Aynur İNCEKIRIK This is me
CELAL BAYAR UNIVERSITY
0000-0002-5029-6036
Türkiye

Publication Date June 30, 2019
Published in Issue Year 2019, Volume 5, Issue 1

Cite

Bibtex @research article { muglajsci469475, journal = {Mugla Journal of Science and Technology}, issn = {2149-3596}, address = {}, publisher = {Muğla Sıtkı Koçman Üniversitesi}, year = {2019}, volume = {5}, number = {1}, pages = {34 - 42}, doi = {10.22531/muglajsci.469475}, title = {COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS}, key = {cite}, author = {Durmuş, Burcu and İşçi Güneri, Öznur and İncekırık, Aynur} }
APA Durmuş, B. , İşçi Güneri, Ö. & İncekırık, A. (2019). COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS . Mugla Journal of Science and Technology , 5 (1) , 34-42 . DOI: 10.22531/muglajsci.469475
MLA Durmuş, B. , İşçi Güneri, Ö. , İncekırık, A. "COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS" . Mugla Journal of Science and Technology 5 (2019 ): 34-42 <https://dergipark.org.tr/en/pub/muglajsci/issue/43454/469475>
Chicago Durmuş, B. , İşçi Güneri, Ö. , İncekırık, A. "COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS". Mugla Journal of Science and Technology 5 (2019 ): 34-42
RIS TY - JOUR T1 - COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS AU - Burcu Durmuş , Öznur İşçi Güneri , Aynur İncekırık Y1 - 2019 PY - 2019 N1 - doi: 10.22531/muglajsci.469475 DO - 10.22531/muglajsci.469475 T2 - Mugla Journal of Science and Technology JF - Journal JO - JOR SP - 34 EP - 42 VL - 5 IS - 1 SN - 2149-3596- M3 - doi: 10.22531/muglajsci.469475 UR - https://doi.org/10.22531/muglajsci.469475 Y2 - 2019 ER -
EndNote %0 Mugla Journal of Science and Technology COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS %A Burcu Durmuş , Öznur İşçi Güneri , Aynur İncekırık %T COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS %D 2019 %J Mugla Journal of Science and Technology %P 2149-3596- %V 5 %N 1 %R doi: 10.22531/muglajsci.469475 %U 10.22531/muglajsci.469475
ISNAD Durmuş, Burcu , İşçi Güneri, Öznur , İncekırık, Aynur . "COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS". Mugla Journal of Science and Technology 5 / 1 (June 2019): 34-42 . https://doi.org/10.22531/muglajsci.469475
AMA Durmuş B. , İşçi Güneri Ö. , İncekırık A. COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS. Mugla Journal of Science and Technology. 2019; 5(1): 34-42.
Vancouver Durmuş B. , İşçi Güneri Ö. , İncekırık A. COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS. Mugla Journal of Science and Technology. 2019; 5(1): 34-42.
IEEE B. Durmuş , Ö. İşçi Güneri and A. İncekırık , "COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS", Mugla Journal of Science and Technology, vol. 5, no. 1, pp. 34-42, Jun. 2019, doi:10.22531/muglajsci.469475

5975f2e33b6ce.png
Mugla Journal of Science and Technology (MJST) is licensed under the Creative Commons Attribution-Noncommercial-Pseudonymity License 4.0 international license