2005•Henan Chemical IndustryRequires access

A Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization

Da Wang

Abstract

Genetic algorithm is a computer model which simulates evolution process in nature. As an effective searching tool,it has the features of simple, universal for use and robust. It is also parrallelism and has broad potential of application. The basic principle and method of genetic algorithm and an updating genetic algorithm-elitist non-dominated sorting genetic algorithm——elitist non-dominated sorting genetic algorithm (NSGA-Ⅱ) are introduced.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Sorting, Genetic algorithm, Computer science, Algorithm, Meta-optimization, Sorting algorithm, Quality control and genetic algorithms, Population-based incremental learning