IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v3y2012i4p20-42.html
   My bibliography  Save this article

An Improved Nondominated Sorting Algorithm

Author

Listed:
  • André R. da Cruz

    (Instituto de Ciências Exatas e Tecnológicas, Universidade Federal de Viçosa, Rio Paranaíba, Brazil & Programa de Pós-Graduação em Engenharia Elétrica, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil)

Abstract

This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm. The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front. In a problem with objective functions, using solutions in the population, the original nondominated sorting algorithm, used by NSGA-II, has always a computational cost of in a naïve implementation. The complexity of the new algorithm can vary from in the best case and in the worst case. A experiment was executed in order to compare the new algorithm with the original and another improved version of the Deb’s algorithm. Results reveal that the new strategy is much better than other versions when there are many levels in Pareto front. It is also concluded that is interesting to alternate the new algorithm and the improved Deb’s version during the evolution of the evolutionary algorithm.

Suggested Citation

  • André R. da Cruz, 2012. "An Improved Nondominated Sorting Algorithm," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 3(4), pages 20-42, October.
    • Handle: RePEc:igg:jncr00:v:3:y:2012:i:4:p:20-42
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jncr.2012100102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:3:y:2012:i:4:p:20-42. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.