Multi-objective Optimization Problems (MOPs) entail multiple conflicting objectives to be satisfied simultaneously. As such, a set of alternative solutions that is able to satisfy all objectives with respect to the Pareto optimality principle is desired. Besides that, the quality of good MOP solutions needs to strike a balance between convergence and diversity against the true Pareto front (i.e. distribution of the ideal Pareto optimal solutions). This research is concerned with how evolutionary algorithms can be employed to undertake MOPs with good convergence and diversity properties of the solutions with respect to the true Pareto front. Masalah pengoptimuman berbilang objektif (Multi-objective Optimization Problem-MOP) melibatkan berbilang objektif yang perlu dipenuhi serentak. Sekumpulan penyelesaian optimuman alternatif diperlukan untuk memenuhi kesemua objektif yang menunju ke arah barisan Pareto.