Multi-Strategy Enhanced Child Drawing Development Optimization Algorithm for Global Optimization Problems and Real Problems

To address the tendency of the traditional Children’s Drawing Development Optimization (CDDO) algorithm to fall into local optima and converge slowly in global optimization and fire-field robot path planning, this study proposes a Multi-Strategy Enhanced Children’s Drawing Development Optimization (MECDDO) algorithm. The algorithm achieves performance improvements through three core strategies: (1) an adaptive cooperative search strategy that integrates information from the global best, worst, and random individuals and guides updates via dynamic weighting, expanding the exploration of the solution space; (2) a multi-strategy adaptive selection mechanism that constructs a pool of four differentiated strategies and dynamically adjusts selection probabilities based on strategy success rates, balancing exploration and exploitation; and (3) a global-optimum guided boundary repair strategy that reduces the loss of high-quality information from out-of-bounds solutions, enhancing local exploitation efficiency. Experiments on the CEC2017 benchmark suite demonstrate that MECDDO achieves outstanding performance across 30-, 50-, and 100-dimensional spaces. Statistical significance was evaluated using the Friedman test and Wilcoxon signed-rank test at a 0.05 significance level. The Friedman test mean rankings (M.R.) are 1.63, 2.20, and 2.70, respectively, consistently outperforming traditional CDDO (M.R. = 9.83, 9.93, 9.73, ranked 10th). Applied to mobile robot path planning, MECDDO achieves an average path length of 27.95483 in 20 × 20 grid environments (rank 1), shortening paths by 8.83% compared with CDDO (30.66212, rank 10), and 61.15516 in 40 × 40 grids (rank 1), reducing paths by 37.19% versus CDDO (97.20336, rank 9), providing trajectories free of redundant turns and convergence speeds 2–3 times faster than competing algorithms. These results validate MECDDO’s significant advantages in numerical optimization accuracy and practical robot path planning.