基于改进TCNN算法的电子组装路径优化研究  

Research on Electronic Assembly Path Optimization Based on Improved TCNN Algorithm

作　　者：夏威[1] XIA Wei(Department of Electronic Engineering,Huizhou Technician Institute,Huizhou 516000,China)

机构地区：[1]惠州市技师学院,电子工程系,广东惠州516000

出　　处：《微型电脑应用》2023年第12期130-134,共5页Microcomputer Applications

摘　　要：电子组装不断朝着规模化、密集化的趋势发展,对电子组装路径进行优化,是提升电子组装生产过程的生产效率重要途径。传统的电子组装路径优化算法是ACO算法,但ACO算法的效率低,逐渐无法满足规模越来越大的电子组装路径优化问题求解需求。因此提出一种高效的TCNN算法进行电子组装路径优化,并采取并行化策略和分治策略对其进行优化,以进一步提升TCNN算法的效率和精度。实验结果显示,改进TCNN算法的效率远超过ACO算法,优化比比ACO算法仅低2.4%。综上所述,改进TCNN算法比ACO算法更能满足大规模电子组装路径优化的需求。Electronic assembly is an important way to continuously improve the efficiency of electronic assembly.The traditional electronic assembly path optimization algorithm is ACO algorithm.However,the efficiency of ACO algorithm is low,and gradually it cannot meet the needs of solving the electronic assembly path optimization problem with larger and larger scale.This paper proposes an efficient TCNN algorithm for electronic assembly path optimization,and adopts parallelization strategy and divide and conquer strategy to optimize it,so as to further improve the efficiency and accuracy of TCNN algorithm.The experimental results show that the efficiency of the improved TCNN algorithm is much higher than that of ACO algorithm,and the optimization ratio is only 2.4%lower than that of ACO algorithm.To sum up,the improved TCNN algorithm can better meet the needs of large-scale electronic assembly path optimization than ACO algorithm.

关 键 词：TCNN算法 电子组装 分治策略 路径优化 

分 类 号：TN710.9[电子电信—电路与系统]