| 多车场满载货运车辆优化调度的网络流算法 |
| |
| 引用本文： | 张明善,唐小我. 多车场满载货运车辆优化调度的网络流算法[J]. 系统工程学报, 2002, 17(3): 216-220 |
| |
| 作者姓名： | 张明善 唐小我 |
| |
| 作者单位： | 1. 西南民族学院经济与管理学院,成都,610041
2. 电子科技大学经济与管理学院,成都,610045 |
| |
| 基金项目： | 国家杰出青年科学基金资助项目 (7972 5 0 0 2 )，四川省杰出青年科学基金资助项目 (川科基 [2 0 0 1] 2号 ) |
| |
| 摘 要： | 探讨在一般条件下的多车场满载的VSP问题。建立了它的网络流模型，并给出了一个基于该网络流最优解的启发式算法。该算法的一个明显特征是，对每一条行车路线的确定总是基于一修改后的网络流模型的最优解，大大提高了算法结果的优化质量。同时，与其它同类算法相比，其算法设计也明显偏优。
|
| 关 键 词： | 多车场满载货运车辆 优化调度 网络流算法 网络流 NP问题 公路交通运输 |
| 文章编号： | 1000-5781(2002)03-216-05 |
| 修稿时间： | 2001-03-19 |
Full load vehicle routing with multiple depots: New network flow based algorithm |
| |
| ZHANG Ming shan ,TANG Xiao wo. Full load vehicle routing with multiple depots: New network flow based algorithm[J]. Journal of Systems Engineering, 2002, 17(3): 216-220 |
| |
| Authors: | ZHANG Ming shan TANG Xiao wo |
| |
| Affiliation: | ZHANG Ming shan 1,TANG Xiao wo 2 |
| |
| Abstract: | This paper considers the problem of scheduling a fleet of identical vehicles to execute a set of freight orders in truckload quantities. We propose an algorithm that starts from an optimal solution to a network flow model which considers all data in the problem in parallel including unloaded travel costs, freight orders, depots, availability of vehicles and the vehicle receiving capacity at each depot. The network solution is then iteratively modified through heuristic operations and the routing of vehicles is determined based on the modified solution. A novel feature of the algorithm is the option of resolving the network model for scheduling the remaining vehicles. |
| |
| Keywords: | vehicle scheduling network flow combination optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
