DHDingcheng Hu

Dingcheng Hu

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dingcheng Hu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Analysis of Bezier Curve-Based Optimization Integrated with Diversity-Adaptive Balance, Reflective Repair, and Stagnation Recovery

    by Yanhua Zhang, Peiqi Li, Dengcheng Zhang, Zhe Li, Lei He, Binbin Li, Dingcheng Hu, Jianqiu Zhou

    Bezier curve-based optimization (BCO) provides a population-based search framework that generates candidate solutions along linear, quadratic, and cubic Bezier paths defined by control points. This paper presents IBCO, an improved BCO configuration that integrates three established controls: dimension- and bound-gated diversity feedback, reflective boundary repair, and stagnation-triggered differential or elite-guided perturbation. The contribution is an auditable integration and activation design, not a claim that these operators are individually new. Existing records comprise 30 runs on 26 classical instances, 29 evaluated CEC2017 functions (F1 and F3–F30; F2 excluded), 24 CEC2022 instances, 5 constrained engineering problems, and 26 high-dimensional classical instances. The CEC2017, CEC2022, and engineering profiles used fixed per-run realized evaluation counts within each documented profile; this does not imply identical candidate-evaluation sequences within every run. Classical and high-dimensional IBCO runs used 9030–9144 evaluations, versus 9030 for Original BCO; therefore, those profiles do not establish fixed-evaluation superiority. A retrospective, problem-blocked reanalysis of existing runs rejected the omnibus null of equal treatments in all seven comparison and ablation profiles at α=0.05 (largest p=0.0220), but IBCO’s advantage over Original BCO did not exceed profile-level Nemenyi critical differences. Among 24 classical rank-1 results, only 4 were unique first places. Ablation records identify reflective repair as the most stable component but do not establish synergy among the complete configuration combining diversity feedback, reflective boundary repair, and stagnation-triggered perturbation. IBCO is therefore interpreted as a competitive, incremental BCO configuration relative to the implemented historical baselines, not as a scale-invariant, evaluation-efficient, or universally dominant optimizer.

  • Open Access

    A Hybrid Detective Behavior Algorithm with Particle Swarm Optimization for Continuous Function Optimization

    by Jianqiu Zhou, Peiqi Li, Lingyi Sheng, Fuyao Fan, Yanhua Zhang, Zhe Li, Dingcheng Hu, Dengcheng Zhang

    Standard Detective Behavior Algorithm (DBA) may exhibit limited exploitation in later iterations, insufficient use of individual historical information, and unstable local search on complex continuous optimization problems. To address these limitations, this paper proposes a hybrid DBA with particle swarm optimization, denoted as DBA-PSO. The method retains the search-space-centered exploration, Lévy-flight-based local search, direct-attack refinement, and opposition-based learning mechanisms of DBA, while introducing the velocity update and personal-best/global-best guidance mechanisms of particle swarm optimization (PSO). At each iteration, DBA-PSO generates one DBA candidate and one PSO candidate and selects the next position through a fixed probabilistic fusion rule. Experiments on 23 classical benchmark functions and the CEC2017 test suite, together with supplementary CEC2022 and constrained engineering-design tests, show that DBA-PSO improves the mean fitness or stability on several functions compared with DBA or PSO and remains competitive on many test cases. Overall, the results support the usefulness of PSO-based velocity memory and historical-best guidance for improving the later-stage search behavior of DBA, while the mixed CEC2022 ranks, uneven engineering feasibility rates, and fixed fusion probability show that the method does not provide uniform dominance across all problem classes.

  • Open Access

    Aircraft Longitudinal Aerodynamic Parameter Identification of Kernel Extreme Learning Machine Based on Improved Northern Goshawk Algorithm

    by Peiqi Li, Lingyi Sheng, Dingcheng Hu, Yanhua Zhang, Zhe Li, Haozhe Zhong, Dengcheng Zhang

    Accurately obtaining aircraft aerodynamic parameters is essential for improving flight performance, optimizing design and control strategies, and ensuring flight safety. In this study, the improved Northern Goshawk Optimization (SPNGO) algorithm is used to optimize the kernel parameters and regularization coefficients of the Kernel Extreme Learning Machine (KELM). To address the defects of the original NGO algorithm, such as insufficient global optimization ability and being prone to falling into local optimums, two improvement strategies are proposed. The enhanced SPNGO algorithm is verified by 14 benchmark test functions, and the proposed SPNGO-KELM model is evaluated using open-source F-16 nonlinear simulation data for longitudinal aerodynamic parameter identification. The results demonstrate its effectiveness under the considered simulation conditions, while further validation with real flight-test data is required before application to actual flight environments. Comparative analysis with KELM, NGO-KELM, SSA-KELM, and WOA-KELM models shows that a single KELM is difficult to achieve high-precision aerodynamic parameter identification, and other comparison models have obvious fitting deviations in non-steady-state and strong nonlinear regions. Notably, the SPNGO-KELM model achieves the best identification performance, with a determination coefficient (R2) of 0.96537 and a mean absolute percentage error (MAPE) as low as 3.1574%. Its comprehensive identification accuracy is 1.81% to 37.98% higher than that of the comparison models, and it can effectively suppress error oscillations in nonlinear regions. Experimental results show that the proposed algorithm has excellent identification accuracy, generalization ability, and anti-interference performance.