Fluid Flow Algorithm to Solve Travel Salesman Problem

Abstract

Travel Salesman Problem (TSP) is well known combinatorial optimization problem. Hamiltonian
path is required to solve TSP. This Hamiltonian path can be achieved by many methods. In this
paper a novel and efficient algorithm is discussed. The name of algorithm is Fluid Flow algorithm.
It works similar as flow of fluid when expands from a source. It starts from smallest triangle and
expands by keeping a closed path and captures its nearest possible point. It continues expansion
until all points included in that path. In this paper the efficiency of proposed algorithm is compared
with other algorithms and experimental results have proved that our proposed algorithm is more
efficient than Ant Colony and Genetic algorithms.