IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0341439.html

IM-NSGAII: A novel approach to boost convergence speed and population diversity in multi-objective optimization

Author

Listed:
  • Wei Jiang
  • Zhenhua Xie

Abstract

Convergence speed and population diversity have long been central concerns in multi-objective evolutionary algorithms. However, the NSGAII algorithm often shows insufficient ability to maintain diversity when facing complex Pareto fronts. To address this issue, an improved NSGAII algorithm (IM-NSGAII) is proposed. First, a population evaluation technique is incorporated after non-dominated sorting to filter and select the best parent population. Second, a sparse population strategy with a high-pressure criterion is employed to guide sparse individuals in local exploration, thereby enhancing population diversity. Finally, a difference operator is introduced to facilitate information exchange among sparse individuals, compensating for the slow convergence speed of the original algorithm. The proposed IM-NSGAII is evaluated against five widely used algorithms on the ZDT, DTLZ, MaF, and WFG benchmark problems. Experimental results demonstrate that IM-NSGAII significantly improves both population diversity and convergence speed.

Suggested Citation

  • Wei Jiang & Zhenhua Xie, 2026. "IM-NSGAII: A novel approach to boost convergence speed and population diversity in multi-objective optimization," PLOS ONE, Public Library of Science, vol. 21(4), pages 1-17, April.
  • Handle: RePEc:plo:pone00:0341439
    DOI: 10.1371/journal.pone.0341439
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0341439
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0341439&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0341439?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:plo:pone00:0341439. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.