{"title":"ACIVY: An Enhanced IVY Optimization Algorithm with Adaptive Cross Strategies for Complex Engineering Design and UAV Navigation.","authors":"Heming Jia, Mahmoud Abdel-Salam, Gang Hu","doi":"10.3390/biomimetics10070471","DOIUrl":null,"url":null,"abstract":"<p><p>The Adaptive Cross Ivy (ACIVY) algorithm is a novel bio-inspired metaheuristic that emulates ivy plant growth behaviors for complex optimization problems. While the original Ivy Optimization Algorithm (IVYA) demonstrates a competitive performance, it suffers from limited inter-individual information exchange, inadequate directional guidance for local optima escape, and abrupt exploration-exploitation transitions. To address these limitations, ACIVY integrates three strategic enhancements: the crisscross strategy, enabling horizontal and vertical crossover operations for improved population diversity; the LightTrack strategy, incorporating positional memory and repulsion mechanisms for effective local optima escape; and the Top-Guided Adaptive Mutation strategy, implementing ranking-based mutation with dynamic selection pools for smooth exploration-exploitation balance. Comprehensive evaluations on the CEC2017 and CEC2022 benchmark suites demonstrate ACIVY's superior performance against state-of-the-art algorithms across unimodal, multimodal, hybrid, and composite functions. ACIVY achieved outstanding average rankings of 1.25 (CEC2022) and 1.41 (CEC2017 50D), with statistical significance confirmed through Wilcoxon tests. Practical applications in engineering design optimization and UAV path planning further validate ACIVY's robust performance, consistently delivering optimal solutions across diverse real-world scenarios. The algorithm's exceptional convergence precision, solution reliability, and computational efficiency establish it as a powerful tool for challenging optimization problems requiring both accuracy and consistency.</p>","PeriodicalId":8907,"journal":{"name":"Biomimetics","volume":"10 7","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2025-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomimetics","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.3390/biomimetics10070471","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
The Adaptive Cross Ivy (ACIVY) algorithm is a novel bio-inspired metaheuristic that emulates ivy plant growth behaviors for complex optimization problems. While the original Ivy Optimization Algorithm (IVYA) demonstrates a competitive performance, it suffers from limited inter-individual information exchange, inadequate directional guidance for local optima escape, and abrupt exploration-exploitation transitions. To address these limitations, ACIVY integrates three strategic enhancements: the crisscross strategy, enabling horizontal and vertical crossover operations for improved population diversity; the LightTrack strategy, incorporating positional memory and repulsion mechanisms for effective local optima escape; and the Top-Guided Adaptive Mutation strategy, implementing ranking-based mutation with dynamic selection pools for smooth exploration-exploitation balance. Comprehensive evaluations on the CEC2017 and CEC2022 benchmark suites demonstrate ACIVY's superior performance against state-of-the-art algorithms across unimodal, multimodal, hybrid, and composite functions. ACIVY achieved outstanding average rankings of 1.25 (CEC2022) and 1.41 (CEC2017 50D), with statistical significance confirmed through Wilcoxon tests. Practical applications in engineering design optimization and UAV path planning further validate ACIVY's robust performance, consistently delivering optimal solutions across diverse real-world scenarios. The algorithm's exceptional convergence precision, solution reliability, and computational efficiency establish it as a powerful tool for challenging optimization problems requiring both accuracy and consistency.