节点文献

货运配载VRP问题的路径匹配算法

Path-Matching Algorithm for Vehicle Routing Problem of Freight Load Matching

【作者】 翟泳

【导师】 樊铭渠;

【作者基本信息】 山东科技大学 , 交通信息工程及控制, 2008, 硕士

【摘要】 货运配载是在我国交通运输行业特定历史环境下产生的一种运输模式,它为提高我国公路运输效率做出了巨大贡献。这种运输模式中,最关键的环节之一是配货信息的交流。传统配货信息的交流主要是通过分布于道路两侧的“空车配货站”进行,这种信息交流方式效率低下,经常会出现有货源信息但一时又找不到合适的车辆信息,有了车辆信息却找不到货源信息的状态,丧失了许多交易机会。为此,交通部公路科学院在1998年投资1000多万元建设了华夏交通在线,开展网络配载业务,随后几年,又有多个配货网站投入运营。利用互联网进行配货信息交流,拓宽了货源信息交流渠道,有助于配载交易形成,在一定程度上降低了空载率,提高了运输效率,无疑是空车配货模式发展的正确方向。但是,这种通过网页浏览的方式来对海量配货信息进行发布和检索效率仍然不高,迫切需要一种能够自动根据路径特点对配货信息进行筛选的信息检索方式。货运配载的路径匹配问题,属于开放型车辆路径问题(Open Vehicle RoutingProblem,OVRP)的一类。但目前对车辆路径问题的研究大多面向数学模型,通常需要较长的建模与计算时间,是面向离线的、非实时的应用,并不能直接应用于求解我国货运配载路径信息匹配的实际问题。针对此情况,本文在充分调研我国货运配载的产生发展和运营过程的基础上,对近几年出现的网络配载模式及功能进行深入分析,引入网络图模型,提出了一个基于交通路网的路径匹配算法。该算法利用交通路网中各结点之间的距离关系,可以检索给定起迄点间及起迄点与各自邻近结点群之间存在的配货信息,同时规划出收益费用比最优的行驶路径,并能根据配货行驶路径的特点对检索出的所信息进行分析、评价和优选,以方便配货组织。文章除了对算法思想和算法描述进行了详细介绍外,还对算法的时空复杂度进行了分析,以证实算法的可行性。最后,文章有重点地介绍了算法仿真实现所需的数据结构、功能函数和部分关键代码。

【Abstract】 Freight transportation load matching is a kind of transportation modes in traffic transport industry with particular historical circumstance, which made great contributes for raising transportation efficiency. During this transportation mode, one of the most important links is information communication. Traditional communication of freight load matching information is mainly through freight transportation stations on both sides of road. This results low efficiency or lose trading opportunity, because sometimes cannot find proper vehicle when exist supply of goods, and also sometimes just in contrary. Therefore, in 1998 ministry of communication invested 10 billion to contribute HuaXia transport online, developing stowage with network. In subsequent years, a few more website was put into operation. Freight load matching information communicating with network can widen channel, benefit to transaction, reduce no-load rate to some extent, and improve transport efficiency, which is the correct direction of freight load matching transportation mode. However, publish and select information through browsing web page is stile in low rate, so we need a new auto select method based on rout characters.Freight load matching routing matching problem belongs to a kind of open vehicle routing problem. At present, the research of these problems often oriented to mathematic model, which need a long time to set up the model and calculate. This is not on real-time, and cannot solve the actual freight transportation load matching problems directly.According to this situation, investigating the production, development and operation of freight transpiration in our country sufficiently, the thesis evaluates stowage mode with website and the function, introducing network graph mode, and proposes a path matching algorithm based on traffic network. The algorithm which using the distance relation of the nodes in the traffic network, can search information of freight trips between given O D points and trips which intersect groups of adjacent points respectively of O D points, calculate the freight route with best benefit cost ratio separately, also can analyze and evaluate and filter these information in the light of characteristic of freight route so that the load matching be convenient. Besides introducing the thought of the algorithm, the thesis also analyzes the complexity in time and space, in order to calculate the availability. In the end, the thesis introduces necessary data structure, performance function and some key code in this algorithm.

【关键词】 货运配载车辆路径问题物流算法
【Key words】 Load MatchingVehicle Routing ProblemLogisticsAlgorithm
节点文献中: 

本文链接的文献网络图示:

本文的引文网络