Process visualization to solve the travelling salesman problem

Abstract

The Traveling Salesman Problem (TSP) is one of the well studied combinatorial optimization problems. Multiple approximation algorithms are derived for solving the distance measure TSP that determines the shortest route through a given set of points or cities. In this paper, we visualize the process of genetic parameters and explain the solution converges. It deals with interactive animation to understand the progress view of the solutions obtained. A Java-based FX and interactive visualization (TSP-ViZ) is alo developed using Java FX and optimization results are discussed.