摘要
以最小化行走距离为目标,构造了拣货作业中订单分批问题的数学模型,在一些模型假设的基础上,给出了订单分批拣货问题的节约启发式算法。并通过算例分析,表明此算法的订单分批结果优于传统的先到先服务分批结果,为实现拣货作业中的订单优化分批提供了一个新方法。
A mathematical model for order batch picking issues is developed with the purpose of minimum running distance. Based on some assumptions, a saving heuristics algorithm is presented. The analysis of calculation example indicates that the saving algorithm excelles the traditional method of ＂first come first service＂. It provides a new method for the optimization of order batching issue.
出处
《铁道运输与经济》
北大核心
2007年第11期65-67,共3页
Railway Transport and Economy
关键词
配送中心
分批拣货
订单
模型
算法
Distribution Center
Batch Picking
Order
Model
Algorithm
