Mustafa Servet Kiran

A directed artificial bee colony algorithm

A new method based on artificial bee colony (ABC) algorithm is proposed in this study.The improvement is based on direction information produced for artificial bees.Performance of the proposed method has been examined on numeric functions.The experimental results show that proposed approach is more effective than some classical variants of ABC algorithm. Artificial bee colony (ABC) algorithm has been introduced for solving numerical optimization problems, inspired collective behavior of honey bee colonies. ABC algorithm has three phases named as employed bee, onlooker bee and scout bee. In the model of ABC, only one design parameter of the optimization problem is updated by the artificial bees at the ABC phases by using interaction in the bees. This updating has caused the slow convergence to global or near global optimum for the algorithm. In order to accelerate convergence of the method, using a control parameter (modification rate-MR) has been proposed for ABC but this approach is based on updating more design parameters than one. In this study, we added directional information to ABC algorithms, instead of updating more design parameters than one. The performance of proposed approach was examined on well-known nine numerical benchmark functions and obtained results are compared with basic ABC and ABCs with MR. The experimental results show that the proposed approach is very effective method for solving numeric benchmark functions and successful in terms of solution quality, robustness and convergence to global optimum.

Artificial bee colony algorithm with variable search strategy for continuous optimization

The artificial bee colony (ABC) algorithm is a swarm-based optimization technique proposed for solving continuous optimization problems. The artificial agents of the ABC algorithm use one solution update rule during the search process. To efficiently solve optimization problems with different characteristics, we propose the integration of multiple solution update rules with ABC in this study. The proposed method uses five search strategies and counters to update the solutions. During initialization, each update rule has a constant counter content. During the search process performed by the artificial agents, these counters are used to determine the rule that is selected by the bees. Because the optimization problems and functions have different characteristics, one or more search strategies are selected and are used during the iterations according to the characteristics of the numeric functions in the proposed approach. By using the search strategies and mechanisms proposed in the present study, the artificial agents learn which update rule is more appropriate based on the characteristics of the problem to find better solutions. The performance and accuracy of the proposed method are examined on 28 numerical benchmark functions, and the obtained results are compared with various classical versions of ABC and other nature-inspired optimization algorithms. The experimental results show that the proposed algorithm, integrated and improved with search strategies, outperforms the basic variants and other variants of the ABC algorithm and other methods in terms of solution quality and robustness for most of the experiments.

A recombination-based hybridization of particle swarm optimization and artificial bee colony algorithm for continuous optimization problems

This paper presents a hybridization of particle swarm optimization (PSO) and artificial bee colony (ABC) approaches, based on recombination procedure. The PSO and ABC are population-based iterative methods. While the PSO directly uses the global best solution of the population to determine new positions for the particles at the each iteration, agents (employed, onlooker and scout bees) of the ABC do not directly use this information but the global best solution in the ABC is stored at the each iteration. The global best solutions obtained by the PSO and ABC are used for recombination, and the solution obtained from this recombination is given to the populations of the PSO and ABC as the global best and neighbor food source for onlooker bees, respectively. Information flow between particle swarm and bee colony helps increase global and local search abilities of the hybrid approach which is referred to as Hybrid approach based on Particle swarm optimization and Artificial bee colony algorithm, HPA for short. In order to test the performance of the HPA algorithm, this study utilizes twelve basic numerical benchmark functions in addition to CEC2005 composite functions and an energy demand estimation problem. The experimental results obtained by the HPA are compared with those of the PSO and ABC. The performance of the HPA is also compared with that of other hybrid methods based on the PSO and ABC. The experimental results show that the HPA algorithm is an alternative and competitive optimizer for continuous optimization problems.

Swarm intelligence approaches to estimate electricity energy demand in Turkey

This paper proposes two new models based on artificial bee colony (ABC) and particle swarm optimization (PSO) techniques to estimate electricity energy demand in Turkey. ABC and PSO electricity energy estimation models (ABCEE and PSOEE) are developed by incorporating gross domestic product (GDP), population, import and export figures of Turkey as inputs. All models are proposed in two forms, linear and quadratic. Also different neighbor selection mechanisms are attempted for ABCEE model to increase convergence to minimum of the algorithm. In order to indicate the applicability and accuracy of the proposed models, a comparison is made with ant colony optimization (ACO) which is available for the same problem in the literature. According to obtained results, relative estimation errors of the proposed models are lower than ACO and quadratic form provides better-fit solutions than linear form due to fluctuations of the socio-economic indicators. Finally, Turkeys electricity energy demand is projected until 2025 according to three different scenarios.

The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem

The artificial bee colony (ABC) algorithm, inspired intelligent behaviors of real honey bee colonies, was introduced by Karaboğa for numerical function optimization. The basic ABC has high performance and accuracy, if the solution space of the problem is continuous. But when the solution space of the problem is discrete, the basic ABC algorithm should be modified to solve this class optimization problem. In this study, we focused on analysis of discrete ABC with neighborhood operator for well-known traveling salesman problem and different discrete neighborhood operators are replaced with solution updating equations of the basic ABC. Experimental computations show that the promising results are obtained by the discrete version of the basic ABC and which neighborhood operator is better than the others. Also, the results obtained by discrete ABC were enriched with 2- and 3-opt heuristic approaches in order to increase quality of the solutions.

A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum

Abstract This paper presents a novel hybrid algorithm based on particle swarm optimization (PSO) and ant colony optimization (ACO) and called hybrid ant particle optimization algorithm (HAP) to find global minimum. In the proposed method, ACO and PSO work separately at each iteration and produce their solutions. The best solution is selected as the global best of the system and its parameters are used to select the new position of particles and ants at the next iteration. The performance of proposed method is compared with PSO and ACO on the benchmark problems and better quality results are obtained by HAP algorithm.

TSA: Tree-seed algorithm for continuous optimization

Abstract This paper presents a new intelligent optimizer based on the relation between trees and their seeds for continuous optimization. The new method is in the field of heuristic and population-based search. The location of trees and seeds on n-dimensional search space corresponds with the possible solution of an optimization problem. One or more seeds are produced from the trees and the better seed locations are replaced with the locations of trees. While the new locations for seeds are produced, either the best solution or another tree location is considered with the tree location. This consideration is performed by using a control parameter named as search tendency (ST), and this process is executed for a pre-defined number of iterations. These mechanisms provide to balance exploitation and exploration capabilities of the proposed approach. In the experimental studies, the effects of control parameters on the performance of the method are firstly examined on 5 well-known basic numeric functions. The performance of the proposed method is also investigated on the 24 benchmark functions with 2, 3, 4, 5 dimensions and multilevel thresholding problems. The obtained results are also compared with the results of state-of-art methods such as artificial bee colony (ABC) algorithm, particle swarm optimization (PSO), harmony search (HS) algorithm, firefly algorithm (FA) and the bat algorithm (BA). Experimental results show that the proposed method named as TSA is better than the state-of-art methods in most cases on numeric function optimization and is an alternative optimization method for solving multilevel thresholding problem.

The continuous artificial bee colony algorithm for binary optimization

This paper introduces an ABC variant to solve binary optimization problems.The performance of the proposed method is investigated on well-known UFLPs.The proposed method is compared with the ABC variants and PSO variants.The experimental results show that the proposed algorithm is an alternative tool for binary optimization. Artificial bee colony (ABC) algorithm, one of the swarm intelligence algorithms, has been proposed for continuous optimization, inspired intelligent behaviors of real honey bee colony. For the optimization problems having binary structured solution space, the basic ABC algorithm should be modified because its basic version is proposed for solving continuous optimization problems. In this study, an adapted version of ABC, ABCbin for short, is proposed for binary optimization. In the proposed model for solving binary optimization problems, despite the fact that artificial agents in the algorithm works on the continuous solution space, the food source position obtained by the artificial agents is converted to binary values, before the objective function specific for the problem is evaluated. The accuracy and performance of the proposed approach have been examined on well-known 15 benchmark instances of uncapacitated facility location problem, and the results obtained by ABCbin are compared with the results of continuous particle swarm optimization (CPSO), binary particle swarm optimization (BPSO), improved binary particle swarm optimization (IBPSO), binary artificial bee colony algorithm (binABC) and discrete artificial bee colony algorithm (DisABC). The performance of ABCbin is also analyzed under the change of control parameter values. The experimental results and comparisons show that proposed ABCbin is an alternative and simple binary optimization tool in terms of solution quality and robustness.

Particle swarm optimization with a new update mechanism

Abstract Particle swarm optimization (PSO) has been invented by inspiring social behaviors of fish or birds to solve nonlinear global optimization problems. Since its invention, many PSO variants have been proposed by modifying its solution update rule to improve its performance. The social component of update rule of PSO is based on subtraction between current position of particle and global best information. Similarly, the cognitive component works by using subtraction between the current position of particle and personal best information. The subtraction-based solution update mechanism has caused premature convergence and stagnation in particle population during the iterations. To overcome these issues, this study presents a distribution-based update rule for PSO algorithm. The performance of proposed approach named as PSOd is investigated on solving 13 nonlinear global optimization benchmark functions and three constrained engineering optimization problems. Obtained results are compared with standard PSO algorithm, its classical variants and some state-of-art swarm intelligence algorithms. The experimental results and comparisons show that PSOd outperforms PSO and its variants on solving the numerical benchmark functions in terms of solution quality and robustness.

An Implementation of Tree-Seed Algorithm (TSA) for Constrained Optimization

One of the recent proposed population-based heuristic search algorithms is tree-seed optimization algorithm, TSA for short. TSA simulates the growing over on a land of trees and seeds and it has been proposed for solving unconstrained continuous optimization problems. The trees and their seeds on the D-dimensional solution space correspond to the possible solution for the optimization problem. At the beginning of the search, the trees are sowed to the land, and a number of seeds for each tree are produced during the iterations. The tree is removed from the stand and its best seed is added to the stand if the fitness of the best seed is better than the fitness of this tree. In the present study, a constraint optimization problem, the well-known pressure vessel design-PVD problem, is solved by using TSA. To overcome the constraints of the problem, a penalty function is used and the problem is considered as a single objective optimization problem. The experimental results obtained by the TSA are compared with the results of state-of-art methods such as artificial bee colony (ABC) and particle swarm optimization (PSO). Based on the solution quality and robustness, the promising and comparable results are obtained by the proposed approach.