Bai Yan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bai Yan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Qi Zhao
Southern University of Science and Technology
5 shared publications - Chao Liu
School of Economics and Management, Beijing University of Technology, Beijing, China
2 shared publications - Ruhul Sarker
School of Systems and Computing, University of New South Wales, Australia
2 shared publications - Saber Mohammed Elsayed
School of Systems and Computing, The University of New South Wales (UNSW), Canberra ACT, Australia
2 shared publications - Zhihai Wang
Beijing University of Technology
2 shared publications Chao Liu
College of Economics and Management, Beijing University of Technology, Beijing 100124, China
1 shared publication
Latest Publications
- 1 December 2019
- Published by Elsevier in Information Sciences
- Vol. 505, 440-456
Transfer learning-assisted multi-objective evolutionary clustering framework with decomposition for high-dimensional data
- 1 December 2019
- Published by Elsevier in Information Sciences
- Vol. 505, 440-456
Transfer learning-assisted multi-objective evolutionary clustering framework with decomposition for high-dimensional data
- Open Access
- 1 September 2018
- Published by Elsevier in Information Sciences
- Vol. 462, 141-159
Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction
- 1 September 2018
- Published by Elsevier in Information Sciences
- Vol. 462, 141-159
Open AccessAdaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction
- 18 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 23 (2) , 247-257
Adaptive Sorting-Based Evolutionary Algorithm for Many-Objective Optimization
Evolutionary algorithms have shown their promise in coping with many-objective optimization problems. However, the strategies of balancing convergence and diversity and the effectiveness of handling problems with irregular Pareto fronts are still far from perfect. To address these issues, this paper proposes an adaptive sorting-based evolutionary algorithm based on the idea of decomposition. Firstly, we propose an adaptive sorting-based environmental selection strategy. Solutions in each subpopulation (partitioned by reference vectors) are sorted based on their convergence. Those with better convergence are further sorted based on their diversity, then being selected according to their sorting levels. Secondly, we provide an adaptive promising subpopulation sorting-based environmental selection strategy for problems which may have irregular Pareto fronts. This strategy provides additional sorting-based selection effort on promising subpopulations after the general environmental selection process. Thirdly, we extend the algorithm to handle constraints. Finally, we conduct an extensive experimental study on the proposed algorithm by comparing with start-of-the-state algorithms. Results demonstrate the superiority of the proposed algorithm.
- 18 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 23 (2) , 247-257
Adaptive Sorting-Based Evolutionary Algorithm for Many-Objective Optimization
Evolutionary algorithms have shown their promise in coping with many-objective optimization problems. However, the strategies of balancing convergence and diversity and the effectiveness of handling problems with irregular Pareto fronts are still far from perfect. To address these issues, this paper proposes an adaptive sorting-based evolutionary algorithm based on the idea of decomposition. Firstly, we propose an adaptive sorting-based environmental selection strategy. Solutions in each subpopulation (partitioned by reference vectors) are sorted based on their convergence. Those with better convergence are further sorted based on their diversity, then being selected according to their sorting levels. Secondly, we provide an adaptive promising subpopulation sorting-based environmental selection strategy for problems which may have irregular Pareto fronts. This strategy provides additional sorting-based selection effort on promising subpopulations after the general environmental selection process. Thirdly, we extend the algorithm to handle constraints. Finally, we conduct an extensive experimental study on the proposed algorithm by comparing with start-of-the-state algorithms. Results demonstrate the superiority of the proposed algorithm.
- 1 October 2017
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 51 (4) , 1301-1315
A new hypervolume-based differential evolution algorithm for many-objective optimization
Evolutionary algorithms are successfully used for many-objective optimization. However, solutions are prone to become nondominated from each other with the increase in the number of objectives, which reduces the efficiency of Pareto dominance-based algorithms. In this paper, a new hypervolume-based differential evolution algorithm (MODEhv) is proposed for many-objective optimization problems (MaOPs). In MODEhv, a modified differential evolution paradigm with automatic parameter configuration strategy is used to balance exploration and exploitation of the algorithm. Besides, the hypervolume indicator is incorporated for the selection of solutions to be varied and solutions to be kept in archive respectively. Finally, a threshold technique is employed to improve diversity of solutions in archive. MODEhv is investigated on a set of widely used benchmark problems and compared with five state-of-the-art algorithms. The experimental results show the efficiency of MODEhv for solving MaOPs.
- 1 October 2017
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 51 (4) , 1301-1315
A new hypervolume-based differential evolution algorithm for many-objective optimization
Evolutionary algorithms are successfully used for many-objective optimization. However, solutions are prone to become nondominated from each other with the increase in the number of objectives, which reduces the efficiency of Pareto dominance-based algorithms. In this paper, a new hypervolume-based differential evolution algorithm (MODEhv) is proposed for many-objective optimization problems (MaOPs). In MODEhv, a modified differential evolution paradigm with automatic parameter configuration strategy is used to balance exploration and exploitation of the algorithm. Besides, the hypervolume indicator is incorporated for the selection of solutions to be varied and solutions to be kept in archive respectively. Finally, a threshold technique is employed to improve diversity of solutions in archive. MODEhv is investigated on a set of widely used benchmark problems and compared with five state-of-the-art algorithms. The experimental results show the efficiency of MODEhv for solving MaOPs.
- 7 January 2017
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 11 (6) , 993-1000
A hybrid evolutionary algorithm for multiobjective sparse reconstruction
- 7 January 2017
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 11 (6) , 993-1000
A hybrid evolutionary algorithm for multiobjective sparse reconstruction