I would like to know what is the difference between MOGA and NSGA-II, in some literature it classifies as two separate methods but in other it classify NSGA as a MOGA method.
MOGA was introduced by Fonseca and Fleming (1993). Like NGSA, it assigns cost values on the basis of domination, but MOGA approaches cost assignment from opposite direction. Whereas NGSA assigns the cost of x based on how many levels of individuals need to be removed from the population before x is non-dominated, MOGA assigns the cost of x based on how many individuals dominate it.
We assign the same cost to all non-dominated individuals. For each dominated individual x, we assign its cost based on how many individuals dominate it, ans also based on how many individuals are near it. Similar to the use of crowding distance in NGSA-II, this encourages diversity in the population.
"MOGA" may either indicate "Multi-Objective Evolutionary Algorithm", or refer to the specific algorithm proposed by Fonseca and Fleming back in 1993. In the first case, talking about "MOGA methods" in general, I'm inclined to think that the term "MOEA" would be more correct. If you are comparing the specific algorithms, go with Mustapha's answer.
Professor Giovanni Squillero Thank you for the reply. So in a broader sense evolutionary(EA)y algorithm and genetic algorithm is the same. I was confused regarding this because in one literature where it compared different "evolutionary algorithms" specified that MOGA and NSGA-II are two different EA methods.
Strictly speaking they are not: GAs are just one type of EAs. However the term GA is sometimes used by practitioners to denote a generic population-based optimizer... Distinctions between the different EAs are blurring nowadays, but they still make sense. I suggest the great book "Introduction to Evolutionary Computing", by Eiben and Smith (2015).