首页 | 本学科首页   官方微博 | 高级检索  
     

配送中心补货作业问题的蚂蚁算法
引用本文:王雄志,周丽虹. 配送中心补货作业问题的蚂蚁算法[J]. 暨南大学学报(自然科学与医学版), 2007, 28(3): 263-267
作者姓名:王雄志  周丽虹
作者单位:暨南大学管理学院,广州,广东,510632;暨南大学管理学院,广州,广东,510632
基金项目:暨南大学校科研和教改项目
摘    要:补货是配送中心运作中一项重要的作业,对其有效管理能够显著减少配送中心的运作时间,带来可观的经济效益. 根据配送中心的具体配置,补货作业呈现不同的模式,本文探讨配送中心分拣区采取指定储存策略情形下,补货设备从储存区补充物品到拣货区的补货作业问题,运用蚂蚁寻找最优路径算法原理设计出解决该问题的算法步骤与流程,并仿真测试算法性能,计算结果显示效果良好.

关 键 词:配送中心  补货  蚂蚁算法
文章编号:1000-9965(2007)03-0263-05
修稿时间:2006-12-01

Ant colony optimization for replenishment operation problem in distribution center
WANG Xiong-zhi,ZHOU Li-hong. Ant colony optimization for replenishment operation problem in distribution center[J]. Journal of Jinan University(Natural Science & Medicine Edition), 2007, 28(3): 263-267
Authors:WANG Xiong-zhi  ZHOU Li-hong
Affiliation:College of Management, Jinan University, Guangzhou 510632, China
Abstract: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.
Keywords:Distribution center   Replenishment operation   Ant colony optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号