1. Chao Bian and Chao Qian . 2022 . Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection. In Parallel Problem Solving From Nature , PPSN 2022. Springer, 428--441. Chao Bian and Chao Qian. 2022. Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection. In Parallel Problem Solving From Nature, PPSN 2022. Springer, 428--441.
2. Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
3. Duc-Cuong Dang , Andre Opris , Bahare Salehi , and Dirk Sudholt . 2023 . A proof that using crossover can guarantee exponential speed-ups in evolutionary multiobjective optimisation . In Conference on Artificial Intelligence, AAAI 2023. AAAI Press. To appear. Duc-Cuong Dang, Andre Opris, Bahare Salehi, and Dirk Sudholt. 2023. A proof that using crossover can guarantee exponential speed-ups in evolutionary multiobjective optimisation. In Conference on Artificial Intelligence, AAAI 2023. AAAI Press. To appear.
4. A fast and elitist multiobjective genetic algorithm: NSGA-II
5. Lower bounds for the runtime of a global multi-objective evolutionary algorithm