Managing search in a partitioned Search space in GA

Nadi, Farhad; Khader, Ahamad Tajudin

doi:10.1109/iccis.2010.5518570

Search citation statements

Order By: Relevance

Paper Sections

Select...

Representation1

Dividing the Search Space1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2015

Publication Types

Select...

Article1

Other1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A set of loci in each individual will be reserved as indicators of regions [22]. It has to be noted that no extra genes will be added to the individuals.…”

Section: Representationmentioning

confidence: 99%

See 1 more Smart Citation

An Adaptive GA in Partitioned Search Space

Nadi

Khader

2014

INT J COMPUT COMMUN

Self Cite

View full text Add to dashboard Cite

Evolutionary algorithms are population based meta-heuristics inspired from natural survival of fittest phenomena. Despite their reasonable performance, these algorithms suffer from some weaknesses including the need for finding the values of their parameters that affect their performance. A new algorithm is proposed that divide the search space into equal sized partitions. Each partition is assigned with two parameters that determine the intensification and diversification rates. The partitions will be intensified or diversified adaptively with regards to the corresponding parameters. Traditional crossover and mutation operators are replaced with two new parameter-free operators. The experiments conducted on a wide range of multi-modal and epistatic problems showed the superiority of the proposed method in comparison to other algorithms in literature.

show abstract

“…A set of loci in each individual will be reserved as indicators of regions [22]. It has to be noted that no extra genes will be added to the individuals.…”

Section: Representationmentioning

confidence: 99%

“…Initially, the search space will be divided into a predefined number (m) of regions (G) with the same size [16,18,22].…”

Section: Dividing the Search Spacementioning

confidence: 99%