TspGA: a simple genetic algorithm for solving the TSP
-
Antonio J. Nebro (University of Málaga)
If you have any question, please send a message to: Antonio J. Nebro (antonio@lcc.uma.es)
1.0 (Last modification: August 4th 2005)
This code is an example of application of a genetic algorithm for solving the TSP (Traveling Salesman Problem). It is intended only for educational purposes. The program allows to experiment with two local search strategies, one based on 2-opt moves and another one using a (mu+lambda)ES.
The program is written in C++ and it has been developed using Cygwin on Windows XP, but it should also work in any Unix-based operating system.
To compile the program, just type make in the root directory of the codes. The name of the executable is TspGA. The parameters of the program are inside the file TspGA.C.
Copyright © 1997-2003 by Antonio J. Nebro.
Permission to use, copy, modify, and distribute this software and its documentation under the terms of the GNU General Public License is hereby granted. No representations are made about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty. See the GNU General Public License for more details.
Generated on Wed Sep 27 08:12:39 2006 for TspGA by
1.4.6