Tsp Solving by Hybridization of GA and AS

Traveling salesman problem (TSP) is one of the most famous combinational optimization problems. Today, many solutions have been offered by using different methods to solve this problem. Each one of these solutions has its own advantages and disadvantages and a comprehensive solution which proves itself as the most optimum one is not presented yet. But we are still waiting for better solutions which solve the problem in more optimum ways. In this paper we have proposed a hybridization solution using the two GA and AS for TSP solving and we have called it GA-AS. The results of this new solution which is presented in experimental results, shows that TSP is solved by using our proposed combinational solution (GA-AS) has better results than TSP solved only by using standard GA. Another new idea considered in this paper is to change the current GA generation in order to reach a better generation and therefore a better answer which is explained schematically.