A regional traffic flow induction method based on real-time traffic data and related equipment

Abstract

The present invention provides a regional traffic flow induction method based on real-time traffic data and related equipment, comprising: respectively obtaining the phase duration between two adjacent intersections of any two adjacent intersections in a target area, taking one of the two adjacent intersections as a starting intersection and the other as a terminal intersection, and determining the starting intersection as an up-going intersection and the terminal intersection as a down-going intersection according to the direction of the traffic flow from the starting intersection to the terminal intersection; calculating the traffic flow saturation between the up-going intersection and the down-going intersection according to the relationship between the phase duration of the up-going intersection and the phase duration of the down-going intersection; taking the product of the distance between the up-going intersection and the down-going intersection and the traffic flow saturation as the path length of the ant colony algorithm; inducing the traffic flow in the target area according to the path length to obtain the induction result of the traffic flow in the target area; improving the efficiency and effectiveness of the path induction, and improving the traffic congestion at the intersection through effective induction.

Description

Technical Field

[0001] The present invention relates to the field of intelligent transportation technology, and in particular to a regional traffic flow induction method based on real-time traffic data and related equipment. Background Art

[0002] With the increasing size and complexity of traffic flow, the contradiction between its capacity and the growing traffic demand has become increasingly acute. The existing intelligent traffic control is difficult to improve the overall efficiency of the urban transportation system. In order to balance the load of large-scale urban traffic and achieve the global optimal traffic performance, theories and methods such as collaborative control and learning mechanism, fuzzy control, and dynamic replanning are adopted to study the phase switching, regional load balancing, global optimization of traffic flow, information collection and processing of vehicle-mounted sensor networks, decomposition of traffic induction tasks and optimal path selection in intelligent transportation systems. A comprehensive and efficient intelligent transportation system with information collection, signal control, and autonomous induction management and traffic mechanisms is established. The organic combination of the induction system that actively guides traffic flow and balances traffic load and the control system that passively guides traffic flow is an effective way to solve urban traffic problems, but how to improve the efficiency of path induction has become an urgent problem to be solved. Summary of the invention

[0003] The present invention provides a regional traffic flow induction method based on real-time traffic data and related equipment, the purpose of which is to improve the efficiency and effectiveness of path induction.

[0004] In order to achieve the above object, the present invention provides a regional traffic flow induction method based on real-time traffic data, comprising:

[0005] Step 1, for any two adjacent intersections among the multiple intersections in the target area, respectively, obtain the phase duration between the two adjacent intersections, and take one of the two adjacent intersections as the starting intersection and the other as the ending intersection, and determine the starting intersection as the up-going intersection and the ending intersection as the down-going intersection according to the direction of the traffic flow from the starting intersection to the ending intersection;

[0006] Step 2, calculating the traffic saturation between the uplink intersection and the downlink intersection according to the relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection;

[0007] Step 3, obtaining the distance between the uplink intersection and the downlink intersection, and taking the product of the distance and the traffic saturation as the path length of the ant colony algorithm;

[0008] Step 4: Induce the traffic flow in the target area according to the path side length to obtain the induction result of the traffic flow in the target area.

[0009] Specifically, the relationship between the phase duration of the upstream intersection and the phase duration of the downstream intersection is one of the following relationships:

[0010] The phase duration of the uplink intersection is greater than the phase duration of the downlink intersection;

[0011] The phase duration of the uplink intersection is equal to the phase duration of the downlink intersection;

[0012] The phase duration of the upstream intersection is shorter than the phase duration of the downstream intersection.

[0013] More specifically, step 2 includes:

[0014] Define the phase duration of the upstream intersection as T b , the phase duration of the downlink intersection is T a ;

[0015] When T a >T b When constructing a set A = {a1, a2, a3, ..., a n}, and every element in the set satisfies:

[0016] a n ·T b >T a

[0017] Take n = min(A) and determine at (n-1)T b Whether the vehicles from the up-bound intersection to the down-bound intersection are empty within a certain time;

[0018] If it is empty, the total traffic time T in the target area is (n-1)T b ;

[0019] For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight, left turn, and right turn;

[0020] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0021]

[0022] If it is not released, the phase duration T of the upstream intersection b The nth cycle of is truncated and hypothesis tested;

[0023] If the test passes, the total traffic time T in the target area is taken as T a ;

[0024] For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight, left turn, and right turn;

[0025] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0026]

[0027] If the test fails, the total traffic time T in the target area is taken as (n-1)T b ;

[0028] For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight, left turn, and right turn;

[0029] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0030]

[0031] Among them, T1, T2, T3, T n Respectively represent the duration of traffic in each direction.

[0032] Furthermore, step 2 also includes:

[0033] When T a =T b When the total traffic time T in the target area is calculated, T = T a =T b ;

[0034] For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight, left turn, and right turn;

[0035] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0036]

[0037] Furthermore, step 2 also includes:

[0038] When T a <T b When the total traffic time T in the target area is T a ;

[0039] For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight, left turn, and right turn;

[0040] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0041]

[0042] Further, step 3 specifically includes:

[0043] Get the distance s between the uplink intersection and the downlink intersection;

[0044] Obtain the traffic saturation δ at any time and in any direction;

[0045] The product of distance s and traffic saturation δ is used as the path length of the ant colony algorithm.

[0046] Furthermore, before step 3, it also includes:

[0047] For any two adjacent intersections among the multiple intersections in the target area, a penalty value is set according to the road section between the two adjacent intersections;

[0048] Increase traffic saturation according to the penalty value.

[0049] The present invention also provides a regional traffic flow induction device based on real-time traffic data, comprising:

[0050] An acquisition module is used to acquire the phase duration between any two adjacent intersections among the multiple intersections in the target area, and to determine that the starting intersection is an up-going intersection and the end-going intersection is a down-going intersection according to the direction of the traffic flow from the starting intersection to the end-going intersection, by taking one of the two adjacent intersections as a starting intersection and the other as an end-going intersection;

[0051] A selection module, used for calculating the traffic saturation between the uplink intersection and the downlink intersection according to the relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection;

[0052] A calculation module is used to obtain the distance between the uplink intersection and the downlink intersection, and use the product of the distance and the traffic saturation as the path length of the ant colony algorithm;

[0053] The induction module is used to induce the traffic flow in the target area according to the path side length to obtain the induction result of the traffic flow in the target area.

[0054] The present invention also provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, a regional traffic flow induction method based on real-time traffic data is implemented.

[0055] The present invention also provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, a regional traffic flow induction method based on real-time traffic data is implemented.

[0056] The above scheme of the present invention has the following beneficial effects:

[0057] The present invention obtains the phase duration between any two adjacent intersections among a plurality of intersections in a target area, and takes one of the two adjacent intersections as a starting intersection and the other as a terminal intersection, and determines the starting intersection as an up-going intersection and the terminal intersection as a down-going intersection according to the direction of the traffic from the starting intersection to the terminal intersection; calculates the traffic saturation between the up-going intersection and the down-going intersection according to the relationship between the phase duration of the up-going intersection and the phase duration of the down-going intersection; obtains the distance between the up-going intersection and the down-going intersection, and uses the product of the distance and the traffic saturation as the path length of an ant colony algorithm; induces the traffic in a target area according to the path length to obtain the induction result of the traffic in the target area; uses the product of the distance between two adjacent intersections and the traffic saturation as the path length of an ant colony algorithm, and the path length is the optimal path of the ant colony algorithm, thereby improving the efficiency and effectiveness of path induction and improving the traffic congestion at the intersection through effective induction.

[0058] Other beneficial effects of the present invention will be described in detail in the subsequent specific implementation section. BRIEF DESCRIPTION OF THE DRAWINGS

[0059] Figure 1 A schematic diagram of a flow chart of an embodiment of the present invention;

[0060] Figure 2 A schematic diagram of a road network according to an embodiment of the present invention;

[0061] Figure 3 It is a directed graph of a road network according to an embodiment of the present invention. DETAILED DESCRIPTION

[0062] In order to make the technical problems, technical solutions and advantages to be solved by the present invention clearer, the following will be described in detail with reference to the accompanying drawings and specific embodiments. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0063] In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.

[0064] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installation", "connection" and "connection" should be understood in a broad sense, for example, it can be a locking connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0065] In addition, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0066] In view of the existing problems, the present invention provides a regional vehicle flow induction method based on real-time traffic data and related equipment.

[0067] like Figure 1 As shown, an embodiment of the present invention provides a regional traffic flow induction method based on real-time traffic data, comprising:

[0068] Step 1, for any two adjacent intersections among the multiple intersections in the target area, respectively, obtain the phase duration between the two adjacent intersections, and take one of the two adjacent intersections as the starting intersection and the other as the ending intersection, and determine the starting intersection as the up-going intersection and the ending intersection as the down-going intersection according to the direction of the traffic flow from the starting intersection to the ending intersection;

[0069] Step 2, calculating the traffic saturation between the uplink intersection and the downlink intersection according to the relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection;

[0070] Step 3, obtaining the distance between the uplink intersection and the downlink intersection, and taking the product of the distance and the traffic saturation as the path length of the ant colony algorithm;

[0071] Step 4: Induce the traffic flow in the target area according to the path side length to obtain the induction result of the traffic flow in the target area.

[0072] Specifically, the relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection is one of the following relationships:

[0073] The phase duration of the uplink intersection is greater than the phase duration of the downlink intersection;

[0074] The phase duration of the uplink intersection is equal to the phase duration of the downlink intersection;

[0075] The phase duration of the upstream intersection is shorter than the phase duration of the downstream intersection.

[0076] Specifically, step 2 includes:

[0077] Define the phase duration of the upstream intersection as T b , the phase duration of the downlink intersection is T a ;

[0078] When T a >T b When constructing a set A = {a1, a2, a3, ..., a n}, and every element in the set satisfies:

[0079] a n ·T b >T a

[0080] Take n = min(A) and determine at (n-1)T b Whether the vehicles from the up-bound intersection to the down-bound intersection are empty within a certain time;

[0081] If it is empty, the total traffic time T in the target area is (n-1)T b ;

[0082] For each direction in the uplink intersection, the duration of traffic flow in each direction within T time is obtained through the monitoring equipment at the intersection; the directions in the uplink intersection include straight, left turn, and right turn;

[0083] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0084]

[0085] The traffic saturation δ is transferred to the data center, and the nth T b The traffic within the duration will be included in the calculation of the next cycle.

[0086] If it is not released, the phase duration T of the upstream intersection b The nth cycle of is truncated and hypothesis tested;

[0087] First, we make the assumption that with a 95% confidence interval, b to T a The number of vehicles passing through the traffic flow in the time period accounts for 90% or more of the total number of vehicles passing through the nth time period, and the traffic flow approximately follows a negative exponential distribution, and its probability density function is:

[0088]

[0089] Time point t α In the interval [0, T b ] obeys uniform distribution within a certain period of time, and its calculation method is:

[0090] tα =T b -(nT b -T a )

[0091] Among them, x is the traffic volume, λ uses the maximum likelihood estimation method, and the samples are obtained from the previous (n-1) cycles. The likelihood function of the samples is:

[0092]

[0093] The maximum likelihood estimator of λ is obtained as Then obtain its distribution function F(x,λ) and calculate the critical value z of the acceptance domain α (One-sided test), if time point t α Greater than the critical value z of the acceptance domain α The test passes.

[0094] If the test passes, the total traffic time T in the target area is taken as T a ;

[0095] For each direction of the uplink intersection, obtain the duration T1, T2, T3, ..., T1 obtained by the monitoring device of the intersection where the traffic flow exists within the time T n ; Directions in the up-bound intersection include straight ahead, left turn, and right turn;

[0096] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0097]

[0098] And transmit the traffic saturation δ to the data center;

[0099] If the test fails, it is considered as (n-1)T b to T a The data in is invalid. In this case, the total traffic time T in the target area is taken as (n-1)T b ;

[0100] For each direction of the uplink intersection, obtain the duration T1, T2, T3, ..., T1 obtained by the monitoring device of the intersection where the traffic flow exists within the time T n ; Directions in the up-bound intersection include straight ahead, left turn, and right turn;

[0101] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0102]

[0103] And transmit the traffic saturation δ to the data center; among them, T1, T2, T3, Tn Respectively represent the duration of traffic in each direction.

[0104] Specifically, step 2 also includes:

[0105] When T a =T b When the total traffic time T in the target area is calculated, T = T a =T b ;

[0106] For each direction of the uplink intersection, obtain the duration T1, T2, T3, ..., T1 obtained by the monitoring device of the intersection where the traffic flow exists within the time T n ; Directions in the up-bound intersection include straight ahead, left turn, and right turn;

[0107] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0108]

[0109] And transmit the traffic saturation δ to the data center.

[0110] Specifically, step 2 also includes:

[0111] When T a <T b When the total traffic time T in the target area is T a ;

[0112] For each direction of the uplink intersection, obtain the duration T1, T2, T3, ..., T1 obtained by the monitoring device of the intersection where the traffic flow exists within the time T n ; Directions in the up-bound intersection include straight ahead, left turn, and right turn;

[0113] According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

[0114]

[0115] And transmit the traffic saturation δ to the data center.

[0116] Specifically, step 3 includes:

[0117] Get the distance s between the uplink intersection and the downlink intersection;

[0118] Obtain the traffic saturation δ at any time and in any direction;

[0119] The product of distance s and traffic saturation δ is used as the path length of the ant colony algorithm.

[0120] It should be noted that the ant colony optimization (ACO), also known as the ant algorithm, is a probabilistic algorithm used to find the optimal path in a graph. Each ant starts looking for food without being told where the food is in advance. When one ant finds food, it releases a volatile secretion, pheromone (called pheromone, which will gradually evaporate and disappear over time, and the concentration of pheromone represents the distance of the path) into the environment to attract other ants, so that more and more ants will find food. Some ants do not always repeat the same path like other ants. They will find another way. If the new path is shorter than the original other paths, then gradually, more ants will be attracted to this shorter path. Finally, after a period of operation, a shortest path will appear, which is a conventional technical means in this field, so the specific minimum path selection process will not be described one by one.

[0121] Specifically, before step 3, it also includes:

[0122] For any two adjacent intersections among the multiple intersections in the target area, a penalty value is set according to the road section between the two adjacent intersections;

[0123] Increase traffic saturation according to the penalty value.

[0124] The embodiment of the present invention guides the vehicles in the target area in real time according to the path length. In practical applications, the penalty value can be designed according to the actual situation. For example, if a certain road section needs less traffic during maintenance, the pheromones left by the ants passing through the road section can be reduced, thereby reducing the number of vehicles passing through the road section. It is also possible to change the proportion of various influences according to the topsis method, thereby achieving an adjustable traffic induction effect. The saturation increment between two adjacent intersections is determined according to different road section conditions, and the specific method is shown in the following table:

[0125] Table 1

[0126] Road conditions major accident Slippery road Narrow roads Peak congestion Saturation increment (percent) 1 0.2 0.1 0.4

[0127] It should be noted that the TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution) method was first proposed by CL Hwang and K. Yoon in 1981. The TOPSIS method is a method of ranking according to the degree of proximity between a finite number of evaluation objects and the idealized goal, and is a relative evaluation of the advantages and disadvantages among existing objects. The TOPSIS method is a ranking method that is close to the ideal solution. This method only requires that each utility function has a monotonically increasing (or decreasing) property. The TOPSIS method is a commonly used and effective method in multi-objective decision analysis, also known as the superiority and inferiority solution distance method. It is a conventional technical means in this field, so its specific superiority and inferiority evaluation process will not be described one by one.

[0128] The embodiments of the present invention are described as follows with reference to specific examples:

[0129] like Figure 2 The schematic diagram of the constructed road network is shown in FIG. 1 . The large numbers represent the numbers of each intersection, and the small numbers reflect the actual distance between two adjacent intersections. This embodiment uses such a representation method and does not affect the final induction result. The target vehicle flow arrives at intersection 10 from intersection 1. The target vehicle flow is induced on the basis of achieving this goal. Therefore, the upstream and downstream relationship of each intersection and the corresponding phase duration of the intersection are obtained according to the direction described above. The phase duration of the upstream intersection is T b , the phase duration of the downlink intersection is T a .

[0130] The following section 5-6 is selected for specific calculation. The calculation method for the remaining sections can be calculated in the same way as the above strategy:

[0131] First, obtain the phase duration of the two intersections. According to the upstream and downstream relationship, intersection 5 should be the upstream intersection and intersection 6 should be the downstream intersection. Therefore, the phase duration of intersection 6 is recorded as T a , let the phase duration of intersection 5 be T b , get the phase duration of two intersections at a certain moment, T b 50s, T a is 40s, obviously T a <T b , then the total traffic time T in the target area is T = T a =40s, the monitoring facilities at the intersection obtain that the duration of traffic flow T1 is 30s, and the saturation δ of the road section is 0.75. The same is true for other intersections, so the following table 2 is calculated:

[0132] Table 2

[0133] starting point 1 1 2 2 3 4 4 end 2 4 3 5 7 5 8 Traffic saturation 0.9 0.3 0.5 0.2 0.4 0.7 0.1 starting point 5 6 6 7 8 9 end 6 7 9 10 9 10 Traffic saturation 0.5 0.3 0.9 0.5 0.2 0.4

[0134] The corresponding directed graph is Figure 3 As shown, the distance parameters after operation are shown in Table 3:

[0135] Table 3

[0136] starting point 1 1 2 2 3 4 4 end 2 4 3 5 7 5 8 distance 2.7 1.5 4.0 1.0 2.4 1.75 0.5 starting point 5 6 6 7 8 9 end 6 7 9 10 9 10 distance 0.5 2.1 3.6 1.5 0.8 2.0

[0137] The following is a comparison of the driving path selection before and after using the present invention to reflect the induction effect:

[0138] Before using this method, the vehicle sets the driving path with the shortest distance as the induction target, and the induction results are 1——>4——>5——>6——>9——>10.

[0139] After adopting the present invention, the vehicle sets the driving path with the minimum traffic saturation as the induction target, and the induction result is 1——>4——>8——>9——>10.

[0140] In summary, the embodiments of the present invention respectively obtain the phase duration between any two adjacent intersections among multiple intersections in the target area, and take one of the two adjacent intersections as the starting intersection and the other as the ending intersection, and determine the starting intersection as the up-going intersection and the ending intersection as the down-going intersection according to the direction of the traffic from the starting intersection to the ending intersection; calculate the traffic saturation between the up-going intersection and the down-going intersection according to the relationship between the phase duration of the up-going intersection and the phase duration of the down-going intersection; obtain the distance between the up-going intersection and the down-going intersection, and use the product of the distance and the traffic saturation as the path length of the ant colony algorithm; induce the traffic in the target area according to the path length to obtain the induction result of the traffic in the target area; use the product of the distance between the two adjacent intersections and the traffic saturation as the path length of the ant colony algorithm, and the path length is the optimal path of the ant colony algorithm, which improves the efficiency and effectiveness of path induction and improves the traffic congestion at the intersection through effective induction.

[0141] The embodiment of the present invention further provides a regional traffic flow induction device based on real-time traffic data, comprising:

[0142] An acquisition module is used to acquire the phase duration between any two adjacent intersections among the multiple intersections in the target area, and to determine that the starting intersection is an up-going intersection and the end-going intersection is a down-going intersection according to the direction of the traffic flow from the starting intersection to the end-going intersection, by taking one of the two adjacent intersections as a starting intersection and the other as an end-going intersection;

[0143] A selection module, used for calculating the traffic saturation between the uplink intersection and the downlink intersection according to the relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection;

[0144] A calculation module is used to obtain the distance between the uplink intersection and the downlink intersection, and use the product of the distance and the traffic saturation as the path length of the ant colony algorithm;

[0145] The induction module is used to induce the traffic flow in the target area according to the path side length to obtain the induction result of the traffic flow in the target area.

[0146] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiments of the embodiments of the present invention. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.

[0147] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated into a processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the embodiments of the present invention. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.

[0148] An embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, a regional traffic flow induction method based on real-time traffic data is implemented.

[0149] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the embodiment of the present invention implements all or part of the process in the above-mentioned embodiment method, which can be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium can at least include: any entity or device that can carry the computer program code to the construction device / terminal device, recording medium, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, RandomAccess Memory), electric carrier signal, telecommunication signal and software distribution medium. For example, U disk, mobile hard disk, disk or optical disk. In some jurisdictions, according to legislation and patent practice, computer-readable media cannot be electric carrier signals and telecommunication signals.

[0150] An embodiment of the present invention also provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, a regional traffic flow induction method based on real-time traffic data is implemented.

[0151] It should be noted that the terminal device may be a mobile phone, tablet computer, notebook computer, ultra-mobile personal computer (UMPC), netbook, personal digital assistant (PDA), etc. For example, the terminal device may be a station (ST, STAION) in a WLAN, a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA) device, a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a computer, a laptop computer, a handheld communication device, a handheld computing device, a satellite wireless device, etc. The embodiments of the present invention do not impose any restrictions on the specific types of terminal devices.

[0152] The processor may be a central processing unit (CPU), or other general-purpose processors, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0153] In some embodiments, the memory may be an internal storage unit of the terminal device, such as a hard disk or memory of the terminal device. In other embodiments, the memory may also be an external storage device of the terminal device, such as a plug-in hard disk, a smart memory card (SMC, Smart Media Card), a secure digital (SD, Secure Digital) card, a flash card (Flash Card), etc. equipped on the terminal device. Further, the memory may also include both an internal storage unit of the terminal device and an external storage device. The memory is used to store an operating system, an application program, a boot loader (BootLoader), data and other programs, such as the program code of the computer program, etc. The memory may also be used to temporarily store data that has been output or is to be output.

[0154] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiments of the embodiments of the present invention. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.

[0155] The above is a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A regional traffic flow induction method based on real-time traffic data, characterized in that: include: Step 1, for any two adjacent intersections among the multiple intersections in the target area, respectively, obtain the phase duration between the two adjacent intersections, and take one of the two adjacent intersections as the starting intersection and the other as the ending intersection, and determine the starting intersection as an up-going intersection and the ending intersection as a down-going intersection according to the direction of the traffic flow from the starting intersection to the ending intersection; Step 2, calculating the traffic saturation between the uplink intersection and the downlink intersection according to the relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection; The step 2 comprises: Define the phase duration of the uplink intersection as T b , the phase duration of the downlink intersection is T a ; When T a >T b When constructing a set A={a1,a2,a3,…,a n }, and each element in the set satisfies: a n ·T b >T a Take n = min(A) and determine at (n-1)T b Whether the vehicles from the up-bound intersection to the down-bound intersection are empty within a period of time; If it is empty, the total traffic time T of the target area is (n-1)T b ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as: If it is not released, the phase duration T of the uplink intersection is b The nth cycle of is truncated and hypothesis tested; If the test passes, the total traffic time T in the target area is taken as T a ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as: If the test fails, the total traffic time T of the target area is taken as (n-1)T b ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as: Among them, T1, T2, T3, T n Respectively represent the duration of traffic in each direction; Step 3, obtaining the distance between the uplink intersection and the downlink intersection, and taking the product of the distance and the traffic saturation as the path length of the ant colony algorithm; Step 4: Inducing the traffic flow in the target area according to the path side length to obtain the induction result of the traffic flow in the target area.

2. The regional traffic flow induction method based on real-time traffic data according to claim 1 is characterized in that: The relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection is one of the following relationships: The phase duration of the uplink intersection is greater than the phase duration of the downlink intersection; The phase duration of the uplink intersection is equal to the phase duration of the downlink intersection; The phase duration of the uplink intersection is shorter than the phase duration of the downlink intersection.

3. The regional traffic flow induction method based on real-time traffic data according to claim 2 is characterized in that: The step 2 also includes: When T a =T b When T is equal to T, the total duration of traffic flow in the target area is calculated as T = T a =T b ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

4. The regional traffic flow induction method based on real-time traffic data according to claim 2 is characterized in that: The step 2 also includes: When T a <T b When the total traffic time T in the target area is calculated as T a ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as:

5. The regional traffic flow induction method based on real-time traffic data according to claim 4 is characterized in that: The step 3 specifically includes: Obtaining a distance s between the uplink intersection and the downlink intersection; Obtain the traffic saturation δ at any time and in any direction; The product of the distance s and the traffic saturation δ is used as the path length of the ant colony algorithm.

6. The regional traffic flow induction method based on real-time traffic data according to claim 5 is characterized in that: Before step 3, the method further includes: For any two adjacent intersections among the multiple intersections in the target area, a penalty value is set according to the road section between the two adjacent intersections; The traffic saturation is increased according to the penalty value.

7. A regional traffic flow induction device based on real-time traffic data, characterized in that: include: An acquisition module is used to acquire the phase duration between any two adjacent intersections among the multiple intersections in the target area, and to take one of the two adjacent intersections as a starting intersection and the other as a terminal intersection, and to determine that the starting intersection is an up-going intersection and the terminal intersection is a down-going intersection according to the direction of the traffic flow from the starting intersection to the terminal intersection; A selection module, used to calculate the traffic saturation between the uplink intersection and the downlink intersection according to the relationship between the phase duration of the uplink intersection and the phase duration of the downlink intersection, including: Define the phase duration of the uplink intersection as T b , the phase duration of the downlink intersection is T a ; When T a >T b When constructing a set A={a1,a2,a3,…,a n }, and each element in the set satisfies: a n ·T b >T a Take n = min(A) and determine at (n-1)T b Whether the vehicles from the up-bound intersection to the down-bound intersection are empty within a period of time; If it is empty, the total traffic time T of the target area is (n-1)T b ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as: If it is not released, the phase duration T of the uplink intersection is b The nth cycle of is truncated and hypothesis tested; If the test passes, the total traffic time T in the target area is taken as T a ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as: If the test fails, the total traffic time T of the target area is taken as (n-1)T b ; For each direction in the uplink intersection, obtain the duration of traffic flow in each direction within T time; the directions in the uplink intersection include straight ahead, left turn, and right turn; According to the duration of traffic flow in each direction, the traffic flow saturation δ in each direction is calculated as: Among them, T1, T2, T3, T n Respectively represent the duration of traffic in each direction; A calculation module, used for obtaining the distance between the uplink intersection and the downlink intersection, and taking the product of the distance and the traffic saturation as the path length of the ant colony algorithm; The induction module is used to induce the traffic flow in the target area according to the path side length to obtain the induction result of the traffic flow in the target area.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the regional traffic flow induction method based on real-time traffic data as described in any one of claims 1 to 6 is implemented.

9. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the regional traffic flow induction method based on real-time traffic data as described in any one of claims 1 to 6 is implemented.

Images