配送中心补货作业问题的蚂蚁算法

Ant colony optimization for replenishment operation problem in distribution center

补货是配送中心运作中一项重要的作业,对其有效管理能够显著减少配送中心的运作时间,带来可观的经济效益.根据配送中心的具体配置,补货作业呈现不同的模式,本文探讨配送中心分拣区采取指定储存策略情形下,补货设备从储存区补充物品到拣货区的补货作业问题,运用蚂蚁寻找最优路径算法原理设计出解决该问题的算法步骤与流程,并仿真测试算法性能,计算结果显示效果良好.

There are lots of operations in 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 which the dedicated storage policy is adopted in the picking area. An ant colony optimization （RCO） algorithm is presented to solve such a problem. The simulation for RCO shows that it can effectively reduce the scope of solution space , searching time and enhance the performance.