{"title":"Alternating curvature-driven evolutionary genetic algorithm for cable insulation thickness measurement","authors":"Yujie LiuFu , Mingyu Hu , Haoran Xu , Junru Song","doi":"10.1016/j.swevo.2025.102164","DOIUrl":null,"url":null,"abstract":"<div><div>Accurate insulation thickness measurement in industrial cables presents a critical yet challenging optimization problem, characterized by an extremely large solution space and stringent requirements for sub-millimeter precision under real-time constraints. Traditional computer vision approaches struggle with computational complexity when processing irregular cross-sections, while conventional evolutionary algorithms exhibit poor convergence characteristics due to the non-convex search landscape. To address these dual challenges, we propose an Alternating Curvature-Driven Genetic Algorithm (ACD-GA) that innovatively integrates geometric prior knowledge with evolutionary computing. Our key advancement lies in establishing a multi-scale curvature gene information database that synergizes differential geometry with adaptive genetic operators. This hybrid architecture features three core innovations: (1) Adaptive generation of initial populations based on multi-scale curvature characteristics to ensure gene quality and diversity; (2) Alternating crossover-mutation operations guided by curvature information to accelerate solution convergence; (3) A population renewal mechanism combining crossover-mutation with original populations and post-selection updates to preserve high-quality genes. Experiments on both regular and irregular IEC standard specimens demonstrate the superiority of ACD-GA in terms of accuracy, repeatability, and convergence efficiency. Compared with traditional manual inspection and fitted ray methods, ACD-GA reduces the average detection time by over 95.8%, decreases the minimum insulation thickness deviation by more than 89.3%, and significantly improves measurement repeatability. When compared with classical evolutionary algorithms (GA, PSO, ACO, SA, DE) and the latest intelligent methods (PSOCO, HPDE, TDE), ACD-GA achieves reductions of 21.1%–86.7% in minimum thickness deviation and up to 88.5% in repeatability, while maintaining comparable detection efficiency.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"99 ","pages":"Article 102164"},"PeriodicalIF":8.5000,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225003219","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Accurate insulation thickness measurement in industrial cables presents a critical yet challenging optimization problem, characterized by an extremely large solution space and stringent requirements for sub-millimeter precision under real-time constraints. Traditional computer vision approaches struggle with computational complexity when processing irregular cross-sections, while conventional evolutionary algorithms exhibit poor convergence characteristics due to the non-convex search landscape. To address these dual challenges, we propose an Alternating Curvature-Driven Genetic Algorithm (ACD-GA) that innovatively integrates geometric prior knowledge with evolutionary computing. Our key advancement lies in establishing a multi-scale curvature gene information database that synergizes differential geometry with adaptive genetic operators. This hybrid architecture features three core innovations: (1) Adaptive generation of initial populations based on multi-scale curvature characteristics to ensure gene quality and diversity; (2) Alternating crossover-mutation operations guided by curvature information to accelerate solution convergence; (3) A population renewal mechanism combining crossover-mutation with original populations and post-selection updates to preserve high-quality genes. Experiments on both regular and irregular IEC standard specimens demonstrate the superiority of ACD-GA in terms of accuracy, repeatability, and convergence efficiency. Compared with traditional manual inspection and fitted ray methods, ACD-GA reduces the average detection time by over 95.8%, decreases the minimum insulation thickness deviation by more than 89.3%, and significantly improves measurement repeatability. When compared with classical evolutionary algorithms (GA, PSO, ACO, SA, DE) and the latest intelligent methods (PSOCO, HPDE, TDE), ACD-GA achieves reductions of 21.1%–86.7% in minimum thickness deviation and up to 88.5% in repeatability, while maintaining comparable detection efficiency.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.