Skip to main content
SpringerLink
Log in

Crossing Over Genetic Algorithms: The Sugal Generalised GA

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baker, J.E. (1985). “Adaptive Selection Methods for Genetic Algorithms.” Proc. First Int. Conf. on Genetic Algorithms and Their Applications, pp. 101-111.

  • Bohachevsky, I.O., M.E. Johnson, and L.S. Myron. (1986). “Generalized Simulated Annealing for Function Optimization,” Technometrics28(3), 209-217.

    Google Scholar 

  • Davis, L. (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold.

  • DeJong, K.A. (1975). “An Analysis of the Behavior of a Class of Genetic Adaptive Systems.” Doctoral Dissertation, University of Michigan. Dissertation Abstracts International 36(10), 5140B.

    Google Scholar 

  • Fogel, L.J., A.J. Owens, and M.J. Walsh. (1966). Artificial Intelligence Through Simulated Evolution. New York: John Wiley.

    Google Scholar 

  • Fogel, D.B., L.J. Fogel, and V.W. Porto. (1990). “Evolving Neural Networks,” Biological Cybernetics63, 487-493.

    Google Scholar 

  • Glover, F. (1977). “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Sciences8(1), 156-166.

    Google Scholar 

  • Glover, F. (1997). “A Template for Scatter Search and Path Relinking.” In J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Lecture Notes in Computer Science, pp. 1-45.

  • Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.

  • Harp, S.A., T. Samad, and A. Guha. (1989). “Towards the Genetic Synthesis of Neural Networks.” Int. Conf. on Genetic Algorithms, pp. 360-369.

  • Holland, J. (1975). Adaptation in Natural and Artificial Systems. MIT Press.

  • Hunter. (1995). “The Sugal Genetic Algorithms Package.” http://osiris.sunderland.ac.uk/ahu/sugal/home.html

  • Schwefel, H. (1981). Numerical Optimization of Computer Models. Chicester: John Wiley.

    Google Scholar 

  • Whitley, D. (1989). “The GENITOR Algorithm and Selective Pressure: Why Rank-Based Allocation of Reproductive Trials is Best.” Proc. Third Int. Conf. on Genetic Algorithms. Morgan Kauffman.

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Systems, University of Sunderland, Tyne and Wear, England. E-mail

    Andrew Hunter

Authors
  1. Andrew Hunter
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hunter, A. Crossing Over Genetic Algorithms: The Sugal Generalised GA. Journal of Heuristics 4, 179–192 (1998). https://doi.org/10.1023/A:1009629730631

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009629730631

Search

Navigation