The demos of the software were in lab SC 289.
Iris van Rooij and Ulrike Stege
Purdue TSP Application Released
This demo version of the Purdue TSP App is the first public release of this
is fully capable of:
- generating problems
- finding optimal tours (using the Concorde
- finding the longest tours (as discussed
by Ed Chronicle)
- finding tours using the June 2005 version of our adaptive pyramid
- collecting subject data on Traveling Salesman Problems and Minimum Spanning
Credits and Acknowledgements:
This program was originally developed by Zheng Li and is now maintianed by
Jack Saalweachter (email@example.com) and Emil
Stefanov (firstname.lastname@example.org) under the supervision of Dr. Zygmunt Pizlo.
Comments, questions, and suggestions should be sent to Jack and Emil.
This program uses the Concorde library for finding optimal TSP tours.
It was written by David Applegate, Robert Bixby, Vasek Chvatal, William Cook,
and Monika Mevenkamp. This project can be found at http://www.tsp.gatech.edu/concorde/index.html.
QSopt, also developed at Georgia Tech, is also used in the program, indirectly,
by the Concorde library. It was developed by David Applegate, William Cook,
Sanjeeb Dash, and Monika Mevenkamp. This project can be found at http://www.isye.gatech.edu/~wcook/qsopt/index.html.
This program also uses an implementation of the Mersenne Twister pseudorandom
generator which was written by Makoto Matsumoto and Takuji Nishimura. They
can be reached at email@example.com.