Yazar "Korkmaz, Sedat" seçeneğine göre listele

Listeleniyor 1 - 3 / 3
  • Küçük Resim Yok
    Öğe
    An artificial algae algorithm for solving binary optimization problems
    (SPRINGER HEIDELBERG, 2018) Korkmaz, Sedat; Babalik, Ahmet; Kiran, Mustafa Servet
    This paper focuses on modification of basic artificial algae algorithm (AAA) for solving binary optimization problems by using a new solution update rule because the agents in AAA work on continuous solution space. The candidate solution generation process of algorithm in the basic version of AAA is replaced with a mechanism that use a neighbor solution randomly selected from the population and three decision variables of this solution. The current solution is taken from the population and randomly selected three dimensions of this solution are changed using the neighbor solution. The agents of AAA work on continuous solution space and this modification for AAA is required for solving a binary optimization problem because a binary optimization problems have decision variables which are element of set {0, 1}. The performance of the proposed algorithm, binAAA for short, is investigated on the uncapacitated facility location problems which are pure binary optimization problem and there is no integer or real valued decision variables in this problem. The results obtained by binAAA are compared with the results of state-of-art algorithms such as artificial bee colony, particle swarm optimization, and genetic algorithms. Experimental results and comparisons show that the binAAA is better than the other algorithm almost all cases in terms of solution quality and robustness based on the mean and standard deviations, respectively.
  • Küçük Resim Yok
    Öğe
    An artificial algae algorithm with stigmergic behavior for binary optimization
    (ELSEVIER, 2018) Korkmaz, Sedat; Kiran, Mustafa Servet
    In this study, we focus on modification of the artificial algae algorithm (AAA), proposed for solving continuous optimization problems, for binary optimization problems by using exclusive-or (xor) logic operator and stigmergic behavior. In the algorithm, there are four processes sequentially realized for solving continuous problems. In the binary version of the algorithm, three of them are adapted in order to overcome the structure of binary optimization problems. In the initialization, the colonies of AAA are set to either zero or one with equal probability. Secondly, helical movement phase is used for obtaining candidate solutions and in this phase, the xor operator and stigmergic behavior are utilized for obtaining binary candidate solutions. The last modified phase is adaptation, and randomly selected binary values in the most starved solution are likened to biggest colony obtained so far. The proposed algorithm is applied to solve well-known uncapacitated facility location problems and numeric benchmark problems. Obtained results are compared with state-of-art algorithms in swarm intelligence and evolutionary computation field. Experimental results show that the proposed algorithm is superior to other techniques in terms of solution quality, convergence characteristics and robustness. (C) 2018 Elsevier B.V. All rights reserved.
  • Küçük Resim
    Öğe
    Türkçe metinlerin statik Huffman algoritması kullanılarak sıkıştırılmasında sıkıştırılma oranı optimizasyonu
    (Selçuk Üniversitesi Fen Bilimleri Enstitüsü, 2003-10-02) Korkmaz, Sedat; Botsalı, Fatih
    Bu tezde, Statik Huffman Algoritması, sıkıştırma oranı optimizasyonu sağlayacak şekilde Türkçe metinleri sıkıştırmak üzere kullanılmıştır. Çalışmalarda farklı alanlarda yazılmış 38 adet Türkçe metin kullanılmıştır. Öncelikle, Türkçe karakterleri ve diğer tüm ASCII karakterleri içeren, farklı karakter kombinezonlarına sahip 1, 2, 3, 4 ve 5 karakterli kelimelerin seçilen Türkçe metinler içindeki tekrarlama frekansları elde edilmiştir. Elde edilen karakter kombinezonları sıkıştırma oram optimizasyonu sağlamak üzere Huffman ağacına yerleştirilmiş ve 15 farklı Huffman seviyesi oluşturulmuştur. Seçilen örnek metinlerin, her bir seviyedeki sıkıştırma kazancı hesaplanmış ve seviyelere ait kazanç değerleri karşılaştırılarak yorumlanmıştır.