Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms

Authors:
Jinghui Zhong;Xiaomin Hu;Jun Zhang;Min Gu
Affiliations:
SUN Yat-sen University, P.R.China;SUN Yat-sen University, P.R.China;SUN Yat-sen University, P.R.China;Wuxi Institute of Technology, P.R. China
Venue:
CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-2 (CIMCA-IAWTIC'06) - Volume 02
Year:
2005

Citing 0
Cited 8

Simulations of egoistic and altruistic behaviors using the vidya multiagent system platform

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Genetic optimization of GRNN for pattern recognition without feature extraction

Expert Systems with Applications: An International Journal
Empirically studying the role of selection operators duringsearch-based test suite prioritization

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Genetic algorithm-based identification of transfer function parameters for a rectangular flexible plate system

Engineering Applications of Artificial Intelligence
Towards an OpenCL implementation of genetic algorithms on GPUs

SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Thermal parameters optimization of a reflow soldering profile in printed circuit board assembly: A comparative study

Applied Soft Computing
Ant colony optimization algorithm for lifetime maximization in wireless sensor network with mobile sink

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Security/cost-based optimal allocation of multi-type FACTS devices using multi-objective particle swarm optimization

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the comparison of performance on a simple genetic algorithm (SGA) using roulette wheel selection and tournament selection. A SGA is mainly composed of three genetic operations, which are selection, crossover and mutation. With the same crossover and mutation operation, the simulation results are studied by comparing different selection strategies which are discussed in this paper. Qualitative analysis of the selection strategies is depicted, and the numerical experiments show that SGA with tournament selection strategy converges much faster than roulette wheel selection.