\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Machine Reliability Optimization by Genetic Algorithm Approach},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2020-01-15 (revised: 15 January 2020)}
\def\TheID{\makeatother }
\def\TheDate{2020-01-15}
\title{Machine Reliability Optimization by Genetic Algorithm Approach}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Ngnassi Djami Aslain  Brisco}

             \author[2]{Nzie  Wolfgang}

             \author[3]{Doka Yamigno  Serge}

             \affil[1]{  University of Ngaoundere}

\renewcommand\Authands{ and }

\date{\small \em Received: 15 December 2019 Accepted: 2 January 2020 Published: 15 January 2020}

\maketitle


\begin{abstract}
        


To define the reliability network of a system (machine), we start with a set of components arranged in an appropriate topology (series, parallel, or parallel-series), choose the best terms of the ratio performance / cost, and gather by links with the aim to combine them. This process requires a long time and effort, given the very large number of possible combinations, which becomes tedious for the analyst. For this reason, it is essential to use an appropriate optimization approach when designing any product. However, before trying to optimize, it is necessary to have a reliability assessment method. The objective of this paper is to display a meta-heuristic method, which is sustained on the genetic algorithm (GA) to improve the machines reliability. To achieve this objective, a methodology that consists of presenting the functionalities of genetic algorithms is developed. The result achieved is the proposal of a reliability network for the optimal solution.

\end{abstract}


\keywords{reliability, cost, reliability network, topology.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
he fundamental function of a system is to provide its customers with a fairly economical cost, acceptable reliability required. These constraints require an optimal design. In the engineering context, the fundamental interest of manufacturers is to find a balance between the reliability of a system and its cost. These two factors constitute the most important decision variable for optimizing a system. This is generally manifested in minimizing the cost under the constraint of reliability on the one hand, and in improving performance to meet the needs of customers under the constraint of cost on the other.\par
In this area, researchers have developed and improved many methods and algorithms. The set of methods can be divided into two main categories: exact methods, which guarantee to obtain an optimal solution for problems of reasonable size, and approximate methods (heuristics and meta-heuristics), which give good solutions. Quality, without guarantee of optimality, but for the benefit of shorter calculation time.\par
If the exact methods are based on the enumeration, often implicitly, for the search for the set of solutions of the search space, then the approached methods rather require random processes in the exploration of potential solutions, and this to deal with the combinatorial explosion generated when using the exact methods. In this perspective, we are essentially seeking in this work to integrate an efficient and adapted optimization method to solve the problem of optimizing reliability by taking into account the most relevant constraints.\par
Given the large number of configurations that can result from a set of components, the procedure of enumerating all the possible architectures is no longer pleasant. Consequently, it is necessary to opt for an approximate method, which will make it possible to find the solution closest to the optimal solution because it is not obvious to examine all the possibilities.\par
In this perspective, we opted for the method of genetic algorithms as an optimization technique. It is considered an effective meta-heuristic method in the field of dependability. It is inspired by genetic biology and is based on the principle of the search for evolution. It does not guarantee an exact solution, but it generates a solution close to the optimum (Painton and Campbell \hyperref[b0]{[1]}, Levitin and Lisnianski \hyperref[b1]{[2]}). 
\section[{II.}]{II.}\par
The Functioning of the Genetic Algorithm a) Origin and principle Genetic algorithms (GA) are heuristic optimization algorithms based on the principles of natural selection and genetics. The researcher Rechenberg \hyperref[b2]{[3]}, is the first scientist who introduced evolutionary algorithms by publishing his work ''Evolution strategies.'' These algorithms are broadly inspired by Darwin's theory of evolution published in 1859. Next, Holland \hyperref[b3]{[4]} proposed the first genetic algorithms to solve combinatorial optimization problems, and they were also developed by the work of David Goldberg published in 1989 (Goldberg \hyperref[b4]{[5]} and Goldberg \hyperref[b5]{[6]}).\par
The aim of the genetic algorithm is to bring up, from one generation to another, the candidates (potential solutions) most suited to solving the problem. Each generation is made up of a defined number of individuals, these form a population, and each of them represents a point in the search space. Each individual (chromosome) has information coded in the form of a Ngnassi Djami Aslain Brisco ? , Nzie Wolfgang ? \& Doka Yamigno Serge ? chain of characters that analogically constitutes genes. Then the passage from one generation to another is carried out based on the process of evolution by the use of evolutionary operators like selection, crossing, and mutation.\par
Their operating principle is quite simple. From an initial population created at random, composed of a set of individuals (chromosomes), we proceed to the evaluation of their parent qualifications to highlight the best suited, as long as the least effective are rejected. Then, the most qualified individuals are chosen by privileged selection by giving them a chance to reproduce by crossing and mutating via the two operators of crossing and mutation. Then by relaunching this process several times, the optimal solution can be refined by passing from one generation to another (Douiri et al. \hyperref[b6]{[7]}). 
\section[{b) Description of the formalism used}]{b) Description of the formalism used}\par
Clustering is a process that partitions a set of data into meaningful subclasses (clusters or clusters).\par
The convergence of genetic algorithms has been demonstrated for many problems, although optimality cannot be guaranteed. The ability of a genetic approach to find the right solution often depends on the adequacy of the coding, the evolution operators, and the measures of adaptation to the problem being addressed. The method proposed here is based on genetic algorithms (Goldberg \hyperref[b5]{[6]}) and evolutionary strategies  {\ref (Schewefel [8]}). It combines the principle of survival of the ablest individuals and genetic combinations for an elitist research mechanism. The genetic method produces new solutions (children) by combining existing solutions (parents) selected from the population, or by mutation. The central idea is that parent solutions will tend to produce superior child solutions in terms of adaptation so that ultimately a solution obtained is optimal.\par
In this study, we used a genetic method previously defined by Bicking et al. \hyperref[b9]{[10]} with a definition of the chromosome and the operators of selection, combination, and mutation concerned. Unlike genetic algorithms, the genetic method used is designed to minimize and not maximize. This method, like genetic algorithms, is not limited by assumptions about the objective function and research space, such as continuity or differentiability. It uses a population of points simultaneously by contrast with usual methods using only one point. Genetic operators are elitistically improving the search process to find the global optimum. There are more complicated genetic operators, but the basic operators and their various modifications can generally be applied. The choice of these operators depends on the nature of the problem and the performance requirements. The genetic algorithm that we are going to implement is as follows, where the process is applied to iteration k:\par
We will choose, as a stop test in our implementation, a finite number of iterations.\par
It is important to note that the stopping criterion can be several cycles of the algorithm (number of generations), the average of the adaptations of individuals, a convergence factor, etc.\par
An individual represents a vector of decision variable (parameters), and its adaptation is measured by the objective function. The formalism and the genetic operators are detailed below. 
\section[{i. Data coding}]{i. Data coding}\par
The first step is to properly define and code the problem. That step associates with each point of the search space a specific data structure called a chromosome, which will characterize each individual in the population. This step is considered to be the most important step in GA because the success of these algorithms depends heavily on how individuals are coded.\par
There are different choices for coding a chromosome, this choice being a very important factor in the progress of the algorithm so it must be well suited to the problem being addressed:\par
? Binary coding: It is the most used coding. The chromosome is coded by a string of bits (which can take the value 0 or 1) containing all the information necessary to describe a point in space; ? Multi-character coding: this is often more natural.\par
We are talking about multiple characters as opposed to bits. A chromosome is then represented by a series of numbers or characters, each representing a gene; ? Coding in the form of a tree: this coding in tree structure starts from a root (comprising several parts equal to the number of initial individuals), from which one or more children can be derived. The tree then builds up gradually, adding branches to each new generation. ii. Generation of the initial population Each chromosome is the potential result of the optimization problem. We define a chromosome as a chain composed of genes, which are the parameters (decision variables) to find. The value of a gene is called an allele. The possible value of an allele is an integer or a real value. Each gene is created randomly, using equation 1.\par
(1)\par
Where:\par
? j ?\{0;1\} is chosen randomly are the minimum and maximum limits of the allele a j . They are chosen according to the problem to be treated.\par
Each chromosome, called an individual in a haploid representation, can be written: With:\par
m is the number of genes i = 1,..., N and N is the size of the population (number of individuals).\par
All the constraints are taken into account in the initial phase of population creation. When an individual is created, if the constraints are respected, this individual is integrated into the initial population; otherwise, it is not. At the start of the algorithm, the initial population contains individuals.\par
The length of the chromosome m and the size of the population N is two of the four adjustment parameters of the genetic method. 
\section[{iii. Objective function and adaptation}]{iii. Objective function and adaptation}\par
We evaluate the different solutions proposed to treat them according to their relevance and to see which the best are. For this, we use the objective function.\par
This function measures the performance of each individual. To be able to judge the quality of an individual and thus compare him to others. The objective function of our case is to minimize the cost while maximizing reliability.\par
The evaluation of each individual in the population then makes it possible to make the selection. For a system made up of n components in parallel, the reliability to be maximized is given by equation 2.\par
(2)? ? ? ? ? ? ? ? j j j j j l u l a a a a ? ? ? ? ? ? ? ? ? , jj lu aa 1 ,..., ,..., i j m X a a a ?? ? ?? ? ? 1 11 n i i Rr ? ? ? ? ?\par
Where:\par
n is the number of components r i is the reliability of the component i For a parallel-series system, the reliability to be maximized is given by equation 3.\par
(3) Where:\par
p is the number of stages of the system r ij the reliability of the j th element of the i th stage n i is the number of components of the i th stage\par
The cost function to be minimized deducted from the work of (Gutha and Vadlamani \hyperref[b8]{[9]}) for a parallel -series system (machine) with p stages is gave by equation 4.\par
(4)\par
Where:\par
-C i is the cost vector of the components of the X i chromosome p is the number of stages of the machine. 
\section[{iv. Selection of the most suitable individuals}]{iv. Selection of the most suitable individuals}\par
When the entire population is assessed at generation t, individuals are ranked in ascending order of objective function. Then the selection is made. Selection helps to statistically identify the best individuals in a population and eliminate the bad ones from one generation to the next. This operator also gives a chance to the bad elements because these elements can, by crossing or mutation, generate relevant descendants compared to the optimization criterion.\par
The first N × G individuals (the best N × G ) are selected to be parents. G is the third setting parameter of the genetic method. G is called the generation gap. G makes it possible to select a part of the population to provide sufficient genetic material without decreasing the speed of convergence (Goldberg \hyperref[b5]{[6]}). 
\section[{There are different selection techniques:}]{There are different selection techniques:}\par
? Selection by rank: This selection method always chooses the individuals with the best adaptation scores, without allowing chance to intervene; ? Selection by wheel: For each parent, the probability of being selected is proportional to their adaptation to the problem (their score by the fitness function). This selection be imaged by a casino roulette wheel, on which all the chromosomes of the population are placed, the place is given to each of the chromosomes being proportional to its adaptation value. Also, the higher an individual's score, the more likely he is to be selected. We spin the wheel as many times as we want individual sons. The best will be able to be drawn several times, and the worst never; ? Selection by tournament: Two individuals are chosen at random, their adaptation functions are compared, and the best suited is selected.;  
\section[{C}]{C}\par
C X e such that each individual has the same probability P(i) = 1 / N as all other individuals, where N is the total number of individuals in the population; ? Elitism: The passage from one generation to another through the crossing and mutation operators creates a great risk of losing the best chromosomes. Therefore, elitism aims to copy the best (or first -best) chromosome (s) from the current population to the new population before proceeding to the mechanisms of crossing and mutation. This technique quickly improves the solution because it prevents the loss of the most qualified chromosome when passing from one generation to another. 
\section[{v. Crossing}]{v. Crossing}\par
The selected population is divided into N / 2 couples formed randomly. Two parents, and are chosen randomly from the potential parents P 1 and P 1 their genes are combined according to equation 5.\par
(5) Where:\par
? j is a uniform random number, -k = N × G +1,..., N, the k th individual, mode can j = 1,..., m.\par
The newly created individual is then evaluated. If its adaptation is better than that of the worst parent, it is integrated into the population to training the next generation. If it is not the case, we repeat the combination. 
\section[{vi. Mutation of all individuals in the population}]{vi. Mutation of all individuals in the population}\par
The mutation operator is a process where a minor change in the genetic code is applied to an individual to introduce diversity and thus avoid falling into local optima. This operator is applied with a probability P m . P m generally lower than that of the crossing P c . This probability must be low. Otherwise the GA will turn into a random search. algorithm, the parameters N and G must be adjusted with care. The size of the population N affects both the performance and efficiency of the algorithm (Bicking et al. \hyperref[b9]{[10]}). The algorithm is less efficient with very small population sizes. Large population size may contain more interesting solutions and discourage premature convergence towards sub-optimal solutions, but requires more assessments per generation, which can lead to a low convergence rate. The generation gap G determines the proportion of the population that remains unchanged between two generations.\par
It is chosen to select individuals as severely as possible, without destroying the diversity of the population too much. The global strategy used assumes that all the individuals who make up the population, from generation to generation, satisfy all the constraints.\par
The best solution for the latest generation represents the solution to the problem by the defined criteria. 
\section[{III.}]{III.} 
\section[{Application}]{Application}\par
Consider a machine made up of five components mounted in parallel (see Figure 1). Our goal is to define an optimal reliability network, to ensure operation with minimum reliability r min = 0.80 while minimizing the cost of the structure.  Step 1: Data coding We choose binary coding using a 5-bit character string. Bits 1 through 5 represent the components of C 1 through C 5 , respectively. If a component exists in the generated solution, then its? ? ? ? ? ? ? ? 1 2\textbf{1}\par
() j 
\section[{vii. Choosing the best solutions}]{vii. Choosing the best solutions}\par
This choice consists in retaining the solutions which have a lower value of the objective function, and putting them in the population P k+1 . 
\section[{viii. Stopping criterion}]{viii. Stopping criterion}\par
The stopping criterion is evaluated in the current population. If it is filled, the whole population has converged on the solution. Otherwise the reproduction pattern will be repeated. The stopping criterion used in this method expresses that all individuals have converged on the same solution and assumes that evolution is no longer possible, that is to say, that no better solution can be found.\par
The whole strategy is elitist because only the best individuals are selected for survival from one generation to the next and can be the parents of new and better individuals. To ensure convergence of the corresponding bit takes the value "1"; otherwise, it takes the value "0".\par
Step 2: Choice of GA parameters This choice is random while waiting to improve it afterward. The parameters of the GA are as follows:\par
-The size of the population: N = 4 ; -The number of generations: K = 10 ; -The probability of crossing: P c = 0.6 ; -The probability of mutation: P m = 0.01.\par
Step 3: Generation of the initial population We randomly generate a population of 4 noted chromosomes X 1 , X 2 , X 3 and X 4 :  Step 4: Definition of objective function The objective function f to optimize is defined by equation 6. \hyperref[b5]{(6)} With:X 1 = [01001], X 2 = [10110], X 3 = [10011] and X 4 = [11001].\par
r min : the minimum reliability of the structure to be optimized;\par
Step 5: Evaluation of the reliability of each X i chromosome in the population For each X i chromosome generated, the reliability and the cost are evaluated respectively by relations 2 and 4. So:\par
----\par
Step 6: Selection of the most suitable chromosomes\par
The best chromosomes in terms of cost in descending order are: X 1 , X 2 , X 3 and X 4 .\par
We select the chromosomes X 1 , X 2 and X 3 for reproduction and we eliminate the chromosome X 4 because it is the worst as far as cost is considered.\par
Step 7: Crossing\par
We cross a couple among the selected chromosomes with a crossover rate of 0.6 to form new children. Consider the couple (X 1 , X 2 ):\par
Step 8: Mutation\par
We do a random draw of a single chromosome gene X' 1 , X' 2 and X 3 ; then the selected bit will be mutated with a mutation probability of 0.01. Consider the second bit of the chromosome X' 2 :\par
Step 9: Substitution\par
We are replacing the new population with the new chromosomes. Chromosomes X 3 and X 4 will is eliminated because they are the least suitable, and the chromosome X 1 and X 2 will be kept .After all, they are the best qualified among the individuals of the population. So the new population will be made up of chromosomes X 1 , X 2 , X' 1 and X'' 2 .X 1 = [01001], X 2 = [10110], X' 1 = [01010] and X'' 2 = [11101].\par
Step 10: Repeat steps 4 to 9\par
The algorithm stops either after the reproduction of 16 generations or when we notice that the solution does not improve after a defined number of generations.\par
Step 11: Optimal solutions -The corresponding chromosome that optimize objective function is:\par
-The optimum reliability and costs for each solution are:\par
By considering the components selected by the genetic algorithm in the previous optimal solutions, we generate all the possible paths (connections) between the component of the machine. In solution 1 (X a chromosome) , we retain the components in parallel C 1   and C 5 ; in solution 2 , we retain the components C 1 and C 2 (thus defining a path); in solution 3, we retain the components C 1 and C 3 (defining a path) and from end to end until the last solution ( X g chromosome), the last path connecting the components C 3 and C 4 is shown. From where the network of optimal reliability of the machine is given by Figure 3. By evaluating the overall reliability of the reliability network, we obtain a reliability of 0.88, higher than the minimum reliability set. Similarly, by evaluating the overall cost of the machine by applying relation 4, for the reliability network we obtain a cost of 88.75, which is much lower than the overall cost generated by the initial system, which is 103.75. Objectively, the reliability network has favored cost reduction on the one hand reliability increase on the other.? ? ? ð??" F E ? ? ii i min minimize f(X ) = C(X ) s.t r X r ? ? ?10 0 10 XX X X ? ?? ? ?? ? ?? ? ? ? ? ? ? ? ? ? ? ' '' 22 1 101 1 0 01 11 XX ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 10001 , 11000 , 10100 , 01001 , 00101 , 01010 a b c d e f X X X X X X ? ? ? ? ? ? ? ? 0. 
\section[{IV.}]{IV.} 
\section[{Conclusion}]{Conclusion}\par
Having completed the writing of this paper, which concerns the optimization of the reliability of a system by the genetic algorithm, it appears that the general objective has been achieved. Indeed, through the functionality of genetic algorithms, implemented on a structure with five components, we were able to reduce the cost and increase the reliability of the parallel structure. However, although the genetic algorithm is easy to implement, it might require an infinite number of iterations to the best approach of optimal solution. This would make the algorithm less robust. In perspective for this work, it would be wise to develop or implement another meta-heuristic that would not require a large number of iterations. 
\section[{Data Availability}]{Data Availability}\par
The data needed to support these results are available in the text, specifically in Table \hyperref[tab_3]{1}. Conflicts of Interest All authors declare that there are no conflicts of interest regarding the publication of this paper.     \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_3}Table 1}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.39390243902439026\textwidth}P{0.31097560975609756\textwidth}P{0.1451219512195122\textwidth}}
Components\tabcellsep Reliability\tabcellsep Cost\\
????\tabcellsep 0.95\tabcellsep 15\\
????\tabcellsep 0.97\tabcellsep 17\\
????\tabcellsep 0.9\tabcellsep 14\\
????\tabcellsep 0.89\tabcellsep 12\\
??ð??"ð??"\tabcellsep 0.96\tabcellsep 16\end{longtable} \par
 
\caption{\label{tab_4}Table 1 :}\end{figure}
 			\footnote{© 2020 Global Journals} 			\footnote{Machine Reliability Optimization by Genetic Algorithm Approach} 		 		\backmatter   			 
\subsection[{Acknowledgments}]{Acknowledgments}\par
This work was funded by the authors of the paper and was carried out in the Department of Fundamental Sciences and Engineering Techniques at the Chemical Engineering and Mineral Industries School at the University of Ngaoundere.  			  			  				\begin{bibitemlist}{1}
\bibitem[Holland ()]{b3}\label{b3} 	 		\textit{Adaptation in natural and artificial systems},  		 			J H Holland 		.  		1975. University of Michigan press.  	 
\bibitem[Douiri et al. ()]{b6}\label{b6} 	 		\textit{Course of Heuristic and Metaheuristic Exact Resolution Methods},  		 			S M Douiri 		,  		 			S Elbarnoussi 		,  		 			H Lakhbab 		.  		2013.  		 			Mohammed V University, Faculty of Sciences of Rabat, Morocco, Mathematics, Computer Science and Applications Research Laboratory 		 	 
\bibitem[Reichenberg ()]{b2}\label{b2} 	 		‘Cybernetic solution path of an experimental poblem'', Library Translation 1122’.  		 			I Reichenberg 		.  	 	 		\textit{Royal Aircraft Establishment}  		1965.  	 
\bibitem[Painton and Campbell ()]{b0}\label{b0} 	 		‘Genetic algorithm in optimization of system reliability’.  		 			L Painton 		,  		 			J Campbell 		.  	 	 		\textit{IEEE Trans Reliab}  		1995. 44 p. .  	 
\bibitem[Goldberg ()]{b4}\label{b4} 	 		\textit{Genetic algorithms},  		 			D Goldberg 		.  		0-201-15767-5, 1989a. Addison Wesley, ISBN.  	 
\bibitem[Goldberg ()]{b5}\label{b5} 	 		\textit{Genetic algorithms in search, optimization and machine learning},  		 			D Goldberg 		.  		1989b. Addison Wesley.  	 
\bibitem[Bicking et al. ()]{b9}\label{b9} 	 		‘Global optimization by artificial life: a new technique using genetic population evolution’.  		 			F Bicking 		,  		 			C Fonteix 		,  		 			J P Corriou 		,  		 			I Marc 		.  	 	 		\textit{RAIRO-Operations Research}  		1994. 28  (1)  p. .  	 
\bibitem[Gutha and Vadlamani ()]{b8}\label{b8} 	 		‘Modified Harmony Search Applied to Reliability Optimization of Complex Systems’.  		 			J Gutha 		,  		 			R Vadlamani 		.  	 	 		\textit{Advances in Intelligent Systems and Computing 382},  				2016.  	 
\bibitem[Schewefel ()]{b7}\label{b7} 	 		\textit{Numerical Optimization of computer models},  		 			H P Schewefel 		.  		1981. Editions Wiley.  	 
\bibitem[Levitin and Lisnianski ()]{b1}\label{b1} 	 		‘Optimizing survivability of vulnerable series-parallel multi-state systems’.  		 			G Levitin 		,  		 			A Lisnianski 		.  	 	 		\textit{Reliability Engineering and System Safety}  		2003. 79 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
