2017
DOI: 10.5815/ijem.2017.06.01
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Genetic Operator for Genetic Folding Algorithm: A Refolding Operator and a New Genotype

Abstract: Genetic Folding algorithm uses linear chromosomes composed of organized genes in floating-numbers manner, in which each genes chain fold back on themselves to form the final GF chromosome. In this paper, a novel genotype representation and a novel genetic operator were proposed. The paper was applied using MATLAB code to illustrate the beneficiary, flexibility and powerful of the Genetic Folding algorithm solving Santa Fe Trail problem. The problem of programming an artificial ant to follow the Santa Fe Trail … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Each GF kernel chromosome was divided into a head segment that only carries functions and a tail segment containing terminals. However, the size of the head segment must be determined ahead of time, but the size of the tails segment does not need to be determined since the GF algorithm predicts the number of genes needed based on the pairs required for the drawn functions ( Mezher & Abbod, 2017 ). Furthermore, the GF algorithm predicts the number of operands (terminals) necessary each time the GF algorithm generates different operators (function) at random.…”
Section: Introductionmentioning
confidence: 99%
“…Each GF kernel chromosome was divided into a head segment that only carries functions and a tail segment containing terminals. However, the size of the head segment must be determined ahead of time, but the size of the tails segment does not need to be determined since the GF algorithm predicts the number of genes needed based on the pairs required for the drawn functions ( Mezher & Abbod, 2017 ). Furthermore, the GF algorithm predicts the number of operands (terminals) necessary each time the GF algorithm generates different operators (function) at random.…”
Section: Introductionmentioning
confidence: 99%