My Genetic Algorithm Story (As Told by Dr. David Carroll)

My first exposure to genetic algorithms was through Steven Levy's book entitled "Artificial Life." While making a frozen pizza one night, I realized that I could use this fascinating technique as a search method for some of my research. Imagine me with pizza cutter in raised hand saying, "Wow, I can automate my tedious two-week long trial and error search and simulate life at the same time!" (Pun intended, think about it.)

For some odd reason, it took me another month to figure out that the guy I played tennis with at the University of Illinois and the chap from the University of Alabama who wrote a marvelous GA textbook, were one and the same, David E. Goldberg (one of the "GA wizards").

With some tips from Goldberg, I concocted a fairly versatile and modern GA (maybe not so modern anymore, but still versatile and usable). The reason for this particular web page is twofold. First, I wrote a FORTRAN GA, whereas all of the other available free GAs I could find at the time were written in PASCAL, LISP or some version of C. Second, most (if not all) of the other readily available GAs do not include more modern GA concepts such as creep mutations, uniform crossover, niching, and elitism (whereas my GA has those options included). More recently I added the ability to use a micro-GA (very efficient). After many requests by colleagues and unknowns for my FORTRAN GA front-end driver code, I have decided to add this web page for any other FORTRAN holdouts (like myself) who are interested in GAs.

While my best version of the GA called the “securGA” used to be for sale (v.1.7.1), I am now offering it for free download. “secur” stands for small-elitist-creeping-uniform-restarting GA and all of my trials with the securGA always proved superior to other versions of my GA.