Application of Genetic Algorithm on Traveling Salesperson Problem

U ovom radu proučavana je primjena genetskog algoritma s lokalnom pretragom za rješavanje problema trgovačkog putnika (TSP). Kroz eksperimente na pet primjera TSP problema različitih veličina, koristeći GUI implementiran u programskom jeziku Java, analiziramo uspješnost genetskog algoritma s i bez lokalne pretrage. Rezultati pokazuju da uvođenje lokalne pretrage značajno poboljšava performanse genetskog algoritma, omogućavajući brže i preciznije pronalaženje približno optimalnih rješenja za veće TSP probleme. Ovi rezultati pružaju uvid u primjenu genetskog algoritma i lokalne pretrage za TSP probleme te mogu biti korisni u praktičnim primjenama optimizacijskih problema.In this research, we have investigated the application of a genetic algorithm with local search for solving the traveling salesman problem (TSP). Through experiments on five instances of TSP problems of varying sizes, using a Java-based GUI implementation, we analyzed the effectiveness of the genetic algorithm. The results demonstrate that the introduction of local search significantly improves the performance of the genetic algorithm, enabling faster and more precise identification of approximately optimal solutions for larger TSP problems. These findings provide insights into the application of the genetic algorithm and local search for TSP problems and can be valuable in practical implementations of optimization problems