is NP-hard problem which involves finding the minimum tour length among a given set of
nodes and return to the starting node knowing that each node must be visited once. This
paper proposes a solution to TSP using Firefly Algorithm (FA) and k-means clustering. The
proposed approach comprises three major steps: cluster the nodes, find the optimal path in
each cluster, and reconnect the clusters. The first step uses k-means clustering to divide the …