2019
DOI: 10.1007/978-3-030-11928-7_60
|View full text |Cite
|
Sign up to set email alerts
|

The Immigration Genetic Approach to Improve the Optimization of Constrained Assignment Problem of Human Resources

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 6 publications
0
8
0
Order By: Relevance
“…The buckling and failure load factors values for 48 ply laminate and 64 ply laminate are presented in Table 2. The obtained results were compared with the results gained from [6][7][8][9][10][11][12][13][14][15][16][17].…”
Section: Bucking Load Optimization Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The buckling and failure load factors values for 48 ply laminate and 64 ply laminate are presented in Table 2. The obtained results were compared with the results gained from [6][7][8][9][10][11][12][13][14][15][16][17].…”
Section: Bucking Load Optimization Resultsmentioning
confidence: 99%
“…Populations will be sorted according to fitness values. The SIG consists of inserting an immigration operator based on the creation of a random population and crossing the population concluded since the uniform evolution and the randomly created population [15]. A mutation operator is also used by replacing a sub-vector of the chromosome with another randomly including gene values from the set of chromosome genes [23].…”
Section: Figure 3: Mutation Operatormentioning
confidence: 99%
See 2 more Smart Citations
“…For a long time, parallelism has been used in computer science to solve major scientific problems related to a number of fields that are modeled on the problem of crunch: economics, meteorology, and bioinformatics) in order to be able to generate solutions more quickly [24,25]. Even with the use of GAs as one of the metaheuristic methods, one of these complex problems like the knapsack problem needs huge computational capacities as well as time to solve.…”
Section: Parallel Genetic Algorithm Architecture For Intelligent Systemmentioning
confidence: 99%