2021
DOI: 10.1016/j.swevo.2020.100796
|View full text |Cite
|
Sign up to set email alerts
|

Variation Operators for Grouping Genetic Algorithms: A Review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 36 publications
(24 citation statements)
references
References 67 publications
0
10
0
Order By: Relevance
“…Grouping problems are problems that group or assign items, considering their objective and constraints (Ramos-Figueroa et al, 2021). More formally, they are to partition a set 𝑉𝑉 of 𝑛𝑛 items into 𝐷𝐷 mutually disjoint subsets 𝐺𝐺 𝑖𝑖 (𝑖𝑖 = 1,2, … , 𝐷𝐷) in such a way that their objective function is maximized or minimized.…”
Section: Grouping Genetic Algorithmmentioning
confidence: 99%
“…Grouping problems are problems that group or assign items, considering their objective and constraints (Ramos-Figueroa et al, 2021). More formally, they are to partition a set 𝑉𝑉 of 𝑛𝑛 items into 𝐷𝐷 mutually disjoint subsets 𝐺𝐺 𝑖𝑖 (𝑖𝑖 = 1,2, … , 𝐷𝐷) in such a way that their objective function is maximized or minimized.…”
Section: Grouping Genetic Algorithmmentioning
confidence: 99%
“…The GGA was designed in 1992 by Falkenauer [35] and is an extension to the traditional GA with the difference of using a group-based solutions representation scheme and variation operators working together with such solution encoding. Ramos-Figueroa et al [36] remark that the encoding of a grouping problem solution into a chromosome is a key issue for obtaining good GGA performance; the authors also comment on the importance of integrating crossover and mutation operators adapted to work at the group level. They present a survey of different variation operators designed to work with GGAs that use different types of encoding, as well as their advantages to solve grouping problems.…”
Section: Grouping Genetic Algorithmsmentioning
confidence: 99%
“… 37 The main characteristic of the genetic algorithm is to operate the structure object directly, 38 and it has certain advantages in solving combinatorial optimization problems. 39 …”
Section: Introductionmentioning
confidence: 99%
“…In a recent article, the authors mentioned that it is necessary to analyze the correlation between the ECU signal and the DCU signal to derive a factor in the future, which also shows the importance of close cooperation between EGR and SCR to the engine . The main characteristic of the genetic algorithm is to operate the structure object directly, and it has certain advantages in solving combinatorial optimization problems …”
Section: Introductionmentioning
confidence: 99%