Yazar "Babalik, Ahmet" seçeneğine göre listele

Listeleniyor 1 - 7 / 7
  • 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
    Classifiers fusion in recognition of wheat varieties
    (SPRINGER-VERLAG BERLIN, 2007) Raudys, Sarunas; Baykan, Omer Kaan; Babalik, Ahmet; Denisov, Vitalij; Bielskis, Antanas Andrius
    Five wheat varieties (Bezostaja Cesit1252, Dagdas, Gerek, Kiziltan traded in Konya Exchange of Commerce, Turkey), characterized by nine geometric and three colour descriptive features have been classified by multiple classier system where pair-wise SLP or SV classifiers served as base experts. In addition to standard voting and Hastie and Tibshirani fusion rules, two new ones were suggested that allowed reducing the generalization error up to 5%. In classifying of kernel lots, we may obtain faultless grain recognition.
  • Küçük Resim Yok
    Öğe
    Implementation of Bat Algorithm on 2D Strip Packing Problem
    (SPRINGER INT PUBLISHING AG, 2016) Babalik, Ahmet
    This paper suggests utilization of a novel metaheuristic method namely bat algorithm (BA) in order to solve 2D rectangular strip packing problem. Although BA is proposed for solving continuous optimization problems, a discrete version of BA is developed by being used neighborhood operators to solve the problem dealt with this study. Firstly, bottom left approach is used as the placement algorithm in the problem, then, discrete BA is used for obtaining the proper sequence of the rectangular object list. The performance of the proposed approach is investigated on 9 different problems on well-known 2D rectangular problem literature. Experimental results show that discrete BA is effective and alternatively usable in solving 2D rectangular strip packing problems.
  • Küçük Resim Yok
    Öğe
    An improvement in fruit fly optimization algorithm by using sign parameters
    (SPRINGER, 2018) Babalik, Ahmet; Iscan, Hazim; Babaoglu, Ismail; Gunduz, Mesut
    The fruit fly optimization algorithm (FOA) has been developed by inspiring osphresis and vision behaviors of the fruit flies to solve continuous optimization problems. As many researchers know that FOA has some shortcomings, this study presents an improved version of FOA to remove with these shortcomings in order to improve its optimization performance. According to the basic version of FOA, the candidate solutions could not take values those are negative as well as stated in many studies in the literature. In this study, two sign parameters are added into the original FOA to consider not only the positive side of the search space, but also the whole. To experimentally validate the proposed approach, namely signed FOA, SFOA for short, 21 well-known benchmark problems are considered. In order to demonstrate the effectiveness and success of the proposed method, the results of the proposed approach are compared with the results of the original FOA, results of the two different state-of-art versions of particle swarm optimization algorithm, results of the cuckoo search optimization algorithm and results of the firefly optimization algorithm. By analyzing experimental results, it can be said that the proposed approach achieves more successful results on many benchmark problems than the compared methods, and SFOA is presented as more equal and fairer in terms of screening the solution space.
  • Küçük Resim Yok
    Öğe
    A modification of tree-seed algorithm using Deb's rules for constrained optimization
    (ELSEVIER SCIENCE BV, 2018) Babalik, Ahmet; Cinar, Ahmet Cevahir; Kiran, Mustafa Servet
    This study focuses on the modification of Tree-Seed Algorithm (TSA) to solve constrained optimization problem. TSA, which is one of the population-based iterative search algorithms, has been developed by inspiration of the relations between trees and seeds grown on a land, and the basic version of TSA has been first used to solve unconstrained optimization problems. In this study, the basic algorithmic process of TSA is modified by using Deb's rules to solve constrained optimization problems. Deb's rules are based on the objective function and violation of constraints and it is used to select the trees and seeds that will survive in next iterations. The performance of the algorithm is analyzed under different conditions of control parameters of the proposed algorithm, CTSA for short, and well-known 13 constrained maximization or minimization standard benchmark functions and engineering design optimization problems are employed. The results obtained by the CTSA are compared with the results of particle swarm optimization (PSO), artificial bee colony algorithm (ABC), genetic algorithm (GA) and differential evolution (DE) algorithm on the standard benchmark problems. The results of state-of-art methods are also compared with the proposed algorithm on engineering design optimization problems. The experimental analysis and results show that the proposed method produces promising and comparable results for the constrained optimization benchmark set in terms of solution quality and robustness. (C) 2017 Elsevier B.V. All rights reserved.
  • Küçük Resim Yok
    Öğe
    A multi-objective artificial algae algorithm
    (ELSEVIER, 2018) Babalik, Ahmet; Ozkis, Ahmet; Uymaz, Sait Ali; Kiran, Mustafa Servet
    In this study, the authors focus on modification of the artificial algae algorithm (AAA), for multi-objective optimization. Basically, AAA is a population-based optimization algorithm inspired by the behavior of microalgae cells. In this work, a modified AAA with appropriate strategies is proposed for multi-objective Artificial Algae Algorithm (MOAAA) from the first AAA that was initially presented to solve single-objective continuous optimization problems. To the best of our knowledge, the MOAAA is the first modification of the AAA for solving multi-objective problems. Performance of the proposed algorithm is examined on a benchmark set consisting of 36 different multi-objective optimization problems and compared with four different swarm intelligence or evolutionary algorithms that are well-known in literature. The MOAAA is highly successful in solving multi-objective problems, and it has been demonstrated that the MOAAA is an alternative competitive algorithm in multi-objective optimization according to experimental results and comparisons presented in this research topic. (C) 2018 Elsevier B.V. All rights reserved.
  • Küçük Resim Yok
    Öğe
    A novel metaheuristic for multi-objective optimization problems: The multi-objective vortex search algorithm
    (ELSEVIER SCIENCE INC, 2017) Ozkis, Ahmet; Babalik, Ahmet
    This study investigates a multi-objective Vortex Search algorithm (MOVS) by modifying the single-objective Vortex Search algorithm or VS. The VS is a metaheuristic-based algorithm that uses a new adaptive step-size adjustment strategy to improve the performance of the search process. Search mechanism of the VS is inspired by the vortex pattern, so it is called a "Vortex Search" algorithm. The original VS is an improved way of solving single-objective continuous problems. To improve the MOVS algorithm, the VS algorithm is enhanced with added calculation approaches, such as fast-nondominated-sorting and crowding-distance, in order to identify the degree of non-dominance of the solutions and the densities of their occurrence. In addition, a crossover operation is added to the MOVS algorithm in order to enhance the Pareto front convergence capacity of the solutions. Finally, to spread the solutions more successfully over the Pareto front, it has been randomly produced using the inverse incomplete gamma function using a parameter between 0 and 1. The proposed MOVS algorithm is tested against 36 different benchmark problems together with NSGAII, MOCeII, IBEA and MOEA/D algorithms. The test results indicate that the MOVS algorithm achieves a better performance on accuracy and convergence speed than any other algorithms when comparisons are made against several test problems, and they also show that it is a competitive algorithm. (C) 2017 Elsevier Inc. All rights reserved.