基于蚁群算法的高层固定货架最短路径问题研究

Research on the shortest path problem of the high-layer fix shelf based on ant colony system

应用蚁群算法的原理,通过建立数学模型,解决了立体仓库堆垛机自动行走最短路径和最短时间问题.利用蚁群算法的相互协同机制来解决高层固定货架最短路径问题的最优化,通过仿真实验,蚁群算法求堆垛机最短运行时间的效率提高了36.32%,最短路径长度的效率提高了56.7%,能够提高自动化立体仓库的作业效率.

Applying the principle of the ant colony algorithm and building mathematics model ,the question of the automated storage＇s stacker crane to run about automatically shortest path and time was solved. It realizes the optimization of shortest path problems about the high-layer fix shelf by means of cooperation mechanism between ant colony. Finally, through the simulated experiment, the efficiency of the stacker crane running the shortest time rises by 36.32% ;and that of running the shortest path rises by 56.7% using the ant colony algorithm. In short, the ant colony algorithm can rise assignment efficiency of automated storage.