摘要
针对双区型仓库的布局特点,结合传统的启发式优化算法与动态规划思想,提出一种适用于双区型仓库的拣选路径优化算法。首先,介绍现有启发式算法和最优化算法的优点与不足;然后,详细描述了改进型算法的实现过程;最后,通过与S形启发式算法、最大间隙算法和最优化算法的比较,表明所设计的算法可以减少拣选作业的总路程且路径模式简单,具有良好的实用性和参考价值。
Considering the layout characteristics of 2-block warehouse,this paper proposes a picking routing algorithm which is based on the traditional heuristic optimization algorithm and dynamic programming idea.Firstly,the advantages and disadvantages of the existing heuristic algorithms and optimization algorithm are introduced.Secondly,the implementation of the improved algorithm is described.Finally,by comparing with S-shape heuristic algorithm,maximum gap algorithm and optimization algorithm.
出处
《工业控制计算机》
2018年第4期90-91,94,共3页
Industrial Control Computer
关键词
路径规划
动态规划
双区型仓库
path planning
dynamic programming
2-block warehouse
