Animation of the Traveling Salesman Problem

Author

ElAarag, Hala ; Romano, Simone

Author_Institution

Dept. of Math. & Comput. Sci., Stetson Univ., Deland, FL, USA

fYear

2013

fDate

4-7 April 2013

Firstpage

1

Lastpage

6

Abstract

Visualization of algorithms has become increasingly more popular as classrooms are upgraded with better technology and graphically interactive systems. This technique is attractive to educators and students alike. With increased performance in languages such as Java and the ease of implementation for graphical interfaces, one can construct graphical systems for effectively animating and visualizing algorithms. In this paper, we present an implementation of such a system for The Traveling Salesman Problem (TSP). Our goal is to bring TSP to life by graphically representing the states of two popular solutions to this problem, namely backtracking and branch and bound, and animating the transitions between those states.

Keywords

backtracking; computer aided instruction; computer animation; computer science education; data visualisation; graphical user interfaces; travelling salesman problems; tree searching; Java languages; TSP; algorithm animation; algorithm visualization; backtracking problem; branch-and-bound problem; graphical interfaces; graphical system construction; state transition animation; traveling salesman problem animation; Aerospace electronics; Animation; Cities and towns; Java; Traveling salesman problems; Visualization; Optimization; TSP; Traveling Salesman Problem; animation; computer science education; educational tools; visualization;

fLanguage

English

Publisher

ieee

Conference_Titel

Southeastcon, 2013 Proceedings of IEEE

Conference_Location

Jacksonville, FL

ISSN

1091-0050

Print_ISBN

978-1-4799-0052-7

Type

conf

DOI

10.1109/SECON.2013.6567488

Filename

6567488