Views: 122 , Downloads: 111 | CTR: 91 % | Weekly Popularity: ⮙2
Research Paper | Computer Science & Engineering | China | Volume 6 Issue 3, March 2017
Comparison of IBEA and NSGA-II on MOTSP
Gerbie Atsede Mitiku
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
How to Cite this Article?
Gerbie Atsede Mitiku, "Comparison of IBEA and NSGA-II on MOTSP", International Journal of Science and Research (IJSR), https://www.ijsr.net/search_index_results_paperid.php?id=ART20171809, Volume 6 Issue 3, March 2017, 1492 - 1495
122 PDF Views | 111 PDF Downloads