Koçer, Hasan ErdinçAkça, Melike Ruhan2020-03-262020-03-2620140196-97221087-6553https://dx.doi.org/10.1080/01969722.2014.970396https://hdl.handle.net/20.500.12395/30589This study aims to solve the traveling salesman problem for small, medium, and large traveling salesman problems taken from the TSPLIB with known solutions, by using an improved artificial bee colony algorithm that is a swarm intelligence-based heuristic algorithm. The improvement process is achieved by using a loyalty function that is used in bee colony optimization as a fitness function used in ABC algorithms. Obtained solutions are compared to solutions from the TSPLIB and the results of cunkas and ozsaglam's (2009) study, which includes the solutions for benchmark problems and cities and counties in Turkey according to the genetic algorithm and particle swarm optimization.en10.1080/01969722.2014.970396info:eu-repo/semantics/closedAccesstraveling salesman problemopt-2 local searchartificial bee colony algorithmopt-2 local searchArticle458635649Q3WOS:000343712400003Q3