Non-dominated sorting is a fundamental combinatorial problem in multiobjective op-timization, and is equivalent to the longest chain problem in combinatorics and random growth models for crystals in materials science. In a previous work [4], we showed that non-dominated sorting has a continuum

Abstract — Non-dominated sorting is an important combinato-rial problem in multi-objective optimization, which is ubiquitous in many fields of science and engineering. In this paper, we overview the results of some recent work by the authors on a continuum limit for non-dominated sorting

We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN 2) in generating non-dominated fronts

Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) -4 computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a

This paper presents a non-dominated sorting flower pollination algorithm for dynamic economic emission dispatch (DEED) problem. Non-dominated sorting flower pollination algorithm is designed to construct the pareto optimal front and a fuzzy techniques extracts the best compromised solution of DEED

We show that non-dominated sorting of a sequence X1,..., Xn of i.i.d. random vari-ables in Rd has a continuum limit that corresponds to solving a Hamilton-Jacobi equation involving the probability density function f of Xi. Non-dominated sorting is a funda-mental problem in multi

Abstract- Although many methods for dealing with multi-objective optimisation (MOO) problems are available [Deb01] and successful applications have been reported [Coe01], the comparison between MOO methods applied to real-world problem was rarely carried out. This paper reports the comparison between MOO methods applied to a real-world problem, namely, the optimisation of a micro heat exchanger ( ¤ HEX).

Over the period of time a number of algorithms have been proposed for test data generation for automation of software testing. One such algorithm was given by Kalyanmoy Deb in 2002, under the name Non-dominated sorting genetic algorithm-II (NSGA-II). It has been applied for solving number

algorithms called non-dominated sorting genetic algorithm (NSGA), which will suit to the requirements of designing a complex heterogeneous embedded system. Further, the algorithm is rigorously tested using Video Codec as a case study. Keywords: Heterogeneous embedded system, Pareto-optimal set, genetic

Abstract-We propose a new algorithm for incremental nondominated sorting of two-dimensional points. The data structure which stores non-dominating layers is based on a tree of Cartesian trees. If there are N points in M layers, the running time for of an insertion is O(M (1 + log(N/M )) + log M