旋转货架配货作业的改进临近域算法  

An Improved Nearest Items Heuristics for the Order Picking Optimization of Multiple Carousels System in Distribution Center

作　　者：王雄志[1] 王国庆[2] 

机构地区：[1]华南农业大学经济管理学院,广东广州510642 [2]暨南大学管理学院,广东广州510632

出　　处：《工业工程与管理》2008年第4期68-71,92,共5页Industrial Engineering and Management

摘　　要：旋转货架系统配置配货作业是现代配送中心中一项非常重要的作业活动,文章研究具有多个水平旋转货架系统的配货作业问题,建立对应的模型,在分析该类型作业中整个货架系统配货顺序最优单个货架物品拣选顺序必然最优的特点基础上,设计改进临近域算法,并通过模拟测试,效果良好。The order picking optimization of a multi-carousel system is one important problem in modern distribution center. This paper analyzes such a system and establishes its mathematical model. According to the character that the optimal picking order of the materials in the single carousel will come forth of the optimal sequence of the whole assignment, a new improved nearest items heuristics （INIH） is presented. Finally, experimental results verify that the optimum solutions are quickly and steadily achieved and show its better performance.

关 键 词：运筹学 配货作业 路径优化 配送中心 

分 类 号：F253.4[经济管理—国民经济]