Bing Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bing Sun has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jeng-Shyang Pan
School of Artificial Intelligence/School of Future Technology, Nanjing University of Information Science and Technology, Nanjing, China
4 shared publications - Shu-Chuan Chu
Nanjing University of Information Science and Technology
4 shared publications Buyue Guo
College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
1 shared publication- Chin-Shiuh Shieh
National Kaohsiung University of Science and Technology
1 shared publication Junzo Watada
Waseda University
1 shared publication- Li Zhang
Qingdao University of Technology
1 shared publication
Latest Publications
- 18 November 2025
- Published by Springer Nature
- p. 71-79
Improved Compact Gannet Optimization Algorithm with Auxiliary Particles
- 18 November 2025
- Published by Springer Nature
- p. 71-79
Improved Compact Gannet Optimization Algorithm with Auxiliary Particles
- 28 April 2025
- Published by Springer Nature
- p. 105-117
Optimization of Wireless Sensor Networks Using Phasmatodea Population Evolution Algorithm
- 28 April 2025
- Published by Springer Nature
- p. 105-117
Optimization of Wireless Sensor Networks Using Phasmatodea Population Evolution Algorithm
- Open Access
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 102396-102415
A Hybrid Parallel Willow Catkin Optimization Algorithm Applied for Engineering Optimization Problems
The Willow Catkin Optimization Algorithm (WCO) is a newly proposed meta-heuristic algorithm in recent years that has a simple structure and excellent optimization searching ability, but the WCO algorithm could benefit from improvements in both convergence speed and solution diversity. In this paper, the parallel technology is introduced into the WCO algorithm, and by proposing two new communication strategies, the Random Mean (RM) method and the Optimal Flight (OF) method, the goal is to utilize all solution information obtained by each subpopulation in the parallel strategy to enhance the algorithm’s performance. Additionally, the WCO algorithm has been hybridized with the Differential Evolution Algorithm (DE), and a mutation mechanism has been introduced to improve the diversity of solutions. The resulting algorithm is called the Hybrid Parallel Willow Catkin Optimization Algorithm (HPWCO). In this paper, the HPWCO algorithm is tested on the CEC2017 benchmark function set and applied to five real-world engineering optimization problems with constraints, and the experimental results were compared with three types of algorithms: the classical algorithm, the newly proposed algorithm, and the parallel algorithm. The results indicate that the HPWCO performs excellently.
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 102396-102415
Open AccessA Hybrid Parallel Willow Catkin Optimization Algorithm Applied for Engineering Optimization Problems
The Willow Catkin Optimization Algorithm (WCO) is a newly proposed meta-heuristic algorithm in recent years that has a simple structure and excellent optimization searching ability, but the WCO algorithm could benefit from improvements in both convergence speed and solution diversity. In this paper, the parallel technology is introduced into the WCO algorithm, and by proposing two new communication strategies, the Random Mean (RM) method and the Optimal Flight (OF) method, the goal is to utilize all solution information obtained by each subpopulation in the parallel strategy to enhance the algorithm’s performance. Additionally, the WCO algorithm has been hybridized with the Differential Evolution Algorithm (DE), and a mutation mechanism has been introduced to improve the diversity of solutions. The resulting algorithm is called the Hybrid Parallel Willow Catkin Optimization Algorithm (HPWCO). In this paper, the HPWCO algorithm is tested on the CEC2017 benchmark function set and applied to five real-world engineering optimization problems with constraints, and the experimental results were compared with three types of algorithms: the classical algorithm, the newly proposed algorithm, and the parallel algorithm. The results indicate that the HPWCO performs excellently.
- Open Access
- 13 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 439
A Parallel Compact Gannet Optimization Algorithm for Solving Engineering Optimization Problems
The Gannet Optimization Algorithm (GOA) has good performance, but there is still room for improvement in memory consumption and convergence. In this paper, an improved Gannet Optimization Algorithm is proposed to solve five engineering optimization problems. The compact strategy enables the GOA to save a large amount of memory, and the parallel communication strategy allows the algorithm to avoid falling into local optimal solutions. We improve the GOA through the combination of parallel strategy and compact strategy, and we name the improved algorithm Parallel Compact Gannet Optimization Algorithm (PCGOA). The performance study of the PCGOA on the CEC2013 benchmark demonstrates the advantages of our new method in various aspects. Finally, the results of the PCGOA on solving five engineering optimization problems show that the improved algorithm can find the global optimal solution more accurately.
- 13 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 439
Open AccessA Parallel Compact Gannet Optimization Algorithm for Solving Engineering Optimization Problems
The Gannet Optimization Algorithm (GOA) has good performance, but there is still room for improvement in memory consumption and convergence. In this paper, an improved Gannet Optimization Algorithm is proposed to solve five engineering optimization problems. The compact strategy enables the GOA to save a large amount of memory, and the parallel communication strategy allows the algorithm to avoid falling into local optimal solutions. We improve the GOA through the combination of parallel strategy and compact strategy, and we name the improved algorithm Parallel Compact Gannet Optimization Algorithm (PCGOA). The performance study of the PCGOA on the CEC2013 benchmark demonstrates the advantages of our new method in various aspects. Finally, the results of the PCGOA on solving five engineering optimization problems show that the improved algorithm can find the global optimal solution more accurately.