2022
DOI: 10.1109/tcyb.2020.3005047
|View full text |Cite
|
Sign up to set email alerts
|

A New Crossover Mechanism for Genetic Algorithms for Steiner Tree Optimization

Abstract: Genetic Algorithms (GAs) have been widely applied in Steiner tree optimization problems. However, as the core operation, existing crossover operators for tree-based GAs suffer from producing illegal offspring trees. Therefore, some global link information must be adopted to ensure the connectivity of the offspring, which incurs heavy computation. To address this problem, this paper proposes a new crossover mechanism, called Leaf Crossover, which generates legal offspring by just exchanging partial parent chrom… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 21 publications
(5 citation statements)
references
References 37 publications
0
5
0
Order By: Relevance
“…(2) Crossover operator P r : Based on the principle comparison, the model in this paper chooses the arithmetic crossover method [34][35][36]. Arithmetic crossover assumes that Γ t A , Γ t B is the arithmetic crossover between two sample individuals.…”
Section: Genetic Algorithm Optimizes the Weights And Resholds Of Neur...mentioning
confidence: 99%
“…(2) Crossover operator P r : Based on the principle comparison, the model in this paper chooses the arithmetic crossover method [34][35][36]. Arithmetic crossover assumes that Γ t A , Γ t B is the arithmetic crossover between two sample individuals.…”
Section: Genetic Algorithm Optimizes the Weights And Resholds Of Neur...mentioning
confidence: 99%
“…Besides, β is a binary vector which is generated randomly. Because the occurrence probability of crossover is typically much larger than that of mutation [65], the probability of crossover is set to 0.9 and the probability of mutation is set to 0.1. Considering the discrete mutation, the value of the mutation index is first set as 0.02 × v , and the mutation step is 0.7 × randn , where randn conforms to a normal distribution with mean 0 and variance 1, • and • represent the ceil and floor functions, respectively.…”
Section: Parameter Calibrationmentioning
confidence: 99%
“…Heuristic algorithms are the existing techniques used to solve signal timing optimization problems. The typical intelligent algorithms, such as genetic [27] and particle swarm optimization [28] algorithms, all have some drawbacks, such as ease of falling into a local optimum and slow operation efficiency. Thus far, many new intelligent optimization algorithms have been proposed to solve these problems.…”
Section: Literature Reviewmentioning
confidence: 99%