Proceedings of the Genetic and Evolutionary Computation Conference Companion 2017
DOI: 10.1145/3067695.3076023
|View full text |Cite
|
Sign up to set email alerts
|

A computationally fast multimodal optimization with push enabled genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 6 publications
0
7
0
Order By: Relevance
“…In this operation, two strings are selected randomly from the mating pool and some of their portions are exchanged. For instance, in a single point crossover operation, two new strings are produced by swapping the right-side portions of two strings after cutting these at arbitrary places, as presented in [15].…”
Section: Crossovermentioning
confidence: 99%
See 4 more Smart Citations
“…In this operation, two strings are selected randomly from the mating pool and some of their portions are exchanged. For instance, in a single point crossover operation, two new strings are produced by swapping the right-side portions of two strings after cutting these at arbitrary places, as presented in [15].…”
Section: Crossovermentioning
confidence: 99%
“…A better child string can be produced by combining good sub-strings from either parent if a suitable site is selected, which is usually selected randomly since the suitability of a site is not always known [15]. However, it must be noted that the random selection of a site does not make the search process random.…”
Section: Crossovermentioning
confidence: 99%
See 3 more Smart Citations