Animating geometric algorithms over the web
Proceedings of the twelfth annual symposium on Computational geometry
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Expanding Neighborhood GRASP for the Traveling Salesman Problem
Computational Optimization and Applications
EAVis: A Visualization Tool for Evolutionary Algorithms
VLHCC '05 Proceedings of the 2005 IEEE Symposium on Visual Languages and Human-Centric Computing
| Hi-index | 0.00 |
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.