this is for holding javascript data
Joao Paulo Papa edited Introduction.tex
over 8 years ago
Commit id: 7b0ccf830cf13242e0321a4f2e3d7a1057f66560
deletions | additions
diff --git a/Introduction.tex b/Introduction.tex
index 91d8f60..73ccc5d 100644
--- a/Introduction.tex
+++ b/Introduction.tex
...
The Global-best Harmony Search (GHS)~\cite{Omran_2008} employs the same modification proposed by IHS with respect to dynamic $PAR$ values. However, it does not employ the concept of bandwidth, being Equation~\ref{e.par} replaced by:
\begin{equation}
\label{e.par_ghs}
x_{m+1,j} =
x_{best,j}, x_{best,z},
\end{equation}
where $z\sim U(1,2,\ldots,n)$, and $best$ stands for the index of the best harmony.