Gezgin satici probleminin çözümüne yönelik algoritmik yaklaşimlar

Many method can be experienced to solve the traveling salesman problem, which can be met in our daily life. The solution time and the efficency of the existent value are considered as important points.There are many and different solution techniques for different kind TSP's. An important technique for TSP is the genetic algorithms (GA). It is very new to use genetic algorithms, which are still being researched, in solving traveling salesman problem, which is widely studied and researched problem in combinatorial optimization and global search heuristics.In this study how genetic algorithm works and the solution of traveling salesman problem, which is among the operational research problems, using genetic algorithm are explained. A genetic algorithm has been developed for traveling salesman problem, and the advantages and the disadvantages of the developed method are explained taking into consideration also the existing methods. The purpose is to solve the traveling salesman using the genetic algorithm mothod, which has the shorter solution time but does not ensure the optimum value.