Recommendation

Has Potential

Link

http://students.ceid.upatras.gr/~papagel/project/tspprobl.htm

Delivery Method

Java Applet

License

Language

English

Author

Institution

University of Patras

Project

UPatras Collection

RelationshipToProject

PartOfCollection

Works

Yes

Description

This example presents a greedy heuristic algorithm for Traveling Salesperson problem.

Evaluation

The example provides good, thorough and simple enough explanation on the Traveling Salesperson problem and the greedy heuristic algorithm that is used. The visualization of the algorithm shows not how the pseudo-code is executed (it is provided separately), but how the algorithm chooses the next path. Pressing only the "Solve" button is rather confusing, as it seems like the visualization is merely a "test how this algorithm works" example, but next to it is a "Step" button, which justifies the example's usefulness in learning the problem and a one heuristic solution for it. The paths' costs are also modifiable instead of just providing fixed input. This improves student engagement and gets him/her to stay with the example longer.

ActivityLevel

GoodFor

Teaching the Concept

Screenshots

Videos

References

HowToUse

First Visited

2008

Last Visited

2008-06-13

Last Updated

Topic

NpCompleteness

Community

Edit

You may edit this entry if you have an account.