Kiran, Mustafa ServetIscan, HazimGunduz, Mesut2020-03-262020-03-2620130941-06431433-3058https://dx.doi.org/10.1007/s00521-011-0794-0https://hdl.handle.net/20.500.12395/29890The artificial bee colony (ABC) algorithm, inspired intelligent behaviors of real honey bee colonies, was introduced by Karaboga for numerical function optimization. The basic ABC has high performance and accuracy, if the solution space of the problem is continuous. But when the solution space of the problem is discrete, the basic ABC algorithm should be modified to solve this class optimization problem. In this study, we focused on analysis of discrete ABC with neighborhood operator for well-known traveling salesman problem and different discrete neighborhood operators are replaced with solution updating equations of the basic ABC. Experimental computations show that the promising results are obtained by the discrete version of the basic ABC and which neighborhood operator is better than the others. Also, the results obtained by discrete ABC were enriched with 2- and 3-opt heuristic approaches in order to increase quality of the solutions.en10.1007/s00521-011-0794-0info:eu-repo/semantics/closedAccessArtificial bee colonyDiscrete optimizationNeighborhood operatorsTraveling salesman problemArticle231921Q1WOS:000320865100002Q2