A review and comparison of two archive based Algorithms:SPEA2 and PAES

The term optimization refers to find the best possible solution. Gradient computation and Nature evolution rule are the two main bases of almost all optimization algorithms. Single objective optimization problems deal with optimization of one objective function whereas multi-objective problems deal with two or more objective functions to be optimized. Many algorithms have been developed till now for the optimization of multi-objective problems. In this paper, we will review and compare two multi-objective evolutionary algorithms SPEA2 (Strength Pareto Evolutionary algorithm) and PAES (Pareto Archived Evolution strategy). Evolutionary algorithms use fitness function, selection, crossover, and mutation procedures to generate a new population. SPEA2 algorithm uses the population set as well as an external set known as an archive to select and generate the next population members. PAES uses a local search approach to generate new solutions and maintains an archive to refer to previously generated solutions and thereby find the dominance ranking of current and newly generated solutions. Four sets of problems (DTLZ1, DTLZ2, ZDT1, ZDT2) will be solved using these algorithms and the results of these algorithms on these test problems will be compared in this paper.