By Topic

An interactive approach to solve the Travelling Salesman Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Thomas, J.J. ; Penang Campus, Sch. of Eng., KDU Coll., Georgetown, Malaysia ; Choy Chee Ken ; Leow, A.

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 interactive visualization (TSP-ViZ) is also developed using Java FX and optimization results are discussed.

Published in:

Computer Sciences and Convergence Information Technology (ICCIT), 2010 5th International Conference on

Date of Conference:

Nov. 30 2010-Dec. 2 2010