{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:10:19Z","timestamp":1779894619596,"version":"3.53.1"},"reference-count":33,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T00:00:00Z","timestamp":1779840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"State Key Laboratory of Autonomous Intelligent Unmanned Systems","award":["ZZKF2025-1-10"],"award-info":[{"award-number":["ZZKF2025-1-10"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>This study proposes an enhanced variant of the gold rush optimizer (GRO) algorithm, termed the complex-order gold rush optimizer (CoGRO) algorithm, to address two inherent theoretical limitations of the original GRO. First, GRO employs a random initialization strategy that lacks ergodicity and uniform coverage, leading to insufficient population diversity and a higher risk of premature convergence. Second, its position update mechanism relies solely on current-time information without incorporating historical search experience, which restricts the algorithm\u2019s ability to model long-term dependencies and escape local optima in complex multimodal landscapes. To overcome these deficiencies, we introduce a chaotic LCS1 initialization to enhance population diversity through improved ergodic coverage, and we embed a complex-order derivative mechanism into the migration and collaboration updates to provide infinite memory capability. A comprehensive sensitivity analysis is conducted to examine the influence of control parameters on CoGRO\u2019s performance, leading to the identification of an optimal parameter configuration. The effectiveness of the proposed algorithm is evaluated using the CEC2022 benchmark suite through ablation studies and comparative analyses with state-of-the-art algorithms. Experimental results on the CEC2022 benchmark suite comprising 12 test functions demonstrate that CoGRO significantly outperforms the original GRO, achieving an average solution accuracy improvement of 0.84% and an average standard deviation reduction of 67.6 across all 12 functions, with particularly notable improvements on hybrid and composition functions. Wilcoxon signed-rank tests confirm the statistical significance of these improvements (p&lt;0.05). These results confirm the feasibility and effectiveness of CoGRO as an improved optimization method for complex engineering problems.<\/jats:p>","DOI":"10.3390\/computation14060124","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:36:56Z","timestamp":1779892616000},"page":"124","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complex-Order Gold Rush Optimizer Algorithm"],"prefix":"10.3390","volume":"14","author":[{"given":"Sixuan","family":"Chen","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaobo","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009, China"},{"name":"National Key Laboratory of Autonomous Intelligent Unmanned Systems, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongli","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lisheng","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,5,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/s00607-025-01596-8","article-title":"Survey on distributed parallel genetic algorithms for large-scale data analysis","volume":"108","year":"2026","journal-title":"Computing"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Brest, J., and Sepesy Mau\u010dec, M. (2025). Comparative study of modern differential evolution algorithms: Perspectives on mechanisms and performance. Mathematics, 13.","DOI":"10.20944\/preprints202503.1551.v2"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TKDE.2025.3621469","article-title":"Dynamic stochastic reorientation particle swarm optimization for adaptive latent factor analysis in high-dimensional sparse matrices","volume":"38","author":"Lyu","year":"2025","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"102147","DOI":"10.1016\/j.swevo.2025.102147","article-title":"GTG-ACO: Graph Transformer Guided Ant Colony Optimization for learning heuristics and pheromone dynamics for combinatorial optimization","volume":"99","author":"Abir","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Tsoulos, I.G., Charilogis, V., and Tsalikakis, D. (2026). Optimizing the Bounds of Neural Networks Using a Novel Simulated Annealing Method. AppliedMath, 6.","DOI":"10.3390\/appliedmath6020023"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Hashemi, A., Dowlatshahi, M.B., and Nezamabadi-Pour, H. (2021). Gravitational search algorithm: Theory, literature review, and applications. Handbook of AI-based Metaheuristics, CRC Press.","DOI":"10.1201\/9781003162841-7"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s40430-022-03700-x","article-title":"Hybrid teaching\u2013learning-based optimization for solving engineering and mathematical problems","volume":"44","author":"Dastan","year":"2022","journal-title":"J. Braz. Soc. Mech. Sci. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.61882\/jsdp.22.2.3","article-title":"Solving dynamic optimization problems with an Improved Imperialis Competition Algorithm","volume":"22","author":"Parvin","year":"2025","journal-title":"Signal Data Process."},{"key":"ref_9","first-page":"113","article-title":"Gold rush optimizer: A new population-based metaheuristic algorithm","volume":"33","author":"Zolfi","year":"2023","journal-title":"Oper. Res. Decis."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"15779","DOI":"10.1038\/s41598-025-00076-5","article-title":"Dynamic gold rush optimizer: Fusing worker adaptation and salp navigation mechanism for enhanced search","volume":"15","author":"Zhang","year":"2025","journal-title":"Sci. Rep."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"107877","DOI":"10.1016\/j.ijepes.2021.107877","article-title":"Inertia-weight local-search-based TLBO algorithm for energy management in isolated micro-grids with renewable resources","volume":"137","author":"Abaeifar","year":"2022","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"118686","DOI":"10.1016\/j.eswa.2022.118686","article-title":"An improved imperialist competition algorithm with adaptive differential mutation assimilation strategy for function optimization","volume":"211","author":"Tang","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1177\/14613484231183938","article-title":"An improved marine predators algorithm tuned data-driven multiple-node hormone regulation neuroendocrine-PID controller for multi-input\u2013multi-output gantry crane system","volume":"42","author":"Ahmad","year":"2023","journal-title":"J. Low. Freq. Noise Vib. Act. Control"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"127000","DOI":"10.1016\/j.energy.2023.127000","article-title":"A vertical and horizontal crossover sine cosine algorithm with pattern search for optimal power flow in power systems","volume":"271","author":"Weng","year":"2023","journal-title":"Energy"},{"key":"ref_15","first-page":"34","article-title":"A novel hybrid of nonlinear sine cosine algorithm and safe experimentation dynamics for model order reduction","volume":"64","author":"Suid","year":"2023","journal-title":"Autom. \u010cAsopis Za Autom. Mjer. Elektron. Ra\u010dunarstvo I Komun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Po\u0142ap, D., and Wo\u017aniak, M. (2017). Polar bear optimization algorithm: Meta-heuristic with fast population movement and dynamic birth and death mechanism. Symmetry, 9.","DOI":"10.3390\/sym9100203"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3469","DOI":"10.1109\/TETCI.2025.3526212","article-title":"Complex-Order Quantum-Behaved Particle Swarm Optimization with Double Jump-Out Strategy","volume":"9","author":"Chen","year":"2025","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"105448","DOI":"10.1016\/j.cnsns.2020.105448","article-title":"Complex-order particle swarm optimization","volume":"92","author":"Machado","year":"2021","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"107641","DOI":"10.1016\/j.asoc.2021.107641","article-title":"Particle swarm optimization algorithm using complex-order derivative concept: A comprehensive study","volume":"111","author":"Pahnehkolaei","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Liu, W., Dou, Z., Yan, Y., Zhou, T., and Chen, J. (2025). Research on Optimal Scheduling of the Combined Cooling, Heating, and Power Microgrid Based on Improved Gold Rush Optimization Algorithm. Electronics, 14.","DOI":"10.3390\/electronics14153135"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.matcom.2025.11.025","article-title":"Improved Egret Swarm Optimization Algorithm with mixed multi-strategy for system evaluation","volume":"243","author":"Peng","year":"2026","journal-title":"Math. Comput. Simul."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1038\/s41598-025-33513-6","article-title":"An enhanced parrot optimizer with multiple strategies for wireless sensor network node deployment","volume":"16","author":"Lan","year":"2026","journal-title":"Sci. Rep."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Tao, P., Aihara, K., and Chen, L. (2026). Brain-Inspired Chaotic Graph Backpropagation for Combinatorial Optimization. IEEE Transactions on Neural Networks and Learning Systems, IEEE.","DOI":"10.1109\/TNNLS.2025.3650570"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Choi, H., Kim, G., Song, H.Y., Shin, S., Lee, C., and Noh, H. (2026). Some New Maximally Chaotic Discrete Maps. Entropy, 28.","DOI":"10.3390\/e28010131"},{"key":"ref_25","first-page":"2128","article-title":"A novel one-dimensional chaotic map with improved sine map dynamics","volume":"15","author":"Htiti","year":"2025","journal-title":"Int. J. Electr. Comput. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"8371","DOI":"10.1007\/s00521-025-11016-9","article-title":"New comparative approach to multi-level thresholding: Chaotically initialized adaptive meta-heuristic optimization methods","volume":"37","author":"Serbet","year":"2025","journal-title":"Neural Comput. Appl."},{"key":"ref_27","first-page":"451","article-title":"Generation of Numbers with the Distribution Close to Uniform with the Use of Chaotic Maps","volume":"Volume 2","author":"Lawnik","year":"2014","journal-title":"International Conference on Simulation and Modeling Methodologies, Technologies and Applications"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.3103\/S106287380812023X","article-title":"Lyapunov exponent for chaotic 1D maps with uniform invariant distribution","volume":"72","author":"Anikin","year":"2008","journal-title":"Bull. Russ. Acad. Sci. Phys."},{"key":"ref_29","unstructured":"Drmota, M., and Tichy, R.F. (2006). Sequences, Discrepancies and Applications, Springer."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"107603","DOI":"10.1016\/j.knosys.2021.107603","article-title":"Fractional-order comprehensive learning marine predators algorithm for global optimization and feature selection","volume":"235","author":"Yousri","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Fernandez, E., Victor, H., Isabela, B., and Ricardo, C. (2025). The Role of Fractional Calculus in Modern Optimization: A Survey of Algorithms, Applications, and Open Challenges. Mathematics, 13.","DOI":"10.3390\/math13193172"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"100971","DOI":"10.1016\/j.padiff.2024.100971","article-title":"Application of fractional differential transform method and Bell polynomial for solving system of fractional delay differential equations","volume":"12","author":"Yadav","year":"2024","journal-title":"Partial Differ. Equ. Appl. Math."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"453","DOI":"10.15388\/24-INFOR563","article-title":"Solution of inverse problem for diffusion equation with fractional derivatives using metaheuristic optimization algorithm","volume":"35","author":"Brociek","year":"2024","journal-title":"Informatica"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/14\/6\/124\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:57:49Z","timestamp":1779893869000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/14\/6\/124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,27]]},"references-count":33,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["computation14060124"],"URL":"https:\/\/doi.org\/10.3390\/computation14060124","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,27]]}}}