Li, Ke and Deb, Kalyanmoy and Zhang, Qingfu and Zhang, Qiang (2017) Efficient Nondomination Level Update Method for Steady-State Evolutionary Multiobjective Optimization. IEEE Transactions on Cybernetics, 47 (9). pp. 2838-2849. DOI https://doi.org/10.1109/tcyb.2016.2621008
Li, Ke and Deb, Kalyanmoy and Zhang, Qingfu and Zhang, Qiang (2017) Efficient Nondomination Level Update Method for Steady-State Evolutionary Multiobjective Optimization. IEEE Transactions on Cybernetics, 47 (9). pp. 2838-2849. DOI https://doi.org/10.1109/tcyb.2016.2621008
Li, Ke and Deb, Kalyanmoy and Zhang, Qingfu and Zhang, Qiang (2017) Efficient Nondomination Level Update Method for Steady-State Evolutionary Multiobjective Optimization. IEEE Transactions on Cybernetics, 47 (9). pp. 2838-2849. DOI https://doi.org/10.1109/tcyb.2016.2621008
Abstract
Nondominated sorting (NDS), which divides a population into several nondomination levels (NDLs), is a basic step in many evolutionary multiobjective optimization (EMO) algorithms. It has been widely studied in a generational evolution model, where the environmental selection is performed after generating a whole population of offspring. However, in a steady-state evolution model, where a population is updated right after the generation of a new candidate, the NDS can be extremely time consuming. This is especially severe when the number of objectives and population size become large. In this paper, we propose an efficient NDL update method to reduce the cost for maintaining the NDL structure in steady-state EMO. Instead of performing the NDS from scratch, our method only updates the NDLs of a limited number of solutions by extracting the knowledge from the current NDL structure. Notice that our NDL update method is performed twice at each iteration. One is after the reproduction, the other is after the environmental selection. Extensive experiments fully demonstrate that, comparing to the other five state-of-the-art NDS methods, our proposed method avoids a significant amount of unnecessary comparisons, not only in the synthetic data sets, but also in some real optimization scenarios. Last but not least, we find that our proposed method is also useful for the generational evolution model.
Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
Depositing User: | Unnamed user with email elements@essex.ac.uk |
Date Deposited: | 14 Dec 2016 09:38 |
Last Modified: | 04 Dec 2024 06:55 |
URI: | http://repository.essex.ac.uk/id/eprint/18565 |
Available files
Filename: 07738460.pdf