摘要
针对多穿越巷道布局立体仓库的拣选路径规划问题,总结了现有的成熟路径生成策略,分析了现有路径生成规划方法的优劣,在此基础上提出了一种结合动态规划方法的启发式搜索算法生成拣选路径;该方法调和了动态规划空间开销大与启发式搜索时间开销大的矛盾;利用限制迭代次数动态规划生成初始种群,免疫算子与遗传算子寻优求解,有效解决了多穿越巷道布局下的拣选路径规划问题;通过数值仿真实验验证,算法有效节约了计算机空间资源,并在可接受的时间内生成了可接受的路径规划结果;虽然算法还存在很多不足,但为分布式布置信息化立体仓库的车载有限资源计算机实时生成路径提供了一种可行的思路。
For stereoscopic warehouse with multi cross aisles layout order picking path planning problem, summarizes the existing mature path generation strategy, analysis of the pros and cons of the existing path generation planning method, Based on this, advances a kind of combining with dynamic planning method of heuristic search algorithm to generate picking route. This method is to reconcile the dynamic planning space overhead and heuristic search time costs big contradiction. Using the limited number of iterative dynamic programming to gen erate the initial population, the immune operator and genetic operators optimization solution, and effectively solves the order picking path planning problem under multiple cross aisles layout. Through numerical simulation experiment, the algorithm saves computer space resources effectively, and at an acceptable time endogenous became an acceptable path planning result. Although algorithm also has many shortcom ings, but limited resources for distributed information of stereoscopic warehouse vehicle computer real time generate path provides a feasible idea.
出处
《计算机测量与控制》
北大核心
2013年第11期3120-3123,共4页
Computer Measurement &Control
关键词
多穿越巷道
立体仓库
动态规划
免疫遗传算法
multi cross aisles
stereoscopic warehouse
Dynamic programming
the immune genetic algorithm
