计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (6): 224-228.DOI: 10.3778/j.issn.1002-8331.2009.06.065

• 工程与应用 • 上一篇    下一篇

基于遗传算法的双区型仓库拣货路径优化研究

王 宏,符 卓,左 武   

  1. 中南大学 交通运输工程学院,长沙 410075
  • 收稿日期:2008-01-17 修回日期:2008-04-02 出版日期:2009-02-21 发布日期:2009-02-21
  • 通讯作者: 王 宏

Genetic algorithm for picking routing problem in 2-block warehouse

WANG Hong,FU Zhuo,ZUO Wu   

  1. School of Traffic and Transportation Engineering,Central South University,Changsha 410075,China
  • Received:2008-01-17 Revised:2008-04-02 Online:2009-02-21 Published:2009-02-21
  • Contact: WANG Hong

摘要: 拣货作业成本是物流成本的重要组成部分。根据物流配送中心传统双区型仓库拣货路径问题的特点,建立了数学模型,并设计了相应的遗传算法来求解该问题。在算例中,通过与传统穿越策略、S形启发式算法和动态规划方法的比较,结果表明以遗传算法优化拣货路径问题,可以明显减少拣货路径的距离及拣货作业时间,具有良好的实用性。

关键词: 物流, 拣货, 拣货路径, 车辆路径问题, 遗传算法

Abstract: Picking operating costs are the important part of the logistics costs.According to the characteristic of the picking routing problem in the 2-block warehouse,the mathematical model is established for this problem and a corresponding genetic algorithm is designed for it.The picking routing problem is solved by S-shape algorithm,dynamic programming,and proposed genetic algorithm respectively.The results show that it can significantly reduce the distance and times of picking routing to solve the problem by proposed genetic algorithm.

Key words: logistics, picking, picking routing, vehicle routing problem, genetic algorithm