摘要
研究在配送中心分拣区采取指定储存策略情形下,补货设备从储存区补充物品到拣货区的补货作业问题,提出复杂度为O(n3)的启发式算法,并模拟测试算法的性能,效果良好.
There are lots of operations in the distribution center, of which the repleniShment operation is an important one that can decrease the processing time seriously and bring considerable economic benefit if managed effectively. The replenishment problem is considered in the paper in which the dedicated storage policy is adopted in the picking area. A heuristics algorithm is presented to find the near-optimal replenishing sequence. And the simulation for the algorithm shows it can effectively reduce the scope of solution space, searching time and enhance the performance.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2008年第4期50-56,共7页
Systems Engineering-Theory & Practice
基金
暨南大学博士论文创新基金
关键词
运筹学
算法
补货问题
配送中心
operations research
algorithm
replenishment operation
distribution center
