An interactive approach to solve the Travelling Salesman Problem

Author

Thomas, J. Joshua ; Ken, Choy Chee ; Leow, Amy

Author_Institution

Penang Campus, Sch. of Eng., KDU Coll., Georgetown, Malaysia

fYear

2010

fDate

Nov. 30 2010-Dec. 2 2010

Firstpage

710

Lastpage

715

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

Keywords

Java; computer animation; interactive systems; problem solving; travelling salesman problems; Java FX; Java-based interactive visualization; combinatorial optimization problem; interactive animation; multiple approximation algorithm; travelling salesman problem; Animation; Biological cells; Cities and towns; Gallium; Traveling salesman problems; Visualization; Wheels; Genetic Algorithm; Optimization; Visualization;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Seoul

Print_ISBN

978-1-4244-8567-3

Electronic_ISBN

978-89-88678-30-5

Type

conf

DOI

10.1109/ICCIT.2010.5711146

Filename

5711146