Kukkonen, S. ; Deb, K. (2006) Improved pruning of non-dominated solutions based on crowding distance for bi-objective optimization problems Proceedings of the World Congress on Computational Intelligence (WCCI-2006) (IEEE Press). Vancouver, Canada . pp. 1179-1186.
![]()
|
PDF
- Author Version
320kB |
Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...
Related URL: http://dx.doi.org/10.1109/CEC.2006.1688443
Abstract
In this paper an algorithm for pruning a set of non-dominated solutions is proposed. The algorithm is based on the crowding distance calculation used in the elitist non-dominated sorting genetic algorithm (NSGA-II). The time complexity class of the new algorithm is estimated and in most cases it is the same as for the original pruning algorithm. Numerical results also support this estimate. For used bi-objective test problems, the proposed pruning algorithm is demonstrated to provide better distribution compared to the original pruning algorithm of NSGA-II. However, with tri-objective test problems there is no improvement and this study reveals that crowding distance does not estimate crowdedness well in this case and presumably also in cases of more objectives.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Proceedings of the World Congress on Computational Intelligence (WCCI-2006) (IEEE Press). Vancouver, Canada. |
ID Code: | 83504 |
Deposited On: | 21 Feb 2012 07:11 |
Last Modified: | 19 May 2016 00:19 |
Repository Staff Only: item control page