Animation of the Traveling Salesman Problem

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 fo...

Full description

Saved in:
Bibliographic Details
Published in:2013 Proceedings of IEEE Southeastcon pp. 1 - 6
Main Authors: ElAarag, Hala, Romano, Sam
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2013
Subjects:
Aerospace electronics
Animation
Cities and towns
computer science education
educational tools
Java
Optimization
Traveling Salesman Problem
Traveling salesman problems
TSP
Visualization
ISBN:9781479900527, 1479900524
ISSN:1091-0050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9781479900527
1479900524
ISSN:1091-0050
DOI:10.1109/SECON.2013.6567488