JZJun Zheng

Jun Zheng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jun Zheng has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    MEIAO: A Multi-Strategy Enhanced Information Acquisition Optimizer for Global Optimization and UAV Path Planning

    by Yongzheng Chen, Ruibo Sun, Jun Zheng, Yuanyuan Shao, Haoxiang Zhou

    With the expansion of unmanned aerial vehicles (UAVs) into complex three-dimensional (3D) terrains for reconnaissance, rescue, and related missions, traditional path planning methods struggle to meet multi-constraint and multi-objective requirements. Existing swarm intelligence algorithms, limited by the “no free lunch” theorem, also face challenges when the standard Information Acquisition Optimizer (IAO) is applied to such tasks, including low exploration efficiency in high-dimensional search spaces, rapid loss of population diversity, and improper boundary handling. To address these issues, this study proposes a Multi-Strategy Enhanced Information Acquisition Optimizer (MEIAO). First, a Levy Flight-based information collection strategy is introduced to leverage its combination of short-range local searches and long-distance jumps, thereby broadening global exploration. Second, an adaptive differential evolution operator is designed to dynamically balance exploration and exploitation via a variable mutation factor, while crossover and greedy selection mechanisms help maintain population diversity. Third, a globally guided boundary handling strategy adjusts out-of-bound dimensions to feasible regions, preventing the generation of low-quality paths. Performance was evaluated on the CEC2017 (dim = 30/50/100) and CEC2022 (dim = 10/20) benchmark suites by comparing MEIAO with eight algorithms, including VPPSO and IAO. Based on the mean, standard deviation, Friedman mean rank, and Wilcoxon rank-sum tests, MEIAO demonstrated superior performance in local exploitation of unimodal functions, global exploration of multimodal functions, and complex adaptation on composite functions while exhibiting stronger robustness. Finally, MEIAO was applied to 3D mountainous UAV path planning, where a cost model considering path length, altitude standard deviation, and turning smoothness was established. The experimental results show that MEIAO achieved an average path cost of 253.9190, a 25.7% reduction compared to IAO (341.9324), with the lowest standard deviation (60.6960) among all algorithms. The generated paths were smoother, collision-free, and achieved faster convergence, offering an efficient and reliable solution for UAV operations in complex environments.


  • Open Access

    An Enhanced Secretary Bird Optimization Algorithm Based on Multi Population Management for Numerical Optimization Problems

    by Jin Zhu, Bojun Liu, Jun Zheng, Shaojie Yin, Meng Wang

    The Secretary Bird Optimization Algorithm (SBOA) is a novel swarm-based meta-heuristic that formulates an optimization model by mimicking the secretary bird’s hunting and predator-evasion behaviors, and thus possesses appreciable application potential. Nevertheless, it suffers from an unbalanced exploration–exploitation ratio, difficulty in maintaining population diversity, and a tendency to be trapped in local optima. To eliminate these drawbacks, this paper proposes an SBOA variant (MESBOA) that integrates a multi-population management strategy with an experience-trend guidance strategy. The proposed method is compared with eight advanced basic/enhanced algorithms of different categories on both the CEC2017 and CEC2022 test suites. Experimental results demonstrate that MESBOA delivers faster convergence, more stable robustness and higher accuracy, achieving mean rankings of 2.500 (CEC2022 10-D), 2.333 (CEC2022 20-D), 1.828 (CEC2017 50-D) and 1.931 (CEC2017 100-D). Moreover, engineering constrained optimization problems further verify its applicability to real-world optimization tasks.