Skip to Main content Skip to Navigation
Conference papers

Asymptotic availability allocation with genetic algorithms

Abstract : This paper proposes a genetic algorithm to allocate the availability goal to a parallel-serial system components. The problem is formulated as a multi-objective optimization problem in continue and discrete variables. It is a combinatorial optimization that is NP-hard, so genetics algorithms are suitable for attacking such a problem. We use the weighing approach and exact penalty method to relax the problem constraints. An experimental factorial plan is proposed to analyze each parameter's influence on the genetic algorithm's results. From this factorial plan, we have indications on how to choose the parameters of our algorithm. The approach used is relevant for genetics algorithms users. The results that we obtain are suitable and enable us to show how powerful are genetics algorithms. A numerical example is given to assess the algorithm.
Complete list of metadata

https://hal.univ-lorraine.fr/hal-03088701
Contributor : Kondo Adjallah <>
Submitted on : Saturday, December 26, 2020 - 11:05:25 PM
Last modification on : Friday, August 27, 2021 - 3:14:08 PM

Identifiers

  • HAL Id : hal-03088701, version 1

Collections

Citation

Charles A.O. Elegbede, Kondo Hloindo Adjallah. Asymptotic availability allocation with genetic algorithms. MCS'2000 the International Conference on Montecarlo Simulation, MCS'2000 the International Conference on Montecarlo Simulation, Jun 2000, Monaco, Monaco. pp.97-104. ⟨hal-03088701⟩

Share

Metrics

Record views

36