J. Joshua Thomas

Learn More
NP-Hard problems are hard to solve, it requires considerable computational power to generate solutions. The objective is to achieve better solution in less time. To obtain better solutions in semi-automated examination timetabling systems, we introduce visual interface tools to assist human to identify conflicts and turn the direction towards the feasible(More)
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.(More)
  • 1