Comparison of IBEA and NSGA-II on MOTSP

Gerbie Atsede Mitiku

Abstract: Multi-objective traveling salesman problem (MOTSP) is a well-known NP hard problem. In this paper, IBEA and NSGA-II algorithm is proposed to solve the MOTSP and compare the result of each algorithm and find a better algorithm based on the execution time it takes to find the Pareto-optimal solutions. The result shows that even though the two algorithm finds the true pare to front NSGA_II is better algorithm for MOTSP problem compare to IBEA

Keywords: Multi-objective traveling salesman problem, Indicator-Based Evolutionary Algorithm IBEA, Non-dominated Sorting based Genetic Algorithm II NSGA-II