deletions | additions       diff --git a/Introduction.tex b/Introduction.tex  index f4ad1be..ae69eb8 100644  --- a/Introduction.tex  +++ b/Introduction.tex 
...
In this section, we briefly present the theoretical background regarding the meta-heuristic techniques employed in this paper, as well as some basis related to optimization-based problems.   Let ${\cal S}=\{\textbf{x}_1,\textbf{x}_2,\ldots,\textbf{x}_m\}$ be a search space, where each possible solution $\textbf{x}_\in\Re^n$ is composed of $n$ decision variables. Additionally, let $f:{\cal S}\rightarrow\Re$ be a function to be minimized/maximized\footnote{For the sake of simplicity, we adopted a minimization problem.}  \section*{Acknowledgments}  The authors are grateful to FAPESP grants \#2013/20387-7 and \#2014/16250-9, as well as CNPq grants \#470571/2013-6 and \#306166/2014-3.