Genetic operators design using division algorithm in the integer solution space

Li Guiting, Wang Bingtuan, Aihua Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Genetic algorithm (GA) is a well known algorithm applied to a wide variety of optimization problems [4]. It combines selection, crossover, and mutation operators in order to find the best solution to a problem. The standard GA operates on chromosomes represented by binary code strings [1, 2]. This paper designs alternative operators in the GA process. The new operations reduce the binary decoding process of chromosomes when performing the computation. Variations of solutions with the implemented operations on chromosomes are studied. Computational examples show that the new methods save the computer time and enhance the efficiency when compared to the standard GA.

Original languageEnglish
Title of host publicationProceedings of the 17th IASTED International Conference on Modelling and Simulation
Pages286-290
Number of pages5
Volume2006
StatePublished - 27 Nov 2006
Event17th IASTED International Conference on Modelling and Simulation - Montreal, QC, Canada
Duration: 24 May 200626 May 2006

Other

Other17th IASTED International Conference on Modelling and Simulation
CountryCanada
CityMontreal, QC
Period24/05/0626/05/06

Fingerprint

Genetic Operators
Mathematical operators
Division
Chromosomes
Genetic algorithms
Genetic Algorithm
Chromosome
Integer
Binary codes
Binary Code
Operator
Decoding
Crossover
Mutation
Strings
Binary
Optimization Problem
Design
Alternatives
Standards

Keywords

  • Crossover
  • Genetic operator/algorithm
  • Mutation
  • Selection

Cite this

Guiting, L., Bingtuan, W., & Li, A. (2006). Genetic operators design using division algorithm in the integer solution space. In Proceedings of the 17th IASTED International Conference on Modelling and Simulation (Vol. 2006, pp. 286-290)
Guiting, Li ; Bingtuan, Wang ; Li, Aihua. / Genetic operators design using division algorithm in the integer solution space. Proceedings of the 17th IASTED International Conference on Modelling and Simulation. Vol. 2006 2006. pp. 286-290
@inproceedings{f0426acff31142e2abeef165f2646fa6,
title = "Genetic operators design using division algorithm in the integer solution space",
abstract = "Genetic algorithm (GA) is a well known algorithm applied to a wide variety of optimization problems [4]. It combines selection, crossover, and mutation operators in order to find the best solution to a problem. The standard GA operates on chromosomes represented by binary code strings [1, 2]. This paper designs alternative operators in the GA process. The new operations reduce the binary decoding process of chromosomes when performing the computation. Variations of solutions with the implemented operations on chromosomes are studied. Computational examples show that the new methods save the computer time and enhance the efficiency when compared to the standard GA.",
keywords = "Crossover, Genetic operator/algorithm, Mutation, Selection",
author = "Li Guiting and Wang Bingtuan and Aihua Li",
year = "2006",
month = "11",
day = "27",
language = "English",
isbn = "0889865949",
volume = "2006",
pages = "286--290",
booktitle = "Proceedings of the 17th IASTED International Conference on Modelling and Simulation",

}

Guiting, L, Bingtuan, W & Li, A 2006, Genetic operators design using division algorithm in the integer solution space. in Proceedings of the 17th IASTED International Conference on Modelling and Simulation. vol. 2006, pp. 286-290, 17th IASTED International Conference on Modelling and Simulation, Montreal, QC, Canada, 24/05/06.

Genetic operators design using division algorithm in the integer solution space. / Guiting, Li; Bingtuan, Wang; Li, Aihua.

Proceedings of the 17th IASTED International Conference on Modelling and Simulation. Vol. 2006 2006. p. 286-290.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Genetic operators design using division algorithm in the integer solution space

AU - Guiting, Li

AU - Bingtuan, Wang

AU - Li, Aihua

PY - 2006/11/27

Y1 - 2006/11/27

N2 - Genetic algorithm (GA) is a well known algorithm applied to a wide variety of optimization problems [4]. It combines selection, crossover, and mutation operators in order to find the best solution to a problem. The standard GA operates on chromosomes represented by binary code strings [1, 2]. This paper designs alternative operators in the GA process. The new operations reduce the binary decoding process of chromosomes when performing the computation. Variations of solutions with the implemented operations on chromosomes are studied. Computational examples show that the new methods save the computer time and enhance the efficiency when compared to the standard GA.

AB - Genetic algorithm (GA) is a well known algorithm applied to a wide variety of optimization problems [4]. It combines selection, crossover, and mutation operators in order to find the best solution to a problem. The standard GA operates on chromosomes represented by binary code strings [1, 2]. This paper designs alternative operators in the GA process. The new operations reduce the binary decoding process of chromosomes when performing the computation. Variations of solutions with the implemented operations on chromosomes are studied. Computational examples show that the new methods save the computer time and enhance the efficiency when compared to the standard GA.

KW - Crossover

KW - Genetic operator/algorithm

KW - Mutation

KW - Selection

UR - http://www.scopus.com/inward/record.url?scp=33751238475&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33751238475

SN - 0889865949

SN - 9780889865945

VL - 2006

SP - 286

EP - 290

BT - Proceedings of the 17th IASTED International Conference on Modelling and Simulation

ER -

Guiting L, Bingtuan W, Li A. Genetic operators design using division algorithm in the integer solution space. In Proceedings of the 17th IASTED International Conference on Modelling and Simulation. Vol. 2006. 2006. p. 286-290