On Solving Travelling Salesman Problems by Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Simulated Annealing versus Metropolis for a TSP instance
Information Processing Letters
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
Journal of Global Optimization
Information Sciences: an International Journal
A hybrid particle swarm optimization algorithm for the vehicle routing problem
Engineering Applications of Artificial Intelligence
Computational Optimization and Applications
Hi-index | 0.00 |
In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared with particle swarm optimization (PSO) algorithm to validate its performance. In the experimental study, we also analysis the important parameters in the artificial bee colony algorithm and their influence have been verified.