LibGA can be found at
The Genetic Algorithms Archive, Navy Center for Applied Research in AI
Or LibGA can be obtained by anonymous ftp to
FTP.AIC.NRL.NAVY.MIL. LibGA is located at
/pub/galist/src/ga/libga100.tar.Z
Arthur L. Corcoran and Roger L. Wainwright,
"Using LibGA to Develop Genetic Algorithms for Solving
Combinatorial Optimization Problems",
in Lance Chambers, Editor, Practical Handbook of Genetic
Algorithms, Applications Volume I, pages 143-172, CRC Press, 1995
Arthur L. Corcoran and Roger L. Wainwright,
"LibGA: A User-Friendly Workbench for Order-Based Genetic Algorithm Research",
Proceedings of the 1993 ACM/SIGAPP
Symposium on Applied Compurting, February 14-16, 1993,
pages 562-569, ACM Press.
Over the years there has been several packages developed that provide a workbench for genetic algorithm (GA) research. Most of these packages use the generational model inspired by GENESIS. A few have adopted the steady-state model used in Genitor. Unfortunately, they have some deficiencies when working with order-based problems such as packing, routing, and scheduling. This paper describes LibGA, which was developed specifically for order-based problems, but which also works easily with other kinds of problems. It offers an easy to use `user-friendly' interface and allows comparisons to be made between both generational and steady-state genetic algorithms for a particular problem. It includes a variety of genetic operators for reproduction, crossover, and mutation. LibGA makes it easy to use these operators in new ways for particular applications or to develop and include new operators. Finally, it offers the unique new feature of a dynamic generation gap.