Optimization of the Traveling Salesman Problem Using Genetis Algorithms

Ovaj rad obrađuje genetske algoritme i njihovu primjenu na problem trgovačkog putnika. Opisane su dvije vrste genetskih algoritama i svi koraci algoritma, a naglasak je postavljen na operatore križanja i mutacije koji su većinom specifični za problem koji se rješava. Predstavljen je cjelokupan generacijski genetski algoritma za rješavanje problema trgovačkog putnika gdje su gradovi prikazani GPS koordinatama. Također, prikazani su rezultati razvijenog algoritma.The subject of this paper are genetic algorithms and their application to the traveling salesman problem. Two kinds of genetic algorithms are described together with all their steps and with special attention given to crossover and mutation operators, which are usually specific to the problem. The presented genetic algorithm is used for solving the traveling salesman problem where cities are described using GPS coordinates. The results of the algorithm are also presented