CN113177072A

CN113177072A - Path fitting algorithm

Info

Publication number: CN113177072A
Application number: CN202011057586.7A
Authority: CN
Inventors: 黄凯; 张翔; 徐鑫; 谭梦迪; 刘爱娣; 华龙宇
Original assignee: Beijing Sutong Technology Co ltd
Current assignee: Beijing Sutong Technology Co ltd
Priority date: 2020-09-29
Filing date: 2020-09-29
Publication date: 2021-07-27
Also published as: CN113742394B; CN113742394A

Abstract

The invention discloses a path fitting algorithm, which comprises the following steps: preprocessing data; the invention is suitable for the technical field of high-speed path fitting, completes the incomplete charging record through path fitting, avoids the income loss of high-speed enterprises caused by missed charging, improves the charging calculation capacity and calculation accuracy of high-speed charging and improves the charging efficiency; the ETC portal equipment fault and suspicious vehicle identification and early warning are carried out by carrying out statistics and filing on the historical fitting path, the ETC portal equipment fault is checked and positioned, the suspicious vehicle is checked, and positioning and distinguishing are carried out on behaviors of intentionally pulling out the card and missing calculation; through the restoration of the complete passing path, the flow rule on the highway can be analyzed, data support is provided for further inducing traffic flow, improving the operation efficiency, reasonably arranging maintenance tasks and the like, and the operation efficiency of the highway and the accuracy and the economic benefit of maintenance operation are improved.

Description

Path fitting algorithm

Technical Field

The invention belongs to the technical field of high-speed path fitting, and particularly relates to a path fitting algorithm.

Background

From 1 month and 1 day 0 in 2020, the national highway networked toll collection system completes grid-connected switching, 487 highway provincial toll stations are all cancelled, and the highway is changed from closed toll collection to open section free flow toll collection mode. The new toll collection mode is realized by erecting an ETC portal frame with a vehicle-mounted unit capable of automatically deducting fees on a high-speed toll collection road section;

however, the existing ETC passing transaction has the situations of wrong collection, missing collection of portal frames and the like, which causes serious loss to high-speed enterprises, causes poor charging calculation capability and low calculation accuracy of high-speed charging, and has poor charging efficiency.

Disclosure of Invention

The invention aims to overcome the defects of the prior art and provide a path fitting algorithm.

In order to achieve the purpose, the invention adopts the following technical scheme:

a path fitting algorithm comprising the steps of:

preprocessing data;

and performing path fitting calculation on the processed transaction data.

Preferably, the data preprocessing comprises:

modeling a highway network, and constructing a directed graph model of the highway network topology based on a highway entrance toll station, an exit toll station and an ETC portal;

the algorithm verifies the high-speed original transaction data according to the business rules.

Preferably, the step of constructing the directed graph model of the highway network topology includes:

abstracting a high-speed entrance toll station, an exit toll station and an ETC portal into a plurality of given points;

connecting all the connected points into a directed edge according to the communication relation between the station and the ETC portal;

and forming a directed graph model of the high-speed road network topology based on the points and the edges.

Preferably, the algorithm verifies the high-speed original transaction data according to the business rules, and the method comprises the following steps:

the algorithm system receives a first part of data comprising an entrance toll station En, entrance time, an exit toll station Ex, exit time and total transaction amount, and the first part of data is verified through an algorithm;

and the algorithm system receives second part of data comprising the ETC portal passed by the transaction path, the transaction time of each ETC portal and the transaction amount of a single ETC portal, and verifies the second part of data through an algorithm.

Preferably, the data each carry a field passID as an identifier representing that it is point-of-way transaction information for a high-speed transaction.

Preferably, the algorithm comprises: with passID as a retrieval condition, sequentially sequencing an entrance toll station En, an ETC portal frame and an exit toll station Ex carried in transaction information according to transaction time; en and Ex are start-stop passing points which are correct in default and not modifiable, and ETC portal transaction is an object of which the algorithm needs to be verified and fitted;

after sequencing, other data carried by one piece of high-speed transaction data also needs to pass the following service specification check to ensure that the data can be subjected to path verification and fitting:

whether the entrance toll station En and the exit toll station Ex can be communicated or not is checked, if not, the judgment is wrong, and the path is not fitted;

and performing regular verification on transaction time, transaction amount and portal number carried by each high-speed transaction, and performing verification according to the following service rules, wherein if the verification fails, the judgment is wrong, and the path is not fitted.

Preferably, the business rule includes:

the transaction time of all ETC gantries cannot be earlier than the entrance time carried by the entrance toll station En;

the transaction time of all ETC gantries is not later than the exit time carried by an exit toll station Ex;

and (4) with the ETC portal number and the transaction time as joint conditions, carrying out duplicate removal on n ETC portal transaction information carried by the high-speed transaction of the same passID.

Preferably, the path fitting calculation is designed by taking i as a cursor and step length as a core, and can mark correct passing points in all passing points En, P1, P2, … Pn and Ex included in a high-speed transaction one by one, mistakenly-received ETC gantries and missed ETC gantries and store all the information in a database, and the steps include:

inputting pathList, wherein the initial value i =0, and step = 1; judging whether step is larger than the sum of the specified value and the total number of the abnormal points, if so, clearing all the Lists, and recalculating from i =0 and step = 1;

judging whether the ith point is an end point, if so, adding the ith point into the FixList, jumping out of the loop, and ending the operation;

judging whether the ith point is in an ExcepList of abnormal points, if so, skipping the operation of the ith point, adding 1 to the cursor i, setting the step length step as 1, and turning to the first step to continue the operation;

after the judgment, the ith point is a normal passing point, whether the ith + step point is in the abnormal list or not is continuously judged, if yes, the operation of the ith + step point is skipped, the vernier i is unchanged, the step length step is added with 1, and the operation is continued in the first step;

after the steps are carried out, the ith point and the (i + step) point are not operated and are not in an abnormal list, next, whether the ith passing point and the (i + step) passing point can be directly communicated or not is judged according to the existing adjacent map, if the ith passing point and the (i + step) passing point are directly communicated, the ith passing point is added into the FixList and is marked as 0, the ith passing point is represented as a normal passing point, a vernier i is added with 1, a step value is 1, and the operation is continued in the first step;

if the ith passing point is not directly communicated with the (i + step) th passing point, calculating the shortest path between the ith passing point and the (i + step) th passing point by adopting a Dijkstra algorithm; if the shortest path exists between the two points, the ETC portal frame which is missed in receiving exists between the two points; further, whether step is 1 or not is judged, and if step is not 1, the ETC portal frame which is mistakenly received between the two points is shown; firstly, adding an ith passing point and all points between the ith passing point and an (i + step) th passing point into a FixList, wherein an ETC portal frame which is missed to receive is marked as 1, and the ETC portal frame is represented as a missed-to-receive portal frame; the ETC portal which is mistakenly received in the original path is marked as 2, and the ETC portal is a mistaken receiving portal; marking the correct route point in the original route as 0, representing that the correct route point is a normal route point, and simultaneously adding all the miscarriage route points into an ErrList miscarriage portal list; if the shortest path cannot be calculated between the ith point routing point and the (i + step) th routing point, adding the ith routing point into the FixList, marking the ith routing point as 0, and judging whether the (i + step) th routing point is an end point; if the route point is the end point, putting the ith route point into an abnormal point List, emptying all lists, and turning to the first step from i =0 and step =1 to continue calculation; if the route point is not the end point, adding the (i + step) th route point into an exception list ExList, if i is unchanged, adding 1 to step, and turning to the first step to continue operation;

repeating the steps until the ith point is the end point;

the algorithm calculates the FixList list, and then judges the wrong receiving reason of the ETC frame in the FixList according to the service rule.

Preferably, the determining the reason for the miscarriage of the ETC rack in the FixList includes:

checking a charging unit corresponding to a preorder portal of the ETC portal, and if the preorder portal is the same as the ETC portal, repeatedly charging the portal;

if the two corresponding charging units are different, checking whether the codes of the index digits in the two codes are the same or not according to the coding rule of the ETC portal frame, and if the codes are different, performing reverse charging;

if the preorder portal of the ETC portal is also a wrong portal, the nearest preorder correct ETC portal is searched forward, and the judgment is carried out.

Preferably, the step length is the result of core design as follows: according to the business rule, if the ith passing point and the (i + step) th passing point can not be communicated, the ith passing point is put into an abnormal list and is not used as a normal passing point to continue calculation, so that the calculation cost is saved.

In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:

1. according to the invention, through path fitting, incomplete charging records are completed, the income loss of a high-speed enterprise caused by missed charging is avoided, the charging calculation capacity and the calculation accuracy of high-speed charging are improved, and the charging efficiency is improved;

2. according to the invention, the history fitting path is counted and filed, the failure of the ETC portal frame equipment and the identification and early warning of suspicious vehicles can be carried out, and the overall behavior rule, the personalized rule of the vehicle, the credit file and the characteristic rule of the ETC portal frame can be obtained by carrying out statistical analysis according to the information of the corresponding ETC portal frame, the entry and exit station, the vehicle and the like, so that the failure of the ETC portal frame equipment can be further checked and positioned, the suspicious vehicles can be checked, and the positioning and distinguishing of behaviors of intentionally pulling out the card and neglecting calculation can be carried out;

3. according to the method, the flow rule on the highway can be analyzed by restoring the complete passing path, data support is provided for further inducing traffic flow, improving the operation efficiency, reasonably arranging maintenance tasks and the like, and the operation efficiency of the highway and the accuracy and the economic benefit of maintenance operation are improved.

Drawings

FIG. 1 is a flow chart of a calculation process of the path fitting algorithm of the present invention;

fig. 2 is a flowchart of a path fitting algorithm in the path fitting algorithm of the present invention.

Detailed Description

The following further describes a specific embodiment of the method for determining the precipitation threshold alarm for the substation waterlogging according to the present invention with reference to fig. 1-2. The path fitting algorithm of the present invention is not limited to the description of the following embodiments.

Example (b):

the present embodiment provides a specific structure of a path fitting algorithm, as shown in fig. 1-2, the steps include:

preprocessing data;

and performing path fitting calculation on the processed transaction data.

Further, the data preprocessing comprises:

Further, the construction step of the directed graph model of the highway network topology comprises the following steps:

Further, the algorithm checks the high-speed original transaction data according to the business rules, and the method comprises the following steps:

Further, the data all have a field passID as an identifier, which represents that the data is the passing point transaction information of a certain high-speed transaction.

Specifically, the algorithm includes: with passID as a retrieval condition, sequentially sequencing an entrance toll station En, an ETC portal frame and an exit toll station Ex carried in transaction information according to transaction time;

Specifically, the business rules include:

Specifically, the path fitting calculation is designed by taking i as a cursor and step length as a core, and can mark correct passing points in all passing points En, P1, P2, … Pn and Ex contained in a high-speed transaction one by one, mistakenly-received ETC gantries and missed ETC gantries and store all the information in a database, and the steps comprise:

repeating the steps until the ith point is the end point;

Specifically, the method for judging the reason for the wrong reception of the ETC rack in the FixList comprises the following steps:

Specifically, the reason why step is core design is as follows: according to the business rule, if the ith passing point and the (i + step) th passing point can not be communicated, the ith passing point is put into an abnormal list and is not used as a normal passing point to continue calculation, so that the calculation cost is saved.

By adopting the technical scheme:

taking Beijing as an example, the highway network topological relation of the Beijing city related to in the invention comprises information such as high-speed entrance/exit toll station names and codes, ETC portal frame toll collection limit and the like, the entrance/exit toll station and the ETC portal frame are abstracted into a plurality of given points, all the communicated points are connected into a directed edge according to the communication relation between the station and the ETC portal frame, and finally a directed highway network topological graph is formed;

based on the known topological graph of the highway network and the ordered passing points of the running vehicles, the high-speed path fitting problem can be converted into calculation of all path sets passing through the ordered passing points; the ETC portal cost is converted into the weight of the edge in the digraph according to the minimum cost completion strategy and aiming at the topological graph of the Beijing expressway network, and a high-speed path passing through the appointed passing point is generated on the premise of appointing the starting point and the ending point by combining the ordered passing point and the shortest path principle in the original transaction data;

the algorithm takes passID as a retrieval condition, and the entrance toll station En, the ETC portal frame and the exit toll station Ex carried in the transaction information are sequentially sequenced according to transaction time. Where En and Ex are the correct default and non-modifiable start-stop transit points, ETC portal transactions are the objects for which the algorithm needs to be validated and fitted. After sequencing, other data carried by one piece of high-speed transaction data also needs to pass the following service specification check to ensure that the data can be subjected to path verification and fitting:

performing regular verification on transaction time, transaction amount and portal number carried by each high-speed transaction, and performing verification according to the following service rules, wherein if the verification fails, the judgment is wrong, and the path is not fitted with data;

the data preprocessing process is finished;

after preprocessing, the algorithm is adopted to verify and fit and complement the original transaction, and is used for verifying whether a missing ETC portal frame and a wrong ETC portal frame exist in high-speed transaction or not, wherein the missed ETC portal frame and the wrong ETC portal frame include repeated charging and reverse charging ETC portal frames;

data fitting calculations were then performed by:

repeating the steps until the ith point is the end point;

the algorithm calculates a FixList list, and then judges the wrong receiving reason of the ETC frame which is received by mistake in the FixList according to the service rule;

so far, the path fitting calculation process is finished;

in the invention, the maximum value of step is set to be 5, namely if the ith passing point is not communicated with the 5 continuous passing points behind the ith passing point, the ith passing point is considered to be a wrong receiving portal frame, and the total number of abnormal points is the length of ExcepList;

all lists referred to in the present invention include: an input original transaction list, an intermediate list required in the calculation process and a calculated output list;

according to the invention, through path fitting, incomplete charging records are completed, the income loss of a high-speed enterprise caused by missed charging is avoided, the charging calculation capacity and the calculation accuracy of high-speed charging are improved, and the charging efficiency is improved;

according to the invention, the history fitting path is counted and filed, the failure of the ETC portal frame equipment and the identification and early warning of suspicious vehicles can be carried out, and the overall behavior rule, the personalized rule of the vehicle, the credit file and the characteristic rule of the ETC portal frame can be obtained by carrying out statistical analysis according to the information of the corresponding ETC portal frame, the entry and exit station, the vehicle and the like, so that the failure of the ETC portal frame equipment can be further checked and positioned, the suspicious vehicles can be checked, and the positioning and distinguishing of behaviors of intentionally pulling out the card and neglecting calculation can be carried out;

according to the method, the flow rule on the highway can be analyzed by restoring the complete passing path, data support is provided for further inducing traffic flow, improving the operation efficiency, reasonably arranging maintenance tasks and the like, and the operation efficiency of the highway and the accuracy and the economic benefit of maintenance operation are improved.

The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims

1. A path fitting algorithm, characterized by the steps of:

preprocessing data;

and performing path fitting calculation on the processed transaction data.

2. The path fitting algorithm of claim 1, wherein the data preprocessing comprises:

3. The path fitting algorithm according to claim 2, wherein the constructing step of the directed graph model of the highway network topology comprises:

4. The path fitting algorithm of claim 2, wherein the algorithm verifies high speed raw transaction data against business rules, comprising:

5. The path fitting algorithm of claim 4, wherein: the data all have a field passID as an identification, which represents that the data is passing point transaction information of a certain high-speed transaction.

6. The path fitting algorithm of claim 4, wherein the algorithm comprises: with passID as a retrieval condition, sequentially sequencing an entrance toll station En, an ETC portal frame and an exit toll station Ex carried in transaction information according to transaction time; en and Ex are start-stop passing points which are correct in default and not modifiable, and ETC portal transaction is an object of which the algorithm needs to be verified and fitted;

7. The path fitting algorithm of claim 6, wherein the business rules comprise:

8. The path fitting algorithm according to claim 1, wherein the path fitting calculation is designed by taking i as a cursor and step as a core, and can mark correct one of all transit points En, P1, P2, … Pn and Ex included in a high-speed transaction, a miscarried ETC portal and a missed ETC portal one by one and store all the information in a database, and the steps comprise:

repeating the steps until the ith point is the end point;

9. The path fitting algorithm according to claim 8, wherein the determining the cause of the incorrect ETC rack in the FixList comprises:

10. The path fitting algorithm of claim 9 wherein the step size is the result of the core design by: according to the business rule, if the ith passing point and the (i + step) th passing point can not be communicated, the ith passing point is put into an abnormal list and is not used as a normal passing point to continue calculation, so that the calculation cost is saved.