Optimal allocation problem using a genetic algorithm

Optimal allocation problem using a genetic algorithm

0.00 Avg rating0 Votes
Article ID: iaor200968888
Country: United Kingdom
Volume: 5
Issue: 2
Start Page Number: 211
End Page Number: 228
Publication Date: May 2009
Journal: International Journal of Operational Research
Authors: ,
Keywords: heuristics: genetic algorithms
Abstract:

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 Universal Generating Function 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 yield better result.

Reviews

Required fields are marked *. Your email address will not be published.