Simple approach to TSP by permutation of six cities and deletion of crossover

We examine an intuitive and very simple approach to find a suboptimal solution to TSP. The algorithm consists of the determination of the initial tour, permutation of the consecutive six cities and the deletion of the crossover. We have tested two kinds of algorithm to the examples on the Web site of TSPLIB95. The average ratio of the length of the obtained tour to the optimal length was 1.0464 and 1.0662.