高速公路联网收费费率表生成系统

发布时间：2018-01-10 23:18

本文关键词：高速公路联网收费费率表生成系统　出处：《华南理工大学》2014年硕士论文　论文类型：学位论文

【摘要】：高速公路联网收费多义路径问题，一般采用标识站、RFID、车牌识别等各种按“点”标识的方法，通过判定车辆有没有经过路网内某个“点”以确定车辆的行驶路径。广东省高速公路联网收费的路径，是以费率表的形式记录。由结算中心事先计算出路网内任意入口站到任意出口站任意车型，经任意标识站组合的最小费额路径。我们的目标，是要建立一个费率表生成系统，快速生成费率表，供收费和拆分使用。费率生成问题非常接近于经典旅行商问题或者有必经节点的最短路径问题，目前关于此类问题的研究很多，但多数是求解一条最短路径。在对路网化简后我们以入口为根度构遍造历状就态可空以间较树快，结地合获回得溯2法N和分支定界法，定义分支的约束、边界和参照物，一次深条最小金额路径。在引入竞争路径划分条件，，只生成竞争路径正常费率的模式下，我们按照里程差异数K和最大竞争路径数N两种竞争路径划分条件，增加约束和边界比较参照物，更准确地裁剪无希望的分支。结合哈稀表和双链表，重新设计已知最佳值数据结构和逻辑处理流程，提高分支的边界比较处理的效率。针对不同路网特点和费率表生成要求，我们设计出不同的路径搜索调用策略，通过以空间换时间等思想，使路径搜索的次数减少一半以上。我们从生成全集正常费率和竞争路径正常费率两种模式，对费率表生成系统进类测似试高，结速果公显路示费系率统表处生理成效等率，比要较精理确想求。解采全用部分标支识定站界组法合一的次最求短解路径2N行了个子问题，对于的一类问题，是非常合适的。
[Abstract]:The problem of toll polysemous path in expressway network generally adopts various methods such as identification station RFID license plate recognition and so on. By determining whether the vehicle has passed a "point" in the road network to determine the route of the vehicle. It is recorded in the form of a fee rate meter. The minimum toll path of any type of vehicle from any entrance station to any exit station in the road network is calculated by the clearing center in advance, and the minimum fee amount path through any combination of marking stations. Our goal. Is to build a rate table generation system, fast generation of fee table for charge and split use. The rate generation problem is very close to the classical traveling salesman problem or the shortest path problem with necessary nodes. However, most of them are to solve a shortest path. After the road network is simplified, we use the entrance as the root degree to construct a complete calendar, which can be empty and faster than the tree, and then get back to the backtracking 2 method N and the branch and bound method, and define the constraint of the branch. Boundary and reference, a minimum amount of path at a time. Under the model of introducing the competition path partition condition, only the normal rate of the competition path is generated. We divide the two competitive paths according to the mileage difference K and the maximum competitive path number N, add the constraints and compare the boundary reference objects, and more accurately cut the hopeless branches. Redesigning the known optimal value data structure and logic processing flow to improve the efficiency of boundary comparison of branches. According to the characteristics of different road networks and the requirements of generating tariff table, we design different path search call strategy. By using the idea of space for time, the number of path searches is reduced by more than half. From the two modes of generating full set normal rate and competing path normal rate, we try to test the rate table generation system. The rate of physiological effect is more precise than that of the system of showing the cost of the road. A sub-problem of finding the shortest solution path 2N by using partial standard method to identify the boundary group of stations is given. A class of problems, is very appropriate.
【学位授予单位】：华南理工大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：U495;TP301.6

【相似文献】