Downloads: 120
Research Paper | Computer Science Engineering | Volume 6 Issue 3, March 2017 | Pages: 1492 - 1495 | China
Comparison of IBEA and NSGA-II on MOTSP
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
How to Cite?: Gerbie Atsede Mitiku, "Comparison of IBEA and NSGA-II on MOTSP", Volume 6 Issue 3, March 2017, International Journal of Science and Research (IJSR), Pages: 1492-1495, https://www.ijsr.net/getabstract.php?paperid=ART20171809, DOI: https://dx.doi.org/10.21275/ART20171809