Hunter, Andrew (1998) Crossing over genetic algorithms: The Sugal Generalised GA. Journal of Heuristics, 4 (2). pp. 180-192. ISSN 1381-1231
Full content URL: http://www.springerlink.com/content/kr9u0767177571...
Full text not available from this repository.
| Item Type: | Article |
|---|---|
| Item Status: | Live Archive |
Abstract
Sugal is a major new public-domain software package designed to support experimentation with, and implementation of, Genetic Algorithms. Sugal includes a generalised Genetic Algorithm, which supports the major popular versions of the GA as special cases. Sugal also has integrated support for various datatypes, including real numbers, and features to make hybridisation simple. This paper discusses the Sugal GA, showing how recombining the features of the popular algorithms results in the creation of a number of useful hybrid algorithms.
| Additional Information: | Sugal is a major new public-domain software package designed to support experimentation with, and implementation of, Genetic Algorithms. Sugal includes a generalised Genetic Algorithm, which supports the major popular versions of the GA as special cases. Sugal also has integrated support for various datatypes, including real numbers, and features to make hybridisation simple. This paper discusses the Sugal GA, showing how recombining the features of the popular algorithms results in the creation of a number of useful hybrid algorithms. |
|---|---|
| Keywords: | genetic algorithms, simulated annealing, software package |
| Subjects: | G Mathematical and Computer Sciences > G400 Computer Science |
| Divisions: | College of Science > School of Computer Science |
| ID Code: | 2777 |
| Deposited On: | 10 Jul 2010 19:01 |
Repository Staff Only: item control page