Comparison of IBEA and NSGA-II on MOTSP
Journal: International Journal of Science and Research (IJSR) (Vol.6, No. 3)Publication Date: 2017-03-05
Authors : Gerbie Atsede Mitiku;
Page : 1492-1495
Keywords : Multi-objective traveling salesman problem; Indicator-Based Evolutionary Algorithm IBEA; Non-dominated Sorting based Genetic Algorithm II NSGA-II;
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
Other Latest Articles
- Impact of FDI on Indian Economy - An Analytical Study
- Pharmacognostic Characterization and Phytochemical Evaluation of Brown Seaweed Hydroclathrus Clathratus (C.Agardh) M.Howe
- Arbuscular Mycorrhizal (AM) Association of Herbal Flora of Telangana University, Nizamabad (T.S.) India
- Designing Mind Map for a Good Research Proposal for PhD Student in the UK: Guidelines and Reviewing
- Analysis&Optimization of Surface Roughness in CNC Milling Machine by Controlling Machining Parameters of EN 19 Steel
Last modified: 2021-06-30 18:07:59