摘要
货物拣选作业是自动仓储作业中一个重要环节。为了缩短拣选路程以减少自动叉车运行时间,建立了拣选路线优化问题的图模型,该模型属于一类特殊的TSP问题—Steiner TSP问题;通过将Steiner TSP转化成为经典的TSP问题,并采用动态规划算法对该模型进行求解,得出了该模型的最优解。
In order to shorten the time and distance of the order picker, a graphic model of picking routing optimization is set up, which is a special case of the Traveling Salesman Problem （TSP）, i.e. Steiner TSP. By converting Steiner TSP to classical TSP, the best solution is obtained by using Dynamic Programming.
出处
《物流技术》
2009年第10期75-76,120,共3页
Logistics Technology
