Abstract
AbstractBees 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 proposed and explained in detail to solve Traveling Salesman Problems (TSPs). The nearest neighbor method was used in the population generation section of BA, and the Multi-Insert function was added to the local search section instead of the Swap function. To see the efficiency of the proposed method, 24 different TSPs were used in experimentation and the obtained results were compared with both classical combinatorial BA and other successful meta-heuristic methods. After detailed analyses and experimental studies on different problems, it has been observed that the proposed method performs well for TSPs and competes well with other methods.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference45 articles.
1. Osaba E, Yang X, Ser JD (2020) Traveling salesman problem: a perspective review of recent research and new results with bio-inspired metaheuristics. Nature-Inspired Comput Swarm Intell Algorithms, Theory Appl 25:135–164. https://doi.org/10.1016/B978-0-12-819714-1.00020-8
2. Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biometrics ve Bioinf (IJBB) 3(6):96–105. https://doi.org/10.14569/IJACSA.2020.0110275
3. Martinovic G, and Bajer D (2012) “Impact of NNA implementation on GA performance for the TSP”, In 5th international conference on bioinspired optimization methods and their applications (bioma 2012), 173–184
4. AlSalibi BA, Jelodar MB, Venkat I (2013) A comparative study between the nearest neighbor and genetic algorithms: a revisit to the traveling salesman problem. Int J Computer Sci Electron Eng (IJCSEE) 1(1):110–123
5. Castellani M, Otri S, Pham DT (2019) Printed circuit board assembly time minimisation using a novel Bees Algorithm. Comput Ind Eng 133:186–194. https://doi.org/10.1016/j.cie.2019.05.015
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献