Bees Algorithm (BA) is a popular meta-heuristic method that has been used in many
different optimization areas for years. In this study, a new version of combinatorial BA is …

Combinatorial optimization finds the best subset in a discrete problem space. In engineering
or management fields, many problems are formulated as a combinatorial optimization …

By combining the modified nearest neighbor approach and the improved inver-over
operation, an Artificial Bee Colony (ABC) Algorithm for Traveling Salesman Problem (TSP) is …

Artificial bee colony (ABC) is a quite popular optimization approach that has been used in
many fields, with its not only standard form but also improved versions. In this paper, new …

Bees Algorithm is one of the most used nature-inspired algorithms. There are five
parameters applied in the basic combinatorial version of Bees Algorithm: number of scout …

Many real world industrial applications involve the Traveling Salesman Problem (TSP),
which is a problem that finds a Hamiltonian path with minimum cost. Examples of problems …

Travelling Salesman Problem (TSP) belongs to the class of NP-Complete problems. It has
been proved that evolutionary algorithms are effective and efficient, with respect to the …

In this research paper, Artificial Bee Colony algorithm is modified with multiple update rules
and K-opt operation to solve the Traveling Salesman Problem. Here the features of swap …

Travelling salesman problem (TSP) is a fundamental combinatorial optimization model
studied in the operations research community for nearly half a century. It belongs to the class …

For the artificial bee colony algorithm (ABC), it is easy to fall into local optimum and has
lower convergence accuracy when solving the traveling salesman problem. For addressing …