Cunkas, MehmetOzsaglam, M. Yasin2020-03-262020-03-2620090196-97221087-6553https://dx.doi.org/10.1080/01969720903068435https://hdl.handle.net/20.500.12395/23201This article deals with a performance evaluation of particle swarm optimization (PSO) and genetic algorithms (GA) for traveling salesman problem (TSP). This problem is known to be NP-hard, and consists of the solution containing N! permutations. The objective of the study is to compare the ability to solve the large-scale and other benchmark problems for both algorithms. All simulation has been performed using a software program developed in the Delphi environment. As yet, overall results show that genetic algorithms generally can find better solutions compared to the PSO algorithm, but in terms of average generation it is not good enough.en10.1080/01969720903068435info:eu-repo/semantics/closedAccessGenetic algorithmsParticle swarm optimizationTraveling salesman problemArticle406490507Q3WOS:000268191100002Q3