The improved initialization method of genetic algorithm for solving the optimization problem

TSP(Traveling Salesman Problem) used widely for solving the optimization is the problem to find out the shortest distance out of possible courses where one starts a certain city, visits every city among N cities and turns back to a staring city. At this time, the condition is to visit N cities exactly only once. TSP is defined easily, but as the number of visiting cities increases, the calculation rate increases geometrically. This is why TSP is classified into NP-Hard Problem. Genetic Algorithm is used representatively to solve the TSP. Various operators have been developed and studied until now for solving the TSP more effectively. This paper applied the new Population Initialization Method (using the Random Initialization method and Induced Initialization method simultaneously), solved TSP more effectively, and proved the improvement of capability by comparing this new method with existing methods.