蔡昕烨 Xinye Cai
蔡昕烨 Xinye Cai
Email confirmado em nuaa.edu.cn - Página inicial
Título
Citado por
Citado por
Ano
An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization
X Cai, Y Li, Z Fan, Q Zhang
IEEE Transactions on Evolutionary Computation 19 (4), 508-523, 2014
1592014
Decomposition-based-sorting and angle-based-selection for evolutionary multiobjective and many-objective optimization
X Cai, Z Yang, Z Fan, Q Zhang
IEEE Transactions on cybernetics 47 (9), 2824-2837, 2016
952016
Push and pull search for solving constrained multi-objective optimization problems
Z Fan, W Li, X Cai, H Li, C Wei, Q Zhang, K Deb, E Goodman
Swarm and evolutionary computation 44, 665-679, 2019
832019
Neighborhood based decision-theoretic rough set models
W Li, Z Huang, X Jia, X Cai
International Journal of Approximate Reasoning 69, 1-17, 2016
762016
A decomposition-based many-objective evolutionary algorithm with two types of adjustments for direction vectors
X Cai, Z Mei, Z Fan
IEEE transactions on cybernetics 48 (8), 2335-2348, 2017
702017
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
Z Fan, W Li, X Cai, H Huang, Y Fang, Y You, J Mo, C Wei, E Goodman
Soft Computing 23 (23), 12491-12510, 2019
672019
A hierarchical image matting model for blood vessel segmentation in fundus images
Z Fan, J Lu, C Wei, H Huang, X Cai, X Chen
IEEE Transactions on Image Processing 28 (5), 2367-2377, 2018
572018
A constrained decomposition approach with grids for evolutionary multiobjective optimization
X Cai, Z Mei, Z Fan, Q Zhang
IEEE Transactions on Evolutionary Computation 22 (4), 564-577, 2017
562017
MOEA/D with angle-based constrained dominance principle for constrained multi-objective optimization problems
Z Fan, Y Fang, W Li, X Cai, C Wei, E Goodman
Applied Soft Computing 74, 621-633, 2019
502019
Difficulty adjustable and scalable constrained multiobjective test problem toolkit
Z Fan, W Li, X Cai, H Li, C Wei, Q Zhang, K Deb, E Goodman
Evolutionary Computation 28 (3), 339-378, 2020
482020
A diversity indicator based on reference vectors for many-objective optimization
X Cai, H Sun, Z Fan
Information Sciences 430, 467-486, 2018
452018
An improved epsilon constraint handling method embedded in MOEA/D for constrained multi-objective optimization problems
Z Fan, H Li, C Wei, W Li, H Huang, X Cai, Z Cai
2016 IEEE Symposium Series on Computational Intelligence (SSCI), 1-8, 2016
452016
Optic disk detection in fundus image based on structured learning
Z Fan, Y Rong, X Cai, J Lu, W Li, H Lin, X Chen
IEEE journal of biomedical and health informatics 22 (1), 224-234, 2017
372017
Epsilon constrained method for constrained multiobjective optimization problems: some preliminary results
Z Yang, X Cai, Z Fan
Proceedings of the companion publication of the 2014 annual conference on …, 2014
372014
A grid weighted sum Pareto local search for combinatorial multi and many-objective optimization
X Cai, H Sun, Q Zhang, Y Huang
IEEE transactions on cybernetics 49 (9), 3586-3598, 2018
362018
A comparative study of constrained multi-objective evolutionary algorithms on constrained multi-objective optimization problems
Z Fan, Y Fang, W Li, J Lu, X Cai, C Wei
2017 IEEE congress on evolutionary computation (CEC), 209-216, 2017
362017
A novel memetic algorithm based on invasive weed optimization and differential evolution for constrained optimization
X Cai, Z Hu, Z Fan
Soft Computing 17 (10), 1893-1910, 2013
282013
Evolutionary approaches for multi-objective next release problem
X Cai, O Wei, Z Huang
Computing and Informatics 31 (4), 847-875, 2012
242012
Positional independence and recombination in cartesian genetic programming
X Cai, SL Smith, AM Tyrrell
European Conference on Genetic Programming, 351-360, 2006
242006
A hybrid of decomposition and domination based evolutionary algorithm for multi-objective software next release problem
X Cai, O Wei
2013 10th IEEE International Conference on Control and Automation (ICCA …, 2013
232013
O sistema não pode efectuar a operação agora. Tente novamente mais tarde.
Artigos 1–20