CMU Artificial Intelligence Repository
Home INFO Search FAQs Repository Root

ParaTSP: Parallel GA with Simulated Annealing to solve TSP's

ParaTSP is a software package for solving Traveling Salesman Problems (TSP) using genetic algorithms (GA) and simulated annealing (SA). ParaTSP is based on Baeck's GeneSyS.
Origin:*   []* []*   []

Version: 1.0 (6-JUN-94) Requires: C Copying: Copyright (c) 1994 by Holger Totzke Use, copying, modification, and distribution permitted. CD-ROM: Prime Time Freeware for AI, Issue 1-1 Author(s): Holger Totzke University of Magdeburg Moskauer Str. 17 39218 Schoenebeck Germany Tel: +49-3928/66334 Keywords: Authors!Totzke, C!Code, Genetic Algorithms, ParaTSP, Simulated Annealing, TSP, Traveling Salesman Problem References: ?
Last Web update on Mon Feb 13 10:23:12 1995