邮政运输网络中的邮路规划和邮车调度  

The Route Programming and Scheduling of the Postal Cars in the Postal Transportation Network

作　　者：于文涛[1] 马钰昕[1] 刘泷[2] 杨振华[3] 

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003 [2]南京邮电大学软件学院,江苏南京210003 [3]南京邮电大学数理学院

出　　处：《数学的实践与认识》2008年第14期192-200,共9页Mathematics in Practice and Theory

摘　　要：本题是一道VRP问题,它涉及到最短路线、最小费用等条件下的优化问题.问题一中,我们论证出最少需要3辆邮车才能满足要求.然后对X1区域根据装载量、时间要求遍历出所有的可行路线,最后选出因空车率而减小的收入最小的邮路,其减少的收入为49.35元.问题二中,将整个区域进行划分,在每个小区域应用分枝定界法求出运行成本的路线.再通过对区域的微调讨论出使邮车数目更小的、更节省运行成本的邮路规划方案.问题三中,由于我们将Z56,Z57由县局X1负责运送,Z27由县局X2负责运送.问题四是一个选址问题.我们借助于中心点算法,考虑各支局在本县区域内的位置,并结合与地市局的距离,提出了相应的选址方案.This is a VRP problem, which involves the optimization on the conditions of shortest route and minimum cost. We have proved that it needs 3 mailcars at least to satisfy the demands in question 1. Then we traver every feasible route. At last we checked out the route of the minimum reduced profit, as the vacant driving. The reduced profit is 49.35. We divide the whole district in sub-district＇s. The route of the minimurri driving cost is get by the Branch-And- Bound in question 2. Then we get the more saving routes by making little changes of the way of the district dividing. In question 3, Z56 and Z57 are delivered by county station X1 ,Z27 is delivered by county station X2. Qestion 4 is about the local selection. The selction method is proposed by the algorthm of central point, considering the locations of sub-stations in county stations, incorporating the distance between the municipality and the county.

关 键 词：模型 空车率 邮路规划 调度 

分 类 号：F618[经济管理—产业经济] U492.3[交通运输工程—交通运输规划与管理]