An Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms

Mandira Chakraborty; Uday K. Chakraborty

doi:10.1109/ICICS.1997.647128

An Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms

Mandira Chakraborty, Uday K. Chakraborty

Research output: Contribution to journal › Article › peer-review

Abstract

The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in genetic algorithms. Simulation results are presented.

Original language	American English
Journal	International Conference on Information and Communication Security
Volume	1
DOIs	https://doi.org/10.1109/ICICS.1997.647128
State	Published - Jan 1 1997
Externally published	Yes

Disciplines

Computer Sciences
Artificial Intelligence and Robotics

Access to Document

10.1109/ICICS.1997.647128License: Unspecified

Cite this

@article{d941c2e98d3f42439a76f5cc478cca25,

title = "An Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms",

abstract = " The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in genetic algorithms. Simulation results are presented.",

author = "Mandira Chakraborty and Chakraborty, \{Uday K.\}",

note = "The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in g",

year = "1997",

month = jan,

day = "1",

doi = "10.1109/ICICS.1997.647128",

language = "American English",

volume = "1",

journal = "International Conference on Information and Communication Security",

}

TY - JOUR

T1 - An Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms

AU - Chakraborty, Mandira

AU - Chakraborty, Uday K.

N1 - The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in g

PY - 1997/1/1

Y1 - 1997/1/1

N2 - The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in genetic algorithms. Simulation results are presented.

AB - The present paper extends the branching process model proposed by Chakraborty (1995) to cover linear ranking selection and binary tournament selection in genetic algorithms. Simulation results are presented.

UR - http://ieeexplore.ieee.org/document/647128/

U2 - 10.1109/ICICS.1997.647128

DO - 10.1109/ICICS.1997.647128

M3 - Article

VL - 1

JO - International Conference on Information and Communication Security

JF - International Conference on Information and Communication Security

ER -

An Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms

Abstract

Disciplines

Access to Document

Other files and links

Cite this