Downloads: 114
Research Paper | Computer Science & Engineering | China | Volume 6 Issue 3, March 2017
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
How to Cite this Article?
Gerbie Atsede Mitiku, "Comparison of IBEA and NSGA-II on MOTSP", International Journal of Science and Research (IJSR), Volume 6 Issue 3, March 2017, pp. 1492-1495, https://www.ijsr.net/get_abstract.php?paper_id=ART20171809
How to Share this Article?
Similar Articles with Keyword 'Multiobjective'
Downloads: 112
Review Papers, Computer Science & Engineering, India, Volume 3 Issue 12, December 2014
Pages: 2112 - 2115Approach to Solve NP Complete Problem Using Game Theoretic Scheduling Algorithm and Map-Reduce on Clouds
V. Mogal [2] | Shekhar H. Pingale [2]
Downloads: 124
Research Paper, Computer Science & Engineering, India, Volume 3 Issue 7, July 2014
Pages: 1345 - 1351Search Optimization using Multiobjective Particle Swarm Optimization
Charu Chhabra | Dr. K. K. Paliwal