分类
稳健性(进化)
蚁群优化算法
计算机科学
适应性
遗传算法
排序算法
蚁群
数学优化
人工智能
算法
机器学习
数学
生态学
生物化学
化学
生物
基因
作者
Yisheng Hu,Haoyang Liu,Chengjin Hu,Jun Zhang
标识
DOI:10.1109/wcmeim56910.2022.10021567
摘要
In order to improve the speed, efficiency and robustness of the automatic sorting system, this paper proposes an improved ant colony algorithm based dynamic sorting strategy. Under the operating condition of automatic sorting scenario on the assembly line, two city sets are established to divide the picking area and the placing area as two countries. In addition, an improved ant colony algorithm optimization approach with variation operator is added, which get inspired by genetic algorithms. This optimization approach has the properties of broad adaptability, high feasibility and capability to achieve global optimization. Simulation and experimental results show that the proposed sorting strategy has better robustness for sorting operations with different objects density. Meanwhile, it can effectively reduce the sorting path length and working time compared with traditional sorting strategies.
科研通智能强力驱动
Strongly Powered by AbleSci AI