Fitting method of highway toll collection path
A technology of expressways and routes, applied in the field of expressway toll route fitting, can solve the problems of increasing the loss of national expressway tolls and the inability of expressway sections to charge, and achieve the effect of reducing the loss of expressway tolls
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0026] A method for fitting expressway toll paths, comprising the following steps:
[0027] S1: Take each toll unit in the expressway network as a node;
[0028] S2: Take any node as the root node, and the collection of the shortest paths between the other nodes connected to the root node and the root node is the shortest path table of the root node, and integrate the shortest path tables of all nodes;
[0029] S3: Judging whether the passage path of a car is complete;
[0030] S4: If a car's passing path is complete, calculate the toll amount based on the path;
[0031] S5: If there is a missing road section in the traffic path of a car, get the first node and the last node of the missing road section, then query the shortest distance from the first node to the last node in the shortest path table of the first node, and then fill in the path The shortest distance forms a complete route, and finally the complete toll amount is calculated according to the complete route.
[...
Embodiment 2
[0040] The expressway network in this embodiment includes eight nodes a, b, c, d, e, f, g and h, and the distance between every two directly connected nodes of the eight nodes is shown in Table 1.
[0041] Table 1
[0042] node distance node distance node distance node distance a->c 47 a->e 70 a->f 24 b->d 31 b->g 74 b->h 79 c->b 55 c->d 88 c->g 66 c->e 23 d->h 29 e->g 42 e->b 31 f->c 25 f->d 120 g->h 66
[0043] The steps to calculate the shortest path table of the above eight nodes are as follows:
[0044] S30: Generate an adjacency matrix from the distance relationship between every two nodes of the eight nodes, and the generated adjacency matrix is as follows figure 1 As shown, the checked set A and the unchecked set B are generated at the same time.
[0045] S31: First select node a as the root node, and then initialize the checked set A and the to-be-checked set B. Initialization ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


