穷举-混沌蚁群算法环形穿梭车模型研究  

Research on Circular Shuttle Vehicle Model Based on Exhaustive Chaotic Ant Colony Algorithm

作　　者：刘绪川 王龙 梅英杰 张孟建 LIU Xu-chuan;WANG Long;MEI Ying-jie;ZHANG Meng-jian(China Key System&Integrated Circuit Co.,Ltd.,Wuxi 214072,China;School of Instrument Science and Engineering,Harbin Institute of Technology,Harbin 150001,China;College of Electrical Engineering,Guizhou University,Guiyang 550025,China)

机构地区：[1]中科芯集成电路有限公司,无锡214072 [2]哈尔滨工业大学仪器科学与工程学院,哈尔滨150001 [3]贵州大学电气工程学院,贵阳550025

出　　处：《自动化与仪表》2021年第7期81-85,共5页Automation & Instrumentation

基　　金：江苏省科技成果转化项目(BA2019012)。

摘　　要：该文针对自动化仓库环形穿梭车调度问题建立模型,从车数、拥堵时间,吞吐量进行分析。对穿梭车N<5,采用穷举法求解模型;在N>5时,采用混沌蚁群算法找到最优解来分析穿梭车拥堵时间、货物处理总耗时以及单位时间内系统最大货物吞吐量之间关系,提高穿梭车的调度效率。This paper establishes a model for the scheduling problem of automated warehouse circular shuttle,analyzes the number of vehicles,congestion time and throughput,and uses the exhaustive method to solve the model for the shuttle N<5.When N>5,chaos ant colony algorithm is used to find the optimal solution to analyze the relationship between the shuttle congestion time,the total cargo handling time and the maximum cargo throughput per unit time,so as to improve the efficiency of shuttle scheduling.

关 键 词：穿梭车 模型 穷举法 混沌蚁群算法 调度效率 

分 类 号：TP272[自动化与计算机技术—检测技术与自动化装置]