Downloads: 114 | Views: 255
Research Paper | Computer Science & Engineering | China | Volume 6 Issue 3, March 2017 | Popularity: 6.6 / 10
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
Edition: Volume 6 Issue 3, March 2017
Pages: 1492 - 1495
Make Sure to Disable the Pop-Up Blocker of Web Browser
