A Modified Complex-Valued Encoding Greater Cane Rat Algorithm for Global Optimization and Constrained Engineering...

The greater cane rat algorithm (GCRA) draws inspiration from the seasonal behavioral patterns of the greater cane rats: extensive roaming during the non-breeding period for global exploration, and aggregative foraging during the reproductive period for local exploitation. The GCRA leverages independent movement and population aggregation to iteratively update positions in pursuit of the optimal solution, which exhibits inherent structural deficiencies: precipitous population diversity collapse, lethargic convergence dynamics, suboptimal computational precision, high susceptibility to local optima, and severe dimensional scalability. This paper proposes a modified complex-valued encoding GCRA (CGCRA) that exploits the mathematical structure of complex numbers to construct a two-dimensional search domain on the complex plane and facilitate collaborative optimization. The CGCRA maps the decision variables onto the complex domain, the real part executes the native foraging mechanism for local fine-grained exploitation, and the imaginary part exploits phase rotation to generate global exploratory perturbations. The CGCRA leverages a dual-encoding redundancy mechanism with inherent error tolerance to attenuate result volatility, augment information capacity and population heterogeneity, elevate search adaptability and disturbance rejection, accelerate parallel computation and exploration efficiency, and facilitate spatial transformation and multi-dimensional data manipulation. Twenty-three benchmark functions and twelve real-world engineering designs are employed to assess the CGCRA's stability and practical feasibility rigorously. The CGCRA delivers comprehensive spatial mapping and adaptive coordination to facilitate population collaboration and bolster resilience, expedite exhaustive research, and advance optimization efficiency. The experimental results demonstrate that the CGCRA emphasizes instructive superiority and practical utility to regulate exploration and exploitation, reduce result dispersion, mitigate search stagnation, accelerate convergence efficiency, elevate solution precision, and fortify stability and robustness.