Optimal allocation problem using genetic algorithm
type: Item
instance of: scholarly article
title: Optimal allocation problem using genetic algorithm
zbMATH Open document ID: 1169.90473
DOI: 10.1504/IJOR.2009.025008
author: Thatimakula Vasanthi
author: G. Arulmozhi
published in: International Journal of Operational Research
publication date: 2009-09-13T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5603395
zbMATH Keywords: linear consecutively connected systems (LCCS)
zbMATH Keywords: multi-state elements
zbMATH Keywords: system reliability
zbMATH Keywords: universal generating function (UGF)
zbMATH Keywords: gas
zbMATH Keywords: genetic algorithms
zbMATH Keywords: permutation crossover
zbMATH Keywords: allocation optimisation
MaRDI profile type: Publication
full work available at URL: ijor.2009.025008
OpenAlex ID: W1991678982
description: scientific article; zbMATH DE number 5603395