Approximate non-dominated sorting for evolutionary many-objective optimization
Zhang X, Tian Y, Jin Y (2016)
Information Sciences 369: 14-33.
Zeitschriftenaufsatz
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Zhang, Xingyi;
Tian, Ye;
Jin, YaochuUniBi ![](https://pub.uni-bielefeld.de/images/icon_orcid.png)
![](https://pub.uni-bielefeld.de/images/icon_orcid.png)
Abstract / Bemerkung
Non-dominated sorting has widely been adopted and shown to be very effective in dominance based evolutionary multi-objective optimization where the number of objectives is two or three. In dealing with many-objective optimization problems, where the number of objectives is more than three, however, the effectiveness of dominance based evolutionary algorithms will seriously degrade and the computational complexity of non-dominated sorting will considerably increase. In this paper, we propose an approximate non-dominated sorting algorithm for many-objective optimization, where the dominance relationship between two solutions is determined by a maximum of three objective comparisons on top of a sorted population according to one of the objectives. The time complexity of the proposed approximate sorting is independent of the number of objectives, which significantly enhances the time efficiency, in particular when the number of objectives is large. To examine the influence of inaccurate sorting on the search performance, the proposed approximate sorting method is embedded in three popular dominance based evolutionary many-objective optimization algorithms. Our experimental results on 16 widely used many-objective optimization benchmark problems suggest that the approximate non-dominated sorting method is not only computationally much more efficient than the state-of-the-art accurate non-dominated sorting methods, but also leads to better search performance on most test problems used in this study.
Erscheinungsjahr
2016
Zeitschriftentitel
Information Sciences
Band
369
Seite(n)
14-33
ISSN
00200255
Page URI
https://pub.uni-bielefeld.de/record/2978506
Zitieren
Zhang X, Tian Y, Jin Y. Approximate non-dominated sorting for evolutionary many-objective optimization. Information Sciences. 2016;369:14-33.
Zhang, X., Tian, Y., & Jin, Y. (2016). Approximate non-dominated sorting for evolutionary many-objective optimization. Information Sciences, 369, 14-33. https://doi.org/10.1016/j.ins.2016.06.007
Zhang, Xingyi, Tian, Ye, and Jin, Yaochu. 2016. “Approximate non-dominated sorting for evolutionary many-objective optimization”. Information Sciences 369: 14-33.
Zhang, X., Tian, Y., and Jin, Y. (2016). Approximate non-dominated sorting for evolutionary many-objective optimization. Information Sciences 369, 14-33.
Zhang, X., Tian, Y., & Jin, Y., 2016. Approximate non-dominated sorting for evolutionary many-objective optimization. Information Sciences, 369, p 14-33.
X. Zhang, Y. Tian, and Y. Jin, “Approximate non-dominated sorting for evolutionary many-objective optimization”, Information Sciences, vol. 369, 2016, pp. 14-33.
Zhang, X., Tian, Y., Jin, Y.: Approximate non-dominated sorting for evolutionary many-objective optimization. Information Sciences. 369, 14-33 (2016).
Zhang, Xingyi, Tian, Ye, and Jin, Yaochu. “Approximate non-dominated sorting for evolutionary many-objective optimization”. Information Sciences 369 (2016): 14-33.
Link(s) zu Volltext(en)
Access Level
![Restricted access for author/reviewer only. Restricted](https://pub.uni-bielefeld.de/images/access_restricted.png)