CN112652189B - Traffic distribution method, device and equipment based on policy flow and readable storage medium - Google Patents
Traffic distribution method, device and equipment based on policy flow and readable storage medium Download PDFInfo
- Publication number
- CN112652189B CN112652189B CN202011599024.5A CN202011599024A CN112652189B CN 112652189 B CN112652189 B CN 112652189B CN 202011599024 A CN202011599024 A CN 202011599024A CN 112652189 B CN112652189 B CN 112652189B
- Authority
- CN
- China
- Prior art keywords
- super
- destination
- flow
- cost
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096833—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
- G08G1/096844—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route where the complete route is dynamically recomputed based on new data
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
Abstract
The invention relates to a traffic distribution method, a device, equipment and a readable storage medium based on policy flow, which comprises the steps of obtaining a traffic network model and a plurality of user travel demands, establishing a plurality of initialized super path trees, establishing a plurality of super clusters, expanding the super clusters, adjusting the super clusters and outputting a super map, enabling the cost of a plurality of super paths between each OD pair on the traffic network model to be the same by continuously adjusting the flow on each super road section, and outputting the super map containing all super road sections in all OD pairs on the traffic network model and the flow on the super road sections, wherein the super map is used for predicting the pedestrian flow of each road section in the existing traffic network in advance and facilitating the optimized layout on the related road in advance; meanwhile, the cost of the super road section and the node cost can be adjusted according to a specific traffic network system, so that the traffic distribution method based on the strategy flow is suitable for the traffic distribution problem of various different traffic networks, namely, has the function of explaining the traffic distribution problem of a general traffic system.
Description
Technical Field
The invention relates to the technical field of traffic flow distribution, in particular to a traffic distribution method, a traffic distribution device, traffic distribution equipment and a readable storage medium based on strategy flows.
Background
Nowadays, research on traffic flow on a traffic network still mainly focuses on a traffic distribution problem, but the research foundation of the problem is that a traveler selects a single path, and the decision of the traveler in reality is often a random process, and the traffic distribution problem cannot describe the process, so that the practicability is poor in many cases, so that a learner introduces a traffic distribution problem with a policy and uses a super path to solve the problem, but the research on the traffic distribution problem with the policy and a solution of the traffic distribution problem in various fields such as an expressway network is limited only in the field so far, a general system explanation is not formed, and an effective method for solving the problem is lacking for the actual traffic network.
Disclosure of Invention
The invention aims to provide a traffic distribution method, a traffic distribution device, traffic distribution equipment and a readable storage medium based on policy flow, and solves the problem that the prior art lacks a solution for traffic network traffic distribution with policy applicable to general system exposition.
In order to achieve the above object, the embodiments of the present application provide the following technical solutions:
in one aspect, an embodiment of the present application provides a traffic distribution method based on policy flow, where the method includes: the method comprises the steps of obtaining a traffic network model and a plurality of user travel demands, and assuming that a user preferentially selects a super path with the lowest travel cost, wherein the user travel demands comprise a starting point and a destination of the user, and the starting point and the destination are both located on nodes of the traffic network model; initialization: sequentially establishing an initialized hyper-path tree for each different destination, and distributing a plurality of users with the same destination on a hyper-path section of the initialized hyper-path tree corresponding to the destination, wherein the flow is the number of the users on the hyper-path section, the hyper-cluster is the initialized hyper-path tree distributed with the users, the hyper-cluster comprises a plurality of OD pairs, and the OD pairs are a hyper-path set communicating one destination and one departure point; super-cluster expansion: sequentially expanding each super cluster, wherein the flow on each super road section on the traffic road network model needs to be updated after each super cluster is expanded, and sequentially adding a new super road section into each super cluster to enable each OD pair in each super cluster to comprise a plurality of super paths; super-cluster adjustment: sequentially adjusting the flow on the super-road sections in each OD pair in each super-cluster to enable the cost of a plurality of super-paths between each OD pair to be the same, updating the flow on each super-road section on the traffic road network model after adjusting one super-cluster each time, and sequentially removing the super-road sections with zero flow in each super-cluster; and detecting whether the cost of a plurality of super paths between all OD pairs on the traffic network model is the same, if so, outputting a super graph, wherein the super graph comprises all super sections in all OD pairs on the traffic network model and the flow on the super sections, and if not, returning to the super cluster expansion.
Optionally, the establishing an initialized hyper path tree includes:
and acquiring the position of the node of the single destination, and sequentially finding a super path which leads to the node of the destination and has the lowest cost by taking the other nodes except the node of the destination on the network traffic model as starting points.
Optionally, the allocating a plurality of users with the same destination to the super-segment of the initialized super-path tree corresponding to the destination includes:
the method comprises the steps of obtaining departure points and destinations of a plurality of users with the same destinations and the number of users at each departure point;
and finding a hyper path with the lowest cost for the connected destination for each different starting point, and distributing the number of users on each hyper section in the hyper path.
Optionally, the adding of the new super road segment includes:
acquiring a node position of a destination, a node position of a departure point and flow on each super road section in a super cluster; adjusting the cost on each overtaking segment by adjusting the flow on each overtaking segment; a less costly superroute is obtained on the traffic road network model by finding new superroad segments and adding the new superroad segments to the superroad.
Optionally, the cost of each super-segment and the cost of each node are both proportional to the traffic, the cost of the super-segment is time and/or money, and the cost of the node is waiting time.
In a second aspect, an embodiment of the present application provides a traffic distribution system based on policy flow, including:
the system comprises a data acquisition module, a data processing module and a data processing module, wherein the data acquisition module is used for acquiring a traffic network model and a plurality of user travel demands, the user travel demands comprise a departure point and a destination of a user, and the departure point and the destination are both positioned on nodes of the traffic network model;
the first calculation module is used for respectively establishing an initialized super-path tree for each different destination in sequence, distributing a plurality of users with the same destination on a super-path section of the initialized super-path tree corresponding to the destination, wherein the flow rate is the number of the users on the super-path section, the super-cluster is a set of all OD pairs in the initialized super-path tree distributed with the users, and the OD pairs are a super-path set communicating one destination with one departure point;
the second calculation module is used for sequentially expanding each super cluster, the flow on each super road section on the traffic road network model needs to be updated after each super cluster is expanded, and new super road sections are sequentially added into each super cluster so that each OD pair in each super cluster comprises a plurality of super paths;
the third calculation module is used for adjusting the flow on the super-road section in each OD pair in each super-cluster in sequence to enable the cost of a plurality of super-paths between each OD pair to be the same, updating the flow on each super-road section on the traffic road network model after adjusting one super-cluster each time, and removing the super-road section with zero flow in each super-cluster in sequence;
and the fourth calculation module is used for detecting whether the cost of the multiple super paths between all OD pairs on the traffic network model is the same or not, outputting a super graph if the cost is the same, wherein the super graph comprises all super sections in all OD pairs on the traffic network model and the flow on the super sections, and returning the super cluster expansion if the cost is not the same.
Preferably, the first calculation module comprises:
a first data acquisition unit configured to acquire a node position where a single destination is located;
and the first calculation unit is used for sequentially finding out a shortest route which leads to the node where the destination is located and has the lowest cost by taking the other nodes except the node where the destination is located on the network traffic model as starting points.
Preferably, the first calculation module comprises:
a second data acquisition unit for acquiring departure points and destinations of a plurality of users having the same destination and the number of users per departure point;
and the second calculation unit is used for searching a hyper path with the lowest cost and communicated destinations for each different starting point, and distributing the number of users on each hyper section in the hyper path.
Optionally, the second computing module comprises:
a third data acquisition unit, configured to acquire a node position of a destination, a node position of a departure point, and a flow rate on each super road segment in a super cluster;
the third calculating unit is used for adjusting the flow on each overtaking section so as to adjust the cost on each overtaking section;
and the fourth calculation unit is used for obtaining a lower-cost super path by searching a new super road section on the traffic road network model and adding the new super road section to the super road.
In a third aspect, an embodiment of the present application provides a traffic distribution apparatus based on a policy flow, including:
a memory for storing a computer program;
and the processor is used for realizing the steps of the traffic distribution method based on the strategy flow when executing the computer program.
In a fourth aspect, the present application provides a readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the steps of the traffic distribution method based on policy flow.
The invention has the beneficial effects that:
the method comprises the steps of enabling the cost of a plurality of super paths between each OD team on a traffic network model to be the same by continuously adjusting the flow on each super road section, outputting a super map containing all super road sections in all OD pairs on the traffic network model and the flow on the super road sections, and predicting the flow of people on each road section in the existing traffic network in advance so as to facilitate the optimized layout on the related road in advance; meanwhile, the cost of the super road section and the cost of the nodes can be adjusted according to the actual specific traffic network system, such as changing the cost into time or money and other related attributes, so the traffic distribution method based on the strategy flow is suitable for the traffic distribution problem of various different traffic networks, namely has the function of explaining the traffic distribution problem of the general traffic system.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the embodiments of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
FIG. 1 is a flow chart of a traffic distribution method based on policy flow according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an OD pair according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a traffic distribution system based on policy flow according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a traffic distribution device based on policy flow according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that: like reference numbers or letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined or explained in subsequent figures. Meanwhile, in the description of the present invention, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.
Example 1
As shown in fig. 1-2, the present embodiment provides a traffic distribution method based on a policy flow, which includes step S1, step S2, step S3, step S4, and step S5.
S1, obtaining a traffic network model and a plurality of user travel demands, and assuming that a user preferentially selects a super path with the lowest travel cost, wherein the user travel demands comprise a departure point and a destination of the user, and the departure point and the destination are both located on nodes of the traffic network model;
the traffic network model comprises a plurality of nodes and road sections among the connected nodes.
S2, initialization: sequentially establishing an initialized hyper-path tree for each different destination, and distributing a plurality of users with the same destination on a hyper-path section of the initialized hyper-path tree corresponding to the destination, wherein the flow is the number of the users on the hyper-path section, the hyper-cluster is the initialized hyper-path tree distributed with the users, the hyper-cluster comprises a plurality of OD pairs, and the OD pairs are a hyper-path set communicating one destination and one departure point;
s3, super cluster expansion: sequentially expanding each super cluster, wherein the flow on each super road section on the traffic road network model needs to be updated after each super cluster is expanded, and sequentially adding a new super road section into each super cluster to enable each OD pair in each super cluster to comprise a plurality of super paths;
s4, super cluster adjustment: sequentially adjusting the flow on the super-road sections in each OD pair in each super-cluster to enable the cost of a plurality of super-paths between each OD pair to be the same, updating the flow on each super-road section on the traffic road network model after adjusting one super-cluster each time, and sequentially removing the super-road sections with zero flow in each super-cluster;
the cost of each super road section and the cost of each node are in direct proportion to the flow, the cost of the super road section is time and money, and the cost of the node is waiting time.
Will be provided with
Defined as the weighted minimum cost from node i to destination d;
defined as the cost to arrive at destination d from node i via a super-road segment s;
the method is a target-based overtaking path flow, namely the pedestrian flow of a traveler leaving a node i to reach each overtaking path section in a destination d through the overtaking path section s;
ωi,sis the cost of passing through node i when passing through a section s of road, MsIs a set of regular road segments corresponding to a super road segment s, eij,sIs the possibility of selecting a link (i, j) when passing the link s,
is the weighted minimum cost, t, from node j to destination dijIs the cost of the segment (i, j), D is the set of destination nodes, N/D is the set of nodes other than the destination node, OiIs a set of super road segments starting from node i; e.g. of the typeij,s、tij、ωi,sThree variables and flow
The relationship (c) varies with the actual meaning of the traffic network map, i.e.
By changing eij,s、tij、ωi,sAnd thereby indirectly change
The value of (c).
I and d are fixed for each OD pair, and the adjustment of the super cluster is performed by adjusting one of the OD pairs
Thereby changing
And
so that it satisfies the equilibrium condition:
from the above expression, it can be concluded that
Is zero, i.e. the flow of people over the section s is zero or
The balance condition is only fulfilled when zero, i.e. the cost of starting from node i to reach destination d via the super-segment s equals the weighted minimum cost from node i to destination d.
And S5, detecting whether the cost of a plurality of super paths between all OD pairs on the traffic network model is the same, if so, outputting a super graph, wherein the super graph comprises all super road sections in all OD pairs on the traffic network model and the flow on the super road sections, and if not, returning to the super cluster expansion.
In a specific embodiment of the present disclosure, the step S2 may further include a step S211.
And S211, acquiring the position of the node where the single destination is located, and sequentially finding out a super path which leads to the node where the destination is located and has the lowest cost by taking other nodes except the node where the destination is located on the network traffic model as starting points.
In a specific embodiment of the present disclosure, the step S2 may further include a step S221 and a step S222.
S221, obtaining departure points and destinations of a plurality of users with the same destinations and the number of users at each departure point;
and S222, finding a super path with the lowest cost and communicated destinations for each different starting point, and distributing the number of users on each super path section in the super path.
In a specific embodiment of the present disclosure, the step S3 may further include a step S311, a step S312, and a step S313.
S311, acquiring a node position of a destination, a node position of a departure point and flow on each super road section in a super cluster;
s312, changing the cost of each super road section by adjusting the flow of each super road section;
step S313, obtaining a lower-cost super route by searching a new super road section on the traffic road network model and adding the new super road section to the super road section.
In a specific embodiment of the present disclosure, after the step S3, a step S321 may be further included.
S321, calculating the maximum super path cost difference delta d of each OD pair in each super cluster in sequence, if the maximum super path cost difference delta d is larger than a preset value, returning to the S4, in the super cluster adjustment, defining
For the weighted maximum cost of the OD pair from node i to destination d,
defined as the weighted minimum cost from node i to destination d:
in the prior art, research on the traffic distribution problem with a strategy and a solution of the traffic distribution problem in each field such as an expressway network is limited to the inside of the field, a general system description is not formed, and an effective method for solving the problem is lacked for an actual traffic network. In the embodiment, the cost of a plurality of super paths between each OD team on the traffic network model is the same by continuously adjusting the flow on each super road section, and a super map containing all super road sections in all OD pairs on the traffic network model and the flow on the super road sections is output and used for predicting the pedestrian flow of each road section in the existing traffic network in advance, so that the optimized layout on the related road is facilitated in advance; meanwhile, the cost of the super road section and the cost of the nodes can be adjusted according to the actual specific traffic network system, such as changing the cost into time or money and other related attributes, so the traffic distribution method based on the strategy flow is suitable for the traffic distribution problem of various different traffic networks, namely has the function of explaining the traffic distribution problem of the general traffic system.
Example 2
As shown in fig. 3, the present embodiment provides a traffic distribution system based on policy flow, and the system includes a data acquisition module 701, a first calculation module 702, a second calculation module 703, a third calculation module 704, and a fourth calculation module 705.
A data obtaining module 701, configured to obtain a traffic network model and a plurality of user travel demands, where the user travel demands include a departure point and a destination of a user, and the departure point and the destination are both located on a node of the traffic network model;
a first calculating module 702, configured to sequentially establish an initialized super-path tree for each different destination, and allocate a plurality of users with the same destination on a super-path segment of the initialized super-path tree corresponding to the destination, where the traffic is the number of users on the super-path segment, and a super-cluster is a set of all OD pairs in the initialized super-path tree to which users are allocated, where an OD pair is a super-path set that connects one destination and one departure point;
a second calculation module 703, configured to sequentially expand each super cluster, where after each super cluster is expanded, the flow rate on each super road segment on the traffic road network model needs to be updated, and sequentially add a new super road segment to each super cluster so that each OD pair in each super cluster includes multiple super paths;
a third calculating module 704, configured to sequentially adjust traffic on the super-road segments in each OD pair in each super-cluster so that costs of multiple super-paths between each OD pair are the same, and after adjusting one super-cluster each time, the traffic on each super-road segment on the traffic road network model needs to be updated, and sequentially remove the super-road segment with zero traffic in each super-cluster;
a fourth calculating module 705, configured to detect whether costs of multiple super paths between all OD pairs on the traffic network model are the same, output a super map if the costs are the same, where the super map includes all super segments in all OD pairs on the traffic network model and traffic on the super segments, and return the super cluster expansion if the costs are different.
In a specific embodiment of the present disclosure, the first calculating module 702 further includes a first data obtaining unit 7021 and a first calculating unit 7023.
A first data obtaining unit 7021 configured to obtain a node location where a single destination is located;
the first calculating unit 7023 is configured to find a shortest route leading to a node where the destination is located in sequence with other nodes on the network traffic model except the node where the destination is located as starting points.
In a specific embodiment of the present disclosure, the first computing module 702 further includes a second data obtaining unit 7022 and a second computing unit 7024.
A second data obtaining unit 7022 configured to obtain departure points and destinations of a plurality of users having the same destination and the number of users per departure point;
a second calculating unit 7024, configured to find a shortest hyper path with the lowest cost and connected to the destination for each different departure point, and allocate the number of users to each hyper path segment in the hyper path.
In a specific embodiment of the present disclosure, the second calculating module 703 further includes a third data obtaining unit 7031, a third calculating unit 7032, and a fourth calculating unit 7033.
A third number obtaining unit 7031, configured to obtain a node position of a destination, a node position of a departure point, and a flow rate on each super road segment in one super cluster;
a third calculating unit 7032, configured to adjust the flow rate on each super road segment, so as to adjust the cost on each super road segment;
a fourth calculating unit 7033 is configured to find a new super-road segment on the traffic road network model, obtain a lower-cost super-path, and add the new super-road segment to the super-road.
It should be noted that, regarding the apparatus in the above embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated herein.
Example 3
Corresponding to the above method embodiments, the embodiments of the present disclosure further provide a traffic distribution device based on a policy flow, and the traffic distribution device based on a policy flow described below and the traffic distribution method based on a policy flow described above may be referred to correspondingly to each other.
Fig. 4 is a block diagram illustrating a traffic distribution facility 800 based on policy flow according to an example embodiment. As shown in fig. 4, the traffic distribution apparatus 800 based on policy flow may include: a processor 801, a memory 802. The policy flow based traffic distribution device 800 may also include one or more of a multimedia component 803, an input/output (I/O) interface 804, and a communication component 805.
The processor 801 is configured to control the overall operation of the traffic distribution apparatus 800 based on the policy flow, so as to complete all or part of the steps in the traffic distribution method based on the policy flow. The memory 402 is used to store various types of data to support the operation of the policy flow based traffic distribution apparatus 800, such data may include, for example, instructions for any application or method operating on the policy flow based traffic distribution apparatus 800, as well as application related data such as traveler data, transceived messages, pictures, audio, video, and so forth. The Memory 802 may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random Access Memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk or optical disk. The multimedia components 803 may include screen and audio components. Wherein the screen may be, for example, a touch screen and the audio component is used for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signal may further be stored in the memory 802 or transmitted through the communication component 805. The audio assembly also includes at least one speaker for outputting audio signals. The I/O interface 804 provides an interface between the processor 801 and other interface modules, such as a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 805 is used for wired or wireless communication between the policy flow based traffic distribution apparatus 800 and other devices. Wireless communication, such as Wi-Fi, bluetooth, Near Field Communication (NFC), 2G, 3G, or 4G, or a combination of one or more of them, so that the corresponding communication component 805 may include: Wi-Fi module, bluetooth module, NFC module.
In an exemplary embodiment, the traffic distribution Device 800 based on the policy flow may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors or other electronic components for performing the above-mentioned traffic distribution method based on the policy flow.
In another exemplary embodiment, a computer readable storage medium is also provided, which comprises program instructions, which when executed by a processor, implement the steps of the above-described policy flow-based traffic distribution method. For example, the computer readable storage medium may be the memory 802 described above that includes program instructions executable by the processor 801 of the traffic distribution facility 800 based on policy flow to perform the traffic distribution method based on policy flow described above.
Example 4
Corresponding to the above method embodiment, the embodiment of the present disclosure further provides a readable storage medium, and a readable storage medium described below and the above described traffic distribution method based on policy flow may be referred to correspondingly.
A readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the traffic distribution method based on policy flow of the above-mentioned method embodiments.
The readable storage medium may be a U disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various readable storage media capable of storing program codes
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. The traffic distribution method based on the strategy flow is characterized by comprising the following steps:
the method comprises the steps of obtaining a traffic network model and a plurality of user travel demands, and assuming that a user preferentially selects a super path with the lowest cost, wherein the user travel demands comprise a starting point and a destination of the user, and the starting point and the destination are both located on nodes of the traffic network model;
initialization: sequentially establishing an initialized super-path tree for each different destination, distributing a plurality of users with the same destination on a super-path section of the initialized super-path tree corresponding to the destination, wherein the flow is the number of the users on the super-path section, the super-cluster is a set of all OD pairs in the initialized super-path tree distributed with the users, and the OD pairs are a super-path set communicating one destination with one starting point;
super-cluster expansion: sequentially expanding each super cluster, wherein the flow on each super road section on the traffic road network model needs to be updated after each super cluster is expanded, and sequentially adding a new super road section into each super cluster to enable each OD pair in each super cluster to comprise a plurality of super paths;
super-cluster adjustment: sequentially adjusting the flow on the super-road sections in each OD pair in each super-cluster to enable the cost of a plurality of super-paths between each OD pair to be the same, updating the flow on each super-road section on the traffic road network model after adjusting one super-cluster each time, and sequentially removing the super-road sections with zero flow in each super-cluster;
detecting whether the cost of a plurality of super paths between all OD pairs on the traffic network model is the same or not, if so, outputting a super map, wherein the super map comprises all super road sections in all OD pairs on the traffic network model and the flow on the super road sections, and if not, returning to the super cluster expansion;
the cost of each super road section and the cost of each node are both in direct proportion to flow, the cost of the super road section is time and/or money, and the cost of the node is waiting time;
will be provided with
Defined as the weighted minimum cost from node i to destination d;
defined as the cost to arrive at destination d from node i via a super-road segment s;
the method is a target-based overtaking path flow, namely the pedestrian flow of a traveler leaving a node i to reach each overtaking path section in a destination d through the overtaking path section s;
ωi,sis the cost of passing through node i when passing through a section s of road, MsIs a set of regular road segments corresponding to a super road segment s, eij,sIs the possibility of selecting a link (i, j) when passing the link s,
is the weighted minimum cost, t, from node j to destination dijIs the cost of the segment (i, j), D is the set of destination nodes, N/D is the set of nodes other than the destination node, OiIs a set of super road segments starting from node i; e.g. of the typeij,s、tij、ωi,sThree variables and flow
The relationship (c) varies with the actual meaning of the traffic network map, i.e.
By changing eij,s、tij、ωi,sAnd thereby indirectly change
A value of (d);
i and d are fixed for each OD pair, and the adjustment of the super cluster is performed by adjusting one of the OD pairs
Thereby changing
And
so that it satisfies the equilibrium condition:
only when
Is zero, i.e. the flow of people over the section s is zero or
The balance condition is only fulfilled when zero, i.e. the cost of starting from node i to reach destination d via the super-segment s equals the weighted minimum cost from node i to destination d.
2. The method of claim 1, wherein the establishing an initialized hyper-path tree comprises:
and acquiring the position of the node of the single destination, and sequentially finding a super path which leads to the node of the destination and has the lowest cost by taking the other nodes except the node of the destination on the network traffic model as starting points.
3. The method of claim 1, wherein the allocating a plurality of users having the same destination to the super-segment of the initialized super-path tree corresponding to the destination comprises:
the method comprises the steps of obtaining departure points and destinations of a plurality of users with the same destinations and the number of users at each departure point;
and finding a hyper path with the lowest cost for the connected destination for each different starting point, and distributing the number of users on each hyper section in the hyper path.
4. The method of claim 1, wherein the adding a new super segment comprises:
acquiring a node position of a destination, a node position of a departure point and flow on each super road section in a super cluster;
adjusting the cost on each overtaking segment by adjusting the flow on each overtaking segment;
a less costly superroute is obtained on the traffic road network model by finding new superroad segments and adding the new superroad segments to the superroad.
5. A traffic distribution system based on policy flow, comprising:
the system comprises a data acquisition module, a data processing module and a data processing module, wherein the data acquisition module is used for acquiring a traffic network model and a plurality of user travel demands, the user travel demands comprise a departure point and a destination of a user, and the departure point and the destination are both positioned on nodes of the traffic network model;
the first calculation module is used for respectively establishing an initialized super-path tree for each different destination in sequence, distributing a plurality of users with the same destination on a super-path section of the initialized super-path tree corresponding to the destination, wherein the flow rate is the number of the users on the super-path section, the super-cluster is a set of all OD pairs in the initialized super-path tree distributed with the users, and the OD pairs are a super-path set communicating one destination with one departure point;
the second calculation module is used for sequentially expanding each super cluster, the flow on each super road section on the traffic road network model needs to be updated after each super cluster is expanded, and new super road sections are sequentially added into each super cluster so that each OD pair in each super cluster comprises a plurality of super paths;
the third calculation module is used for adjusting the flow on the super-road section in each OD pair in each super-cluster in sequence to enable the cost of a plurality of super-paths between each OD pair to be the same, updating the flow on each super-road section on the traffic road network model after adjusting one super-cluster each time, and removing the super-road section with zero flow in each super-cluster in sequence;
the fourth calculation module is used for detecting whether the cost of a plurality of super paths between all OD pairs on the traffic network model is the same or not, if the cost is the same, outputting a hypergraph, wherein the hypergraph comprises all super road sections in all OD pairs on the traffic network model and the flow on the super road sections, and if the cost is not the same, returning to the super cluster expansion of the second calculation module;
the cost of each super road section and the cost of each node are both in direct proportion to flow, the cost of the super road section is time and/or money, and the cost of the node is waiting time;
will be provided with
Defined as the weighted minimum cost from node i to destination d;
defined as the cost to arrive at destination d from node i via a super-road segment s;
the method is a target-based overtaking path flow, namely the pedestrian flow of a traveler leaving a node i to reach each overtaking path section in a destination d through the overtaking path section s;
ωi,sis the cost of passing through node i when passing through a section s of road, MsIs a set of regular road segments corresponding to a super road segment s, eij,sIs the possibility of selecting a link (i, j) when passing the link s,
is the weighted minimum cost, t, from node j to destination dijIs the cost of the segment (i, j), D is the set of destination nodes, N/D is the set of nodes other than the destination node, OiIs a set of super road segments starting from node i; e.g. of the typeij,s、tij、ωi,sThree variables and flow
The relationship (c) varies with the actual meaning of the traffic network map, i.e.
By changing eij,s、tij、ωi,sAnd thereby indirectly change
A value of (d);
i and d are fixed for each OD pair, and the adjustment of the super cluster is performed by adjusting one of the OD pairs
Thereby changing
And
so that it satisfies the equilibrium condition:
only when
Is zero, i.e. the flow of people over the section s is zero or
The balance condition is only fulfilled when zero, i.e. the cost of starting from node i to reach destination d via the super-segment s equals the weighted minimum cost from node i to destination d.
6. The strategic flow-based traffic distribution system of claim 5, wherein the first computing module comprises:
a first data acquisition unit configured to acquire a node position where a single destination is located;
and the first calculation unit is used for sequentially finding out a shortest route which leads to the node where the destination is located and has the lowest cost by taking the other nodes except the node where the destination is located on the network traffic model as starting points.
7. The strategic flow-based traffic distribution system of claim 5, wherein the first computing module comprises:
a second data acquisition unit for acquiring departure points and destinations of a plurality of users having the same destination and the number of users per departure point;
and the second calculation unit is used for searching a hyper path with the lowest cost and communicated destinations for each different starting point, and distributing the number of users on each hyper section in the hyper path.
8. The strategic flow-based traffic distribution system of claim 5, wherein the second computing module comprises:
a third data acquisition unit, configured to acquire a node position of a destination, a node position of a departure point, and a flow rate on each super road segment in a super cluster;
the third calculating unit is used for adjusting the flow on each overtaking section so as to adjust the cost on each overtaking section;
and the fourth calculation unit is used for obtaining a lower-cost super path by searching a new super road section on the traffic road network model and adding the new super road section to the super road.
9. Traffic distribution equipment based on policy flow, characterized by comprising:
a memory for storing a computer program;
processor for implementing the steps of the method for policy flow based traffic distribution according to any of claims 1 to 4 when executing said computer program.
10. A readable storage medium, characterized by: the readable storage medium has stored thereon a computer program which, when being executed by a processor, carries out the steps of the method for policy flow based traffic distribution according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011599024.5A CN112652189B (en) | 2020-12-30 | 2020-12-30 | Traffic distribution method, device and equipment based on policy flow and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011599024.5A CN112652189B (en) | 2020-12-30 | 2020-12-30 | Traffic distribution method, device and equipment based on policy flow and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112652189A CN112652189A (en) | 2021-04-13 |
| CN112652189B true CN112652189B (en) | 2021-09-28 |
Family
ID=75363908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011599024.5A Active CN112652189B (en) | 2020-12-30 | 2020-12-30 | Traffic distribution method, device and equipment based on policy flow and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112652189B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113570867B (en) * | 2021-09-26 | 2021-12-07 | 西南交通大学 | Urban traffic state prediction method, device, equipment and readable storage medium |
| CN115798217A (en) * | 2023-02-06 | 2023-03-14 | 中国市政工程西南设计研究总院有限公司 | Multi-mode traffic network super-path flow distribution method, device, equipment and medium |
Citations (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103208194A (en) * | 2013-04-03 | 2013-07-17 | 昆明联诚科技有限公司 | Urban traffic signal cooperative control system |
| CN104537439A (en) * | 2014-12-29 | 2015-04-22 | 中南大学 | Minimal-cost path and mixed path distribution method for alleviating track traffic congestion |
| CN105355035A (en) * | 2015-11-16 | 2016-02-24 | 清华大学 | Traffic dispersion method formulated based on traffic flow assignment distribution difference |
| CN105930914A (en) * | 2016-04-01 | 2016-09-07 | 东南大学 | City bus optimal charging structure charge determination method based on origin-destination distance |
| CN106952475A (en) * | 2017-04-26 | 2017-07-14 | 清华大学 | The personalized inductivity distribution method of dual path road network under user equilibrium principle |
| CN107123260A (en) * | 2017-06-26 | 2017-09-01 | 上海交通大学 | Method of traffic assignment based on traveler budget limit |
| CN107256632A (en) * | 2017-08-11 | 2017-10-17 | 上海交通大学 | A kind of method of traffic assignment based on the heterogeneous time value of user Yu congestion expense budget |
| CN109238297A (en) * | 2018-08-29 | 2019-01-18 | 沈阳理工大学 | A kind of user is optimal and the Dynamic User-Optimal Route Choice method of system optimal |
| JP2019185279A (en) * | 2018-04-06 | 2019-10-24 | 株式会社デンソー | Control apparatus |
| CN110457753A (en) * | 2019-06-27 | 2019-11-15 | 东南大学 | A kind of multiple attributive decision making method of sustainable transport network design |
| CN110582072A (en) * | 2019-08-16 | 2019-12-17 | 北京邮电大学 | Fuzzy matching-based resource allocation method and device in cellular internet of vehicles |
| CN110853335A (en) * | 2019-11-14 | 2020-02-28 | 东南大学 | Cooperative fleet conflict risk avoidance autonomous decision-making method for common bottleneck sections of expressway |
| CN111105613A (en) * | 2019-12-02 | 2020-05-05 | 北京建筑大学 | Traffic distribution method and system based on multi-source data |
| CN111127881A (en) * | 2019-12-16 | 2020-05-08 | 安徽科力信息产业有限责任公司 | Area anti-overflow traffic signal control game method and system |
| CN111383448A (en) * | 2018-12-29 | 2020-07-07 | 阿里巴巴集团控股有限公司 | Traffic information processing method and device based on road section |
| CN111583648A (en) * | 2020-05-14 | 2020-08-25 | 公安部交通管理科学研究所 | Urban traffic flow prediction method fusing GPS data and checkpoint flow data |
| CN112070298A (en) * | 2020-09-04 | 2020-12-11 | 深圳市规划国土发展研究中心 | Target urban railway interconnection and intercommunication operation organization scheme optimization method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10102744B2 (en) * | 2016-09-27 | 2018-10-16 | International Business Machines Corporation | Predictive traffic management using virtual lanes |
| US11011056B2 (en) * | 2018-01-29 | 2021-05-18 | Fujitsu Limited | Fragmentation-aware intelligent autonomous intersection management using a space-time resource model |
-
2020
- 2020-12-30 CN CN202011599024.5A patent/CN112652189B/en active Active
Patent Citations (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103208194A (en) * | 2013-04-03 | 2013-07-17 | 昆明联诚科技有限公司 | Urban traffic signal cooperative control system |
| CN104537439A (en) * | 2014-12-29 | 2015-04-22 | 中南大学 | Minimal-cost path and mixed path distribution method for alleviating track traffic congestion |
| CN105355035A (en) * | 2015-11-16 | 2016-02-24 | 清华大学 | Traffic dispersion method formulated based on traffic flow assignment distribution difference |
| CN105930914A (en) * | 2016-04-01 | 2016-09-07 | 东南大学 | City bus optimal charging structure charge determination method based on origin-destination distance |
| CN106952475A (en) * | 2017-04-26 | 2017-07-14 | 清华大学 | The personalized inductivity distribution method of dual path road network under user equilibrium principle |
| CN107123260A (en) * | 2017-06-26 | 2017-09-01 | 上海交通大学 | Method of traffic assignment based on traveler budget limit |
| CN107256632A (en) * | 2017-08-11 | 2017-10-17 | 上海交通大学 | A kind of method of traffic assignment based on the heterogeneous time value of user Yu congestion expense budget |
| JP2019185279A (en) * | 2018-04-06 | 2019-10-24 | 株式会社デンソー | Control apparatus |
| CN109238297A (en) * | 2018-08-29 | 2019-01-18 | 沈阳理工大学 | A kind of user is optimal and the Dynamic User-Optimal Route Choice method of system optimal |
| CN111383448A (en) * | 2018-12-29 | 2020-07-07 | 阿里巴巴集团控股有限公司 | Traffic information processing method and device based on road section |
| CN110457753A (en) * | 2019-06-27 | 2019-11-15 | 东南大学 | A kind of multiple attributive decision making method of sustainable transport network design |
| CN110582072A (en) * | 2019-08-16 | 2019-12-17 | 北京邮电大学 | Fuzzy matching-based resource allocation method and device in cellular internet of vehicles |
| CN110853335A (en) * | 2019-11-14 | 2020-02-28 | 东南大学 | Cooperative fleet conflict risk avoidance autonomous decision-making method for common bottleneck sections of expressway |
| CN111105613A (en) * | 2019-12-02 | 2020-05-05 | 北京建筑大学 | Traffic distribution method and system based on multi-source data |
| CN111127881A (en) * | 2019-12-16 | 2020-05-08 | 安徽科力信息产业有限责任公司 | Area anti-overflow traffic signal control game method and system |
| CN111583648A (en) * | 2020-05-14 | 2020-08-25 | 公安部交通管理科学研究所 | Urban traffic flow prediction method fusing GPS data and checkpoint flow data |
| CN112070298A (en) * | 2020-09-04 | 2020-12-11 | 深圳市规划国土发展研究中心 | Target urban railway interconnection and intercommunication operation organization scheme optimization method |
Non-Patent Citations (7)
| Title |
|---|
| A class of bush-based algorithms for the traffic assignment problem;Yu (Marco) Nie;《Transportation Research Part B》;20100131;第44卷(第1期);全文 * |
| New insights and improvements of using paired alternative segments for traffic assignment;Jun Xie, Chi Xie;《Transportation Research Part B》;20160829;第93卷;全文 * |
| Quadratic approximation and convergence of some bush-based algorithms for the traffic assignment problem;Jun Xie;《Transportation Research Part B》;20131031;第56卷;正文第15-29页 * |
| Testing the proportionality condition with taxi trajectory data;Jun Xie;《Transportation Research Part B》;20170413;第104卷;全文 * |
| 博弈论视角下的交通分配系统最优与用户均衡的探讨;王灿;《武汉理工大学学报（交通科学与工程版）》;20140831;第38卷(第4期);全文 * |
| 基于对策理论的交通流分配新方法;崔洪军;《公路交通科技》;20040731;第21卷(第7期);全文 * |
| 基于对策理论的路径生成式交通流分配算法;肖海燕;《湖北第二师范学院学报》;20080228;第25卷(第2期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112652189A (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bovy | On modelling route choice sets in transportation networks: a synthesis | |
| WO2021139701A1 (en) | Application recommendation method and apparatus, storage medium and electronic device | |
| CN112652189B (en) | Traffic distribution method, device and equipment based on policy flow and readable storage medium | |
| CN105988870A (en) | Mobile device with low number of touch times | |
| CN108875090B (en) | Song recommendation method, device and storage medium | |
| CN112000700A (en) | Map information display method and device, electronic equipment and storage medium | |
| CN107490385A (en) | Traffic path planing method and its device | |
| CN108255706A (en) | Edit methods, device, terminal device and the storage medium of automatic test script | |
| JP7051724B2 (en) | How to present useful information to achieve the purpose of the computer system and the target. | |
| CN112328909B (en) | Information recommendation method and device, computer equipment and medium | |
| CN107102833A (en) | Line information interactive approach and electronic equipment | |
| CN108259547A (en) | Information push method, equipment and programmable device | |
| CN113822460A (en) | Traffic flow prediction method and device, electronic equipment and storage medium | |
| EP2980701B1 (en) | Stream processing with context data affinity | |
| CN113326440A (en) | Artificial intelligence based recommendation method and device and electronic equipment | |
| JP6470965B2 (en) | Advertisement selection device, advertisement selection method and program | |
| JP6249841B2 (en) | Content presentation system, method and program | |
| WO2023000261A1 (en) | Regional traffic prediction method and device | |
| CN113643532B (en) | Regional traffic prediction method and device | |
| CN113657812A (en) | Method and system for intelligent decision-making of store operation based on big data and algorithm | |
| CN111667018B (en) | Object clustering method and device, computer readable medium and electronic equipment | |
| CN113158030A (en) | Method and device for recommending different-place interest points, electronic equipment and storage medium | |
| KR102349522B1 (en) | Method and system for long-term relevant document clustering | |
| CN104123307A (en) | Data loading method and system | |
| CN112559603B (en) | Feature extraction method, device, equipment and computer-readable storage medium |
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 |