2007 IEEE International Conference on Systems, Man and Cybernetics 2007
DOI: 10.1109/icsmc.2007.4414016
|View full text |Cite
|
Sign up to set email alerts
|

Using escape operations in gene-set genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…In the mutation operation, if a short segment is selected in a mutation possibility and replaced by another segment, then the gene-set based GA is achieved [27]. …”
Section: Methodsmentioning
confidence: 99%
“…In the mutation operation, if a short segment is selected in a mutation possibility and replaced by another segment, then the gene-set based GA is achieved [27]. …”
Section: Methodsmentioning
confidence: 99%