A Novel Genetic Algorithm Developed on a Reduced Search Space for Optimal Redundancy Allocation in Multi-State Series-Parallel Systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

A Novel Genetic Algorithm Developed on a Reduced Search Space for Optimal Redundancy Allocation in Multi-State Series-Parallel Systems

Résumé

We consider the redundancy allocation problem (RAP) for multi-state series-parallel systems (MSSPSs),with the objective of maximizing system availability under cost constraint. We show that, to obtain the global optimum,an evolutionary algorithm(EA)only needs to search within a subset of the feasible region.To exploit this, a repair algorithm is designed in a genetic algorithm (GA),to ensure it generates individuals only within the boundary subset,without increasing its computational complexity. We also add a novel mutation operator to improve local search efficiency, via generalizing the local search operators that appear in previous MSSPS RAP literature. In benchmark test, our modified GA out performs the comparative algorithms and finds a solution better than the published one.
Fichier principal
Vignette du fichier
M09_098_FP.pdf (501.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01238994 , version 1 (07-12-2015)

Identifiants

  • HAL Id : hal-01238994 , version 1

Citer

Mu-Xia Sun, Yan-Fu Li, Enrico Zio. A Novel Genetic Algorithm Developed on a Reduced Search Space for Optimal Redundancy Allocation in Multi-State Series-Parallel Systems. ESREl 2015, Sep 2015, Zurich, Switzerland. ⟨hal-01238994⟩
161 Consultations
100 Téléchargements

Partager

Gmail Facebook X LinkedIn More