| 基于遗传算法的双区型仓库拣货路径优化研究 |
| |
| 引用本文： | 王宏,符卓,左武.基于遗传算法的双区型仓库拣货路径优化研究[J].计算机工程与应用,2009,45(6):224-228. |
| |
| 作者姓名： | 王宏 符卓 左武 |
| |
| 作者单位： | 中南大学 交通运输工程学院，长沙 410075 |
| |
| 摘 要： | 拣货作业成本是物流成本的重要组成部分。根据物流配送中心传统双区型仓库拣货路径问题的特点，建立了数学模型，并设计了相应的遗传算法来求解该问题。在算例中，通过与传统穿越策略、S形启发式算法和动态规划方法的比较，结果表明以遗传算法优化拣货路径问题，可以明显减少拣货路径的距离及拣货作业时间，具有良好的实用性。
|
| 关 键 词： | 物流 拣货 拣货路径 车辆路径问题 遗传算法 |
| 收稿时间： | 2008-1-17 |
| 修稿时间： | 2008-4-2
|
Genetic algorithm for picking routing problem in 2-block warehouse |
| |
| WANG Hong,FU Zhuo,ZUO Wu.Genetic algorithm for picking routing problem in 2-block warehouse[J].Computer Engineering and Applications,2009,45(6):224-228. |
| |
| Authors: | WANG Hong FU Zhuo ZUO Wu |
| |
| Affiliation: | School of Traffic and Transportation Engineering，Central South University，Changsha 410075，China |
| |
| 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 pro... |
| |
| Keywords: | logistics picking picking routing vehicle routing problem genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
