Non-dominated Sorting

Non-Dominated Sorting is a hierarchical sorting algorithm used in multiobjective optimization that classifies a population of candidate solutions into successive layers of non-dominated fronts, where each front consists of solutions that are not dominated by any other solution within the same front, thereby distinguishing it from other sorting procedures by its reliance on Pareto dominance to establish solution ranking.

1.4K

Publications

46.2K

Citations

4.6K

Authors

1.4K

Institutions

Publications per year

2017–2026

929

Authors

4.6K

  1. RT
    Reza Tavakkoli‐Moghaddam

    University of Tehran, Iran

    13 publications · 425 citations

    13

    h-index

  2. PJ
    Pradeep Jangir

    Saveetha University, India

    15 publications · 770 citations

    13

    h-index

  3. YJ
    Yaochu Jin

    University of Surrey, United Kingdom

    8 publications · 966 citations

    8

    h-index

  4. MR
    Masoud Rabbani

    University of Tehran, Iran

    8 publications · 323 citations

    8

    h-index

  5. KK
    Kanak Kalita

    Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, India

    8 publications · 189 citations

    8

    h-index

1–5 of 4.6K

Venues

  1. IEEE Access

    51 publications · 1.7K citations

    24

    h-index

  2. International Journal of Production Research

    30 publications · 1.3K citations

    22

    h-index

  3. Energies

    35 publications · 919 citations

    19

    h-index

  4. Engineering Optimization

    36 publications · 947 citations

    18

    h-index

  5. Sustainability

    23 publications · 529 citations

    16

    h-index

1–5