Name
Abstract | ||
|---|---|---|
The Multi-objective Genetic Algorithms (MOGA) based on Pareto Optimum have been widely applied to solve multi-objective optimal problems, mainly because of their ability to find a set of candidate solutions within a single run. In MOGAs, a non-dominated set is a set of candidate solutions, so it is very important to construct the non-dominated set efficiently. In this paper, the relation of individuals and their related features are discussed. It is proved that the individuals of an evolutionary population can be sorted by quick sort. We construct the non-dominated set of the evolutionary population with quick sort, and the time complexity of the construction is O(nlogn), compared to the previous best result of O(n(2)) described in the popular NSGA-II [Deb, 2002]. We further propose a multi-objective genetic algorithm based on quick sort, and two benchmark problems are experimented. We show that the results of the experiments match to our theoretical analysis. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24840-8_13 | ADVANCES IN ARTIFICIAL INTELLIGENCE |
Keywords | Field | DocType |
time complexity,dominating set | Mathematical optimization,Tree sort,Evolutionary algorithm,Computer science,Adaptive sort,sort,Selection sort,Time complexity,Genetic algorithm,Sorting algorithm | Conference |
Volume | ISSN | Citations |
3060.0 | 0302-9743 | 1 |
PageRank | References | Authors |
0.41 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinhua Zheng | 1 | 517 | 36.36 |
| Charles X. Ling | 2 | 2854 | 282.92 |
| Zhongzhi Shi | 3 | 2440 | 238.03 |
| Juan Xue | 4 | 5 | 1.23 |
| Xuyong Li | 5 | 51 | 4.69 |