| 邮政车辆调度问题及其优化算法 |
| |
| 引用本文： | 谭政,符卓,肖天国,左武.邮政车辆调度问题及其优化算法[J].铁道科学与工程学报,2008,5(6):76-81. |
| |
| 作者姓名： | 谭政 符卓 肖天国 左武 |
| |
| 作者单位： | 中南大学交通运输工程学院,湖南长沙410075 |
| |
| 基金项目： | 国家自然科学基金资助项目(70671108) |
| |
| 摘 要： | 从邮政实际运营情况出发，在兼顾其他限制条件的同时，着重研究带路程长度和装载能力限制的邮车调度问题，抽象出此类问题的数学模型，并设计一个禁忌搜索算法进行求解。算例测试结果表明，采用该算法可以在很短的时间内求出较高质量的邮车调度问题的优化解。
|
| 关 键 词： | 车辆路径问题 邮车调度 禁忌搜索 |
Postal vehicle scheduling problem and its tabu search algorithm |
| |
| TAN Zheng,FU Zhuo,XIAO Tian-guo,ZUO Wu.Postal vehicle scheduling problem and its tabu search algorithm[J].Journal of Railway Science and Engineering,2008,5(6):76-81. |
| |
| Authors: | TAN Zheng FU Zhuo XIAO Tian-guo ZUO Wu |
| |
| Abstract: | Considering the actually postal operations,the postal vehicle routing problem with capacity and distance constrains was studied.A mathematical model about this kind of problem was built,and a new TS was described to solve it.Computational results of example show that a higher quality solution can be found in very short time using the algorithm. |
| |
| Keywords: | vehicle routing problem postal vehicle scheduling tabu search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
