\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={A Novel Hybrid Symbiotic Organism Search for Solving Generator Maintenance Scheduling in a Power System},
 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{2017-01-15 (revised: 15 January 2017)}
\def\TheID{\makeatother }
\def\TheDate{2017-01-15}
\title{A Novel Hybrid Symbiotic Organism Search for Solving Generator Maintenance Scheduling in a Power System}
\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]{G.  Balaji}

             \affil[1]{  Government Polytechnic College}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2016 Accepted: 3 January 2017 Published: 15 January 2017}

\maketitle


\begin{abstract}
        


The generator maintenance scheduling (GMS) problem is a high-dimensional complex constrained non linear optimization problem that determines the schedule for carrying out planned preventive maintenance on generating units in a power system. Here, GMS is modelled from the perspective of vertically integrated utility system subject to different set system and operational constraints. Over the last few decades, a number of solution techniques, including nature inspired algorithms, have been developed and proposed to solve this problem. In this paper, a new nature inspired algorithm; symbiotic organism search is proposed to solve the generator maintenance scheduling problem. To examine the efficiency of the proposed algorithm, two test systems, 4-units and 22-units system are considered. The simulation results are compared with that of other existing algorithms, which reveal that the proposed method has merit in terms of solution quality.

\end{abstract}


\keywords{generator maintenance scheduling, hybrid symbiotic organism search, overall operational cost minimization, optimal generator maintenance schedule.}

\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& 	 	 		 \par
-Fitness function to be minimized 
\section[{I. Introduction}]{I. Introduction}\par
he generator maintenance scheduling problem is a large scale, stochastic, nonlinear combinatorial optimization problem which is a sub problem of integrated long term operations planning problem. The objective of the GMS problem is to find the exact time interval for preventive maintenance of power generating units with the intention of minimizing the operating cost, maximizing the system reliability and extending the life time of it. In earlier literature, mathematical approaches have been used for solving GMS \hyperref[b0]{[1,}\hyperref[b1]{2,}\hyperref[b2]{3]}. These methods are limited to small size systems having few numbers of generators. For the case of large size systems, the number of intermediate solutions exponentially increases known as curse of dimensionality that restricts the use of mathematical methods to solve GMS. Local search methods such as Simulated annealing (SA) \hyperref[b3]{[4]}, Tabu search (TS) algorithm \hyperref[b4]{[5]} has been proposed for the solution of GMS problem. For obtaining timetable for the purpose of maintenance of generators, nature inspired algorithms like Particle swarm optimization (PSO) \hyperref[b5]{[6]}, Artificial bee colony (ABC) algorithm \hyperref[b6]{[7]}, Ant colony optimization (ACO) \hyperref[b7]{[8]}, Shuffled frog leaping algorithm (SFLA) \hyperref[b8]{[9]} have been used. Evolutionary algorithms such as Genetic algorithm (GA) \hyperref[b9]{[10]}, Evolutionary programming (EP) \hyperref[b10]{[11]}, Differential evolution (DE) \hyperref[b11]{[12]} The generator maintenance scheduling (GMS) problem is a high-dimensional complex constrained non linear optimization problem that determines the schedule for carrying out planned preventive maintenance on generating units in a power system. Here, GMS is modelled from the perspective of vertically integrated utility system subject to different set of system and operational constraints. Over the last few decades, a number of solution techniques, including nature inspired algorithms, have been developed and proposed to solve this problem. In this paper, a new nature inspired algorithm; symbiotic organism search is proposed to solve the generator maintenance scheduling problem. To examine the efficiency of the proposed algorithm, two test systems, 4-units and 22-units system are considered. The simulation results are compared with that of other existing algorithms, which reveal that the proposed method has merit in terms of solution quality.\par
and other meta heuristic approaches such as Harmony Search (HS) \hyperref[b12]{[13]}, Teaching Learning Based Optimization (TLBO) \hyperref[b13]{[14]} have also been applied for the solution of GMS.\par
In this paper, to solve the GMS problem, a new nature inspired algorithm; Symbiotic Organism Search (SOS) \hyperref[b14]{[15]} is proposed. To get exact production cost that is to be spent by generating company to meet the weekly active peak load demand, Lagrange multiplier method (LMM) is hybridized with SOS, which helps SOS in finding minimum production cost based maintenance schedule for GMS. To examine the efficacy of the proposed approach, a small size system having 4 generating units and a medium size system having 22 generating units are considered and simulation results are compared with that obtained using well admired techniques such as PSO and TS.\par
The paper is organized as follows. In section 2, GMS problem formulation is discussed. Section 3 presents the detailed explanation of proposed SOS for solving GMS. The simulation results and discussions of using the proposed technique to solve GMS for 4-and 22-units system are included in Sections 4. Section 5 ends with the concluding remarks and future scope of the work. 
\section[{II. GMS Problem Formulation}]{II. GMS Problem Formulation}\par
The cost objective considered here is to minimize the overall operational cost over a planning horizon is stated as( ) ?? ? = = = + + + = T t I i I i it i it it i it i it i U v P H U c P b P a H F 1 1 1 2 . . . . .\textbf{(1)}\par
The first part of (1) is production cost and second part signifies the variable operation and maintenance cost. The fixed maintenance cost is constant and does not have influence on maintenance schedule and hence it is neglected in the formulation.\par
The solution obtained for the GMS problem must satisfy the following set of system and operational constraints.? ? ? ? + = = otherwise M S S t U i i i it 1 1 ,..., 0\textbf{(2) 1 1 , 2 1 1 1}= ? ? + = i i i M S S t t i U (3) 1 1 2 M S S + ? (4) ( ) ? ? = = ? ? ? ? ? ? ? ? ? I i I i t i it i PD P U R 1 1 max 1 . (\textbf{5})max min i it i P P P ? ? (6) ? = ? I i t it it PD U P 1 .\textbf{(7)}\par
The constraint (2) is the maintenance window constraint which ensures that once maintenance of the unit i begins, the work have to be continued without any break off for the time period that is exactly equal to maintenance duration of unit i. To ensure no two generators is maintained by same crew, it is stated in terms of U it variables of second unit i2 as in \hyperref[b2]{(3)}. Crew constraint restricts maintenance of unit 1 and 2 in unison. In some situation, the maintenance works on some of the power producing units should be initiated only after the completion of maintenance activities of other generators. This can be achieved with the inclusion of precedence constraint. For instance, if maintenance of unit '2' is to be started only after the completion of maintenance of unit '1', then this constraint is given by (  {\ref 4}). In every sub-period of planning horizon, the sum of capacity of generating units that are switched off for maintenance must be lesser than gross reserve in that sub-period. This can be achieved by using resource constraint as given in \hyperref[b4]{(5)}. Constraint (6) guarantees the real power output from every generator is within its minimum and maximum limits. Load balance constraint is given by \hyperref[b6]{(7)}. 
\section[{III. Proposed Solution Methodology}]{III. Proposed Solution Methodology}\par
The GMS problem have two types of variables; continuous and binary integer variables. The continuous variables denote the power output from the online generating units and binary integer variables indicates the on/off status of power producing units. Here, as in most of the literature, the staring period for maintenance of each generator is considered as variables which are integers. The number of integer variables is exactly equal to number of generators present in the system. To solve the problem, symbiotic organism search (SOS) a population based new meta-heuristic nature inspired algorithm is proposed. The SOS is initially developed by Cheng and Prayogo in 2014 \hyperref[b14]{[15]}. Basically SOS has been proposed for solving the problem in continuous domain. This algorithm requires only common control parameter such as population size and maximum number of generations to be tuned and does not have any algorithm specific control parameters. It mimics the symbiotic interaction strategies adopted by two organisms to stay alive and propagate in the ecosystem. To evolve to a good solution, SOS uses three important phases; mutualism, commensalism and parasitism. The flowchart of the SOS is shown in Fig.  {\ref 1}. Year 2017 F 
\section[{Fig. 1: Flowchart of Symbiotic Organism Search}]{Fig. 1: Flowchart of Symbiotic Organism Search}\par
To deal with integers, a rounding off operator is used in SOS called integer coded symbiotic organism search (ICSOS). The detailed explanation of proposed solution methodology for solving GMS problem is given below. 
\section[{a) Hybrid SOS for Cost based GMS}]{a) Hybrid SOS for Cost based GMS}\par
The cost objective is given in \hyperref[b0]{(1)}. The aim is to obtain a maintenance schedule for the GMS problem such that the overall operation cost should be minimized. To obtain the exact production cost involved to meet the weekly peak load demand, a LMM is hybridized with ICSOS called hybrid SOS (HSOS). The following are the steps involved in HSOS for solving cost based GMS.\par
i. Initialization Initialize NP population called ecosystem. Each vector of ecosystem called organism represents one candidate solution of the problem. Each organism (X k ) has integers decision variables equal to number of generators present in the system which is generated randomly between every generator's earliest and latest allowed starting period for maintenance as follows( ) ( ) ( ) ( ) k Ei k Li k Ei k i S S random S round X ? + = . 1 , 0\textbf{(8)}\par
The integer variables are checked for precedence and crew constraints. If any of the above constraint is violated for a particular generator, the corresponding integer variable is chosen randomly until the constraints are satisfied and then the integer variables are checked for maintenance window constraint. After satisfying all the constraints, the status of each unit is set at '0' from the starting period up to its corresponding maintenance duration period to indicate that the unit i is switched off for preventive maintenance and '1' during other periods. The LMM is used to achieve optimal generation schedule from the online generators in every week to meet the weekly load demand as follows.\par
Step 1: With initial value of ?, power output from each committed generator (P i ) in sub-period t can be calculated usingi i it c b P 2 ? = ? (9)\par
The generated output power is checked to satisfy constraint \hyperref[b5]{(6)}.\par
Step 2: The change in power output (?P) can be calculated using Step 3: The change in ? (??) can be found as follows 
\section[{No}]{No}? = ? = ? NCG i i K K c P 1 2 1 ? (11)\par
Step 4: The new value of ? for the next iteration (K+1) can be found by adding change in ? with previous value of ? as follows1 1 + + ? + = K K K ? ? ? (12)\par
The above steps are repeated until ?P becomes zero. Thus constraint \hyperref[b6]{(7)} is satisfied. The fitness function of the GMS problem to be minimized by HSOS is ( )? ? ? = = = + + + = T t NC nc nc nc I i it i it i it i CV U c P b P a H 1 1 1 2 . . ? ?\textbf{(13)}\par
ii. Mutualism Phase In mutualism phase, two participating organisms of the ecosystem get benefited. In SOS, two organisms X y and X z are selected. They interacts each other with the aim of increasing mutual survival advantage in the ecosystem. The new solution after mutual relationship is given by( ) ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? + = 1 . 2 . 1 , 0 BF X X X random round X X z y best y new y (14) ( ) ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? + = 2 . 2 . 1 , 0 BF X X X random round X X z y best z new z (15)\par
where X best is the best organism in the ecosystem which is used in SOS to model the highest degree of adaptation, that is the objective of both organisms. After creating the starting period for maintenance of each generator using equations (  {\ref 14}) and (  {\ref 15}) they are checked for any constraints violation. If all the constraints are satisfied, the status of each unit is set at '0' from the starting period up to its corresponding maintenance duration period to indicate that the unit i is taken out for preventive overhauling work and '1' during other periods. The minimum production cost for new organisms that denotes the starting period for maintenance of thermal units is calculated with the help of LMM. The fitness function is calculated for new organisms using equation \hyperref[b12]{(13)}. If these organisms have better fitness, the current organism is replaced by the new one.\par
iii. Commensalism Phase During this phase, an organism X y gets benefited by interacting with randomly generated another organism X z in the ecosystem. But X z is neither suffered nor benefited. A new solution of X y is determined based on the commensalism operation among the organisms X y and X z , which can be expressed as( ) ( ) ( ) z best y new y X X rand round X X ? ? + = . 1 , 1\textbf{(16)}\par
Once the new organism that indicates the starting period for maintenance of power generating units is determined, it is checked in order to satisfy constraints (2) - \hyperref[b4]{(5)}. After satisfying all the constraints, the status of each unit is set at '0' from the starting period up to its corresponding maintenance duration period to indicate that the unit i is taken out for planned preventive maintenance and '1' during other periods.\par
Then LMM is used to obtain optimum generation schedule from the online generators in every sub-period to meet the weekly peak load demand with minimum production cost. The fitness function is calculated for new organisms using equation \hyperref[b12]{(13)}. The new organism X y,new is accepted, if it has better fitness, than the current organism.\par
iv. Parasitism Phase In this phase, a parasite vector X y,new is created in the search space by duplicating organism X y and its dimensions are perturbed using a random number as follows ( )  {\ref (} )y new y X random round X . 1 , 0 , =\textbf{(17)}\par
The parasite vector that indicates the starting period for maintenance of generating units is checked in order to satisfy constraints (2) - \hyperref[b4]{(5)}. After satisfying all the constraints, the status of each unit is set at '0' from the starting period up to its corresponding maintenance duration period to indicate that the unit i is taken offline for maintenance and '1' during other periods. Then LMM is used to obtain optimum generation schedule from the online generators in every sub-period to meet the weekly peak load demand with minimum production cost thus satisfying generator limit and load balance constraints given by equations (  {\ref 6}) and \hyperref[b6]{(7)}. The fitness function is calculated for new organisms using equation ( \hyperref[formula_9]{13}). An organism X z is chosen randomly from the ecosystem that serves as a host for the parasite vector X y,new . If the parasite vector has better fitness function value, then it occupies the space of its corresponding host by killing them. The above phases are repeated until maximum number of generations. 
\section[{IV. Simulation Results and Discussions}]{IV. Simulation Results and Discussions}\par
In order to prove the superiority of the proposed HSOS algorithm, two test systems; one is small system having 4 generators and another one is medium size system having 22 power generating units are considered \hyperref[b4]{[5,}\hyperref[b11]{12]}. In the proposed approach, Lagrange Multiplier method is hybridized with ICSOS in order to solve large scale generator maintenance scheduling problem. In HSOS approach, ICSOS tries to find an optimal starting period for maintenance of power generating units with the help of LMM which tries to economically dispatch the available generation from committed generators to meet the weekly peak active load demand with minimum production cost. The program is developed using MATLAB on a personal computer with 3 GHz core i5 CPU. The simulation results are compared with that achieved via particle swarm optimization scheme. 
\section[{a) Test System 1: 4 Units System}]{a) Test System 1: 4 Units System}\par
There are 4 thermal generating units to be maintained within a planning period of 8 weeks. Among 4 generating units, due to precedence constraint, the maintenance of unit 1 must be completed before the starting of maintenance of unit 2. Due to crew constraint, units 1 and 2 should not be under maintenance simultaneously. The generator data is given in \hyperref[b11]{[12]}. The gross reserve in every week can be calculated by taking difference between installed capacity and load demand in that week. The weekly peak load data is given in Table \hyperref[tab_1]{1}. In order to compare the results of proposed HSOS and mathematical approach assisted particle swarm optimization (MAPSO) \hyperref[b11]{[12]}, the population size and maximum number of generations for both the algorithms are set at 10 and 500 respectively. Since the test system 1 is a small system, both the algorithms produce the same maintenance schedule. Table  {\ref 2} shows the maintenance schedule of 4 units system. Here, '0' indicates the unit is taken out for maintenance and '1' indicates that the unit is available to serve the load. From the table, it can be seen that unit 1 and 2 are not under maintenance in unison, thereby satisfying crew constraints. Also, the maintenance of unit 2 begins only after the completion of maintenance of unit 1, thereby satisfying precedence constraint. In Table  {\ref 2}, it is clear that each generator is under maintenance only once during the planning period and is equal to corresponding maintenance duration week, thereby satisfying maintenance window constraint. 
\section[{Table 2: Maintenance Schedule of 4 Units System}]{Table 2: Maintenance Schedule of 4 Units System}\par
Unit/Week 1 2 3 4 5 6 7 81 1 1 0 0 0 0 1 1 2 1 1 1 1 1 1 0 0 3 0 0 1 1 1 1 1 1 4 1 1 1 1 1 1 0 1\par
Fig.  {\ref 2}. shows the capacity on maintenance in every week. From the figure, it can be seen that, in every week, the capacity of units that are taken out for maintenance is lesser than the gross reserve in that week, thereby satisfying resource constraint. 
\section[{Fig. 2: Capacity on Maintenance}]{Fig. 2: Capacity on Maintenance}\par
Table \hyperref[tab_2]{3} shows the power output from online generators obtained using LMM. From the table, it can be seen that power output from committed generators are within their lower and upper bounds, thereby satisfying generator limit constraint. The sum of the power output from available generators in every week is exactly equal to corresponding active power load demand, thus satisfying load balance constraint. For the maintenance schedule of 4 unit system that is obtained through Tabu Search (TS) algorithm \hyperref[b4]{[5]}, the authors have not given the overall production cost. For the same schedule, using LMM the overall operation cost is found. Table \hyperref[tab_3]{4} shows the comparison of overall operational cost between proposed method with other existing methods. The available reserve in every week can be calculated by taking difference between installed capacity and sum of capacity on maintenance and weekly load demand. The minimum reserve obtained for the above maintenance schedule is 225 MW in 2 nd week. 
\section[{Global}]{Global} 
\section[{b) Test System 2: 22 Units System}]{b) Test System 2: 22 Units System}\par
In this system, there are 22 generating units that have to be maintained once within a planning horizon of one year. The planning period is divided into 52 subperiods (weeks). The generator data is provided in \hyperref[b11]{[12]}. The weekly load data is given in Fig.  {\ref 3}. 
\section[{Fig. 3: Load Data of 22 units system}]{Fig. 3: Load Data of 22 units system}\par
Due to precedence constraint, units 2 and 5 should be taken out for maintenance before the commencement of maintenance of units 3 and 6 respectively. Due to crew constraints, units 15 and 16, units 21 and 22 should not be under maintenance at the same time.\par
To make the comparison between proposed HSOS and MAPSO, population size and maximum number of iterations are fixed at 50 and 2500 respectively. The convergence characteristics of 22 units system is shown in Fig. \hyperref[fig_1]{4}. From the characteristics, it can be seen that though HSOS have speed of convergence lower than MAPSO, it produces better maintenance schedule in terms of overall operational cost which includes production as well as variable operation and maintenance costs than MAPSO. Table  {\ref 5} and 6 shows the maintenance schedule obtained through proposed HSOS algorithm and MAPSO. From Table \hyperref[tab_5]{5 and 6}, it can be seen that in both the schedules, each unit is taken out for maintenance only once during the planning horizon and is under maintenance without any interruption for the period equal to corresponding maintenance duration weeks. Thus, the maintenance window constraint gets satisfied. The gross reserve in every week is given in \hyperref[b4]{[5]}. In every week, the capacity on maintenance is lesser than the gross reserve in that week. Thus resource constraint is satisfied. In Table  {\ref 5} and 6, it is evident that the maintenance on units 2 and 5 gets completed before the starting of maintenance on units 3 and 6 respectively satisfying precedence constraint. Also units 15 and 16, units 21 and 22 are not under maintenance in same duration satisfying crew constraint.\par
The comparison of overall operational cost for 22 units system satisfying generator limit and load balance constraints are given Table \hyperref[tab_4]{7}.  
\section[{V. Conclusion}]{V. Conclusion}\par
A new nature inspired algorithm for the optimization of generator maintenance scheduling problem in vertically integrated system is presented in this paper. In the proposed approach, conventional lambda iteration approach or Lagrange Multiplier method is hybridized with integer coded symbiotic organism search algorithm. The lambda iteration approach assists symbiotic organism search algorithm in finding optimal starting period for maintenance of generating units. The proposed approach provides a feasible maintenance schedule for the generating units by considering minimization of overall generator operation cost as objective which includes production and variable operation and maintenance cost while satisfying system and operational constraints. The proposed method is validated by considering two test systems. The superiority of the proposed HSOS algorithm is demonstrated by comparing the results with the results obtained from MAPSO algorithm. The results conclude that both HSOS and MAPSO are well suited for solving generator maintenance scheduling of small system. For solving large scale generator maintenance scheduling problem, HSOS outperforms MAPSO in terms of finding the overall generation operation cost. Thus, test results reveal the capability of the proposed algorithm in finding the optimal solution for the GMS problem. The proposed approach can be extended for the solution of GMS problem in the competitive environment without any difficulty.  \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-2.png}
\caption{\label{fig_1}Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.19119629317607412\textwidth}P{0.27354675652906485\textwidth}P{0.08951137320977252\textwidth}P{0.05299073294018534\textwidth}P{0.2427548441449031\textwidth}}
\tabcellsep \tabcellsep \multicolumn{2}{l}{P it}\tabcellsep -Power output from generating unit i in sub-\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{period t, MW}\\
\tabcellsep \tabcellsep P i\tabcellsep min.\tabcellsep -Minimum limit generating unit i, MW\\
\tabcellsep \tabcellsep P i\tabcellsep max.\tabcellsep -Maximum limit generating unit i, MW\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{R i}\tabcellsep -Rating of unit i\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{U it}\tabcellsep -State variable equal to 0 if the unit i in sub-\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{period t is offline for maintenance and 1 otherwise}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{S Ei}\tabcellsep -Earliest period in which maintenance of unit i\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{can start}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{S Li}\tabcellsep -Latest period in which maintenance of unit i\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{can start}\\
\tabcellsep \tabcellsep S i\tabcellsep -Starting period of maintenance of unit i ? [S Li ,\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{S Ei ]}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{M i}\tabcellsep -Maintenance duration of unit i\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{PD t}\tabcellsep -Active power load demand in week t\\
\multicolumn{2}{l}{Keywords: generator maintenance scheduling, hybrid symbiotic organism search, overall operational cost}\tabcellsep ? ?\tabcellsep -Penalty factor\\
\multicolumn{2}{l}{minimization, optimal generator maintenance schedule.}\tabcellsep \\
\multicolumn{2}{l}{Nomenclature}\tabcellsep \\
i\tabcellsep -Power generating unit index\tabcellsep \\
I\tabcellsep -Total number of generating units\tabcellsep \\
t\tabcellsep -Time period index (week)\tabcellsep \\
T\tabcellsep -Total number of sub periods (weeks) in the\tabcellsep \\
\multicolumn{2}{l}{planning horizon}\tabcellsep \\
nc\tabcellsep -Constraint index\tabcellsep \\
NC\tabcellsep -Total number of constraints\tabcellsep \\
k\tabcellsep -Population index\tabcellsep \\
K\tabcellsep -Iteration index in Lagrange Multiplier method\tabcellsep \\
NP\tabcellsep -Population Size\tabcellsep \\
\multicolumn{2}{l}{a i , b i , c i -Fuel cost coefficients of unit i}\tabcellsep \\
CV\tabcellsep -Constraint violation\tabcellsep \\
v i\tabcellsep -Variable operation and maintenance cost of\tabcellsep \\
\multicolumn{2}{l}{unit i in \$/MWh}\tabcellsep \\
H\tabcellsep -Number of hours in a sub-period (week) = 168\tabcellsep \\
X\tabcellsep -Vector of variables\tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.7216981132075472\textwidth}P{0.016037735849056604\textwidth}P{0.016037735849056604\textwidth}P{0.016037735849056604\textwidth}P{0.016037735849056604\textwidth}P{0.016037735849056604\textwidth}P{0.016037735849056604\textwidth}P{0.016037735849056604\textwidth}P{0.016037735849056604\textwidth}}
Week\tabcellsep 1\tabcellsep 2\tabcellsep 3\tabcellsep 4\tabcellsep 5\tabcellsep 6\tabcellsep 7\tabcellsep 8\\
\multicolumn{9}{l}{Load (MW) 249 265 276 279 256 307 187 295}\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.85\textwidth}}
Year 2017\\
71\\
of Researches in Engineering ( ) Volume XVII Issue VI Version I F\\
Journal\end{longtable} \par
 
\caption{\label{tab_2}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{P{0.3666666666666667\textwidth}P{0.4833333333333333\textwidth}}
\tabcellsep Cost (\$)\\
HSOS\tabcellsep 3391993.59\\
\multicolumn{2}{l}{MAPSO 3391993.59}\\
TS\tabcellsep 3392728.13\end{longtable} \par
 
\caption{\label{tab_3}Table 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7} \par 
\begin{longtable}{P{0.3578947368421052\textwidth}P{0.49210526315789477\textwidth}}
\tabcellsep Cost (\$)\\
HSOS\tabcellsep 148582246.21\\
\multicolumn{2}{l}{MAPSO 148584093.45}\\
TS\tabcellsep 148705625.34\end{longtable} \par
 
\caption{\label{tab_4}Table 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6} \par 
\begin{longtable}{P{0.17339514978601997\textwidth}P{0.24251069900142655\textwidth}P{0.16005706134094153\textwidth}P{0.27403708987161196\textwidth}}
\tabcellsep \tabcellsep 830\tabcellsep 10,15\\
19\tabcellsep 1695\tabcellsep 460\tabcellsep 15,22\\
20\tabcellsep 1675\tabcellsep 560\tabcellsep 12,15,22\\
21\tabcellsep 1805\tabcellsep 440\tabcellsep 3,12,22\\
22\tabcellsep 1705\tabcellsep 440\tabcellsep 3,12,22\\
23\tabcellsep 1766\tabcellsep 440\tabcellsep 3,12,22\\
24\tabcellsep 1946\tabcellsep 100\tabcellsep 12\\
25\tabcellsep 2116\tabcellsep 100\tabcellsep 12\\
26\tabcellsep 1916\tabcellsep 320\tabcellsep 12,20\\
27\tabcellsep 1737\tabcellsep 320\tabcellsep 12,20\\
28\tabcellsep 1927\tabcellsep 220\tabcellsep 20\\
29\tabcellsep 2137\tabcellsep 0\tabcellsep -----\\
30\tabcellsep 1927\tabcellsep 0\tabcellsep -----\\
31\tabcellsep 1907\tabcellsep 220\tabcellsep 16\\
32\tabcellsep 1888\tabcellsep 220\tabcellsep 16\\
33\tabcellsep 1818\tabcellsep 220\tabcellsep 16\\
34\tabcellsep 1848\tabcellsep 220\tabcellsep 16\\
35\tabcellsep 2118\tabcellsep 220\tabcellsep 16\\
36\tabcellsep 1879\tabcellsep 220\tabcellsep 16\\
37\tabcellsep 2089\tabcellsep 0\tabcellsep -----\\
38\tabcellsep 1989\tabcellsep 0\tabcellsep -----\\
39\tabcellsep 1999\tabcellsep 0\tabcellsep -----\\
40\tabcellsep 1982\tabcellsep 0\tabcellsep -----\\
41\tabcellsep 1672\tabcellsep 650\tabcellsep 9\\
42\tabcellsep 1782\tabcellsep 650\tabcellsep 9\\
43\tabcellsep 1772\tabcellsep 650\tabcellsep 9\\
44\tabcellsep 1556\tabcellsep 650\tabcellsep 9\\
45\tabcellsep 1706\tabcellsep 650\tabcellsep 9\\
46\tabcellsep 1806\tabcellsep 90\tabcellsep 6\\
47\tabcellsep 1826\tabcellsep 90\tabcellsep 6\\
48\tabcellsep 1906\tabcellsep 90\tabcellsep 6\\
49\tabcellsep 1999\tabcellsep 90\tabcellsep 6\\
50\tabcellsep 2109\tabcellsep 0\tabcellsep -----\\
51\tabcellsep 2209\tabcellsep 0\tabcellsep -----\\
52\tabcellsep 1779\tabcellsep 0\tabcellsep -----\\
\multicolumn{4}{l}{Weeks Load Maintenance Capacity Units on Maintenance}\\
1\tabcellsep 1694\tabcellsep 511\tabcellsep 8,11,15,17\\
2\tabcellsep 1714\tabcellsep 511\tabcellsep 8,11,15,17\\
3\tabcellsep 1844\tabcellsep 511\tabcellsep 8,11,15,17\\
4\tabcellsep 1694\tabcellsep 511\tabcellsep 8,11,15,17\\
5\tabcellsep 1684\tabcellsep 320\tabcellsep 15,17\\
6\tabcellsep 1763\tabcellsep 610\tabcellsep 10\\
7\tabcellsep 1663\tabcellsep 610\tabcellsep 10\\
8\tabcellsep 1583\tabcellsep 610\tabcellsep 10\\
9\tabcellsep 1543\tabcellsep 610\tabcellsep 10\\
10\tabcellsep 1586\tabcellsep 610\tabcellsep 10\\
11\tabcellsep 1690\tabcellsep 610\tabcellsep 10\\
12\tabcellsep 1496\tabcellsep 710\tabcellsep 10,14\\
13\tabcellsep 1456\tabcellsep 950\tabcellsep 10,14,21\\
14\tabcellsep 1396\tabcellsep 950\tabcellsep 10,14,21\\
15\tabcellsep 1443\tabcellsep 950\tabcellsep 10,14,21\\
16\tabcellsep 1273\tabcellsep 1350\tabcellsep 4,10,12,13,14,18,22\end{longtable} \par
 
\caption{\label{tab_5}Table 6 :}\end{figure}
 			\footnote{© 2017 Global Journals Inc. (US)} 		 		\backmatter   			 
\subsection[{Acknowledgement}]{Acknowledgement}\par
The authors gratefully acknowledge the support and facilities provided by the authorities of Annamalai University, Annamalainagar, India to carry out this research work.  			  			 
\subsection[{Global Journals Inc. (US) Guidelines Handbook 2017}]{Global Journals Inc. (US) Guidelines Handbook 2017}\par
www.GlobalJournals.org			 			  				\begin{bibitemlist}{1}
\bibitem[Satapathy et al. ()]{b13}\label{b13} 	 		‘0-1 integer programming for generation maintenance scheduling in power systems based on teaching learning based optimization (TLBO)’.  		 			S C Satapathy 		,  		 			A Naik 		,  		 			K Parvathi 		.  	 	 		\textit{Communications. in Computer and Information Sciences (CCIS) series}  		2012. 306  (2)  p. .  	 
\bibitem[El-Sharkh et al. ()]{b10}\label{b10} 	 		‘A fuzzy evolutionary programming-based solution methodology for security-constrained generation maintenance scheduling’.  		 			M Y El-Sharkh 		,  		 			A A El-Keib 		,  		 			H Chen 		.  	 	 		\textit{Electric Power System Research}  		2003. 67 p. .  	 
\bibitem[Samuel and Rajan ()]{b8}\label{b8} 	 		‘A Modified Shuffled Frog Leaping Algorithm for Long-Term Generation Maintenance Scheduling’.  		 			G G Samuel 		,  		 			C C A Rajan 		.  	 	 		\textit{Proceedings of the Third Int. Conf. on Soft Computing for Problem Solving (SocProS)},  				 (the Third Int. Conf. on Soft Computing for Problem Solving (SocProS))  		2013. Springer. p. .  	 
\bibitem[El -Amin et al. ()]{b4}\label{b4} 	 		‘A Tabu search algorithm for maintenance scheduling of generating units’.  		 			I El -Amin 		,  		 			S Duffuaa 		,  		 			M Abbas 		.  	 	 		\textit{Electric Power System Research}  		2000. 54 p. .  	 
\bibitem[Egan et al. ()]{b2}\label{b2} 	 		‘An experimental method of determination of optimal maintenance schedules in power systems using the branch and bound technique’.  		 			G T Egan 		,  		 			T S Dillon 		,  		 			K Morsztyn 		.  	 	 		\textit{IEEE Transactions on System Man and Cybernetics}  		1976. 6  (8)  p. .  	 
\bibitem[Dahal et al. ()]{b9}\label{b9} 	 		\textit{Generator maintenance scheduling using a genetic algorithm with a fuzzy evaluation function, Fuzzy Sets and System},  		 			K P Dahal 		,  		 			C J Aldridge 		,  		 			J R Mcdonald 		.  		1999. 102 p. .  	 
\bibitem[Zurn and Quintana ()]{b0}\label{b0} 	 		‘Generator maintenance scheduling via successive approximations dynamic programming’.  		 			H H Zurn 		,  		 			V H Quintana 		.  	 	 		\textit{IEEE Transactions on Power Apparatus and Systems}  		1975. 94  (2)  p. .  	 
\bibitem[Fetanat and Shafipour ()]{b12}\label{b12} 	 		‘Harmony Search Algorithm based 0-1 Integer Programming for Generation Maintenance Scheduling in Power Systems’.  		 			A V Fetanat 		,  		 			G Shafipour 		.  	 	 		\textit{Journal of Theoretical and Applied Information Technology}  		2011. p. .  	 
\bibitem[Satoh and Nara ()]{b3}\label{b3} 	 		‘Maintenance scheduling by using simulated annealing method’.  		 			T Satoh 		,  		 			K Nara 		.  	 	 		\textit{IEEE Transactions on Power Systems}  		1991. 6  (5)  p. .  	 
\bibitem[Balaji et al. ()]{b11}\label{b11} 	 		\textit{Mathematical approach assisted differential evolution for generator maintenance scheduling, Electrical Power and Energy Systems},  		 			G Balaji 		,  		 			R Balamurugan 		,  		 			L Lakshminarasimman 		.  		2016. 82 p. .  	 
\bibitem[Anandhakumar et al. ()]{b6}\label{b6} 	 		‘Modified ABC Algorithm for Generator Maintenance Scheduling’.  		 			R Anandhakumar 		,  		 			S Subramanian 		,  		 			S Ganesan 		.  	 	 		\textit{International Journal of Computer and Electrical Engineering}  		2011. 3  (6)  p. .  	 
\bibitem[Yare et al. ()]{b5}\label{b5} 	 		‘Optimal generator maintenance scheduling using a modified discrete PSO’.  		 			Y Yare 		,  		 			G K Venagamoorthy 		,  		 			U O Aliyu 		.  	 	 		\textit{IET Generation Transmission \& Distribution}  		2008. 2  (6)  p. .  	 
\bibitem[Dopazo and Merrill ()]{b1}\label{b1} 	 		‘Optimal maintenance scheduling using integer programming’.  		 			J F Dopazo 		,  		 			H M Merrill 		.  	 	 		\textit{IEEE Transactions on Power Apparatus and Systems}  		1975. 94  (5)  p. .  	 
\bibitem[Foong et al. ()]{b7}\label{b7} 	 		\textit{Power plant maintenance scheduling using ant colony optimization: an improved formulation, Engineering Optimization},  		 			W K Foong 		,  		 			H R Maier 		,  		 			A R Simpson 		.  		2008. 40 p. .  	 
\bibitem[Cheng and Prayogo ()]{b14}\label{b14} 	 		‘Symbiotic Organisms Search: A new meta-heuristic optimization algorithm’.  		 			M Y Cheng 		,  		 			D Prayogo 		.  	 	 		\textit{Computers and Structures}  		2014. 139 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}