Name
Abstract | ||
|---|---|---|
The complexity of multi-objective evolutionary algorithms based on the non-dominated principles mainly depends on finding non-dominated fronts. In order to reduce complexity and improve construction efficiency, this paper introduces a non-dominated set construction algorithm based on Two Dimensional Sequence (TSNS). When the non-dominated set closes to the Pareto optimal front, it always maintains one dimension by ascending order while the other dimension by descending order. In order to verify the effectiveness of the proposed algorithm, we integrate the algorithm into GA, DE, PSO, then we tested and compared it with classical benchmark functions. The experimental results indicate that the proposed algorithm performs better than NSGA-II in terms of the quality of solutions and the speed of convergence. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-49014-3_14 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Multi-objective optimization,Non-dominated set,Evolutionary algorithm | Convergence (routing),Mathematical optimization,Evolutionary algorithm,Computer science,Algorithm,Pareto optimal,Sorting,Bogosort,Multi-objective optimization,Bitonic sorter,Sorting algorithm | Conference |
Volume | ISSN | Citations |
562 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 11 | 6 |