… This paper proposes a solution to TSP using Firefly Algorithm (FA) and kmeans clustering.
The proposed approach … Then, apply Genetic Algorithm on each group to find the sub-path. …

… To conclude this paper, a hybrid genetic algorithm (integration of both local technique and
… Euclidean traveling salesman problem. By comparing to the traditional genetic algorithm …

… This problem is the traveling sales-man problem (TSP). The traveling salesman problem (TSP)
is the problem of searching the shortest Hamiltonian route among all target points. The …

… , by partitioning the problem with a clustering technique, K-Means, and solving these pieces
… a new genetic algorithm with improved genetic operators is proposed. The genetic algorithm …

… improved genetic algorithm is proposed that can be used to find the solution of TSP problems.
… contains three steps in first step author applied k means clustering for deviation of nodes. …

… problem. Over the last few decades, many evolutionary algorithms have been developed for
solving … In this study, a new design that uses the k-means clustering method, is proposed to …

… problem into a series of small-scale problems. First, the k-means and improved genetic algorithm
… layer and generate the initial solution. Then, the developed two phases simplified 2-opt …

… The two-phase heuristic approach that uses an improved K-means approach by collecting
the cities depending on their positions and precise capacity constraints is developed for the …

… to solve the symmetric Traveling Salesman Problem (TSP) by combining the K-means clustering
… , we first apply the K-means algorithm to group cities into several clusters. Then we use …

… In this paper, MTSP will be solved using combination of K-means and crossover ACO
based … Crossover is one of the operators in the genetic algorithm. Crossover is a process of …