Genetic Algorithm For Solving TSP Problems

In this paper, a modified genetic algorithm is proposed for solving TSP problems. In this algorithm the unfitness function is chosen as a merit at the beginning of iteration and a new crossover operator is designed. In addition, we use a hybrid mutation operator, and make immune operation on individual after mutation operation. This modified algorithm is used to solve the extended TSP forms such as MTSP and TSPD. Some numerical results show that this algorithm is efficient.