The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

Artificial bee colony algorithm simulating the intelligent foraging behavior of honey bee swarms is one of the most popular swarm based optimization algorithms. It has been introduced in 2005 and applied in several fields to solve different problems up to date. In this paper, an artificial bee colony algorithm, called as Artificial Bee Colony Programming (ABCP), is described for the first time ...

Feature selection plays an important role in data mining and pattern recognition, especially in the case of large scale data. Feature selection is done due to large amount of noise and irrelevant features in the original data set. Hence, the efficiency of learning algorithms will increase incredibly if these irrelevant data are removed by this procedure. A novel approach for feature selection i...

The idea behind this work is to solve the Shortest Common Supersequence by using Artificial Bee Colony (ABC) Algorithm. This algorithm is considered as one of the newest nature-inspired swarm-based optimization algorithms and has a promising performance [6]. Shortest Common Supersequence is a classical problem in the field of strings and it is classified as NP-Hard problem [12]. Many algorithms...

Many different earning algorithms used for getting high performance in mathematics and statistical tasks. Recently, an Artificial Bee Colony (ABC) developed by Karaboga is a nature inspired algorithm, which has been shown excellent performance with some standard algorithms. The hybridization and improvement strategy made ABC more attractive to researchers. The two famous improved algorithms are...

Artificial Bee Colony algorithm is a global optimization algorithm which is motivated by the foraging behavior of honey bee swarms. Basic Artificial Bee Colony algorithm (ABC) has the advantages of strong robustness, fast convergence and high flexibility, fewer setting parameters, but it has the disadvantages premature convergence in the later search period and the accuracy of the optimal value...

Artificial Bee Colony (ABC) Algorithm is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself. . In this proposed wor...