Optimal allocation problem using genetic algorithm (Q840586)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal allocation problem using genetic algorithm |
scientific article; zbMATH DE number 5603395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal allocation problem using genetic algorithm |
scientific article; zbMATH DE number 5603395 |
Statements
Optimal allocation problem using genetic algorithm (English)
0 references
13 September 2009
0 references
Summary: This paper proposes a genetic model to study the reliability optimisation in a linear consecutively connected system (LCCS) by allocating \(M\) statistically independent multi-state elements with different characteristics to the first \(N\) positions. The system is reliable if the first position is connected with the \((N+1)\)th position. The reliability of LCCS is obtained using the universal generating function (UGF) technique. The optimal allocation is obtained by means of genetic algorithm. In our work, for the one-to-one allocation, the permutation crossover is used, which reduces the complexity of the problem and also yields a better result.
0 references
linear consecutively connected systems (LCCS)
0 references
multi-state elements
0 references
system reliability
0 references
universal generating function (UGF)
0 references
gas
0 references
genetic algorithms
0 references
permutation crossover
0 references
allocation optimisation
0 references