As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
An improved artificial bee colony algorithm is proposed for traveling salesman problem, which is a classical NP- hard problem. By improved artificial bee colony algorithm we introduce swarm behavior of the artificial fish swarm algorithm and the crossover operator of the genetic algorithm, and enlightens the underdamping motion of physics which uses it to adaptively update for the visual range of the artificial fish swarm algorithm. Through the simulation of six classic traveling salesman problems in the TSPLIB standard library and comparison with other improved algorithms, we show that the improved artificial bee colony algorithm has a better performance and better results than the original artificial bee colony algorithm in solving the TSP problem.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.