| Monarch butterfly optimization: a comprehensive review Y Feng, S Deb, GG Wang, AH Alavi Expert Systems with Applications 168, 114418, 2021 | 178 | 2021 |
| Binary moth search algorithm for discounted {0-1} knapsack problem YH Feng, GG Wang IEEE Access 6, 10708-10719, 2018 | 111 | 2018 |
| Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem Y Feng, GG Wang, W Li, N Li Neural Computing and Applications 30 (10), 3019-3036, 2018 | 92 | 2018 |
| Solving 0–1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation Y Feng, J Yang, C Wu, M Lu, XJ Zhao Memetic Computing 10, 135-150, 2018 | 86 | 2018 |
| Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem Y Feng, GG Wang, J Dong, L Wang Computers & Electrical Engineering 67, 454-468, 2018 | 75 | 2018 |
| A novel hybrid cuckoo search algorithm with global harmony search for 0-1 knapsack problems Y Feng, GG Wang, XZ Gao International Journal of Computational Intelligence Systems 9 (6), 1174-1190, 2016 | 52 | 2016 |
| An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems Y Feng, K Jia, Y He Computational intelligence and neuroscience 2014, 1-1, 2014 | 51 | 2014 |
| A binary moth search algorithm based on self-learning for multidimensional knapsack problems Y Feng, GG Wang Future Generation Computer Systems 126, 48-64, 2022 | 47 | 2022 |
| 基于混沌理论的动态种群萤火虫算法 冯艳红， 刘建芹， 贺毅朝 计算机应用 33 (3), 796-799, 2013 | 47 | 2013 |
| A novel monarch butterfly optimization with global position updating operator for large-scale 0-1 knapsack problems Y Feng, X Yu, GG Wang Mathematics 7 (11), 1056, 2019 | 43 | 2019 |
| Solving randomized time-varying knapsack problems by a novel global firefly algorithm Y Feng, GG Wang, L Wang Engineering with Computers 34 (3), 621-635, 2018 | 39 | 2018 |
| An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0-1 knapsack problems Y Feng, GG Wang, Q Feng, XJ Zhao Computational intelligence and neuroscience 2014, 36-36, 2014 | 34 | 2014 |
| The importance of transfer function in solving set-union knapsack problem based on discrete moth search algorithm Y Feng, H An, X Gao Mathematics 7 (1), 17, 2018 | 33 | 2018 |
| Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm C Wu, J Zhao, Y Feng, M Lee Applied Intelligence 50, 1872-1888, 2020 | 32 | 2020 |
| Enhanced moth search algorithm for the set-union knapsack problems Y Feng, JH Yi, GG Wang IEEE Access 7, 173774-173785, 2019 | 32 | 2019 |
| Monarch butterfly optimization algorithm with differential evolution for the discounted {0-1} knapsack problem Y Feng, J Yang, Y He, GG Wang Acta Electronica Sinica 46 (6), 1343-1350, 2018 | 24 | 2018 |
| An improved hybrid encoding firefly algorithm for randomized time-varying knapsack problems Y Feng, GG Wang 2015 Second International Conference on Soft Computing and Machine …, 2015 | 5 | 2015 |
| Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems Y Feng, H Wang, Z Cai, M Li, X Li Mathematics 11 (8), 1811, 2023 | 2 | 2023 |
| 基于自适应着约束处理法的改进蛾子搜索算法 Y FENG, G WANG, M LI, X LI | | |
| ISCMI 2016 T Ahmad, AH Alavi, A Alihodzic, W Amalraj, M Chis, Z Cui, VS Devi, ... | | |
Gai-Ge Wang (王改革)Professor of School of Computer Science and Technology, Ocean University of ChinaVerified email at ouc.edu.cn
