CN109271562A - Current expense determines method, road-net node relational model construction method and device - Google Patents
Current expense determines method, road-net node relational model construction method and device Download PDFInfo
- Publication number
- CN109271562A CN109271562A CN201811162473.6A CN201811162473A CN109271562A CN 109271562 A CN109271562 A CN 109271562A CN 201811162473 A CN201811162473 A CN 201811162473A CN 109271562 A CN109271562 A CN 109271562A
- Authority
- CN
- China
- Prior art keywords
- node
- station
- relationship
- charge
- road
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07B—TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
- G07B15/00—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points
- G07B15/06—Arrangements for road pricing or congestion charging of vehicles or vehicle users, e.g. automatic toll systems
Abstract
The present invention relates to determination method, apparatus, computer equipment and the storage mediums of the current expense of high speed, are applied to intelligent transportation field.The described method includes: receiving inquiry request;The charge road-net node relational model constructed in advance is inquired, shortest path is obtained;The charge road-net node relational model is stored in chart database, and road-net node relational model of charging stores in chart database according to the form of node, relationship, node/relationship attribute;The shortest path is merged by same a road section, obtains a plurality of section;Calculate the corresponding mileage in every section and rate;According to the corresponding mileage in a plurality of section and rate, the corresponding total kilometrage of the shortest path and total pass cost are obtained.The total pass cost calculated performance of the present invention is superior, and on national network rate calculates time-consuming and greatly shortens.
Description
Technical field
The present invention relates to field of intelligent transportation technology, determination method, apparatus, calculating more particularly to the current expense of high speed
Machine equipment and storage medium, and, method, apparatus, computer equipment and the storage medium of the building of road-net node relational model.
Background technique
In order to reach more efficient inter-provincial traffic efficiency, national high-speed networking becomes a kind of demand;After national network with
The increase of fastlink, charge station, beacon station quantity, road network complexity increase severely.Based on national network, more common high speed
It is to obtain road network parameter path, it follows that take by look-up table and based under relevant database that transit cost, which calculates method,
With.However, in the implementation of the present invention, inventor exists in the prior art following problem, total in the whole country
Charge station is estimated up to 8000 or more, and the road network parameter path of any two charge station is up to 10,000,000 hundred million ranks, existing method
There are problems that time-consuming for transit cost calculation.
Summary of the invention
Based on this, it is necessary to aiming at the problem that existing transit cost calculates that time-consuming, provide a kind of current expense of high speed
Determine method, apparatus, computer equipment and storage medium.
On the one hand, the embodiment of the present invention provides a kind of determination method of current expense of high speed, comprising:
Inquiry request message is received, includes the information of access station, outlet station and identification point in the inquiry request message;
Inquire the charge road-net node relational model that constructs in advance, obtain using the access station, outlet station as start-stop point simultaneously
By the shortest path of the identification point;The charge road-net node relational model is stored in chart database, road network section of charging
Point relational model stores in chart database according to the form of node, relationship, node/relationship attribute;
The shortest path is merged by same a road section, obtains a plurality of section;Calculate the corresponding mileage in every section
And rate;
According to the corresponding mileage in a plurality of section and rate, obtain the corresponding total kilometrage of the shortest path and
Total pass cost.
In one of the embodiments, further include:
Charge station's information, phantom station information and identification point information that road network entity includes are obtained, the figure number is stored as
According to the node in library;The phantom station is the intermediate node or tie point of two highways;
The first connected relation, charge station between acquisition charge station and the second connected relation between phantom station, charge station
Third connecting relationship between identification point and the 4th connected relation between phantom station and phantom station, are stored as the figure number
According to the relationship in library;
Section coding and station coding are obtained, the attribute of the node in the chart database is stored as;
The mileage in section and the rate in section are obtained, the attribute of relationship in the chart database is stored as;Rate
For the passage expense of road unit distance;
According to the attribute of node, node in the chart database, the attribute of relationship and relationship, the charge road is obtained
Net node relationships model.
In one of the embodiments, further include:
Determine that routing node, the routing node are made of two adjacent virtual stations according to the phantom station;
The connected relation between described two adjacent virtual stations is established, as pass of the routing node in chart database
System, the relationship is added in the chart database;
Mileage between described two adjacent virtual stations is set, rate is 0, as the routing node in chart database
In relationship attribute;
Increase the model of the routing node in the charge road-net node relational model as a result,.
In one of the embodiments, further include:
Determine identification point adjacent the first charge station and the second charge station;
Mileage between the identification point and the first charge station, rate are respectively set to the first charge station and the second charge
Mileage, rate between standing close in the chart database as the connected relation between the identification point and the first charge station
The attribute of system;
Mileage between the identification point and the second charge station, rate are disposed as 0, as the identification point and second
The attribute of connected relation relationship in the chart database between charge station.
In one of the embodiments, further include:
According to the node and relationship stored in the chart database, no connected relation is determined and adjacent first node
And second node;
Identification is nearest with the first node distance and there are the third nodes of connected relation;
The connected relation between the third node and the second node is established, the connected relation is added to described
In the relationship of chart database.
The connected relation established between the third node and the second node in one of the embodiments,
After the connected relation is added in the relationship of the chart database, further includes:
If the corresponding road network entity of the third node is identification point, fourth node is obtained;The fourth node is distance
The third node it is nearest and corresponding road network entity be charge station node;
Mileage between the third node and the second node, rate are respectively set to the fourth node
Mileage, rate between the second node exist as the connected relation between the third node and the second node
The attribute of relationship in the chart database.
In one of the embodiments, after the reception inquiry request message, further includes:
If not including the information of identification point in the current query information, the charge road-net node relationship constructed in advance is inquired
Model is obtained using the access station, outlet station as the shortest path section of start-stop point, as shortest path;
According to the corresponding mileage of the shortest path section and rate, obtains the corresponding total kilometrage of the shortest path and always lead to
Row takes.
On the other hand, a kind of construction method of road-net node relational model of charging also is provided, comprising:
Charge station's information, phantom station information and identification point information that road network entity includes are obtained, the figure number is stored as
According to the node in library;The phantom station is the intermediate node or tie point of two highways;
The first connected relation, charge station between acquisition charge station and the second connected relation between phantom station, charge station
Third connecting relationship between identification point and the 4th connected relation between phantom station and phantom station, are stored as the figure number
According to the relationship in library;
Section coding and station coding are obtained, the attribute of the node in the chart database is stored as;
The mileage in section and the rate in section are obtained, the attribute of relationship in the chart database is stored as;Rate
For the passage expense of road unit distance;
According to the attribute of node, node in the chart database, the attribute of relationship and relationship, the charge road is obtained
Net node relationships model.
Another aspect also provides a kind of determination device of current expense of high speed characterized by comprising
Traffic information obtains module, for receiving inquiry request message, includes access station in the inquiry request message, goes out
The information at mouth station and identification point;
Path determination module, for inquiring the charge road-net node relational model constructed in advance, obtain with the access station,
Outlet station is start-stop point and the shortest path by the identification point;The charge road-net node relational model is stored in diagram data
In library, road-net node relational model of charging is stored in chart database according to the form of node, relationship, node/relationship attribute;
Path analysis module obtains a plurality of section for merging the shortest path by same a road section;It calculates every
The corresponding mileage in section and rate;
Mileage and expense statistical module, for obtaining described according to the corresponding mileage in a plurality of section and rate
The corresponding total kilometrage of shortest path and total pass cost.
Another aspect also provides a kind of construction device of road-net node relational model of charging, comprising:
Node memory module, charge station's information, phantom station information and the identification point letter for including for obtaining road network entity
Breath, is stored as the node of the chart database;The phantom station is the intermediate node or tie point of two highways;
Relationship storage module, for obtaining between the first connected relation, charge station and phantom station between charge station
The 4th between third connecting relationship and phantom station and phantom station between two connected relations, charge station and identification point is connected to pass
System, is stored as the relationship of the chart database;
Nodal community memory module, for obtaining section coding and station coding, the section being stored as in the chart database
The attribute of point;
Attribute of a relation memory module is stored as the figure number for obtaining the mileage in section and the rate in section
According to the attribute of relationship in library;Rate is the passage expense of road unit distance;
Model construction module, for the category according to the attribute of node, node in the chart database, relationship and relationship
Property, obtain the charge road-net node relational model.
Another aspect, also provides a kind of computer equipment, including memory and processor, and the memory is stored with calculating
Machine program, which is characterized in that the step of processor realizes any of the above-described embodiment the method when executing described program.
In another aspect, the embodiment of the present invention provides a kind of computer storage medium, it is stored thereon with computer program, the journey
It realizes when sequence is executed by processor such as the step of above-mentioned any embodiment the method.
A technical solution in above-mentioned technical proposal has the following advantages that or the utility model has the advantages that based on the preparatory structure of chart database
Charge road-net node relational model is built, when getting current query information, includes access station in the inquiry request message, go out
The information at mouth station and identification point;Inquiry charge road-net node relational model, can quickly obtain be with the access station, outlet station
Start-stop point and the shortest path for passing through the identification point;The shortest path is merged by same a road section, obtains a plurality of road
Section;Calculate the corresponding mileage in every section and rate;According to the corresponding mileage in a plurality of section and rate, obtain described
The corresponding total kilometrage of shortest path and total pass cost.Due to using chart database storage charge road-net node relational model, number
Greatly reduce according to amount of storage, can quickly determine shortest path, and opposite traditional technology, total pass cost calculated performance are excellent
More, on national network rate calculates time-consuming and greatly shortens.
Detailed description of the invention
Fig. 1 is the applied environment figure of the determination method of the current expense of one embodiment high speed;
Fig. 2 is the schematic flow chart of the charge road-net node relational model construction method of an embodiment;
Fig. 3 is the schematic diagram of charge road-net node relational model in the chart database of another embodiment;
Fig. 4 is the schematic flow chart of storage charge road-net node relational model in chart database of an embodiment;
Fig. 5 is the schematic flow chart of the charge road-net node relational model construction method of another embodiment;
Fig. 6 is the schematic diagram of the determination device of the current expense of high speed of an embodiment;
Fig. 7 is the schematic diagram of the charge road-net node relational model construction device of an embodiment;
Fig. 8 is the internal structure chart of computer equipment in one embodiment.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
Referenced herein " embodiment " is it is meant that a particular feature, structure, or characteristic described can wrap in conjunction with the embodiments
It is contained at least one embodiment of the application.Each position in the description occur the phrase might not each mean it is identical
Embodiment, nor the independent or alternative embodiment with other embodiments mutual exclusion.Those skilled in the art explicitly and
Implicitly understand, embodiment described herein can be combined with other embodiments.
In one embodiment, as shown in Figure 1, providing a kind of determination method of current expense of high speed, comprising steps of
S110, receives inquiry request message, includes the information of access station, outlet station and identification point in the inquiry request message;S120,
The charge road-net node relational model constructed in advance is inquired, is obtained using the access station, outlet station as described in start-stop point and process
The shortest path of identification point;The charge road-net node relational model is stored in chart database, road-net node relationship mould of charging
Type stores in chart database according to the form of node, relationship, node/relationship attribute;S130, by the shortest path by same
A road section merges, and obtains a plurality of section;Calculate the corresponding mileage in every section and rate;S140, according to a plurality of road
The corresponding mileage of section and rate, obtain the corresponding total kilometrage of the shortest path and total pass cost.
Wherein, chart database is a kind of non-relational database, the relationship letter between its Graphics Application theory storage entity
Breath.It should be noted that chart database can be Neo4j, AllegroGraph, OrientDB, Cosmos DB or Titan,
In embodiment using Neo4j as chart database, but it is not limited to Neo4j.Typical Representative of the Neo4j as chart database,
There is its unique data store organisation, it is these three types of that data storage is broadly divided into node, relationship, node/relationship attribute;By figure
Database technology, magnanimity node, the storage of relationship and inquiry are possibly realized.It in embodiment, can be with by using chart database
The storage and the reduction of charge path for easily realizing national high-speed networking charge path, have compared to traditional figure constructed based on memory
Higher efficiency.
A kind of determination method of the current expense of high speed of above-described embodiment constructs charge road network section based on chart database in advance
Point relational model includes access station, outlet station and identification point in the inquiry request message when getting current query information
Information;Inquiry charge road-net node relational model, can quickly obtain using the access station, outlet station as start-stop point and pass through
The shortest path of the identification point;The shortest path is merged by same a road section, obtains a plurality of section;Calculate every road
The corresponding mileage of section and rate;According to the corresponding mileage in a plurality of section and rate, it is corresponding to obtain the shortest path
Total kilometrage and total pass cost.Since using chart database storage charge road-net node relational model, data storage capacity is significantly
It reduces, can quickly determine shortest path, and opposite traditional technology, total pass cost calculated performance is superior, on national network to take
Rate calculates time-consuming and greatly shortens.
In one embodiment, the step of refering to what is shown in Fig. 2, based on chart database building charge road-net node relational model
May include:
S210 obtains charge station's information, phantom station information and identification point information that road network entity includes, is stored as described
The node of chart database;The phantom station is the intermediate node or tie point of two highways;S220 is obtained between charge station
The first connected relation, the second connected relation between charge station and phantom station, the third connecting between charge station and identification point
The 4th connected relation between relationship and phantom station and phantom station, is stored as the relationship of the chart database;S230 obtains road
Section coding and station coding, are stored as the attribute of the node in the chart database;S240 obtains the mileage in section and road
Rate in section, is stored as the attribute of relationship in the chart database;Rate is the passage expense of road unit distance;S250, root
According to the attribute of node, node in the chart database, the attribute of relationship and relationship, the charge road-net node relationship is obtained
Model.
It is analyzed by the road network entity to real world, the pass in connected relation and chart database in road network entity
Be it is consistent, based on chart database can fast implement charge road-net node relational model.Road network entity by charge station, phantom station,
Rate, routing node are constituted in identification point, section, and charge station, phantom station, identification point are mapped to the node in chart database, road
Section coding, stand coding, station name are mapped to the attribute of node in the form of key-value pair.Rate stores between station and station in section
The information such as mileage, rate the connected relation, mileage, rate of adjacent charge station are found out by rate in analysis section, for
The connectivity of adjacent charge station is mapped to the relationship in chart database, is expressed in the form of side, and mileage, rate, section are compiled
Code, coding of standing are mapped to the attribute of relationship in the form of key-value pair.Therefore, charge road-net node relational model is in chart database
Storage realize: according to charge road-net node relational model, storage of the implementation model in chart database.Charge station, phantom station,
For identification point as the node in chart database, the attribute of node may include section coding, stand coding, station name.Adjacent charge
It stands, the connectivity between the phantom station in charge station and adjacent identification point, two high speed intermediate nodes or branch can use side
Be attached, be stored in chart database as relationship, the attribute of relationship may include mileage, rate, section coding, into station
It encodes, be driven out to the information such as station coding.
Further, it is based on chart database, the model of routing node, model storage method can also be stored are as follows:
Determine that routing node, the routing node are made of two adjacent virtual stations according to the phantom station;Establish institute
The connected relation between two adjacent virtual stations is stated, as relationship of the routing node in chart database, by the relationship
It is added in the chart database;Mileage between described two adjacent virtual stations is set, rate is 0, as the routing
The attribute of relationship of the node in chart database;Increase the routing section in the charge road-net node relational model as a result,
The model of point.
In some scenes, routing node refers in particular to the interchange between section and the tie point between section and section;
Each routing node is made of two phantom stations, for describing the connectivity of routing node.Corresponding two void of routing node
Connectivity between quasi- station is mapped to the relationship in its corresponding chart database, and mileage and rate are set as 0, are mapped to relationship
Attribute.The consumption charge station A and rear charge station B that identification point is searched by identification point, by the company of identification point and charge station A, charge station B
The general character is mapped to the relationship in chart database, and the mileage and rate of identification point and charge station A are set as the mileage with charge station A, B
Equal with rate, the mileage and rate of identification point and charge station B are set as 0, and mileage and rate are mapped to the attribute of relationship.
In one embodiment, the storage method of identification point corresponding node and attribute of a relation in chart database can be with are as follows: really
Determine identification point adjacent the first charge station and the second charge station;By the mileage between the identification point and the first charge station, rate
Be respectively set to mileage between the first charge station and the second charge station, rate, as the identification point and the first charge station it
Between connected relation relationship in the chart database attribute;By between the identification point and the second charge station mileage, take
Rate is disposed as 0, the category as the relationship in the chart database of the connected relation between the identification point and the second charge station
Property.
In some scenes, the first charge station is the charge station before the identification point, and the second charge station is the mark
Charge station after point, the reference of front-rear position are the current direction in section.That is the first charge station is the receipts of the identification point upstream
Take station, the second charge station is the charge station in the identification point downstream.Certainly, actual conditions are based on, can will be the first charge station
For the charge station in the identification point downstream, the second charge station is the charge station of the identification point upstream.
In one embodiment, can also charge road-net node relational model to Primary Construction it is further perfect, comprising: root
According to the node and relationship stored in the chart database, no connected relation is determined and adjacent first node and the second section
Point;Identification is nearest with the first node distance and there are the third nodes of connected relation;Establish the third node with it is described
The connected relation is added in the relationship of the chart database by the connected relation between second node.
Further, the determination method of the attribute of above-mentioned newly-increased relationship can be with are as follows: if the corresponding road of the third node
Network entity is identification point, obtains fourth node;The fourth node is and corresponding road network nearest apart from the third node
Entity is the node of charge station;Mileage between the third node and the second node, rate are respectively set to
Mileage, rate between the fourth node and the second node, as between the third node and the second node
Connected relation relationship in the chart database attribute.
Charge road-net node relational model schematic diagram in chart database as shown in Figure 3, it is public with Guangdong part high speed below
In for website, illustrate the mode of building charge road-net node relational model:
1) network entity that satisfies the need first is analyzed, and the mapping model of road network entity and chart database is established.1. figure is got the bid
Circle indicates phantom station, for describing two highway intermediate nodes or tie point.The circle presentation-entity of figure acceptance of the bid 2. is received
Take station.The circle of figure acceptance of the bid 3. indicates identification point.Two-way connectivity between standing is connected with four-headed arrow, the unidirectional arrow of unilaterally connected
Head connection, the attribute of mileage and rate as connected relation.
2) region of figure acceptance of the bid 4. is routing node, is made of two phantom stations, is extensively to start high speed and West 2nd Ring Road in reality
The interchange in south, physical location are identical.To guarantee that the connectivity of figure need to create when constructing model and adhere to two road separately
Node is connected between node with four-headed arrow, and due to being same position, the mileage and rate being connected in attribute are 0.
3) figure acceptance of the bid region 5. is identification point, due to identification point at a distance from the charge station of front and back and mileage is unknown, still
It is then bound to by the identification point by its corresponding front and back charge station.Therefore, in settable identification point and front and back charge station
Rate and mileage between any one are 0, and the expense with front and back charge station is set as with the rate and mileage of another charge station
Rate is identical with mileage.Such as figure: it is 5600 meters that company, which extensively starts the mileage between red stove, and rate is 300 points, therefore settable company extensively starts
Mileage between two E1 of west is 5600 meters, and rate is 300 points, and the mileage and rate between two E1 of west and red stove are 0.According to this
Rule, model construction of the achievable identification point in chart database.
4) region of figure acceptance of the bid 6. is infeasible paths.For infeasible paths, need to find next reachable charge station,
Phantom station or identification point, and establish connected relation.Such as figure: even West 2nd Ring Road south and gold are white unreachable, cannot establish connected relation, even
West 2nd Ring Road and wide bright E1 are reachable, and for the connectivity for guaranteeing road network, even West 2nd Ring Road is southern need to establish connected relation with wide bright E1.Due to wide
Bright E1 is identification point, even the southern mileage and expense that may be configured as the even city West 2nd Ring Road Nan Yuhe with the mileage and rate of wide bright E1 in West 2nd Ring Road
Rate.
5) and so on, the building of achievable on national network charge road-net node relational model.
In one embodiment, as shown in figure 4, the flow chart that charge road-net node relational model stores in chart database can
To include following several steps:
Step 1: obtaining charge station, phantom station, identification point information, from road network entity with the joint form in chart database
It is stored.Section coding, coding of standing, station name are stored as the attribute of node.
Step 2: the charge station in same section, phantom station, identification point being ranked up by station sequence, according to Fee Schedule in section
Judge whether adjacent charge station is connected to, connection is then stored connected relation with the relationship in chart database, is not connected to, is looked into
The connected relation with next charge station is looked for, until finding the charge station of nearest connection.Mileage, rate, section coding, volume of standing
Code is stored as the attribute on side.
Step 3: the record in traversal routing node table, two phantom stations for including by routing node establish connected relation,
It is inserted into chart database in the form of relationship.Mileage, rate, section coding, coding of standing are stored as the attribute on side, mileage
It is 0 with rate.
Step 4: the record in traversal identification point table establishes the connected relation of identification point Yu front and back charge station, with relationship
Form is inserted into chart database.The mileage and rate at identification point and consumption charge station are set as mileage and rate with front and back charge station
Equal, the mileage and rate of identification point and rear charge station are set as 0.
Further, with newly-built highway be open to traffic successively and the revocation of existing charge station, in chart database
Charge road-net node relational model can also be updated according to the setting period, and the method for update can be with are as follows: exploitation is corresponding in advance
More new interface, realize the quick update of node, relationship and attribute;Based on these more new interfaces, existing receipts are deleted first
Take road-net node relational model;Secondly charge station, phantom station, identification point information are obtained from road network entity, call chart database
Node create interface, complete the addition of node;Third: it from the connectivity for searching adjacent charge station in section in rate, calls
The relationship of chart database creates interface, completes the creation of adjacent charge station's connected relation;4th: correspondence is found out from routing node
Phantom station, call chart database relationship create interface, complete phantom station connected relation creation;It is last: from identification point
Front and back charge station is found out, the connected relation of identification point Yu front and back charge station is established, so far, road-net node relational model has updated
At.
Based on the charge road-net node relational model of chart database storage, interface journey can be calculated by corresponding rate
Sequence writes rate using Java language and calculates interface, and by incoming access station, outlet station and identification point information, system returns to phase
Corresponding mileage and rate, when access station, outlet station information are lost, the rate and mileage that system returns are 0.External program tune
When calculating interface with rate, it need to only be passed to access station, outlet station coding, identification point coded sequence or access station, outlet station and compile
Code, outlet station coding, identification point coded sequence, can the corresponding mileage of quick obtaining and rate.The specific current expense of high speed
The schematic diagram of determination process can also be with reference to shown in Fig. 5.
In some scenes, after reception inquiry request message, it is also necessary to judge that the identification point in current query information is
It is no for sky, if identification point be it is empty if shortest path restored according to inlet/outlet station information, otherwise according to inlet/outlet station information and
Identification point restores the shortest path of approach designated identification point.
Using above-mentioned charge road-net node relational model construction method, charge road-net node relational model, road can solve
The problems such as storage of net node relationships model and update, the Shortest Path Searching based on weight and specified node and rate calculate.It is logical
It crosses network entity data of satisfying the need to be analyzed, node, pass in charge station, identification point, phantom station and its connectivity and chart database
System, attribute are consistent, can fast implement charge road-net node relational model based on chart database.Neo4j provide Java,
.Net, the multilinguals second development interface such as PHP is stored and is updated convenient for data model.Rate calculating parameter passes through node, pass
The mode of system and attribute is stored in chart database, forms networked fee collection path profile.In the APOC storing process library of chart database
The path search algorithms such as Dijkstra, A*, D* are encapsulated, can go out pass through the shortest path of designated identification point with quick search, from
And further calculate pass cost.The sharpest edges of chart database are to store the node and relationship of magnanimity, and from the node of magnanimity
With shortest path is rapidly found out in relationship.
Advantage using the determination method of the current expense of above-mentioned high speed includes: that (one) data model is simple, and scalability is strong;
(2) using chart database storage charge path profile, data volume greatly reduces;(3) using chart database store adjacent charge station,
The connected relation and rate of phantom station calculate weight, and amount of storage substantially reduces;(4) rate calculated performance is superior, on national network to take
Rate calculates time-consuming within 10ms;(5) rapid rate that can solve pahtfinder hard calculates.
It should be understood that for the various method embodiments described above, although each step in flow chart is according to arrow
Instruction is successively shown, but these steps are not that the inevitable sequence according to arrow instruction successively executes.Unless having herein bright
True explanation, there is no stringent sequences to limit for the execution of these steps, these steps can execute in other order.And
And at least part step in the flow chart of embodiment of the method may include multiple sub-steps or multiple stages, this is a little
Step or stage are not necessarily to execute completion in synchronization, but can execute at different times, these sub-steps
Perhaps the execution sequence in stage be also not necessarily successively carry out but can with the sub-step of other steps or other steps or
At least part in person's stage executes in turn or alternately.
Based on thought identical with the current determination method of expense of the high speed in above-described embodiment, it is logical that high speed is also provided herein
The determining device of row expense.
In one embodiment, as shown in fig. 6, the determination device of the current expense of high speed includes:
Traffic information obtains module 601, includes entrance in the inquiry request message for receiving inquiry request message
It stands, the information of outlet station and identification point;
Path determination module 602 is obtained for inquiring the charge road-net node relational model constructed in advance with the entrance
It stands, outlet station is start-stop point and the shortest path by the identification point;The charge road-net node relational model is stored in figure
In database, charge road-net node relational model is in chart database according to node, relationship, the form of node/relationship attribute
Storage;
Path analysis module 603 obtains a plurality of section for merging the shortest path by same a road section;Meter
Calculate the corresponding mileage in every section and rate;
Mileage and expense statistical module 604, for obtaining institute according to the corresponding mileage in a plurality of section and rate
State the corresponding total kilometrage of shortest path and total pass cost.
Further, in one embodiment, the determination device of the current expense of the high speed further include: relational model building
Module, the module specifically include:
Node storage unit, charge station's information, phantom station information and the identification point letter for including for obtaining road network entity
Breath, is stored as the node of the chart database;The phantom station is the intermediate node or tie point of two highways;
Relationship storage unit, for obtaining between the first connected relation, charge station and phantom station between charge station
The 4th between third connecting relationship and phantom station and phantom station between two connected relations, charge station and identification point is connected to pass
System, is stored as the relationship of the chart database;
Nodal community storage unit, for obtaining section coding and station coding, the section being stored as in the chart database
The attribute of point;
Attribute of a relation storage unit is stored as the figure number for obtaining the mileage in section and the rate in section
According to the attribute of relationship in library;Rate is the passage expense of road unit distance;
Model construction unit, for the category according to the attribute of node, node in the chart database, relationship and relationship
Property, obtain the charge road-net node relational model.
Further, in one embodiment, the relational model constructs module, further includes:
Routing node storage unit, for determining routing node according to the phantom station, the routing node is by two
Adjacent virtual station composition;The connected relation between described two adjacent virtual stations is established, as the routing node in diagram data
The relationship is added in the chart database by the relationship in library;Mileage between described two adjacent virtual stations, expense are set
Rate is 0, the attribute as relationship of the routing node in chart database;As a result, in the charge road-net node relationship
Increase the model of the routing node in model
Further, in one embodiment, the relationship storage unit, specifically includes:
Point analysis subelement is identified, for determining identification point adjacent the first charge station and the second charge station;
First identifier point attribute of a relation determines subelement, for by between the identification point and the first charge station mileage,
Rate is respectively set to mileage between the first charge station and the second charge station, rate, charges as the identification point and first
The attribute of connected relation relationship in the chart database between standing;
Second identifier point attribute of a relation determines subelement, for by between the identification point and the second charge station mileage,
Rate is disposed as 0, as the connected relation between the identification point and the second charge station in the chart database relationship
Attribute.
Further, in one embodiment, the relational model constructs module, further includes:
Model optimization unit, for determining not to be connected to pass according to the node and relationship stored in the chart database
System and adjacent first node and second node;Identification is nearest with the first node distance and there are the third sections of connected relation
Point;The connected relation between the third node and the second node is established, the connected relation is added to the figure number
According in the relationship in library.
Further, in one embodiment, the relational model constructs module, further includes:
Attribute of a relation adding unit obtains Section four if being identification point for the corresponding road network entity of the third node
Point;The fourth node be apart from the third node it is nearest and corresponding road network entity be charge station node;It will be described
Mileage, rate between the third node and the second node are respectively set to the fourth node and the second node
Between mileage, rate, as the connected relation between the third node and the second node in the chart database
The attribute of relationship.
The determination device of the current expense of high speed through the foregoing embodiment constructs charge road network section based on chart database in advance
Point relational model includes access station, outlet station and identification point in the inquiry request message when getting current query information
Information;Inquiry charge road-net node relational model, can quickly obtain using the access station, outlet station as start-stop point and pass through
The shortest path of the identification point;The shortest path is merged by same a road section, obtains a plurality of section;Calculate every road
The corresponding mileage of section and rate;According to the corresponding mileage in a plurality of section and rate, it is corresponding to obtain the shortest path
Total kilometrage and total pass cost.Since using chart database storage charge road-net node relational model, data storage capacity is significantly
It reduces, can quickly determine shortest path, and opposite traditional technology, total pass cost calculated performance is superior, on national network to take
Rate calculates time-consuming and greatly shortens.
In one embodiment, as shown in fig. 7, charge road-net node relational model construction device includes:
Node memory module 701, charge station's information, phantom station information and the identification point for including for obtaining road network entity
Information is stored as the node of the chart database;The phantom station is the intermediate node or tie point of two highways;
Relationship storage module 702, for obtaining between the first connected relation, charge station and phantom station between charge station
The 4th between third connecting relationship and phantom station and phantom station between second connected relation, charge station and identification point is connected to
Relationship is stored as the relationship of the chart database;
Nodal community memory module 703 is stored as in the chart database for obtaining section coding and station coding
The attribute of node;
Attribute of a relation memory module 704 is stored as the figure for obtaining the mileage in section and the rate in section
The attribute of relationship in database;Rate is the passage expense of road unit distance;
Model construction module 705, for attribute, relationship and the relationship according to node, node in the chart database
Attribute, obtain the charge road-net node relational model.
Further, in one embodiment, above-mentioned charge road-net node relational model construction device includes: further include:
Routing node memory module, for determining routing node according to the phantom station, the routing node is by two
Adjacent virtual station composition;The connected relation between described two adjacent virtual stations is established, as the routing node in diagram data
The relationship is added in the chart database by the relationship in library;Mileage between described two adjacent virtual stations, expense are set
Rate is 0, the attribute as relationship of the routing node in chart database;As a result, in the charge road-net node relationship
Increase the model of the routing node in model
Further, in one embodiment, the relationship storage module 702, specifically includes:
Identification point analytical unit, for determining identification point adjacent the first charge station and the second charge station;
First identifier point attribute of a relation determines subelement, for by between the identification point and the first charge station mileage,
Rate is respectively set to mileage between the first charge station and the second charge station, rate, charges as the identification point and first
The attribute of connected relation relationship in the chart database between standing;
Second identifier point attribute of a relation determination unit, for by between the identification point and the second charge station mileage, take
Rate is disposed as 0, the category as the relationship in the chart database of the connected relation between the identification point and the second charge station
Property.
Further, in one embodiment, above-mentioned charge road-net node relational model construction device includes: further include:
Model optimization module, for determining not to be connected to pass according to the node and relationship stored in the chart database
System and adjacent first node and second node;Identification is nearest with the first node distance and there are the third sections of connected relation
Point;The connected relation between the third node and the second node is established, the connected relation is added to the figure number
According in the relationship in library.
Further, in one embodiment, above-mentioned charge road-net node relational model construction device includes: further include:
Attribute of a relation adding module obtains Section four if being identification point for the corresponding road network entity of the third node
Point;The fourth node be apart from the third node it is nearest and corresponding road network entity be charge station node;It will be described
Mileage, rate between the third node and the second node are respectively set to the fourth node and the second node
Between mileage, rate, as the connected relation between the third node and the second node in the chart database
The attribute of relationship.
By above-mentioned charge road-net node relational model construction device, obtained charge road-net node relational model have with
Lower advantage: (one) data model is simple, and scalability is strong;(2) using chart database storage charge path profile, data volume subtracts significantly
It is few;(3) adjacent charge station, the connected relation of phantom station and rate are stored using chart database and calculates weight, amount of storage drops significantly
It is low.
The specific restriction of determination device/charge road-net node relational model construction device about the current expense of high speed can be with
Determination method/charge road-net node relational model construction method restriction of expense current for high speed in seeing above, herein
It repeats no more.Modules in determination device/charge road-net node relational model construction device of the current expense of above-mentioned high speed
It can be realized fully or partially through software, hardware and combinations thereof.Above-mentioned each module can be embedded in the form of hardware or independently of
In processor in computer equipment, it can also be stored in a software form in the memory in computer equipment, in order to locate
It manages device and calls the corresponding operation of the above modules of execution.
In addition, determination device/charge road-net node relational model construction device of the current expense of the high speed of above-mentioned example
In embodiment, the logical partitioning of each program module is merely illustrative of, and can according to need in practical application, such as phase
It answers the convenient of the realization of the configuration requirement or software of hardware to consider, above-mentioned function distribution is completed by different program modules,
Determination device/charge road-net node relational model construction device internal structure of the current expense of the high speed is divided into not
Same program module, to complete all or part of the functions described above.
In one embodiment, a kind of computer equipment is provided, which can be server, internal junction
Composition can be as shown in Figure 8.The computer equipment include by system bus connect processor, memory, network interface and
Database.Wherein, the processor of the computer equipment is for providing calculating and control ability.The memory packet of the computer equipment
Include non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with operating system, computer program and data
Library.The built-in storage provides environment for the operation of operating system and computer program in non-volatile memory medium.The calculating
The database of machine equipment is used to store the number of the determination device of the current expense of charge road-net node relational model construction device/high speed
According to.The network interface of the computer equipment is used to communicate with external terminal by network connection.The computer program is processed
A kind of determination method of current expense of high speed is realized when device executes.
It will be understood by those skilled in the art that structure shown in Fig. 8, only part relevant to application scheme is tied
The block diagram of structure does not constitute the restriction for the computer equipment being applied thereon to application scheme, specific computer equipment
It may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.
In one embodiment, a kind of computer equipment, including memory and processor are provided, is stored in memory
Computer program, the processor perform the steps of when executing computer program
Inquiry request message is received, includes the information of access station, outlet station and identification point in the inquiry request message;
Inquire the charge road-net node relational model that constructs in advance, obtain using the access station, outlet station as start-stop point simultaneously
By the shortest path of the identification point;The charge road-net node relational model is stored in chart database, road network section of charging
Point relational model stores in chart database according to the form of node, relationship, node/relationship attribute;
The shortest path is merged by same a road section, obtains a plurality of section;Calculate the corresponding mileage in every section
And rate;
According to the corresponding mileage in a plurality of section and rate, obtain the corresponding total kilometrage of the shortest path and
Total pass cost.
In one embodiment, the high speed pass cost of above-mentioned other embodiments is also realized when processor executes computer program
The step of determination method.
In one embodiment, a kind of computer equipment, including memory and processor are provided, is stored in memory
Computer program, the processor perform the steps of when executing computer program
Charge station's information, phantom station information and identification point information that road network entity includes are obtained, the figure number is stored as
According to the node in library;The phantom station is the intermediate node or tie point of two highways;
The first connected relation, charge station between acquisition charge station and the second connected relation between phantom station, charge station
Third connecting relationship between identification point and the 4th connected relation between phantom station and phantom station, are stored as the figure number
According to the relationship in library;
Section coding and station coding are obtained, the attribute of the node in the chart database is stored as;
The mileage in section and the rate in section are obtained, the attribute of relationship in the chart database is stored as;Rate
For the passage expense of road unit distance;
According to the attribute of node, node in the chart database, the attribute of relationship and relationship, the charge road is obtained
Net node relationships model.
In one embodiment, the charge road network section of above-mentioned other embodiments is also realized when processor executes computer program
The step of construction method of point relational model.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
Machine program performs the steps of when being executed by processor
Inquiry request message is received, includes the information of access station, outlet station and identification point in the inquiry request message;
Inquire the charge road-net node relational model that constructs in advance, obtain using the access station, outlet station as start-stop point simultaneously
By the shortest path of the identification point;The charge road-net node relational model is stored in chart database, road network section of charging
Point relational model stores in chart database according to the form of node, relationship, node/relationship attribute;
The shortest path is merged by same a road section, obtains a plurality of section;Calculate the corresponding mileage in every section
And rate;
According to the corresponding mileage in a plurality of section and rate, obtain the corresponding total kilometrage of the shortest path and
Total pass cost.
Alternatively, being performed the steps of when computer program is executed by processor
Charge station's information, phantom station information and identification point information that road network entity includes are obtained, the figure number is stored as
According to the node in library;The phantom station is the intermediate node or tie point of two highways;
The first connected relation, charge station between acquisition charge station and the second connected relation between phantom station, charge station
Third connecting relationship between identification point and the 4th connected relation between phantom station and phantom station, are stored as the figure number
According to the relationship in library;
Section coding and station coding are obtained, the attribute of the node in the chart database is stored as;
The mileage in section and the rate in section are obtained, the attribute of relationship in the chart database is stored as;Rate
For the passage expense of road unit distance;
According to the attribute of node, node in the chart database, the attribute of relationship and relationship, the charge road is obtained
Net node relationships model.
In one embodiment, also realize that the high speed of above-mentioned other embodiments is current when computer program is executed by processor
The step of determination method of expense, alternatively, the step of the construction method of the charge road-net node relational model of above-mentioned other embodiments
Suddenly.It is that can pass through those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method
Computer program is completed to instruct relevant hardware, and that the computer program can be stored in a non-volatile computer is readable
It takes in storage medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, this Shen
Please provided by any reference used in each embodiment to memory, storage, database or other media, may each comprise
Non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, there is no the portion being described in detail in some embodiment
Point, it may refer to the associated description of other embodiments.
The term " includes " of embodiment hereof and " having " and their any deformations, it is intended that cover non-exclusive packet
Contain.Such as contain series of steps or the process, method, system, product or equipment of (module) unit are not limited to arrange
Out the step of or unit, but optionally further comprising the step of not listing or unit, or optionally further comprising for these mistakes
The intrinsic other step or units of journey, method, product or equipment.
Referenced herein " multiple " refer to two or more."and/or", the association for describing affiliated partner are closed
System indicates may exist three kinds of relationships, for example, A and/or B, can indicate: individualism A exists simultaneously A and B, individualism
These three situations of B.Character "/" typicallys represent the relationship that forward-backward correlation object is a kind of "or".
Referenced herein " first second " be only be the similar object of difference, do not represent for the specific of object
Sequence, it is possible to understand that specific sequence or precedence can be interchanged in ground, " first second " in the case where permission.It should manage
The object that solution " first second " is distinguished is interchangeable under appropriate circumstances so that the embodiments described herein can in addition to
Here the sequence other than those of diagram or description is implemented.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the concept of this application, various modifications and improvements can be made, these belong to the protection of the application
Range.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of determination method of the current expense of high speed characterized by comprising
Inquiry request message is received, includes the information of access station, outlet station and identification point in the inquiry request message;
The charge road-net node relational model constructed in advance is inquired, obtains using the access station, outlet station as start-stop point and passes through
The shortest path of the identification point;The charge road-net node relational model is stored in chart database, the charge road network section
Point relational model stores in chart database according to the form of node, relationship, node/relationship attribute;
The shortest path is merged by same a road section, obtains a plurality of section;Calculate the corresponding mileage in every section and expense
Rate;
According to the corresponding mileage in a plurality of section and rate, the corresponding total kilometrage of the shortest path and total logical is obtained
Row takes.
2. the method according to claim 1, wherein further include:
Charge station's information, phantom station information and identification point information that road network entity includes are obtained, the chart database is stored as
Node;The phantom station is the intermediate node or tie point of two highways;
Obtain the second connected relation, charge station and the mark between the first connected relation, charge station and the phantom station between charge station
Know the third connecting relationship between point and the 4th connected relation between phantom station and phantom station, is stored as the chart database
Relationship;
Section coding and station coding are obtained, the attribute of the node in the chart database is stored as;
The mileage in section and the rate in section are obtained, the attribute of relationship in the chart database is stored as;Rate is road
The passage expense of unit distance;
According to the attribute of node, node in the chart database, the attribute of relationship and relationship, the charge road network section is obtained
Point relational model.
3. according to the method described in claim 2, it is characterized by further comprising:
Determine that routing node, the routing node are made of two adjacent virtual stations according to the phantom station;
The connected relation between described two adjacent virtual stations is established, as relationship of the routing node in chart database,
The relationship is added in the chart database;
Mileage between described two adjacent virtual stations is set, rate is 0, as the routing node in chart database
The attribute of relationship;
Increase the model of the routing node in the charge road-net node relational model as a result,.
4. according to the method described in claim 2, it is characterized by further comprising:
Determine identification point adjacent the first charge station and the second charge station;
By the mileage between the identification point and the first charge station, rate be respectively set to the first charge station and the second charge station it
Between mileage, rate, as the connected relation between the identification point and the first charge station in the chart database relationship
Attribute;
Mileage between the identification point and the second charge station, rate are disposed as 0, charged as the identification point and second
The attribute of connected relation relationship in the chart database between standing.
5. according to the method described in claim 2, it is characterized by further comprising:
According to the node and relationship stored in the chart database, no connected relation is determined and adjacent first node and
Two nodes;
Identification is nearest with the first node distance and there are the third nodes of connected relation;
The connected relation between the third node and the second node is established, the connected relation is added to the figure number
According in the relationship in library.
6. according to the method described in claim 5, it is characterized in that, it is described establish the third node and the second node it
Between connected relation, after the connected relation is added in the relationship of the chart database, further includes:
If the corresponding road network entity of the third node is identification point, fourth node is obtained;The fourth node is described in distance
Third node it is nearest and corresponding road network entity be charge station node;
Mileage between the third node and the second node, rate are respectively set to the fourth node and institute
Mileage between second node, rate are stated, as the connected relation between the third node and the second node described
The attribute of relationship in chart database.
7. a kind of construction method for road-net node relational model of charging characterized by comprising
Charge station's information, phantom station information and identification point information that road network entity includes are obtained, the chart database is stored as
Node;The phantom station is the intermediate node or tie point of two highways;
Obtain the second connected relation, charge station and the mark between the first connected relation, charge station and the phantom station between charge station
Know the third connecting relationship between point and the 4th connected relation between phantom station and phantom station, is stored as the chart database
Relationship;
Section coding and station coding are obtained, the attribute of the node in the chart database is stored as;
The mileage in section and the rate in section are obtained, the attribute of relationship in the chart database is stored as;Rate is road
The passage expense of unit distance;
According to the attribute of node, node in the chart database, the attribute of relationship and relationship, the charge road network section is obtained
Point relational model.
8. a kind of determination device of the current expense of high speed characterized by comprising
Traffic information obtains module, includes access station, outlet station in the inquiry request message for receiving inquiry request message
With the information of identification point;
Path determination module is obtained for inquiring the charge road-net node relational model constructed in advance with the access station, outlet
It stands for start-stop point and by the shortest path of the identification point;The charge road-net node relational model is stored in chart database
In, road-net node relational model of charging stores in chart database according to the form of node, relationship, node/relationship attribute;
Path analysis module obtains a plurality of section for merging the shortest path by same a road section;Calculate every road
The corresponding mileage of section and rate;
Mileage and expense statistical module, for obtaining described most short according to the corresponding mileage in a plurality of section and rate
The corresponding total kilometrage in path and total pass cost.
9. a kind of construction device for road-net node relational model of charging characterized by comprising
Node memory module, charge station's information, phantom station information and the identification point information for including for obtaining road network entity, is deposited
Storage is the node of the chart database;The phantom station is the intermediate node or tie point of two highways;
Relationship storage module connects for obtaining second between the first connected relation, charge station and phantom station between charge station
Third connecting relationship between clearance system, charge station and identification point and the 4th connected relation between phantom station and phantom station,
It is stored as the relationship of the chart database;
Nodal community memory module is stored as the node in the chart database for obtaining section coding and station coding
Attribute;
Attribute of a relation memory module is stored as the chart database for obtaining the mileage in section and the rate in section
The attribute of middle relationship;Rate is the passage expense of road unit distance;
Model construction module, for the attribute according to the attribute of node, node in the chart database, relationship and relationship,
Obtain the charge road-net node relational model.
10. a kind of computer equipment, including memory and processor, the memory are stored with computer program, feature exists
In, the processor realizes claim 1 to 7 any the method when executing described program the step of.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811162473.6A CN109271562B (en) | 2018-09-30 | 2018-09-30 | Current expense determines method, road-net node relational model construction method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811162473.6A CN109271562B (en) | 2018-09-30 | 2018-09-30 | Current expense determines method, road-net node relational model construction method and device |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109271562A true CN109271562A (en) | 2019-01-25 |
CN109271562B CN109271562B (en) | 2019-11-26 |
Family
ID=65195540
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811162473.6A Active CN109271562B (en) | 2018-09-30 | 2018-09-30 | Current expense determines method, road-net node relational model construction method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109271562B (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110443904A (en) * | 2019-08-28 | 2019-11-12 | 招商华软信息有限公司 | A kind of payment omitted detection method, device, server and storage medium |
CN110570534A (en) * | 2019-09-12 | 2019-12-13 | 招商华软信息有限公司 | Processing method, device, equipment and storage medium of charge rate |
CN111275840A (en) * | 2020-02-19 | 2020-06-12 | 中国联合网络通信集团有限公司 | Vehicle charging method and device |
CN111949664A (en) * | 2020-08-18 | 2020-11-17 | 上海伽易信息技术有限公司 | Subway high-speed data network route analysis method based on double-route protection and tendency aggregation degree graph calculation |
CN113158381A (en) * | 2020-12-28 | 2021-07-23 | 华南理工大学 | Method for solving distance between adjacent nodes and connectivity of routing nodes of expressway network |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1725248A (en) * | 2004-07-21 | 2006-01-25 | 上海高德威智能交通系统有限公司 | Charged monitoring system for road charging monitoring and management section and its monitoring method |
CN101739730A (en) * | 2009-11-26 | 2010-06-16 | 童超 | GPS navigation technology-based expressway charging system and GPS navigation technology-based expressway charging method |
CN104574066A (en) * | 2015-01-26 | 2015-04-29 | 深圳前海万融智能信息有限公司 | Road and bridge payment method and system based on mobile network |
CN107292800A (en) * | 2016-03-30 | 2017-10-24 | 高德信息技术有限公司 | A kind of road charging method and apparatus |
CN108362298A (en) * | 2018-02-22 | 2018-08-03 | 青岛融汇通投资控股有限公司 | Air navigation aid and device in area map |
-
2018
- 2018-09-30 CN CN201811162473.6A patent/CN109271562B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1725248A (en) * | 2004-07-21 | 2006-01-25 | 上海高德威智能交通系统有限公司 | Charged monitoring system for road charging monitoring and management section and its monitoring method |
CN101739730A (en) * | 2009-11-26 | 2010-06-16 | 童超 | GPS navigation technology-based expressway charging system and GPS navigation technology-based expressway charging method |
CN104574066A (en) * | 2015-01-26 | 2015-04-29 | 深圳前海万融智能信息有限公司 | Road and bridge payment method and system based on mobile network |
CN107292800A (en) * | 2016-03-30 | 2017-10-24 | 高德信息技术有限公司 | A kind of road charging method and apparatus |
CN108362298A (en) * | 2018-02-22 | 2018-08-03 | 青岛融汇通投资控股有限公司 | Air navigation aid and device in area map |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110443904A (en) * | 2019-08-28 | 2019-11-12 | 招商华软信息有限公司 | A kind of payment omitted detection method, device, server and storage medium |
CN110443904B (en) * | 2019-08-28 | 2021-08-31 | 招商华软信息有限公司 | Missed fee detection method, device, server and storage medium |
CN110570534A (en) * | 2019-09-12 | 2019-12-13 | 招商华软信息有限公司 | Processing method, device, equipment and storage medium of charge rate |
CN110570534B (en) * | 2019-09-12 | 2021-08-31 | 招商华软信息有限公司 | Processing method, device, equipment and storage medium of charge rate |
CN111275840A (en) * | 2020-02-19 | 2020-06-12 | 中国联合网络通信集团有限公司 | Vehicle charging method and device |
CN111275840B (en) * | 2020-02-19 | 2021-08-03 | 中国联合网络通信集团有限公司 | Vehicle charging method and device |
CN111949664A (en) * | 2020-08-18 | 2020-11-17 | 上海伽易信息技术有限公司 | Subway high-speed data network route analysis method based on double-route protection and tendency aggregation degree graph calculation |
CN113158381A (en) * | 2020-12-28 | 2021-07-23 | 华南理工大学 | Method for solving distance between adjacent nodes and connectivity of routing nodes of expressway network |
CN113158381B (en) * | 2020-12-28 | 2023-04-07 | 华南理工大学 | Method for solving distance between adjacent nodes and connectivity of routing nodes of expressway network |
Also Published As
Publication number | Publication date |
---|---|
CN109271562B (en) | 2019-11-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109271562B (en) | Current expense determines method, road-net node relational model construction method and device | |
CN108981739B (en) | Path planning method, device, server and storage medium | |
CN102810118B (en) | A kind of change weighs net K nearest neighbor search method | |
CN105677804A (en) | Determination of authority stations and building method and device of authority station database | |
CN103471603B (en) | The matching process of a kind of public bus network and road network and device | |
CN103149576A (en) | Map matching method of floating car data | |
CN110442603A (en) | Address matching method, apparatus, computer equipment and storage medium | |
CN101694749A (en) | Method and device for speculating routes | |
CN106528589A (en) | Data management method and device | |
CN109737967A (en) | Unmanned plane paths planning method, device, storage medium and computer equipment | |
CN109635037A (en) | A kind of the fragment storage method and device of relationship type distributed data base | |
CN107766406A (en) | A kind of track similarity join querying method searched for using time priority | |
CN110345964A (en) | Route matching method, apparatus, system and storage medium | |
WO2021236006A1 (en) | Route deviation quantification and vehicular route learning based thereon | |
CN110751831A (en) | Travel mode identification method and device, computer equipment and storage medium | |
CN109741227A (en) | One kind is based on nearest neighbor algorithm prediction people room consistency processing method and system | |
CN109540165B (en) | Heuristic search expressway network constraint routing algorithm | |
CN106095850A (en) | A kind of data processing method and equipment | |
CN114168694A (en) | Road network fusion method and device, computer equipment and storage medium | |
Li et al. | Efficient adaptive matching for real-time city express delivery | |
CN116698075B (en) | Road network data processing method and device, electronic equipment and storage medium | |
CN112101638B (en) | Cooperative optimization method for urban logistics distribution range | |
CN100456680C (en) | Cooling method and coder | |
CN108663062A (en) | Paths planning method and its system | |
CN107588779B (en) | Intelligent vehicle navigation method based on travel time between any two nodes |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |