We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Yerel Arama Bölümü Güncellenmiş Arı Algoritması ile Gezgin Satıcı Problemi Optimizasyonu.
- Authors
Şahin, Murat
- Abstract
Solving traveling salesman problems with many connections with classical optimization methods is challenging. In this context, metaheuristic algorithms that direct their searches to an optimum solution are preferred. In this study, the Bee Algorithm, one of these metaheuristic algorithms inspired by the foraging methods of honey bees, was examined. The study aims to increase the Bees Algorithm's effectiveness in solving traveling salesman problems. The Variable Multiple Insertion operator has been added to the Classical Bee Algorithm, and optimizations have been made for different traveling salesman problems by searching within close neighborhood regions. As a result of the tests, it was seen that much better results were obtained with this algorithm compared to other Bee Algorithms in the literature. The algorithm has reduced from 1.40-2.80% to 0.11-0.50% in problems of 100 cities and from 8.10-9.67% to 2.00-2.79% in issues of 200 cities.
- Publication
Journal of Intelligent Systems: Theory & Applications, 2023, Vol 6, Issue 1, p24
- ISSN
2651-3927
- Publication type
Article
- DOI
10.38016/jista.986793