Optimal allocation problem using genetic algorithm
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.
- A note on a reliability redundancy allocation problem using a tuned parameter genetic algorithm
- Optimal allocation of multi-state elements in linear consecutively connected systems with vulnerable nodes.
- Genetic algorithm for chance constrained reliability stochastic optimisation problems
- Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach
- A genetic algorithm for reliability-oriented task assignment in a distributed system
- Optimal allocation of multi-state elements in linear consecutively connected systems with vulnerable nodes.
- Optimization and phenotype allocation
- A Birnbaum-importance based genetic local search algorithm for component assignment problems
- Memory and learning in metaheuristics
- A genetic algorithm for the solution of the problem of optimal file allocation among computing networks nodes
- Uneven allocation of elements in linear multi-state sliding window system
This page was built for publication: Optimal allocation problem using genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840586)
