About this document
Greedy Genetic Algorithm for TSP by basakj216 is a document available to read on EtoBox.
The document presents a new Greedy Genetic Algorithm (GGA) for solving the Travelling Salesman Problem (TSP), which improves upon existing methods by achieving approximately 5% better path lengths. The algorithm incorporates a greedy approach in generating the initial population, crossover operations, and mutation processes. Results from testing the GGA on standard TSP problems show significant improvements compared to traditional algorithms, with specific optimal path lengths reported for Eil51 and Att48.
- Author
- basakj216
- Language
- EN