A conceptual comparison of NSGA-II, OMOPSO and AbYss algorithms
by Rajani Kumari; Dinesh Kumar; Vijay Kumar
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 7, No. 4, 2017

Abstract: The optimisation of multi-objective problems is currently an important area of research and development. The importance gained by this type of problem has given rise to the development of multi-objective metaheuristics to attain solutions for such problems. In this paper, an experimental comparison of non-dominated sorting genetic algorithm-II (NSGA-II), archive-based hybrid scatter search (AbYss), and optimised multi-objective particle swarm optimisation (OMOPSO) using ZDT benchmark, has been done to determine which multi-objective metaheuristic has the best performance with respect to a problem. The results thus obtained are compared and analysed based on three performance metrics namely hypervolume, GD, and IGD that evaluate the dispersion of the solutions on the Pareto front and its proximity to it.

Online publication date: Fri, 04-May-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Technology and Secured Transactions (IJITST):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com