\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={Non-Dominated Sorting Whale Optimization Algorithm (NSWOA): A Multi-Objective Optimization Algorithm for Solving Engineering Design Problems By Pradeep Jangir \& Narottam Jangir},
 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{Non-Dominated Sorting Whale Optimization Algorithm (NSWOA): A Multi-Objective Optimization Algorithm for Solving Engineering Design Problems By Pradeep Jangir \& Narottam Jangir}
\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]{Dr. Pradeep  Jangir}

             \author[2]{Narottam  Jangir}

             \affil[1]{  RRVPN Rajasthan}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


This novel article presents the multi-objective version of the recently proposed the Whale Optimization Algorithm (WOA) known as Non-Dominated Sorting Whale Optimization Algorithm (NSWOA). This proposed NSWOA algorithm works in such a manner that it first collects all non-dominated Pareto optimal solutions in achieve till the evolution of last iteration limit. The best solutions are then chosen from the collection of all Pareto optimal solutions using a crowding distance mechanism based on the coverage of solutions and bubble-net hunting strategy to guide humpback whales towards the dominated regions of multi-objective search spaces. For validate the efficiency and effectiveness of proposed NSWOA algorithm is applied to a set of standard unconstrained, constrained and engineering design problems. The results are verified by comparing NSWOA algorithm against Multi objective Colliding Bodies Optimizer (MOCBO), Multi objective Particle Swarm Optimizer (MOPSO), non-dominated sorting genetic algorithm II (NSGA-II) and Multi objective Symbiotic Organism Search (MOSOS). The results of proposed NSWOA algorithm validates its efficiency in terms of Execution Time (ET) and effectiveness in terms of Generalized Distance (GD), Diversity Metric (DM) on standard unconstraint, constraint and engineering design problem in terms of high coverage and faster convergence.

\end{abstract}


\keywords{non-dominated; crowing distance; nswoa algorithm; multi-objective algorithm;economic constrained emission dispatch.}

\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
ptimization is a work of achieving the best result under given limitation or constraints. Now a day, optimization is used in all the fields like construction, manufacturing, controlling, decision making, prediction etc. The final target is always to get feasible solution with minimum use of resources. In this field computers make a revolutionary impact on every field as it provides the facility of virtual testing of all parameters that are involved in a particular design with less involvement of human efforts, benefits in less time consuming, human efforts and wealth as well.\par
Today we use computer-aided design where a designer designs a virtual system on computer and gives only command to test all parameters involved in that design without even the need for a single prototype.\par
A designer only to design and simulate a system and set all the parameter limitation for the computer.\par
Computer-aided design technique becomes more effective with the additional feature of autogeneration of solutions after it's mathematically formulation of any system or design problem. Auto generation of solution, this feature is come into nature with the development of algorithms. In past years, real world designing problems are solved by gradient descent optimization algorithms. In gradient descent optimization algorithm, the solution of mathematically formulated problem is achieved by obtaining its derivative. This technique is suffered from local minima stagnation \hyperref[b0]{[1,}\hyperref[b1]{2]} more time consuming and their solution is highly dependent on their initial solution.\par
The next stage of development of optimization algorithms is population basedstochastic algorithms.These algorithms had number of solutions at a time so embedded with a unique feature of local minima avoidance. Later population based algorithms are developed to solve single objective at a time either it may be maximization or minimization on accordance the problems objective function. Some popular algorithms for single objective problems are Moth-Flame optimizer (MFO) \hyperref[b2]{[3]}, Bat algorithm (BA) \hyperref[b3]{[4]}, Particle swarm optimization (PSO) \hyperref[b4]{[5]}, Ant colony optimization (ACO) \hyperref[b5]{[6]}, Genetic algorithm (GA) \hyperref[b6]{[7]}, Cuckoo search (CS) \hyperref[b7]{[8]}, Mine blast algorithm (MBA) \hyperref[b8]{[9]}, Krill Herd (KH) \hyperref[b9]{[10]}, Interior search algorithm (ISA) \hyperref[b10]{[11]} etc. These algorithms have capabilities to handle uncertainties \hyperref[b11]{[12]}, local minima \hyperref[b12]{[13]}, misleading global solutions \hyperref[b13]{[14]}, better constraints handling \hyperref[b14]{[15]} etc. To overcome these difficulties different algorithms are enabled with different powerful operators. As mention above here is only objective then it is easy to measure the performance in terms of speed, accuracy, efficiency etc. with the simple operational operators.\par
In general, real world problems are nonlinear and multi-objective in nature.In multi-objective problem there may be some objectives are consisting of maximization function while some are minimization function. So now a day, multi-objective algorithms are in firm attention.\par
Let's take an example of buying a car, so we have many objectives in mind like speed, cost, comfort level, space for number of people riding, average fuel consumption, pick up time required to gain particular speed, type of fuel requirement either it is diesel driven, petrol driven or both etc. To simply understand multiobjective problem, from Fig. \hyperref[fig_0]{1}, we considertwo objectives, first cost and second comfort level. So we go for sole objective of minimum cost possible then we have to deny comfort level objective and vice-versa. It means real word problems are with conflicting objectives. So as, we are disabled to find an optimal solution like single objective problems. About multiobjective algorithm and its working is detailed described in next portion of the article. The No free launch \hyperref[b15]{[16]} theorem that logically proves that none of the only algorithm exists equally efficient for all engineering problem. This is the main reason that it allows all researcher either to propose new algorithm or improve the existing ones. This paper proposed the multi-objective version of the well-known whale optimization algorithm(WOA) \hyperref[b16]{[17]}. In this paper non-sorted WOA (NSWOA) is tested on the standard unconstraint and constrainttest function along with some well-known engineering design problem, their results are also compared with contemporary multi-objective algorithms Multi objective Colliding Bodies Optimizer (MOCBO) \hyperref[b17]{[18]}, Multi objective Particle Swarm Optimizer (MOPSO) \hyperref[b18]{[19]}\hyperref[b20]{[20]}, Non-dominated Sorting Genetic Algorithm (NSGA) \hyperref[b21]{[21]}\hyperref[b22]{[22]}\hyperref[b23]{[23]}, non-dominated sorting genetic algorithm II (NSGA-II) \hyperref[b24]{[24]} and Multi objective Symbiotic Organism Search (MOSOS) \hyperref[b25]{[25]} that are widely accepted due to their ability to solve real world problem.\par
The structure of the paper can be given as follows: -Section 2 consists of literature; Section 3 includes the proposed novel NSWOAalgorithm; Section 4 consists of competitive results analysis of standard test functions as well as engineering design problem and section 5 includes real world application, finally conclusion based on results and future scope of work is drawn. 
\section[{II.}]{II.} 
\section[{Literature Review}]{Literature Review}\par
As the name describes, multi-objective optimization handlessimultaneously multiple objectives. Mathematically minimize/maximize optimization problem can be written as follows: / : ( ?) = \{ ( ?),\textbf{(}\par
? ? , = 1,2, . . . ,\par
Where q is the number of inequality constraints, r is the number of equality constraints,k is the number of variables, is the i th inequality constraints, no is the number of objective functions, indicates the i th equality constraints, and  {\ref [ , ]} are the boundaries of i th variable.\par
Obviously, relational operators are ineffective in comparing solutions with respect to multiple objectives. The most common operator in the literate is Pareto optimal dominances, which is defined as follows for minimization problems:\par
where ? = ( , , ? , ) and ? = ( , , ? , ). For maximization problems, Pareto optimal dominance is defined as follows:\par
where ? = ( , , ? , ) and ? = ( , , ? , ).\par
These equationsshow that a solution is better than another in a multi-objective search space if it is equal in all objective and better in at least one of the objectives. Pareto optimal dominance is denoted with ? and ?. With these two operator's solutions can be easily compared and differentiated.\par
Population based multi-objective algorithm's solution consists of multiple solution. But with multiobjective algorithm we cannot exactly determine the optimal solution because each solution is bounded by other objectives or we can say there is always conflict between other objectives. So the main function of stochastic/population based multi-objective algorithm is to find out best trade-offs between the objectives, so called Pareto optimally set \hyperref[b26]{[26]}\hyperref[b27]{[27]}\hyperref[b28]{[28]}.\par
The principle of working for an ideal multiobjective optimization algorithm is as shown in Fig.  {\ref 2}.\par
Step No. -1 Find maximum number of nondominated solution according to objective, it expresses the number of Pareto optimal set so as shows higher coverage\par
Step No. -2 Choose one of the Pareto optimal solution using crowding distance mechanism that fulfills the objectives.  
\section[{F}]{F}\par
Now a day recently proposed sole objective algorithms are equipped with powerful operators to provide them a capability to solve multi-objective problems as well. In the same manner we proposed NSWOA algorithm in a hope that it will perform efficiently for multi-objective problems. These are: Multi-objective GWO \hyperref[b29]{[29]}, Multi-objective Bat Algorithm \hyperref[b30]{[30]}, Multiobjective Bee Algorithm \hyperref[b31]{[31]},Pareto Archived Evolution Strategy (PAES) \hyperref[b32]{[32]}, Pareto-frontier Differential Evolution (PDE) \hyperref[b33]{[33]}, Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) \hyperref[b34]{[34]}, Strength-Pareto Evolutionary Algorithm (SPEA) \hyperref[b35]{[35,}\hyperref[b36]{36]}andMulti-objective water cycle algorithm with unconstraint and constraint standard test functions \hyperref[b37]{[37]} \hyperref[b38]{[38]}.Performance measurement for approximate robustness to Pareto front of multi-objective optimization algorithms in terms of coverage, convergence and success metrics.\par
The computational complexity of NSWOA algorithm is order of ( )where N is the number of individuals in the population and M is the number of objectives. The complexity for other good algorithms in this field: NSGA-II, MOPSO, SPEA2 and PAES are (\par
). However, the computational complexity is much better than some of the algorithms such as NSGA and SPEA which are of ( ). 
\section[{III.}]{III.}\par
Non-Dominated Sorting Whale Optimization Algorithm (nswoa)   The Whale Optimization Algorithm (WOA) with sole objective was proposed by Mirjalili Seyedali and Andrew Lewis in 2016 \hyperref[b16]{[17]}. It is basically a stochastic population based, nature inspired algorithm. In this algorithm the basic strategy based on special hunting nature of humpback whales.Some fact about humpback whales that they are: fancy creatures, biggest mammals in the world and have power of think, learn, judge, communicate, being emotional etc. They are also considered as predators as they never sleep, only half of the brain sleeps, as they have to breathe from surface of the ocean. One more interesting fact about whales is their hunting or foraging behavior to hunt small fishes. Such type of foraging behavior is known as bubble-net feeding strategy where whales went down in water approximate 10-15 meter and then after start to produce bubbles in a spiral shape encircles prey and then follows the bubbles and moves upward the surface. This foraging behavior is done by making distinct bubbles along with a circle or '9-shaped path' represented in Fig. \hyperref[fig_1]{3}   . *( ) ( ) D C X t X t ? ? ?? ?? ? (1) ( 1) *( ) . X t X t A D ? ? ? ?? ? ?? ? ?? ?? (2)2 * A a r a ? ? ?? ? ? (3) 2* C r ? ?? (4)\par
Where: ? is a variable linearly decrease from 2 to 0 over the course of iteration and r is a random number [0, 1]. 
\section[{b) Bubble-net attacking method}]{b) Bubble-net attacking method}\par
In order to mathematical equation for bubblenet behaviour of humpback whales, two methods are modelled as: 
\section[{i. Shrinking Encircling Mechanism}]{i. Shrinking Encircling Mechanism}\par
This technique is employed by decreasing linearly the value of a ? from 2 to 0. Random value for vector ? in rang between [-1, 1]. 
\section[{ii. Spiral Updating Position}]{ii. Spiral Updating Position}\par
Mathematical spiral equation for position update between humpback whale and prey that was helix-shaped movement given as follows:\par
( ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?? ? ?? ?? ?? ? ??? ?? ?\textbf{(6)}\par
Where: p expresses random number between [0, 1].\par
iii. Search for prey 
\section[{A}]{A} 
\section[{??}]{??}\par
Vector can be used for exploration to search for prey;\par
vector A ?? also takes the values greater than one or less than -1. Exploration follows two conditions. rand D C X X ? ? ?? ?? ?????? ?? ? (7)\textbf{( 1)}\par
.rand X t X A D ? ? ? ?? ? ?????? ?? ??\textbf{(8)}\par
Finally follows these conditions: ? Position of whales are updated as a spiral or helix shaped movement function and so as value of next position of whales is decided ? The value of absolute distance is achieved which is basically a distance between the current best solution (whales current position) to the final (prey position) optimal solution ? We assume that there is 50-50\% probability that whale either follow the shrinking encircling or logarithmic path during optimizationmuch needed to update their position towards optimal one ? Stage 3 ? Termination counter in integrated to limit/forcefully stop the search in uncertain search space (max. iteration counter to forcefully converge the search to optimal one) ? Size of the position vector matrix is continuously reduced over the course of iteration due to directed search to find global best solution ? Continuously position of the whalesis updated towards the optimal one viaeither follow the shrinking encircling or logarithmic path during optimizationequation for each iteration ? Likewise, multi-objective optimization the NSWOA algorithm is made to capable to store the pareto? 1 A ? ?? 
\section[{? Stage4}]{? Stage4}\par
Note: We assume that there is 50-50\% probability that whale either follow the shrinking encircling or logarithmic path during optimization. Mathematically we modelled as follows:\par
Global Journal of Researches in Engineering ( ) Volume XVII Issue IV Version I optimal solutions in a collectionset and make it as flexible to change solution over the course of iteration ? Solution is assigned a rank according to their ability as if a solution is not dominated by other solution is assigned rank1, dominated by only solution assigned rank 2 and so on \& if collection set is full (archive size) over predefined size then some solutions that are less non-dominated (according to fitness value) in natureare directed to be out from the collection set according to the crowding distance mechanism. This collection set is similar to the term achieve used in MOSOS and NSGA-II. It is a repository to store the best non-dominated solutions obtained so far. The search mechanism in NSWOA is very similar to that of WOA algorithm, in which solutions are improved using position vectors. Due to the existence of multiple best solutions, however, the best whales position should be chosen from the collection set.\par
In order to select solutions from the archive to establish tunnels between solutions, we employ a leader selection mechanism. In this approach, the crowding distance between each solution in the archive is first selection and the number of solutions in the neighbourhood is counted as the measure of coverage or diversity. We require the NSWOAalgorithm to select solutions from the less populated regions of the archive using the following equation to improve the distribution of solutions in the archive across all objectives.\par
This section proposes multi-objective version of the WOA algorithm called NSWOA algorithm. The nondominated sorting has been of the most popular and efficient techniques in the literature of multi-objective optimization. As its name implies, non-dominated sorting sort Pareto optimal solutions based on the domination level and give them a rank. This means that the solutions that are not dominated by any solutions is assigned with rank 1, the solutions that are dominated by only one solution are assigned rank 2, the solutions that are dominated by only two solutions are assigned rank 3, and so on. Afterwards, solutions are chosen to improve the quality of the population base on their rank. The better rank, the higher probability to be chosen. The main drawback of non-dominated sorting is its computational cost, which has been resolved in NSGA-II.\par
The success of the NSGA-II algorithm is an evidence of the merits of non-dominated sorting in the field of multi-objective optimization. This motivated our attempts to employ this outstanding operator to design another multi-objective version of the WOA algorithm. In the NSWOA algorithm, solutions are updated with the same equations presented in equation 3.9. In every This mechanism allows better solutions to contribute in improving the solutions in the population. It should be noted that non-dominated sorting gives a probability to dominated solutions to be selected as well, which improves the exploration of the NSWOA algorithm. Flow chart of NSWOA algorithm is represented as Fig. \hyperref[fig_6]{4}. 
\section[{Constraint Handling Approach}]{Constraint Handling Approach}\par
With the extended literature survey we find that the population based algorithms are the common way to solve the multi-objective problems as they are more commonly provides the global solution and capable of handling both continuous and combinational optimization problem with a very high coverage and convergence. Multi-objective problems are subjected to various type of constraints like linear, non-linear, equality, inequality etc. So with these problems embedded it is very difficult to find simple and good strategy to achieve considerable solutions in the acceptable criterion. So in this paper NSWOA algorithm uses a very simple approach to get feasible solutions. In this mechanism, after generating number of solutions at each generation, all the desirable constraint checked and then some solution that fulfills the criterion of acceptable solution are selected and collected them in achieve. Afterward non dominated solutions added in archive as we find more suitable solution to get acceptable solution. So as if achieve is full then less dominated solutions are removed. Finally, according to crowing distance mechanism all these solutions (more suitable position of the whales) from archive is selected to get desired solution. 
\section[{?P?\textunderscore i=c??Rank?\textunderscore i}]{?P?\textunderscore i=c??Rank?\textunderscore i}\par
(3.9)\par
iteration, however, the solutions to have optimal position of whalesare chosen using the following equation:\par
where c is a constant and should be greater than 1 and ???????? ?? is the rank number of solutions after doing the non-dominated sorting.  
\section[{Results Analysis On Test Functions}]{Results Analysis On Test Functions}\par
For determine the performance of proposed NSWOA algorithm is applied to: ? A set of unconstraint and constraint standard multiobjective test functions ? Tested on well-known engineering design problems ? Non-linear, highly complex practical application known as economic constrained emission dispatch (ECED)\par
? With and Without stochastic integration of wind power (WP) in the next section ? A simple six-operating generational unit with power demand 1200 MW.  (Engineering multiobjective design problem) with distinct characteristics like non-linear, non-convex, discrete pareto fronts and convex etc. are selected to measure the performance of proposed NSWOA algorithm. To deal with real world engineering design problem is really a typical task with unknown search space, in this article we include four different engineering problems are considered and performance is compared with various well known algorithms like MOWCA, NSGA-II, MOPSO, PAES and ?-GA multi-objective algorithms. Each algorithm is separately runs fifteen times and numeric results are listed in tables below. To measure the quality of obtained results we match their coverage of obtained true pare to front with respect to their original or true pare to fronts. 
\section[{Initialize the no. of whales, no. of variable, maximum iterations}]{Initialize the no. of whales, no. of variable, maximum iterations}\par
For numeric as well as qualitative performance of purposed NSWOA algorithm on various case studies we consider Generational Distance (GD) given by Veldhuizen in 1998 \hyperref[b39]{[39]}for measuring the deviation of the distance between true pare to front and obtained pare to front, Diversity matric (Î?") also known as matrix of spread to measure the uniformly distribution of nondominated solution given by Deb \hyperref[b24]{[24]}and Metric of spacing (S) to represent the distribution of nondominated distribution of obtained solutions by purposed algorithm given by Schott \hyperref[b40]{[40]}. where\par
shows the Euclidean distance (calculated in the objective space) between the Pareto optimal solution achieved and the nearest true Pareto optimal solution in the reference set, is the total number of achieved Pareto optimal solutions.Î?" = ? | | ( )\par
where, , are Euclidean distances between extreme solutions in true pareto front and obtained pareto front.\par
shows the Euclidean distance between each point in true pare to front and obtained pare to front.\par
and 'd' are the total number of achieved Pareto optimal solutions and averaged distance of all solutions. 
\section[{= ? ( ? ) a) Results on unconstrained test problems}]{= ? ( ? ) a) Results on unconstrained test problems}\par
Like as above mentioned, the first set of test problems consist of unconstrained standard test functions. All the standard unconstrained test functions mathematical formulation is shown in Appendix A. Later, the numeric results are represented in Table \hyperref[tab_3]{1} and best optimal pare to front is shown in Fig. \hyperref[fig_9]{5}.\par
All the statistical results are shown Table \hyperref[tab_3]{1} suggests that the NSWOA algorithm effectively outperforms with most of the unconstraint test functions compare to the MOSOS, MOCBO, MOPSO and NSGA-II algorithm. The effectiveness of proposed nondominated version of WOA (NSWOA algorithm) can be seen in the Table \hyperref[tab_3]{1}, represents a greater robustness and accuracy of NSWOA algorithm in terms of mean and standard deviation with the help of GD, diversity matrix along with computational time. However, proposed NSWOA algorithm shows very competitive results in comparison with the MOPSO, MOCBO and MOSOS algorithms and in some cases these algorithms perform better than proposed one. Pare to front obtained by proposed NSWOA algorithm shows almost complete coverage with respect to true pare to front. Year 2017 
\section[{F}]{F}\par
The mathematical representation of these performance indicating metric are as follows:\par
where "d" is the average of all ?? ?? , ?? ?????? is the total number of achieved Pareto optimal solutions, and?? ?? = min ?? ?|ð??"ð??" 1 ?? (?? ?) ? ð??"ð??" 1 ?? (?? ?)| + |ð??"ð??" 2 ?? (?? ?) ? ð??"ð??" 2 ?? (?? ?)?\par
for all i,j=1,2,?,n. Smallest value of "S" metric gives the global best non-dominated solutions are uniformly distributed, thus if numeric value of ?? ?? and ?? are same then value of "S" metric is equal to zero.\par
with wind power (ECEDWP). These can be classified into four groups given below: The next set of standard test functions consisting of constrained functions. For constrained test function it should be necessary that NSWOA algorithm has a capability of handling constraints so algorithm is equipped with a death penalty function to search that violate any of the constraints at any level \hyperref[b41]{[41]}. For comparing the results of different algorithms, we have utilized GD and Î?" metrics. has a capability of handling constraints so algorithm is equipped with a death penalty function to search agents that violate any of the constraints at any level \hyperref[b41]{[41]}. For comparing the results of different algorithms, we have    
\section[{i. Four-bar truss design problem}]{i. Four-bar truss design problem}\par
The statistical results of four bar truss design problem \hyperref[b42]{[42]} in given in Table \hyperref[tab_6]{3} and best optimal front is given in Fig. The statistical results of four bar truss design problem \hyperref[b42]{[42]} in given in Table \hyperref[tab_6]{3} and best optimal front is given in Fig. \hyperref[fig_11]{7}. It consists of two minimization objectives displacement and volume with four design control variable mathematically given in Appendix C. Year 2017 F CONST function consists of concave front with linear front, OSY is similar to CONST but consists of many linear regions with different slops while TNK almost similar to wave shaped. These also suggests that NSWOA algorithm has a capability to solve various type of constraint problem. All the constraint test functions are mathematically given in Appendix B.  
\section[{Speed-reducer design problem}]{Speed-reducer design problem}\par
The statistical results of speed reducer design problem \hyperref[b43]{[43]} is given in Table \hyperref[tab_5]{4} and best optimal front is given in Fig. \hyperref[fig_14]{8} Pareto optimal front obtained by the NSWOA Algorithm for "Four -bus truss design problem"\par
The statistical results of speed reducer design problem \hyperref[b43]{[43]} is given in   iii. 
\section[{Welded-beam design problem}]{Welded-beam design problem}\par
The statistical results of welded beam design problem \hyperref[b44]{[44]} is given in Table  {\ref 5} and best optimal front is given in Fig. The statistical results of welded beam design problem \hyperref[b44]{[44]} is given in Table  {\ref 5 and}  Table  {\ref 5}: Results of the multi-objective NSWOA algorithms on welded-beam design problem in terms mean and standard deviation 
\section[{Disk brake design problem}]{Disk brake design problem}\par
The statistical results of welded beam design problem \hyperref[b44]{[44]} is given in Table \hyperref[tab_8]{6} and best optimal front is given in Fig. \hyperref[fig_0]{10}. It is a well-known mechanical design Fig. \hyperref[fig_0]{10}: Paretooptimal front obtained by the NSWOA Algorithm for "Disk brake design problem" Due to high complexity of engineering design problem it is really hard to gain results alike true pare front but we can clearly see that optimal pare obtained by NSWOA algorithm is covers almost whole solutions that are the actual/true solutions of an engineering design problem. From all above tested function we can conclude that problem either it consists of constraints or unconstraint problem NSWOA algorithm shows its capability to solve any kind of linear, non-linear and complex real problem. next section we attached a highly non-linear complex real problem to show its effectiveness regarding the real world complex application with many objectives.\par
The statistical welded beam design problem \hyperref[b44]{[44]} is given in Table \hyperref[tab_8]{6} and best optimal front is known mechanical design problem consists of two minimization objectives stopping time and mass of brake of a disk brake four design control variable mathematically given in Appendix C.\par
optimal front obtained by the NSWOA Algorithm for "Disk brake design problem"\par
Due to high complexity of engineering design problem it is really hard to gain results alike true pare to optimal pare to obtained by NSWOA algorithm is covers almost whole solutions that are the actual/true solutions of an engineering design problem. From all above tested function we can conclude that problem either it consists problem NSWOA algorithm shows its capability to solve any kind of linear, linear and complex real world problem. So in the linear complex real problem to show its effectiveness regarding the real ication with many objectives. 
\section[{d) Formulation Of Economic Constrained Emission Dispatch (ECED) With Integration Of (WP) i. Mathematical Formulation Of Wind Power}]{d) Formulation Of Economic Constrained Emission Dispatch (ECED) With Integration Of (WP) i. Mathematical Formulation Of Wind Power}\par
In case of wind power generation, the output power of wind generator is calculated with the help of a stochastic variable wind speed ? (meter/seconds). Wind speed is a variable function so their probability distribution plays a very important role. Wind sp mathematically formulated as two distribution function, probability density function (PDF) and cumulative distribution function (CDF) as follows:( ) = ( ) ? ( ) ? * exp ? ( ( ) = 1 ? exp ? ( ) ?\par
, ? 0 objectives stopping time and mass of brake of a disk brake with four design control variable mathematically given in optimal front obtained by the NSWOA Algorithm for "Disk brake design problem" 
\section[{Economic Constrained Emission ) With Integration Of Wind Power Formulation Of Wind Power}]{Economic Constrained Emission ) With Integration Of Wind Power Formulation Of Wind Power}\par
In case of wind power generation, the output power of wind generator is calculated with the help of a (meter/seconds). Wind speed is a variable function so their probability distribution plays a very important role. Wind speed mathematically formulated as two-parametric Weibull distribution function, probability density function (PDF) and cumulative distribution function (CDF) as follows: where, S(v) and s(v) are CDF and PDF respectively. Shape factor and scale factor are k and c respectively. The wind speed and output wind power are related as:) ? , ? 0 (4.1) (4.2)= 0, < ? ? < ? < (4.3)\par
where, and are the rated speed of wind and rated power output. and are cut-out and cut-in speed of wind respectively. The CDF of in the boundary of [0, ] on an accordance with the speed range of wind can be formulated as:( ) = 1 ? ? 1 + * \} + exp [? ( ) ? ], 0 ? < (4.4)\par
Above equation is very meaningful to calculate the ECED problems with speculative wind power with variable speed. 
\section[{ii. Modeling of ECEDWP problem}]{ii. Modeling of ECEDWP problem}\par
As power is formulated as system constraint, so the objective function of economic emission dispatch problem (EEDP) stays on unchanged as classical EEDP:\par
Fuel cost objective is given by:( ) = ? ( + + ) (4.5)\par
where, the thermal power generators cost coefficients are , , for i-th generator, Sum of the total fuel cost of the system and N is the total number of generators. Total Emission is calculated by:( ) = ? [\{( + + ) * 10 \} + * exp ( * )] (4.6)\par
where, , , , and are emission coefficients with valve point effect taking into consideration i-th thermal generator. 
\section[{iii. System Constraints}]{iii. System Constraints}\par
As wind power generation is considered as system constraint with the summation of stochastic variables the classical power balance constraint changes to fulfill the predefined confidence level.? ( + ? + ) ? (4.7)\par
where, is confidence level that a power system must follow the load demand and so as it is selected nearer to unity as values lesser than unity represents high operational risk.\par
represents system losses can be calculated by B-coefficient method given below:= ? ? + ? + (4.8)\par
So as to change above described power balance constrained equation into deterministic form can be solved as:\{ < + ? ? = ( + ? ? ) ? 1 ? (4.9) + ? ? ? + * ? * (4.10)\par
iv. Reserve capacity system constraint So as to reduce the impact of stochastic wind power on system, up and down spinning reserve needs to be maintained \hyperref[b22]{[22]}. Such reserve constraints formulated as \hyperref[b14]{[15]} and \hyperref[b15]{[16]} respectively:\{? ( ? ) ? + * \} ? (4.11) ? ? ? * ( ? ) ? (4.12)\par
where, represents the reserve demand of conventional thermal power plant system and it generally keeps the maximum value of thermal unit, and are maximum and minimum output level of operational generators of i-th unit, and are predefined down and upper confidence level parameter respectively, and are the demand coefficients of up and down spinning reserves. 
\section[{v. Generational capacity constraint}]{v. Generational capacity constraint}\par
The real output power is bounded by each generators upper and lower bounds given as: ? ? (4.13)\par
V.\par
Test System For Economic Emission Dispatch Problem a) 40-Operational Thermal Generating Unit 
\section[{i. Case Study I-40 Thermal-Generator Lossless System Without Wind Power}]{i. Case Study I-40 Thermal-Generator Lossless System Without Wind Power}\par
In this case forty operational generating unit is consider without integration of wind power means all the generating units are coal fired. Input parameters like generators operating limit, fuel cost coefficients and emission coefficients are given in Appendix D and in Table \hyperref[tab_3]{11}. extracted from \hyperref[b45]{[45]}. System is considered lossless and its solution is compared with three well known multi-objective algorithms like SMODE \hyperref[b45]{[45]}, NSGA-II \hyperref[b45]{[45]}and MBFA \hyperref[b46]{[46]} in terms of various objectives such as best cost, best emission and best compromise between both objectives. Best compromise solution is then obtained by the fuzzy based method \hyperref[b47]{[47]}. Total power demand for this system is 10500 MW. Results obtained by NSWOA algorithm is added to table 7 and best pare to front obtained by NSWOA algorithm is represented in Fig. \hyperref[fig_17]{12}.\par
Non-Dominated Sorting Whale Optimization Algorithm (NSWOA): A Multi-Objective Optimization Algorithm for Solving Engineering Design Problems\par
ii. Case study lossless system with wind power All the conditions are remaining same as case study I like input parameters and power demand. While 
\section[{generator lossless system}]{generator lossless system}\par
All the conditions are remaining same as case y I like input parameters and power demand. While integrating with wind power plant, the total rated output power of wind farm is set to 1000 MW \hyperref[b45]{[45,}\hyperref[b47]{47]}.Statistical results obtained by NSWOA algorithm is reported in Table  {\ref 8} and best optimal front is represented in Fig. \hyperref[fig_4]{13}. integrating with wind power plant, the total rated output power of wind farm is set to 1000 MW \hyperref[b45]{[45,}\hyperref[b47]{47]}.Statistical results obtained by NSWOA algorithm is reported in sented in Fig. \hyperref[fig_4]{13}.    Fig. \hyperref[fig_4]{13}: Pareto optimal front obtained by the NSWOA Algorithm for "40 thermal-generator lossless system with wind power" b) Test system with six operational generating unit This test system consists of six operational generating unit with simply a quadratic fuel and emission objective function for a power demand of 1200 MW. Input data for operational generating unit loading limits and loss parameters are given in Table \hyperref[tab_17]{12} of Appendix D extracted from \hyperref[b52]{[52,} {\ref 53]}. 
\section[{Be st emission}]{Be st emission}\par
It is represented in Table \hyperref[tab_13]{10} that with the objective of least cost objective minimum fuel cost is 6.4197e+04 \$ and emission value is 1345.9 lb. But fuel cost increases to 6.992e+04 \$ and emission value reduced to a numeric value 1242.7 lb with the objective of emission minimization. Compromise point or true operating point obtained by NSWOA algorithm for multi-objective combined economic emission dispatch (MOCEED) problem is as fuel cost is 6.4830e+04 \$ that is higher than minimum fuel cost 6.4197e+04\$ and lower than 6.992e+04 \$ obtained during least cost and emission value objectives respectively. So as with emission value for true operating point is 1285 lb that is lower than 1345.9 lb and higher than 1242.7 lb obtained during least cost and emission value objectives respectively. Statistical value obtained for compromise point is compared with other techniques solves same MOCEED problem like SPEA2, NSGA-II and PDE in Table \hyperref[tab_13]{10}. Fig. \hyperref[fig_18]{14} shows 100 non-dominated solutions as true pare to front for 6-opertaional generating for PD=1200 MW.   
\section[{Result Discussion}]{Result Discussion}\par
In almost all the cases that we consider in this article where NSWOA algorithm proves its effectiveness in both prospective quantitative and qualitative. From plots also evident that NSWOA algorithm follows the exact pare to front similar to the true pare to front for all constrained, unconstrained and complex engineering design problem. So as for real world application of economic emission dispatch problem and its integration with stochastic wind power generation. So for this application Wilcox on test (statistical test)is performed.\par
In Table \hyperref[tab_12]{9} the signed rank test is presented in third row of each results whereas the calculation time is represented in forth row. For this test null hypothesis cannot be rejected at 5\% level for numeric value '0' while null hypothesis is rejected at 5\% level with the value of '1'. Where NSWOA algorithm performs superior to other algorithms that are considered for comparative purpose.\par
NSWOA algorithm shows good performance in both coverage and convergence as main mechanism that guarantee convergence in WOA and NSWO Aalgorithms are continuously shrink its virtual limitation using helix shaped or 9-shaped path strategy in the movement of whales for their random walk. Both mechanism emphasizes convergence and exploitation proportional to maximum number of generation (iteration). Since this complex task might degrade its performance compare to without limitation or free movement should be a concern. However, the numerical results expresses that NSWOA algorithm has a little effect of slow convergence at all. NSWOA algorithm has an advantage of high coverage, which is the result of the selection of position of whales and archive selection procedure. All the position is updated according to their fitness value that enable the algorithm to direct the search space in right direction to find the best solution without trapped in local solution. Archive selection criteria follow all the rules of the entrance and exhaust of any value in it for each iteration and updated when its size full. Solutions of higher fitness in archive have higher probability to thrown away first to improve the coverage of the pare to optimal front obtained during the optimization process. 
\section[{VII.}]{VII.} 
\section[{Conclusion}]{Conclusion}\par
In this paper the non-dominated sorting whale optimization algorithm-multi-objective version of recently proposed whale optimizationalgorithm (WOA) is proposed known as NSWOA algorithm. This paper also utilizes the bubble-net swarming strategy for exploration purpose used in its parent WOA version. The NSWOA algorithm is developed with equipping whale optimization algorithm with crowding distance criterion, an archive and whales position (accordance to ranking) selection method based on Pareto optimal dominance nature. The NSWOA algorithm is first applied on 17 standard test functions (including eight unconstraint, five constraint and four engineering design multi-objective problems) to prove its capability in terms of qualities and quantities showing numerical as well as convergence and coverage of pare to optimal front with respect to true pare to front. Then after NSWOA algorithm is applied to real world complex ECEDWP problem where algorithm proves its dominance over other well recognized contemporary algorithms. The numeric results are stored and represented in performance indices: GD, metric of diversity, metric of spacing and computational time. The qualitative results are reported as convergence and coverage in best pare to optimal front found in 15 independent runs. To check effectiveness of proposed version of algorithm the results are verified with SMODE, MOSOS, MOCBO, MOPSO, NSGA-II and other well recognize algorithms in the field of multi-objective algorithms. We can also conclude from the standard test functions results that NSWOA algorithm is able to find pare to optimal front of any kind of shape. Finally, the result of complex real world ECEDWP problem validates that NSWOA algorithm is capable of solving any kind of non-linear and complex problem with many constraint and unknown search space. Therefore, we conclude that proposed non-dominated version of WOA algorithm has various merits among the contemporary multi-objective algorithms as well as provides an alternative for solving multi or many objective problems.\par
For future works, it is suggested to test NSWOA algorithm on other real world complex problems. Also, it is worth to investigate and find the best constrained handling technique for this algorithm.\par
Appendix A: Unconstrained multi-objective test problems utilized in this work. 
\section[{KUR:}]{KUR:}\par
Minimize:ð??"ð??" 1 (??) = ? ?? 10exp (?0.2??? ?? 2 + ?? ??+1 2 ) ? 2 ??=1 ð??"ð??" 2 (??) = ? [|?? ?? | 0.8 + 5??????(?? ?? 3 )] 2 ??=1\par
5 51 3 i x i ? ? ? ? ? FON: 2 1 1 2 2 1 1 ( ) 1 exp ( ) min 1 ( ) 1 exp ( ) n i i n i i f x x n imize f x x n = = ? ? ? = ? ? ? ? ? ? ? ? ? = ? ? ? ? = ? ? + ? ? ? ? ? ? ? ? 4 4 1 i x i n ? ? ? ? ? ZDT1: ZDT2: Minimise: ?? ?? (??) = ?? ?? Minimise: ð??"ð??" 2 (??) = ð??"ð??"(??) × ??ð??"ð??" 1 (??), ð??"ð??"(??)? ??(??) = 1 + 9 ?? ? 1 ? ?? ?? ?? ??=2 ??ð??"ð??" 1 (??), ð??"ð??"(??)? = 1 ? ? ð??"ð??" 1 (??) ð??"ð??"(??) 0 ? ?? ?? ? 1, 1 ? ?? ?\textbf{30}\par
Where:\par
Minimise:ð??"ð??" 1 (??) = ?? 1\par
Minimise: ð??"ð??" 2 (??) = ð??"ð??"(??) × ??ð??"ð??" 1 (??), ð??"ð??"(??)?\par
Where: SCHN-1 :??(??) = 1 + 9 ???1 ? ?? ?? ?? ??=2 ??ð??"ð??" 1 (??), ð??"ð??"(??)? = 1 ? ? ð??"ð??" 1 (??) ð??"ð??"(??) ? 2 0 ? ?? ?? ? 1,Minimize: ð??"ð??" 1 (??) = ?? ?? 2 ð??"ð??" 2 (??) = (?? ? 2) 2 A x A ? ? ?\par
Where: value of can be from 10 to 10\textasciicircum 5. 
\section[{SCHN-2 :}]{SCHN-2 :}\par
Minimize:\par
( ) Where:1 2 2 x, 1 x 2, 1 3 ( ) 4 x, 3 4 x 4,\textbf{4}( ) 5 if x if x f x if x if x f x x ? ? ? ? ? ? ? < ? ? ? = ? ? ? < ? ? ? ? ? ? > ? ? ? = ? ?ð??"ð??" 1 (??) = ??? 1 2 ? ?? 2 2 + 1 + 0.1??????(16???????????? ? ?? 1 ?? 2 ?) ð??"ð??" 2 (??) = 0.5 ? (?? 1 ? 0.5) 2 ? (?? 2 ? 0.5) 2 0.1 ? ?? 1 ? ??, 0 ? ?? 2 ? ?? BNH:\par
This problem was first proposed by Binh and Korn \hyperref[b48]{[48]}:Minimise: ?? ?? (??) = ???? ?? ?? + ???? ?? ?? Minimise: ð??"ð??" 2 (??) = (?? 1 ? 5) 2 + (?? 2 ? 5) 2 ð??"ð??" 1 (??) = (?? 1 ? 5) 2 + ?? 2 2 ? 25 ð??"ð??" 2 (??) = 7.7 ? (?? 1 ? 8) 2 ? (?? 2 + 3) 2 0 ? ?? 1 ? 5,0 ? ?? 2 ? 3 
\section[{OSY:}]{OSY:}\par
The OSY test problem has five separated regions proposed by Osyczka and Kundu \hyperref[b49]{[49]}. Also, there are six constraints and six design variables. 
\section[{Minimise:}]{Minimise:}\par
ð??"ð??" 1 (??) = ?? Where:ð??"ð??" 1 (??) = 2 ? ?? 1 ? ?? 2 ð??"ð??" 2 (??) = ?6 + ?? 1 + ?? 2 ð??"ð??" 3 (??) = ?2 ? ?? 1 + ?? 2 ð??"ð??" 4 (??) = ?2 + ?? 1 ? 3?? 2 ð??"ð??" 5 (??) = ?4 + ?? 4 + (?? 3 ? 3) 2 ð??"ð??" 6 (??) = 4 ? ?? 6 ? (?? 5 ? 3) 2 0 ? ?? 1 ? 10,0 ? ?? 2 ? 10,1 ? ?? 3 ? 5,0 ? ?? 4 ? 6,1 ? ?? 5 ? 5,0 ? ?? 6 ? 10 SRN:\par
The third problem has a continuous Pareto optimal front proposed by Srinivas and Deb \hyperref[b50]{[50]}.\par
Minimise:ð??"ð??" 1 (??) = 2 + (?? 1 ? 2) 2 + (?? 2 ? 1) 2 Minimise: ð??"ð??" 2 (??) = 9?? 1 ? (?? 2 ? 1)\textbf{2}\par
Where:ð??"ð??" 1 (??) = ?? 1 2 + ?? 2 2 ? 255 ð??"ð??" 2 (??) = ?? 1 ? 3?? 2 + 10 ?20 ? ?? 1 ? 20, ?20 ? ?? 2 ?\textbf{20} 
\section[{CONSTR:}]{CONSTR:}\par
This problem has a convex Pareto front, and there are two constraints and two design variables.\par
Minimise:ð??"ð??" 1 (??) = ?? 1 Minimise: ð??"ð??" 2 (??) = (1 + ?? 2 )/(?? 1 )\par
Where:ð??"ð??" 1 (??) = 6 ? (?? 2 + 9?? 1 ), ð??"ð??" 2 (??) = 1 + ?? 2 ? 9?? 1 0.1 ? ?? 1 ? 1,0 ? ?? 2 ? 5\par
Appendix C: Constrained multi-objective engineering problems used in this work. 
\section[{Four-bar truss design problem:}]{Four-bar truss design problem:}\par
The 4-bar truss design problem is a well-known problem in the structural optimisation field \hyperref[b42]{[42]}, in which structural volume (f1) and displacement (f2) of a 4-bar truss should be minimized. As can be seen in the following equations, there are four design variables (x1-x4) related to cross sectional area of members 1, 2, 3, and 4. 
\section[{Minimise:}]{Minimise:}\par
?? ?? (??) = ?????? * (?? * ??(??) + ð??"ð??"ð??"ð??"ð??"ð??"ð??"ð??"(?? * ??(??)) + ð??"ð??"ð??"ð??"ð??"ð??"ð??"ð??"(??(??)) + ??(??))Minimise: ð??"ð??" 2 (??) = 0.01 * (? 2 ??(1) ? + ? 2 * ???????? (2) ??(2) ? ? ((2 * ????????(2))/??(3)) + (2/??(1))) 1 ? ?? 1 ? 3,1.4142 ? ?? 2 ? 3,1.4142 ? ?? 3 ? 3,1 ? ?? 4 ? 3 
\section[{Speed reducer design problem:}]{Speed reducer design problem:}\par
The speed reducer design problem is a well-known problem in the area of mechanical engineering \hyperref[b43]{[43]}, in which the weight (f1) and stress (f2) of a speed reducer should be minimized. There are seven design variables: gear face width (x1), teeth module (x2), number of teeth of pinion (x3 integer variable), distance between bearings 1 (x4), distance between bearings 2 (x5), diameter of shaft 1 (x6), and diameter of shaft 2 (x7) as well as eleven constraints. 
\section[{Minimise:}]{Minimise:}\par
ð??"ð??"  The disk brake design problem has mixed constraints and was proposed by Ray and Liew \hyperref[b44]{[44]}. The objectives to be minimized are: stopping time (f1) and mass of a brake (f2) of a disk brake. As can be seen in following equations, there are four design variables: the inner radius of the disk (x1), the outer radius of the disk (x2), the engaging force (x3), and the number of friction surfaces (x4) as well as five constraints.  \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-3.png}
\caption{\label{fig_1}3 )}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{22}\includegraphics[]{image-4.png}
\caption{\label{fig_2}?n?\{1, 2 ,Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-7.png}
\caption{\label{fig_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-9.png}
\caption{\label{fig_7}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-10.png}
\caption{\label{fig_9}Fig. 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-11.png}
\caption{\label{fig_10}FFig. 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-12.png}
\caption{\label{fig_11}7 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-13.png}
\caption{\label{fig_12}Fig. 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-14.png}
\caption{\label{fig_13}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-15.png}
\caption{\label{fig_14}Fig. 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{99}\includegraphics[]{image-16.png}
\caption{\label{fig_15}9 .Fig. 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-17.png}
\caption{\label{fig_16}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-18.png}
\caption{\label{fig_17}Fig. 12 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{14}\includegraphics[]{image-19.png}
\caption{\label{fig_18}Fig. 14 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-20.png}
\caption{\label{fig_19}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{112131415171819110111165}\includegraphics[]{image-21.png}
\caption{\label{fig_20}1 ( 1 ð??"ð??" 2 ( 1 ð??"ð??" 3 ( 1 ð??"ð??" 4 ( 1 ð??"ð??" 5 ( 1 ð??"ð??" 7 ( 1 ð??"ð??" 8 ( 1 ð??"ð??" 9 ( 1 ð??"ð??" 10 ( 1 ð??"ð??" 11 ( 1 2. 6 ? 5}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1528}\includegraphics[]{image-22.png}
\caption{\label{fig_21}Minimise: ð??"ð??" 1 ( 5 Where? 28 ?}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{13034415}\includegraphics[]{image-23.png}
\caption{\label{fig_22}Minimise: ð??"ð??" 1 ( 30 ð??"ð??" 3 ( 4 ð??"ð??" 4 ( 1 ð??"ð??" 5 (}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.03076280623608018\textwidth}P{0.028869710467706013\textwidth}P{0.16469933184855234\textwidth}P{0.013251670378619154\textwidth}P{0.15428730512249442\textwidth}P{0.15476057906458798\textwidth}P{0.14340200445434298\textwidth}P{0.15570712694877506\textwidth}P{0.004259465478841871\textwidth}}
Algorithm ? Function â??"\tabcellsep PFs\tabcellsep \tabcellsep NSWOA MEAN±SD\tabcellsep MOSOS MEAN±SD\tabcellsep MOCBO MEAN±SD\tabcellsep MOPSO MEAN±SD\tabcellsep NSGA -MEAN±SD II\\
\tabcellsep GD\tabcellsep \multicolumn{2}{l}{0.00722±0.00211}\tabcellsep 0.0075±0.0042\tabcellsep 0.0083±0.0062\tabcellsep 0.015±0.0075\tabcellsep 0.0301±0.0043\\
KUR\tabcellsep Î?"\tabcellsep \multicolumn{2}{l}{0.02699±0.00025}\tabcellsep 0.0295±0.0122\tabcellsep 0.0357±0.0236\tabcellsep 0.0991±0.031\tabcellsep 0.0362±0.0240\\
\tabcellsep CT\tabcellsep \multicolumn{2}{l}{7.55752±0.43359}\tabcellsep 10.7413±0.822\tabcellsep 7.9531±0.5823\tabcellsep 8.0532±0.621\tabcellsep 20.4368±3.102\\
\tabcellsep GD\tabcellsep \multicolumn{2}{l}{0.00163±0.00022}\tabcellsep 0.0019±0.0002\tabcellsep 0.0022±0.0003\tabcellsep 0.0042±0.000\tabcellsep 0.0026±0.0003\\
FON\tabcellsep Î?" CT GD\tabcellsep \multicolumn{2}{l}{0.28815±0.03648 09.6571±0.54537 0.36659±0.06618}\tabcellsep 0.3875±0.0062 11.4013±1.140 0.3325±0.0256\tabcellsep 0.3955±0.0068 8.6606±0.8862 0.3337±0.0319\tabcellsep 0.4158±0.008 8.732±0.9134 0.3348±0.035\tabcellsep 0.3987±0.0082 22.0323±4.522 0.3352±0.038\tabcellsep Year 2017\\
ZDT-1\tabcellsep Î?"\tabcellsep \multicolumn{2}{l}{0.34579±0.00775}\tabcellsep 0.3803±0.0122\tabcellsep 0.3825±0.0125\tabcellsep 0.3876±0.024\tabcellsep 0.3905±0.0220\\
\tabcellsep CT\tabcellsep \multicolumn{2}{l}{6.59899±0.00371}\tabcellsep 8.2351±0.0204\tabcellsep 3.1435±0.0193\tabcellsep 3.7533±0.006\tabcellsep 11.2681±0.364\\
\tabcellsep GD\tabcellsep 0\tabcellsep . 07001±0.00066\tabcellsep 0.0731±0.0010\tabcellsep 0.0729±0.0005\tabcellsep 0.0733±0.001\tabcellsep 0.0725±0.0004\\
ZDT-2\tabcellsep Î?"\tabcellsep \multicolumn{2}{l}{0.04133±0.06577}\tabcellsep 0.4307±0.0007\tabcellsep 0.4316±0.0007\tabcellsep 0.4321±0.001\tabcellsep 0.431±0.00075\\
\tabcellsep CT\tabcellsep \multicolumn{2}{l}{4.65825±0.02000}\tabcellsep 8.2345±0.0457\tabcellsep 3.1502±0.0130\tabcellsep 3.6113±0.014\tabcellsep 11.2811±0.024\\
\tabcellsep GD\tabcellsep \multicolumn{2}{l}{0.07132±0.03917}\tabcellsep 0.1022±0.5187\tabcellsep 0.0982±0.5007\tabcellsep 0.1235±0.009\tabcellsep 0.1147±0.0039\\
ZD T-3\tabcellsep Î?"\tabcellsep \multicolumn{2}{l}{0.69774±0.23268}\tabcellsep 0.6537±0.0052\tabcellsep 0.65325±0.002\tabcellsep 0.8234±0.108\tabcellsep 0.7386±0.0474\\
\tabcellsep CT\tabcellsep \multicolumn{2}{l}{8.77756±0.34789}\tabcellsep 13.4567±0.129\tabcellsep 6.2846±0.1059\tabcellsep 8.3764±0.231\tabcellsep 14.3406±0.144\\
\tabcellsep GD\tabcellsep \multicolumn{2}{l}{0.49888±0.00022}\tabcellsep 0.5015±0.0006\tabcellsep 0.5078±0.0013\tabcellsep 0.5146±0.001\tabcellsep 0.5204±0.0019\\
ZD T-4\tabcellsep Î?"\tabcellsep \multicolumn{2}{l}{0.35779±0.01477}\tabcellsep 0.4585±0.0073\tabcellsep 0.4795±0.0079\tabcellsep 0.6543±0.024\tabcellsep 0.7003±0.0089\\
\tabcellsep CT\tabcellsep \multicolumn{2}{l}{7.87855±0.12275}\tabcellsep 13.9022±0.121\tabcellsep 6.6922±0.1440\tabcellsep 8.8203±0.218\tabcellsep 14.8102±0.170\\
\tabcellsep GD\tabcellsep \multicolumn{2}{l}{0.00999±0.00075}\tabcellsep 0.0028±0.0024\tabcellsep 0.0031±0.0032\tabcellsep 0.0032±0.003\tabcellsep 0.0034±0.0042\\
SCHN-1\tabcellsep Î?"\tabcellsep \multicolumn{2}{l}{0.50066±0.01477}\tabcellsep 0.5295±0.1312\tabcellsep 0.5302±0.1356\tabcellsep 0.8582±0.164\tabcellsep 0.5502±0.1360\\
\tabcellsep CT\tabcellsep \multicolumn{2}{l}{11.7600±1.23165}\tabcellsep 8.2135±1.121\tabcellsep 5.4845±1.1320\tabcellsep 5.5721±1.133\tabcellsep 17.9121±2.162\\
\tabcellsep GD\tabcellsep \multicolumn{2}{l}{0.04977±0.00188}\tabcellsep 0.0705±0.0215\tabcellsep 0.0932±0.0228\tabcellsep 0.1497±0.022\tabcellsep 0.3096±0.0217\\
SCHN-2\tabcellsep Î?"\tabcellsep \multicolumn{2}{l}{0.65698±0.02888}\tabcellsep 0.7821±0.0512\tabcellsep 0.801±0.08326\tabcellsep 0.8652±0.060\tabcellsep 0.9562±0.0921\\
\tabcellsep CT\tabcellsep \multicolumn{2}{l}{5.79912±0.14008}\tabcellsep 8.7015±0.4532\tabcellsep 5.9751±0.2821\tabcellsep 6.0272±0.582\tabcellsep 18.421±2.1802\end{longtable} \par
  {\small\itshape [Note: F b) Results on constrained test problemsThe next set of standard test functions consisting of constrained functions. For constrained test function it should be necessary that NSWOA algorithm]} 
\caption{\label{tab_3}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.02316076294277929\textwidth}P{0.02258174386920981\textwidth}P{0.1870231607629428\textwidth}P{0.12043596730245232\textwidth}P{0.12043596730245232\textwidth}P{0.12043596730245232\textwidth}P{0.2507152588555858\textwidth}P{0.00521117166212534\textwidth}}
\tabcellsep \tabcellsep \multicolumn{5}{l}{Results of the multi-objective NSWOA algorithms on constrained test problems problems}\tabcellsep \\
Algorithm?\tabcellsep \tabcellsep NSWOA\tabcellsep MOSOS\tabcellsep MOCBO\tabcellsep MOPSO\tabcellsep NSGA-II\tabcellsep \\
\tabcellsep PFs\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Function â??"\tabcellsep \tabcellsep MEAN±SD\tabcellsep MEAN±SD\tabcellsep MEAN±SD\tabcellsep MEAN±SD\tabcellsep MEAN±SD\tabcellsep \\
\tabcellsep GD\tabcellsep 0.14566±0.00216\tabcellsep 0.1508±0.0040\tabcellsep 0.1528±0.0051\tabcellsep 0.1576±0.0062\tabcellsep 0.1 542±0.0072 0.1 542±0.0072\tabcellsep \\
TNK\tabcellsep Î?"\tabcellsep 0.09996±0.05027\tabcellsep 0.1206±0.0423\tabcellsep 0.1242±0.0512\tabcellsep 0.1286±0.0522\tabcellsep 0.1 26±0.06242 0.126±0.06242\tabcellsep \\
\tabcellsep CT\tabcellsep 10.7775±0.04668\tabcellsep 15.1286±0.063\tabcellsep 11.0104±0.052\tabcellsep 12.0212±0.054\tabcellsep 17. 4204±0.055 17.4204±0.055\tabcellsep \\
\tabcellsep GD\tabcellsep 0.10004±0.00029\tabcellsep 0.1196±0.0031\tabcellsep 0.1210±0.0041\tabcellsep 0.1282±0.0042\tabcellsep 0.1 242±0.0043 0.1 242±0.0043\tabcellsep \\
OSY\tabcellsep Î?" CT\tabcellsep 0.54798±0.06679 15.4470±0.02008\tabcellsep 0.5354±0.0616 20.2124±0.032\tabcellsep 0.5422±0.0712 12.2104±0.030\tabcellsep 0.5931±0.0721 14.6420±0.042\tabcellsep 0.5682±0.0751 24. 2204±0.039 0.5682±0.0751 24. 2204±0.039\tabcellsep Year 2017\\
\tabcellsep GD\tabcellsep 0.14447±0.00488\tabcellsep 0.1436±0.0062\tabcellsep 0.1498±0.0076\tabcellsep 0.1644±0.0078\tabcellsep 0.1 566±0.0042 0.1566±0.0042\tabcellsep \\
BNH\tabcellsep Î?"\tabcellsep 0.44477±0.03786\tabcellsep 0.4288±0.0625\tabcellsep 0.4798±0.0721\tabcellsep 0.4975±0.0632\tabcellsep 0.4892±0.0832 0.4892±0.0832\tabcellsep \\
\tabcellsep CT\tabcellsep 07.5524±0.04587\tabcellsep 16.2664±0.054\tabcellsep 9.1544±0.0420\tabcellsep 9.7452±0.0464\tabcellsep 19. 652±0.0511 19. 652±0.0511\tabcellsep \\
\tabcellsep GD\tabcellsep 0.05881±0.01499\tabcellsep 0.0988±0.0014\tabcellsep 0.1018±0.0015\tabcellsep 0.1125±0.0026\tabcellsep 0.1 024±0.0032 0.1 024±0.0032\tabcellsep \\
SRN\tabcellsep Î?"\tabcellsep 0.20444±0.00098\tabcellsep 0.2295±0.0017\tabcellsep 0.2352±0.0019\tabcellsep 0.2730±0.0023\tabcellsep 0. 0.2 2468±0.0018 468±0.0018\tabcellsep \\
\tabcellsep CT\tabcellsep 7.24456±0.00122\tabcellsep 12.3254±0.012\tabcellsep 7.3251±0.0082\tabcellsep 9.2134±0.0083\tabcellsep 17. 0231±0.023 17. 0231±0.023\tabcellsep \\
\tabcellsep GD\tabcellsep 0.42115±0.02998\tabcellsep 0.5162±0.0021\tabcellsep 0.5202±0.0034\tabcellsep 0.5854±0.0036\tabcellsep 0.5532±0.0041 532±0.0041\tabcellsep \\
CONST\tabcellsep Î?"\tabcellsep 0.7865±0.000666\tabcellsep 0.7122±0.0072\tabcellsep 0.7235±0.0083\tabcellsep 0.7344±0.0084\tabcellsep 0.8126±0.0087 126±0.0087\tabcellsep \\
\tabcellsep CT\tabcellsep 16.7555±0.00050\tabcellsep 10.0112±0.003\tabcellsep 5.2252±0.0028\tabcellsep 6.4766±0.0035\tabcellsep 14. 0892±0.003 14. 0892±0.003\tabcellsep \end{longtable} \par
 
\caption{\label{tab_4}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{P{0.4381637168141593\textwidth}P{0.4118362831858407\textwidth}}
\tabcellsep bus truss design problem"\\
\multicolumn{2}{l}{problem consists of two minimization objectives stress}\\
\multicolumn{2}{l}{and weight with seven design control variable}\\
\multicolumn{2}{l}{mathematically given in Appendix C.}\\
GD\tabcellsep S\\
MEAN±SD\tabcellsep \\
0.96469±0.41014800\tabcellsep 1.778124±04.943415 1.778124±04.943415\\
0.98831±0.17894217\tabcellsep 16. 68520±2.6969443 16. 68520±2.6969443\\
9.843702±7.0810303\tabcellsep 02.7654494±3.534978 02.7654494±3.534978\\
3.117536±1.6781086\tabcellsep 47.80098±32.8015157 47.80098±32.8015157\\
77.99834±4.2102608\tabcellsep 16.20129±4.26842769 16.20129±4.26842769\end{longtable} \par
  {\small\itshape [Note: and best optimal front is known mechanical design problem consists of two minimization objectives stress and weight with seven design control var mathematically given in Appendix C. MEAN±SD © 2017 Global Journals Inc. (US)]} 
\caption{\label{tab_5}Table 4}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_6}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_7}Table 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6} \par 
\begin{longtable}{P{0.85\textwidth}}
Year 2017\\
29\\
Journal of Researches in Engineering ( ) Volume XVII Issue IV Version I F\\
Global\end{longtable} \par
 
\caption{\label{tab_8}Table 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_10}Table 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{.} \par 
\begin{longtable}{P{0.046495726495726496\textwidth}P{0.07410256410256409\textwidth}P{0.05521367521367521\textwidth}P{0.07119658119658119\textwidth}P{0.05957264957264957\textwidth}P{0.07119658119658119\textwidth}P{0.07119658119658119\textwidth}P{0.09299145299145299\textwidth}P{0.04358974358974359\textwidth}P{0.07119658119658119\textwidth}P{0.05957264957264957\textwidth}P{0.06247863247863248\textwidth}P{0.07119658119658119\textwidth}}
\tabcellsep \tabcellsep \multicolumn{2}{l}{SMODE[45]}\tabcellsep \tabcellsep \multicolumn{2}{l}{NSGAII [45]}\tabcellsep \multicolumn{3}{l}{MOEA/D[51]}\tabcellsep \tabcellsep NSWOA\tabcellsep \\
Case Study-II\tabcellsep \multicolumn{2}{l}{Best emission Best cost}\tabcellsep Best Compromise\tabcellsep Best emission\tabcellsep Best cost\tabcellsep Best Compromise\tabcellsep \multicolumn{2}{l}{Best emission Best cost}\tabcellsep Best Compromise\tabcellsep Best emission\tabcellsep Best cost\tabcellsep Best Compromise\\
\tabcellsep \tabcellsep \tabcellsep -Point\tabcellsep \tabcellsep \tabcellsep -Point\tabcellsep \tabcellsep \tabcellsep -Point\tabcellsep \tabcellsep \tabcellsep -Point\\
?P G\tabcellsep 10,245.76\tabcellsep 10,177.55\tabcellsep 10,225.71\tabcellsep 10,241.72\tabcellsep 10,242.09\tabcellsep 10,241.63\tabcellsep 10,244.43\tabcellsep 10,242.71\tabcellsep 10,242.8\tabcellsep 10,241.6\tabcellsep 10,224.18\tabcellsep 10,236.58\\
P W\tabcellsep 254.24\tabcellsep 322.45\tabcellsep 274.29\tabcellsep 258.28\tabcellsep 257.91\tabcellsep 258.37\tabcellsep 255.568\tabcellsep 257.294\tabcellsep 257.156\tabcellsep 255.321\tabcellsep 276.81\tabcellsep 263.75\\
Cost\tabcellsep 153,830\tabcellsep 116,430\tabcellsep 123,590\tabcellsep 132,410\tabcellsep 122,610\tabcellsep 126,240\tabcellsep 154,0 0 0\tabcellsep 115,770\tabcellsep 120,950\tabcellsep 145,636\tabcellsep 118,789\tabcellsep 123,449\\
\tabcellsep 54,055\tabcellsep 385,770\tabcellsep 68,855\tabcellsep 73,894\tabcellsep 121,850\tabcellsep 78,860\tabcellsep 55,754\tabcellsep 440,240\tabcellsep 79,485\tabcellsep 56,508\tabcellsep 179,098\tabcellsep 68,804\\
Emission\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_11}Table . 8}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9} \par 
\begin{longtable}{P{0.05483870967741935\textwidth}P{0.15994623655913978\textwidth}P{0.11424731182795698\textwidth}P{0.08987455197132616\textwidth}P{0.05788530465949821\textwidth}P{0.1614695340501792\textwidth}P{0.1218637992831541\textwidth}P{0.08987455197132616\textwidth}}
\tabcellsep \tabcellsep NSWOA\tabcellsep NSGAII[45]\tabcellsep \tabcellsep \tabcellsep NSWOA\tabcellsep NSGAII[45]\\
Case\tabcellsep Best\tabcellsep 119310\tabcellsep 124,380\tabcellsep Case\tabcellsep Best\tabcellsep 118,789\tabcellsep 122,610\\
Study I\tabcellsep Worst\tabcellsep 127555\tabcellsep 147,760\tabcellsep Study II\tabcellsep Worst\tabcellsep 145,636\tabcellsep 173,060\\
Cost\tabcellsep Mean Wilcox\tabcellsep 124831\tabcellsep 131,710\tabcellsep Cost\tabcellsep Mean\tabcellsep 123,449 ?10\tabcellsep 134,880\\
\tabcellsep on\tabcellsep 1/5.38e?10\tabcellsep \tabcellsep \tabcellsep Wilcox on test\tabcellsep 1/5.65e\tabcellsep \\
\tabcellsep test (H/P)\tabcellsep 14.98\tabcellsep \tabcellsep \tabcellsep (H/P)\tabcellsep 19.876\tabcellsep \\
\tabcellsep Simulation\tabcellsep \tabcellsep \tabcellsep \tabcellsep Simulation\tabcellsep \tabcellsep \\
\tabcellsep speed (s)\tabcellsep \tabcellsep \tabcellsep \tabcellsep speed (s)\tabcellsep \tabcellsep \\
Case Study I Emission\tabcellsep Best Worst Mean Wilcoxon\tabcellsep 87,123 408.020 189,284\tabcellsep 93,002 194,830 141,800\tabcellsep Case Study II Emission\tabcellsep Best Worst Mean\tabcellsep 56,508 179,098 104,185\tabcellsep 73,894 158,250 102,120\\
\tabcellsep test (H/P)\tabcellsep 1/5.54e?10\tabcellsep \tabcellsep \tabcellsep Wilcox on\tabcellsep 1/5.65e?10\tabcellsep \\
\tabcellsep Simulation speed (s)\tabcellsep 40.57\tabcellsep 154.78\tabcellsep \tabcellsep test (H/P) speed (s) Simulation\tabcellsep 45.67\tabcellsep 127.57\end{longtable} \par
 
\caption{\label{tab_12}Table 9 9}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10} \par 
\begin{longtable}{P{0.6375\textwidth}P{0.2125\textwidth}}
NSWOA\tabcellsep MODE[\\
Parameters\tabcellsep \end{longtable} \par
 
\caption{\label{tab_13}Table 10 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.1187624750499002\textwidth}P{0.10179640718562874\textwidth}P{0.11367265469061877\textwidth}P{0.09161676646706587\textwidth}P{0.10688622754491017\textwidth}P{0.10688622754491017\textwidth}P{0.10688622754491017\textwidth}P{0.10349301397205589\textwidth}}
\tabcellsep Economic dispatch\tabcellsep Emission dispatch\tabcellsep EED\tabcellsep EED\tabcellsep EED\tabcellsep EED\tabcellsep EED\\
P 1 (MW)\tabcellsep 84.7275\tabcellsep 125\tabcellsep 107.9932\tabcellsep 108.6284\tabcellsep 107.3965\tabcellsep 113.1259\tabcellsep 104.1573\\
P 2 (MW)\tabcellsep 93.4118\tabcellsep 150\tabcellsep 118.3631\tabcellsep 115.9456\tabcellsep 122.1418\tabcellsep 116.4488\tabcellsep 122.9807\\
P 3 (MW)\tabcellsep 210\tabcellsep 201.4824\tabcellsep 210\tabcellsep 206.7969\tabcellsep 206.7536\tabcellsep 217.4191\tabcellsep 214.9553\\
P 4 (MW)\tabcellsep 211.8607\tabcellsep 198.8723\tabcellsep 204.65\tabcellsep 210.0000\tabcellsep 203.7047\tabcellsep 207.9492\tabcellsep 203.1387\\
P 5 (MW)\tabcellsep 315\tabcellsep 288.5129\tabcellsep 306.6592\tabcellsep 301.8884\tabcellsep 308.1045\tabcellsep 304.6641\tabcellsep 316.0302\\
P 6 (MW)\tabcellsep 325\tabcellsep 286.2913\tabcellsep 303.8712\tabcellsep 308.4127\tabcellsep 303.3797\tabcellsep 291.5969\tabcellsep 289.9396\\
Cost (\$)\tabcellsep 64,197\tabcellsep 65,992\tabcellsep 64,830\tabcellsep 64,843\tabcellsep 64,920\tabcellsep 64,962\tabcellsep 64,884\\
Emission (lb)\tabcellsep 1345.9\tabcellsep 1242.7\tabcellsep 1285\tabcellsep 1286.0\tabcellsep 1281.0\tabcellsep 1281.0\tabcellsep 1285\end{longtable} \par
 
\caption{\label{tab_14}53] PDE [53] NSGAII[53] SPEA2[53]}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.5219298245614035\textwidth}P{0.013765182186234818\textwidth}P{0.03441295546558704\textwidth}P{0.27989203778677463\textwidth}}
\multicolumn{2}{l}{dispatch 1269383. Where: ??(??) = 1 + problem. Cogent 9 29 ? ?? ?? ?? ??=2 ??ð??"ð??" 1 (??), ð??"ð??"(??)? = 1 ? ? Engineering, (1), ð??"ð??" 1 (??) ð??"ð??"(??)}\tabcellsep 55. ? ?\tabcellsep Watkins WA, Schevill WE. Aerial observation of feeding behavior in four baleen whales: Eubalaena ð??"ð??" 1 (??) ð??"ð??"(??) ? sin?10??ð??"ð??" 1 (??)? 0 ? ?? ?? ? 1, 1 ? ?? ? 30\\
\multicolumn{2}{l}{53. J .S. Dhillon , S.C. Parti and D P Kothari, " Multi-https://doi.org/10.1080/23311916.2016.126933 ZDT4:}\tabcellsep \tabcellsep glacialis, novaean-gliae, and Balaenoptera physalus. J Balaenoptera borealis, Megaptera\\
\multicolumn{2}{l}{objective optimal thermal power dispatch", Electrical Minimise: ð??"ð??" 1 (??) = ?? 1}\tabcellsep \tabcellsep Mammal 1979: 155-63.\\
\multicolumn{2}{l}{Power \& Energy Systems, Volume 16, Number 6,}\tabcellsep \multicolumn{2}{l}{56. Goldbogen JA , Friedlaender AS , Calambokidis J ,}\\
\multicolumn{2}{l}{1994, pp. 383-389. Minimise: ð??"ð??" 2 (??) = ð??"ð??"(??) × ??ð??"ð??" 1 (??), ð??"ð??"(??)?}\tabcellsep \tabcellsep Mckenna MF , Simon M , Nowacek DP . Integrative\\
\multicolumn{2}{l}{54. Hof PR , Van Der Gucht E . Structure of the cerebral}\tabcellsep \tabcellsep approaches to the study of baleen whale diving be-\\
\multicolumn{4}{l}{cortex of the humpback whale, Megaptera novaeangliae (Cetacea, Mysticeti, Balaenopteridae). Anat Rec 2007;290:1-31 . ??ð??"ð??" 1 (??), ð??"ð??"(??)? = 1 ? ? ð??"ð??" 1 (??) g(x) = 91 + ?(?? ?? havior, feeding performance, and foraging ecology. BioScience 2013;63:90-100 . 10 2 ? 10  *  cos (4???? ?? )) ð??"ð??"(??) ??=2}\\
\tabcellsep \tabcellsep \tabcellsep Year 2017\\
\tabcellsep \tabcellsep \tabcellsep Journal of Researches in Engineering ( ) Volume XVII Issue IV Version I F\\
\tabcellsep \tabcellsep \tabcellsep Global\\
\tabcellsep \tabcellsep \tabcellsep 1 ? ?? ? 30\\
ZDT3:\tabcellsep \tabcellsep \\
Minimise:\tabcellsep ð??"ð??" 1 (??) = ?? 1\tabcellsep \end{longtable} \par
 
\caption{\label{tab_15}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.5804878048780489\textwidth}P{0.05528455284552846\textwidth}P{0.048373983739837395\textwidth}P{0.05528455284552846\textwidth}P{0.048373983739837395\textwidth}P{0.05528455284552846\textwidth}P{0.0069105691056910576\textwidth}}
( ) Volume XVII Issue IV Version I\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Global Journal of Researches in Engineering\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Where:\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
1\tabcellsep 2 + ?? 2\tabcellsep 2 +?? 3\tabcellsep 2 + ?? 4\tabcellsep 2 +?? 5\tabcellsep 2 + ?? 6\tabcellsep 2\end{longtable} \par
 
\caption{\label{tab_16}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12} \par 
\begin{longtable}{P{0.03516949152542373\textwidth}P{0.041949152542372886\textwidth}P{0.049576271186440674\textwidth}P{0.136864406779661\textwidth}P{0.0656779661016949\textwidth}P{0.09830508474576272\textwidth}P{0.09322033898305085\textwidth}P{0.08220338983050847\textwidth}P{0.04533898305084746\textwidth}P{0.08940677966101696\textwidth}P{0.10805084745762711\textwidth}P{0.00423728813559322\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep Year 2017\\
Appendix D:\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\tabcellsep \tabcellsep \tabcellsep \multicolumn{6}{l}{Test system 1: 40-operational thermal generating unit}\tabcellsep \tabcellsep \tabcellsep \\
Unit\tabcellsep Pmin\tabcellsep Pmax\tabcellsep a i\tabcellsep b i\tabcellsep c i\tabcellsep ? i\tabcellsep ? i\tabcellsep ? i\tabcellsep ? i\tabcellsep ? i\tabcellsep \\
1\tabcellsep 36\tabcellsep 114\tabcellsep 0.00690\tabcellsep 6.73\tabcellsep 94.705\tabcellsep 0.048\tabcellsep -2.22\tabcellsep 60\tabcellsep 1.31\tabcellsep 0.0569\tabcellsep \\
2\tabcellsep 36\tabcellsep 114\tabcellsep 0.00690\tabcellsep 6.73\tabcellsep 94.705\tabcellsep 0.048\tabcellsep -2.22\tabcellsep 60\tabcellsep 1.31\tabcellsep 0.0569\tabcellsep \\
3\tabcellsep 60\tabcellsep 120\tabcellsep 0.02028\tabcellsep 7.07\tabcellsep 309.54\tabcellsep 0.0762\tabcellsep -2.36\tabcellsep 100\tabcellsep 1.31\tabcellsep 0.0569\tabcellsep \\
4\tabcellsep 80\tabcellsep 190\tabcellsep 0.00942\tabcellsep 8.18\tabcellsep 369.03\tabcellsep 0.054\tabcellsep -3.14\tabcellsep 120\tabcellsep 0.9142\tabcellsep 0.0454\tabcellsep \\
5\tabcellsep 47\tabcellsep 97\tabcellsep 0.01140\tabcellsep 5.35\tabcellsep 148.89\tabcellsep 0.085\tabcellsep -1.89\tabcellsep 50\tabcellsep 0.9936\tabcellsep 0.0406\tabcellsep \\
6\tabcellsep 68\tabcellsep 140\tabcellsep 0.01142\tabcellsep 8.05\tabcellsep 222.33\tabcellsep 0.0854\tabcellsep -3.08\tabcellsep 80\tabcellsep 1.31\tabcellsep 0.0569\tabcellsep \\
7\tabcellsep 110\tabcellsep 300\tabcellsep 0.00357\tabcellsep 8.03\tabcellsep 287.71\tabcellsep 0.0242\tabcellsep -3.06\tabcellsep 100\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
8\tabcellsep 135\tabcellsep 300\tabcellsep 0.00492\tabcellsep 6.99\tabcellsep 391.98\tabcellsep 0.0335\tabcellsep -2.32\tabcellsep 130\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
9\tabcellsep 135\tabcellsep 300\tabcellsep 0.00573\tabcellsep 6.6\tabcellsep 455.76\tabcellsep 0.425\tabcellsep -2.11\tabcellsep 150\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
10\tabcellsep 130\tabcellsep 300\tabcellsep 0.00605\tabcellsep 12.9\tabcellsep 722.82\tabcellsep 0.0322\tabcellsep -4.34\tabcellsep 280\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
11\tabcellsep 94\tabcellsep 375\tabcellsep 0.00515\tabcellsep 12.9\tabcellsep 635.20\tabcellsep 0.0338\tabcellsep -4.34\tabcellsep 220\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
12\tabcellsep 94\tabcellsep 375\tabcellsep 0.00569\tabcellsep 12.8\tabcellsep 654.69\tabcellsep 0.0296\tabcellsep -4.28\tabcellsep 225\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
13 14\tabcellsep 125 125\tabcellsep 500 500\tabcellsep 0000421 0.00752\tabcellsep 12.5 8.84\tabcellsep 913.40 1760.4\tabcellsep 0.0512 0.0496\tabcellsep -4.18 -3.34\tabcellsep 300 520\tabcellsep 0.5035 0.5035\tabcellsep 0.02075 0.02075\tabcellsep F\\
15\tabcellsep 125\tabcellsep 500\tabcellsep 0.00708\tabcellsep 9.15\tabcellsep 1728.3\tabcellsep 0.0496\tabcellsep -3.55\tabcellsep 510\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
16\tabcellsep 125\tabcellsep 500\tabcellsep 0.00708\tabcellsep 9.15\tabcellsep 1728.3\tabcellsep 0.0151\tabcellsep -3.55\tabcellsep 510\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
17\tabcellsep 220\tabcellsep 500\tabcellsep 0.00313\tabcellsep 7.97\tabcellsep 647.85\tabcellsep 0.0151\tabcellsep -2.68\tabcellsep 220\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
18\tabcellsep 220\tabcellsep 500\tabcellsep 0.00313\tabcellsep 7.95\tabcellsep 649.69\tabcellsep 0.0151\tabcellsep -2.66\tabcellsep 222\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
19\tabcellsep 242\tabcellsep 550\tabcellsep 0.00313\tabcellsep 7.97\tabcellsep 647.83\tabcellsep 0.0151\tabcellsep -2.68\tabcellsep 220\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
20\tabcellsep 242\tabcellsep 550\tabcellsep 0.00313\tabcellsep 7.97\tabcellsep 647.81\tabcellsep 0.0145\tabcellsep -2.68\tabcellsep 220\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
21\tabcellsep 254\tabcellsep 550\tabcellsep 0.00298\tabcellsep 6.63\tabcellsep 785.96\tabcellsep 0.0145\tabcellsep -2.22\tabcellsep 290\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
22\tabcellsep 254\tabcellsep 550\tabcellsep 0.00298\tabcellsep 6.63\tabcellsep 785.96\tabcellsep 0.0138\tabcellsep -2.22\tabcellsep 285\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
23\tabcellsep 254\tabcellsep 550\tabcellsep 0.00284\tabcellsep 6.66\tabcellsep 794.53\tabcellsep 0.0138\tabcellsep -2.26\tabcellsep 295\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
24\tabcellsep 254\tabcellsep 550\tabcellsep 0.00284\tabcellsep 6.66\tabcellsep 794.53\tabcellsep 0.0132\tabcellsep -2.26\tabcellsep 295\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
25\tabcellsep 254\tabcellsep 550\tabcellsep 0.00277\tabcellsep 7.10\tabcellsep 801.32\tabcellsep 0.0132\tabcellsep -2.42\tabcellsep 310\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
26\tabcellsep 254\tabcellsep 550\tabcellsep 0.00277\tabcellsep 7.10\tabcellsep 801.32\tabcellsep 1.842\tabcellsep -2.42\tabcellsep 310\tabcellsep 0.5035\tabcellsep 0.02075\tabcellsep \\
27\tabcellsep 10\tabcellsep 150\tabcellsep 0.52124\tabcellsep 3.33\tabcellsep 1055.1\tabcellsep 1.842\tabcellsep -1.11\tabcellsep 360\tabcellsep 0.9936\tabcellsep 0.0406\tabcellsep \\
28\tabcellsep 10\tabcellsep 150\tabcellsep 0.52124\tabcellsep 3.33\tabcellsep 1055.1\tabcellsep 1.842\tabcellsep -1.11\tabcellsep 360\tabcellsep 0.9936\tabcellsep 0.0406\tabcellsep \\
29\tabcellsep 10\tabcellsep 150\tabcellsep 0.52124\tabcellsep 3.33\tabcellsep 1055.1\tabcellsep 1.842\tabcellsep -1.11\tabcellsep 360\tabcellsep 0.9936\tabcellsep 0.0406\tabcellsep \\
30\tabcellsep 47\tabcellsep 97\tabcellsep 0.01140\tabcellsep 5.35\tabcellsep 148.89\tabcellsep 0.085\tabcellsep -1.89\tabcellsep 50\tabcellsep 0.9936\tabcellsep 0.0406\tabcellsep \\
31\tabcellsep 60\tabcellsep 190\tabcellsep 0.00160\tabcellsep 6.43\tabcellsep 222.92\tabcellsep 0.0121\tabcellsep -2.08\tabcellsep 80\tabcellsep 0.9142\tabcellsep 0.0454\tabcellsep \\
32\tabcellsep 60\tabcellsep 190\tabcellsep 0.00160\tabcellsep 6.43\tabcellsep 222.92\tabcellsep 0.0121\tabcellsep -2.08\tabcellsep 80\tabcellsep 0.9142\tabcellsep 0.0454\tabcellsep \\
33\tabcellsep 60\tabcellsep 190\tabcellsep 0.00160\tabcellsep 6.43\tabcellsep 222.92\tabcellsep 0.0121\tabcellsep -2.08\tabcellsep 80\tabcellsep 0.9142\tabcellsep 0.0454\tabcellsep \\
34\tabcellsep 90\tabcellsep 200\tabcellsep 0.00010\tabcellsep 8.95\tabcellsep 107.87\tabcellsep 0.0012\tabcellsep -3.48\tabcellsep 65\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
35\tabcellsep 90\tabcellsep 200\tabcellsep 0.00010\tabcellsep 8.62\tabcellsep 116.58\tabcellsep 0.0012\tabcellsep -3.24\tabcellsep 70\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
36\tabcellsep 90\tabcellsep 200\tabcellsep 0.00010\tabcellsep 8.62\tabcellsep 116.58\tabcellsep 0.0012\tabcellsep -3.24\tabcellsep 70\tabcellsep 0.655\tabcellsep 0.02846\tabcellsep \\
37\tabcellsep 25\tabcellsep 110\tabcellsep 0.01610\tabcellsep 5.88\tabcellsep 307.45\tabcellsep 0.095\tabcellsep -1.98\tabcellsep 100\tabcellsep 1.42\tabcellsep 0.0677\tabcellsep \\
38\tabcellsep 25\tabcellsep 110\tabcellsep 0.01610\tabcellsep 5.88\tabcellsep 307.45\tabcellsep 0.095\tabcellsep -1.98\tabcellsep 100\tabcellsep 1.42\tabcellsep 0.0677\tabcellsep \end{longtable} \par
 
\caption{\label{tab_17}Table 12 :}\end{figure}
 			\footnote{© 2017 Global Journals Inc. (US)} 			\footnote{Year 2017 F © 2017 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Edgeworth]{b28}\label{b28} 	 		\textit{},  		 			F Y Edgeworth 		.  	 	 		\textit{Mathematical Physics: P. Keagan}  		p. 1881.  	 
\bibitem[Deb et al. ()]{b23}\label{b23} 	 		‘A fast and elitist multiobjective genetic algorithm: NSGA-II’.  		 			K Deb 		,  		 			A Pratap 		,  		 			S Agarwal 		,  		 			T Meyarivan 		.  	 	 		\textit{Evolutionary Computation}  		2002. 6 p. .  	 	 (IEEE Transactions on) 
\bibitem[Deb et al. ()]{b24}\label{b24} 	 		‘A fast and elitistmultiobjective genetic algorithm: NSGA-II’.  		 			K Deb 		,  		 			A Pratap 		,  		 			S Agarwal 		,  		 			T A M T Meyarivan 		.  	 	 		\textit{IEEE Trans. Evol. Comput}  		2002. 6  (2)  p. .  	 
\bibitem[Deb et al. ()]{b21}\label{b21} 	 		‘A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II’.  		 			K Deb 		,  		 			S Agrawal 		,  		 			A Pratap 		,  		 			T Meyarivan 		.  	 	 		\textit{Parallel problem solving from nature PPSN VI},  				2000. p. .  	 
\bibitem[Akbari et al. ()]{b31}\label{b31} 	 		‘A multi-objective artificial bee colony algorithm’.  		 			R Akbari 		,  		 			R Hedayatzadeh 		,  		 			K Ziarati 		,  		 			B Hassanizadeh 		.  	 	 		\textit{Swarm and Evolutionary Computation}  		2012. 2 p. .  	 
\bibitem[Osyczka and Kundu ()]{b49}\label{b49} 	 		‘A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm’.  		 			A Osyczka 		,  		 			S Kundu 		.  	 	 		\textit{Structural optimization}  		1995. 10 p. .  	 
\bibitem[Ray and Liew ()]{b44}\label{b44} 	 		\textit{A swarm metaphor for multiobjective design optimization},  		 			T Ray 		,  		 			K M Liew 		.  		2002. 34 p. .  	 	 (Engineering optimization) 
\bibitem[Panda and Pani ()]{b25}\label{b25} 	 		‘A Symbiotic Organisms Search algorithm with adaptive penaltyfunction to solve multi-objective constrained optimization problems’.  		 			Arnapurna Panda 		,  		 			Sabyasachi Pani 		.  	 	 		\textit{Applied Soft Computing}  		2016. 46 p. .  	 
\bibitem[Vogl et al. ()]{b1}\label{b1} 	 		‘Accelerating the convergence of the backpropagation method’.  		 			T P Vogl 		,  		 			J Mangis 		,  		 			A Rigler 		,  		 			W Zink 		,  		 			D Alkon 		.  	 	 		\textit{Biological cybernetics}  		1988. 59 p. .  	 
\bibitem[Bhesdadiya et al. ()]{b52}\label{b52} 	 		\textit{An NSGA-III algorithm for solving multi-objective economic/environmental},  		 			R H Bhesdadiya 		,  		 			I N Trivedi 		,  		 			P Jangir 		,  		 			N Jangir 		,  		 			A Kumar 		.  		2016.  	 
\bibitem[Deb and Goldberg ()]{b13}\label{b13} 	 		‘Analyzing deception in trap functions’.  		 			K Deb 		,  		 			D E Goldberg 		.  	 	 		\textit{Foundations of genetic algorithms},  				1993. 2 p. .  	 
\bibitem[Dorigo et al. ()]{b5}\label{b5} 	 		‘Ant colony optimization’.  		 			M Dorigo 		,  		 			M Birattari 		,  		 			T Stutzle 		.  	 	 		\textit{IEEE Comput Intell Mag}  		2006. 1 p. .  	 
\bibitem[Knowles and Corne ()]{b32}\label{b32} 	 		‘Approximating the nondominated front using the Pareto archived evolution strategy’.  		 			J D Knowles 		,  		 			D W Corne 		.  	 	 		\textit{Evol Comput}  		2000. 8  (2)  p. .  	 
\bibitem[Yang ()]{b30}\label{b30} 	 		‘Bat algorithm for multi-objective optimisation’.  		 			X.-S Yang 		.  	 	 		\textit{International Journal of Bio-Inspired Computation}  		2011. 3 p. .  	 
\bibitem[Kurpati et al. ()]{b43}\label{b43} 	 		‘Constraint handling improvements for multiobjective genetic algorithms’.  		 			A Kurpati 		,  		 			S Azarm 		,  		 			J Wu 		.  	 	 		\textit{Structural and Multidisciplinary Optimization},  				2002. 23 p. .  	 
\bibitem[Deb and Goel ()]{b22}\label{b22} 	 		‘Controlled elitist nondominated sorting genetic algorithms for better convergence’.  		 			K Deb 		,  		 			T Goel 		.  	 	 		\textit{Evolutionary multi-criterion optimization},  				2001. p. .  	 
\bibitem[Pareto ()]{b27}\label{b27} 	 		\textit{Cours d'economie politique: Librairie Droz},  		 			Pareto 		.  		1964.  	 
\bibitem[Gandomi et al. ()]{b7}\label{b7} 	 		‘Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems’.  		 			A H Gandomi 		,  		 			X-S Yang 		,  		 			A H Alavi 		.  	 	 		\textit{Eng Comput}  		2013. 29 p. .  	 
\bibitem[Kelley ()]{b0}\label{b0} 	 		‘Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition’.  		 			C T Kelley 		.  	 	 		\textit{SIAM Journal on Optimization}  		1999. 10 p. .  	 
\bibitem[Qu et al. ()]{b45}\label{b45} 	 		‘Economic emission dispatch problems with stochastic wind power using summation based multi-objective evolutionary algorithm’.  		 			B Y Qu 		,  		 			J J Liang 		,  		 			Y S Zhu 		,  		 			Z Y Wang 		,  		 			P N Suganthan 		.  	 	 		\textit{Information Sciences}  		2016. 351 p. .  	 
\bibitem[Hota et al. ()]{b46}\label{b46} 	 		‘Economic emission load dispatch through fuzzy based bacterial foraging algorithm’.  		 			P K Hota 		,  		 			A K Barisal 		,  		 			R Chakrabarti 		.  	 	 		\textit{Electr. Power Energy Syst}  		2010. 32 p. .  	 
\bibitem[Abido ()]{b47}\label{b47} 	 		‘Environmental / economic power dispatch using multiobjective evolutionary algorithms: a comparative study’.  		 			M A Abido 		.  	 	 		\textit{IEEE Trans Power Syst}  		2003. 1  (4)  p. .  	 
\bibitem[Schott]{b40}\label{b40} 	 		‘Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization’.  		 			J R Schott 		.  	 	 		\textit{DTIC Document1995},  				 	 
\bibitem[Coello et al. ()]{b18}\label{b18} 	 		‘Handling multiple objectives withparticle swarm optimization’.  		 			C A Coello 		,  		 			G T Pulido 		,  		 			M S Lechuga 		.  	 	 		\textit{IEEE Trans. Evol. Comput}  		2004. 8  (3)  p. .  	 
\bibitem[John ()]{b6}\label{b6} 	 		\textit{Holland, adaptation in natural and artificial systems},  		 			H John 		.  		1992. Cambridge: MIT Press.  	 
\bibitem[Gandomi ()]{b10}\label{b10} 	 		‘Interior Search Algorithm (ISA): A Novel Approach for Global Optimization’.  		 			A H Gandomi 		.  	 	 		\textit{ISA Transactions}  		2014. Elsevier. 53  (4)  p. .  	 
\bibitem[Sadollaha and Eskandarb ()]{b38}\label{b38} 	 		‘Joong Hoon Kim : Water cycle algorithm for solving constrained multiobjectiveoptimization problems’.  		 			Ali Sadollaha 		,  		 			Hadi Eskandarb 		.  	 	 		\textit{Applied Soft Computing}  		2015. 27 p. .  	 
\bibitem[Sadollah et al. (2014)]{b37}\label{b37} 	 		‘Joong Hoon Kim : Water cycle algorithm for solving multi-objective optimization problems’.  		 			Ali Sadollah 		,  		 			Hadi Eskandar 		,  		 			Ardeshir Bahreininejad 		.  	 	 		\textit{Soft Comput}  		06 september 2014.  	 
\bibitem[Gandomi and Alavi ()]{b9}\label{b9} 	 		‘Krill Herd: a new bioinspired optimization algorithm’.  		 			A H Gandomi 		,  		 			A H Alavi 		.  	 	 		\textit{Common Nonlinear Sci. Numer. Simul}  		2012. 17  (12)  p. .  	 
\bibitem[Sadollah et al. ()]{b8}\label{b8} 	 		‘Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems’.  		 			A Sadollah 		,  		 			A Bahreininejad 		,  		 			H Eskandar 		,  		 			M Hamdi 		.  	 	 		\textit{Appl Soft Comput}  		2013. 13 p. .  	 
\bibitem[Binh and Korn ()]{b48}\label{b48} 	 		‘MOBES: A multiobjective evolution strategy for constrained optimization problems’.  		 			T T Binh 		,  		 			U Korn 		.  	 	 		\textit{The Third International Conference on Genetic Algorithms},  				Mendel 97. 1997. p. 27.  	 
\bibitem[Zhang and Li (2007)]{b34}\label{b34} 	 		‘MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition’.  		 			Qingfu Zhang 		,  		 			Hui Li 		.  	 	 		\textit{IEEE transactions on evolutionary computation}  		december 2007. 11  (6) .  	 
\bibitem[Coello and Lechuga ()]{b20}\label{b20} 	 		‘MOPSO: a proposal for multiple objectiveparticle swarm optimization’.  		 			C A Coello 		,  		 			M S Lechuga 		.  	 	 		\textit{Proceedings of the IEEE Congress onEvolutionary Computation},  				 (the IEEE Congress onEvolutionary Computation)  		2002. p. .  	 
\bibitem[Mirjalili ()]{b2}\label{b2} 	 		‘Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm’.  		 			Seyedali Mirjalili 		.  	 	 		\textit{Knowledge-Based System}  		2015. 89 p. .  	 
\bibitem[Zhu and Wang ()]{b51}\label{b51} 	 		‘Multi-objective economic emission dispatch considering wind power using evolutionary algorithm based on decomposition’.  		 			Y S Zhu 		,  		 			J Wang 		.  	 	 		\textit{Electr. Power Energy Syst}  		2014. 63 p. .  	 
\bibitem[Srinivasan and Deb ()]{b50}\label{b50} 	 		‘Multi-objective function optimisation using non-dominated sorting genetic algorithm’.  		 			N Srinivasan 		,  		 			K Deb 		.  	 	 		\textit{Evolutionary Comp}  		1994. 2 p. .  	 
\bibitem[Mirjalili et al. ()]{b29}\label{b29} 	 		‘Multi-objective grey wolf optimizer: A novel algorithm for multi-criterion optimization’.  		 			S Mirjalili 		,  		 			S Saremi 		,  		 			S M Mirjalili 		,  		 			L D S Coelho 		.  	 	 		\textit{Expert Systems with Applications}  		2016. 47 p. .  	 
\bibitem[Panda and Pani ()]{b17}\label{b17} 	 		‘Multiobjective colliding bodies optimization’.  		 			A Panda 		,  		 			S Pani 		.  	 	 		\textit{Proceedings of 5th Int. Conf. on Soft Computing for Problem Solving},  				 (5th Int. Conf. on Soft Computing for Problem SolvingSocProS,IIT Roorkee, India)  		2015.  	 
\bibitem[Van Veldhuizen and Lamont ()]{b39}\label{b39} 	 		\textit{Multiobjective evolutionary algorithm research: A history and analysis},  		 			D A Van Veldhuizen 		,  		 			G B Lamont 		.  		Citeseer1998.  	 
\bibitem[Zitzler and Thiele ()]{b36}\label{b36} 	 		‘Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach’.  		 			E Zitzler 		,  		 			L Thiele 		.  	 	 		\textit{Evolutionary Computation}  		1999. 3 p. .  	 	 (IEEE Transactions on) 
\bibitem[Coello and Pulido ()]{b42}\label{b42} 	 		‘Multiobjective structural optimization using a microgenetic algorithm’.  		 			C C Coello 		,  		 			G T Pulido 		.  	 	 		\textit{Structural and Multidisciplinary Optimization},  				2005. 30 p. .  	 
\bibitem[Wolpert and Macready ()]{b15}\label{b15} 	 		‘No free lunch theorems for optimization’.  		 			D H Wolpert 		,  		 			W G Macready 		.  	 	 		\textit{Evolutionary Computation}  		1997. 1 p. .  	 	 (IEEE Transactions on) 
\bibitem[Ngatchou et al. ()]{b26}\label{b26} 	 		‘Pareto multi objective optimization," in Intelligent Systems Application to Power Systems’.  		 			P Ngatchou 		,  		 			A Zarei 		,  		 			M El-Sharkawi 		.  	 	 		\textit{Proceedings of the 13th International Conference on},  				 (the 13th International Conference on)  		2005. 2005. p. .  	 
\bibitem[Kennedy and Eberhart ()]{b4}\label{b4} 	 		‘Particle swarm optimization’.  		 			J Kennedy 		,  		 			R Eberhart 		.  	 	 		\textit{Proceedings of the IEEE International Conference on Neural Networks},  				 (the IEEE International Conference on Neural NetworksPerth, Australia)  		1995. p. .  	 
\bibitem[Abbass et al. ()]{b33}\label{b33} 	 		‘PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems’.  		 			H A Abbass 		,  		 			R Sarker 		,  		 			C Newton 		.  	 	 		\textit{Proceedings of the 2001 Congress on},  				 (the 2001 Congress on)  		2001. 2001. p. .  	 
\bibitem[Knowles et al. ()]{b12}\label{b12} 	 		\textit{Reducing local optima in single-objective problems by multi-objectivization," in Evolutionary multicriterion optimization},  		 			J D Knowles 		,  		 			R A Watson 		,  		 			D W Corne 		.  		2001. p. .  	 
\bibitem[Beyer and Sendhoff ()]{b11}\label{b11} 	 		‘Robust optimizationa comprehensive survey’.  		 			H.-G Beyer 		,  		 			B Sendhoff 		.  	 	 		\textit{Computer methods in applied mechanics and engineering}  		2007. 196 p. .  	 
\bibitem[Mirjalili and Lewis ()]{b16}\label{b16} 	 		‘The Whale Optimization Algorithm’.  		 			Seyedali Mirjalili 		,  		 			Andrew Lewis 		.  	 	 		\textit{Science Direct Advances in Engineering Software}  		2016. Elsevier. 95 p. .  	 
\bibitem[Coello ()]{b14}\label{b14} 	 		‘Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art’.  		 			C A C Coello 		.  	 	 		\textit{Computer methods in applied mechanics and engineering}  		2002. 191 p. .  	 
\bibitem[Coello ()]{b41}\label{b41} 	 		‘Use of a self-adaptive penalty approach for engineering optimization problems’.  		 			C A C Coello 		.  	 	 		\textit{Computers in Industry}  		2000. 41 p. .  	 
\bibitem[Volume XVII Issue IV Version I Global Journal of Researches in Engineering]{b19}\label{b19} 	 		‘Volume XVII Issue IV Version I’.  	 	 		\textit{Global Journal of Researches in Engineering}  		 	 
\bibitem[Yang ()]{b3}\label{b3} 	 		 			Xin-She Yang 		.  		\textit{The bat algorithm (BA),"A Bioinspired algorithm},  				2010.  	 
\bibitem[Zitzler ()]{b35}\label{b35} 	 		 			E Zitzler 		.  		\textit{Evolutionary algorithms for multiobjective optimization: Methods and applications},  				1999. Citeseer. 63.  	 
\end{bibitemlist}
 			 		 	 
\end{document}