摘要
针对不断提高的自动化仓库能效和输送作业效率要求,本文对长纵深巷道配两台堆垛机的作业形式进行了探讨。基于两个中心点车辆路由问题模式,建立了单巷道双堆垛机作业路径优化问题的数学模型。采用动态区域划分法将两个中心点车辆路由问题简化为一个中心点车辆路由问题,并设计了最大最小蚁群算法对两台堆垛机的作业路径进行优化。实例对比分析表明所建立的数学模型和给出的求解算法能够有效地求解双堆垛机作业路径优化问题,提高了自动化立体仓库的作业效率。
As the requirements for the energy efficiency of automated warehouse and delivery operation growing quickly, the form of two cranes worked in a long aisle are discussed in this paper. The problem is treated as double-depot vehicle problem and its mathematics model is built. Then the problem can be simplified as single-depot vehicle problem dynamic region partition. So the Max-Min Ant System（MMAS） algorithm is extended to the problem associated the path of Double Cranes in one aisle of an Automatic Storage and Retrieval System. Finally, the algorithm is performed with practical case, which produces high-quality for the problem.
出处
《电子设计工程》
2016年第2期68-71,75,共5页
Electronic Design Engineering
关键词
双堆垛机
路径优化
NP难题
蚁群算法
自动化立体仓库
double stackers
path optimization
NP-hard problem
ant colony optimization
automatic warehouse
