Travelling Salesman Problem using Dynamic Approach

Abstract

In this paper, the Travelling Salesman Problems using dynamic approach is discussed. Increasing development in our life resulted in difficulties to solve problems which can be solved in Generic Algorithm (GA) in an efficient way to reach optimal solution. Generic Algorithm follows sequence of steps to solve any problem (selection, fitness, crossover and mutation). Each of these steps has types which can be selected according to characteristics of the problem. Crossover is exchange information of offspring. So it leads us to focus on it in order to reach optimal solution in least time by changing it from generation to another. In this paper, experiment on the Travelling Salesman Problem (TSP) is applied in which time is saved and problem is solved using two point crossovers.