Crossing Over Genetic Algorithms: The Sugal Generalised GA

Authors:
Andrew Hunter
Affiliations:
Department of Computing and Information Systems, University of Sunderland, Tyne and Wear, England. E-mail: cs0ahu@sunderland.ac.uk
Venue:
Journal of Heuristics
Year:
1998

Citing 10
Cited 2

Generalized simulated annealing for function optimization

Technometrics
Evolving neural networks

Biological Cybernetics
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Numerical Optimization of Computer Models

Numerical Optimization of Computer Models
Adaptive Selection Methods for Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Towards the Genetic Synthesisof Neural Networks

Proceedings of the 3rd International Conference on Genetic Algorithms
The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best

Proceedings of the 3rd International Conference on Genetic Algorithms
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.

GA design of crisp-fuzzy logic controllers

Proceedings of the 1999 ACM symposium on Applied computing
An Evolution Program for Non-Linear Transportation Problems

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sugal is a major new public-domain software package designed tosupport experimentation with, and implementation of, GeneticAlgorithms. Sugal includes a generalised Genetic Algorithm,which supports the major popular versions of the GA as specialcases. Sugal also has integrated support for various datatypes,including real numbers, and features to make hybridisationsimple. This paper discusses the Sugal GA, showing howrecombining the features of the popular algorithms results inthe creation of a number of useful hybrid algorithms.