Yanhong Feng

12 papers Journal 12
YearRankTypeTitle / Venue / Authors
2022 J jnl
A binary moth search algorithm based on self-learning for multidimensional knapsack problems.
Future Gener. Comput. Syst.
Yanhong Feng, Gai-Ge Wang
2021 J jnl
Monarch butterfly optimization: A comprehensive review.
Expert Syst. Appl.
Yanhong Feng, Suash Deb, Gai-Ge Wang, Amir Hossein Alavi
2019 J jnl
Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems.
IEEE Access
Yanhong Feng, Jiao-Hong Yi, Gai-Ge Wang
2018 J jnl
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem.
IEEE Access
Yanhong Feng, Gai-Ge Wang
2018 J jnl
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem.
Neural Comput. Appl.
Yanhong Feng, Gai-Ge Wang, Wenbin Li, Ning Li
2018 J jnl
Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem.
Comput. Electr. Eng.
Yanhong Feng, Gai-Ge Wang, Junyu Dong, Ling Wang
2018 J jnl
Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation.
Memetic Comput.
Yanhong Feng, Juan Yang, Congcong Wu, Mei Lu, Xiang-Jun Zhao
2018 J jnl
Solving randomized time-varying knapsack problems by a novel global firefly algorithm.
Eng. Comput.
Yanhong Feng, Gai-Ge Wang, Ling Wang
2017 J jnl
Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization.
Neural Comput. Appl.
Yanhong Feng, Gai-Ge Wang, Suash Deb, Mei Lu, Xiang-Jun Zhao
2016 J jnl
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems.
Int. J. Comput. Intell. Syst.
Yanhong Feng, Gai-Ge Wang, Xiao-Zhi Gao
2014 J jnl
An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems.
Comput. Intell. Neurosci.
Yanhong Feng, Gai-Ge Wang, Qingjiang Feng, Xiang-Jun Zhao
2014 J jnl
An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems.
Comput. Intell. Neurosci.
Yanhong Feng, Ke Jia, Yichao He