- Full text PDF available (0)
Journals and Conferences
Traveling salesman problem is a typical combinatorial optimization problem which can be effectively solved by genetic algorithm. This paper proposes an improved partheno-genetic algorithm to solve TSP problem. A comparison between our algorithm and the conventional partheno-genetic algorithm shows its effectiveness.