Trunk line green wave optimization method, device and equipment and storage medium
By searching separately for the two directions of the main road and optimizing the phase adjustment of each intersection based on the bidirectional green wave score, the problem of traffic congestion caused by the asymmetrical green light start time in the existing technology has been solved, and smooth traffic flow on the main road has been achieved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-03
- Publication Date
- 2026-03-10
AI Technical Summary
Existing technologies cannot achieve optimal green wave control in both directions of the main road simultaneously when implementing bidirectional green waves, especially in scenarios where the green light on-time is asymmetrical, leading to traffic congestion.
By searching separately for the two directions of the trunk line, optimizing the two-way green wave based on the two-way green wave score, and optimizing the phase adjustment of each intersection, the green wave width and phase difference are calculated to achieve optimal two-way green wave control.
It ensures smooth traffic flow on main roads in any scenario, especially when the green light timing is asymmetrical. By optimizing the green wave width and phase difference, it improves the smoothness of traffic flow.
Smart Images
Figure CN121640698A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of intelligent transportation technology, and in particular to a method, apparatus, device and storage medium for optimizing green wave traffic on main lines. Background Technology
[0002] In urban traffic networks, the distances between intersections are often short. In such cases, traffic flowing from upstream to downstream intersections retains the characteristics it had when leaving the upstream intersection. Therefore, when implementing signal control at downstream intersections, it is necessary to consider the dynamic information of upstream signal control. In other words, in a major traffic artery, signal control at each intersection is not isolated but rather the mutual influence between the signal control systems at each intersection is fully considered.
[0003] In traffic engineering, the design of a two-way green wave is intended to enable smooth traffic flow in two opposite directions simultaneously, reducing stopping and waiting times. The process of solving a two-way green wave involves calculating the green light start times at a series of intersections so that vehicles can pass through all intersections at a certain speed in both directions without being blocked by red lights.
[0004] In implementing bidirectional green wave technology, existing methods typically first optimize one direction of the trunk line to maximize the green wave bandwidth in that direction, and then optimize the other direction within a relative range using the obtained phase difference as the center. However, this approach often fails to achieve optimal bidirectional green wave performance when the traffic light activation times differ between the two directions. Summary of the Invention
[0005] In view of this, embodiments of this application provide a trunk line green wave optimization method, apparatus, device and storage medium, which searches separately in the two directions of the trunk line and optimizes the two-way green wave based on the bidirectional green wave score. It is suitable for trunk line green wave optimization in any scenario, especially in scenarios where the green light on-time is asymmetrical in the two directions of the trunk line.
[0006] In a first aspect, embodiments of this application provide a trunk line green wave optimization method, comprising: obtaining the initial absolute phase of each intersection in each direction of the trunk line based on the signal control scheme of each intersection and the initial phase difference of each pair of adjacent intersections; obtaining a set of phase adjustment combinations based on several selectable phase adjustment amounts for each intersection, wherein each phase adjustment combination includes a selected selectable phase adjustment amount for each intersection; adjusting the initial absolute phase based on each phase adjustment combination to obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line; obtaining the optimal bidirectional green wave score of the trunk line based on each green wave width, and thereby obtaining the phase difference between adjacent intersections after trunk line green wave optimization.
[0007] Based on the above, the two directions of the trunk line are searched separately, and the two-way green wave score is optimized according to the two-way green wave score. This method is suitable for trunk line green wave optimization in any scenario, especially in scenarios where the green light on-time is asymmetrical in the two directions of the trunk line.
[0008] In one possible implementation of the first aspect, obtaining the optimal bidirectional green wave score of the trunk line based on each of the green wave widths includes: obtaining the green wave score corresponding to each phase adjustment combination in each direction of the trunk line based on each of the green wave widths, and thereby obtaining the bidirectional green wave score corresponding to the phase adjustment combination, wherein the green wave score in each direction changes positively with the green wave width in that direction, the trunk line flow rate, and the trunk line length, and the bidirectional green wave score is equal to the product of the average and minimum values of the green wave scores in the two directions of the trunk line corresponding to the phase adjustment combination; and taking the maximum value among the bidirectional green wave scores as the optimal bidirectional green wave score of the trunk line.
[0009] As described above, by making the bidirectional green wave score equal to the product of the average and minimum green wave scores of the two directions of the trunk line, the problem of large green wave scores consuming small green wave scores is prevented. The weight of the direction with poor traffic is increased, and the smooth flow of traffic on the trunk line is truly achieved.
[0010] In one possible implementation of the first aspect, obtaining the phase difference of adjacent intersections after trunk line green wave optimization based on the optimal bidirectional green wave score includes: obtaining the phase adjustment combination corresponding to the optimal bidirectional green wave score, and thereby obtaining the phase difference adjustment amount of each adjacent intersection of the trunk line, wherein the phase difference adjustment amount of each adjacent intersection of the trunk line is equal to the difference between the selectable phase adjustment amounts of the second intersection and the first intersection in the corresponding phase adjustment combination in any direction; the phase difference of each pair of adjacent intersections after trunk line green wave optimization is equal to the sum of the initial phase difference of the adjacent intersection and the phase difference adjustment amount of the adjacent intersection divided by the positive remainder of the trunk line signal control cycle.
[0011] Based on the above, the phase difference of each adjacent intersection on the trunk line after green wave optimization is obtained by the phase adjustment combination corresponding to the optimal bidirectional green wave score of the trunk line. The time start of the signal control cycle of each intersection is obtained according to the phase difference, so as to achieve smooth bidirectional traffic on the trunk line.
[0012] In one possible implementation of the first aspect, obtaining the initial absolute phase of each intersection in each direction of the trunk line based on the signal control scheme of each intersection and the initial phase difference of each pair of adjacent intersections includes: obtaining the green light start time of the intersection in each direction of the trunk line based on the signal control scheme of each intersection; in each direction of the trunk line, with the initial absolute phase of the first intersection in that direction as 0, the initial absolute phase of any other intersection is equal to the initial absolute phase of the previous intersection of that intersection plus the initial phase difference of the adjacent intersection plus the green light start time of that intersection in that direction.
[0013] Based on the initial phase difference of the intersection and the initial absolute phase obtained from the intersection's signal control scheme, the initial phase values suitable for various trunk line green wave optimization scenarios are obtained.
[0014] In one possible implementation of the first aspect, adjusting the initial absolute phase according to each phase adjustment combination to obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line includes: in each direction of the trunk line, the absolute phase of the first intersection is its initial absolute phase, and the absolute phase corresponding to each phase adjustment combination of any other intersection is equal to the initial absolute phase of the intersection plus the selectable phase adjustment amount selected by the intersection in the phase adjustment combination; obtaining the green wave width corresponding to each phase adjustment combination in each direction of the trunk line based on the absolute phase of each intersection corresponding to each phase adjustment combination in each direction of the trunk line.
[0015] Based on the above, for each phase adjustment combination, the green wave width is calculated independently in both directions of the trunk line, which is suitable for green wave optimization in various scenarios.
[0016] In one possible implementation of the first aspect, the method further includes: obtaining the trunk line signal control cycle based on the maximum value among the signal control cycles of each intersection on the trunk line, and adjusting the green light time at each intersection accordingly.
[0017] Therefore, trunk line green wave optimization is performed within a unified signal control cycle to achieve the maximum green wave effect.
[0018] In one possible implementation of the first aspect, it further includes: obtaining an optional phase adjustment amount for each intersection based on the trunk signal control cycle, wherein the maximum value is less than half of the trunk signal control cycle and the minimum value is a negative value greater than half of the trunk signal control cycle.
[0019] As shown above, the range of selectable phase adjustment amounts for each intersection set by the above method includes the range of absolute phase adjustment amounts for each intersection, which is suitable for green wave optimization in various scenarios.
[0020] Secondly, embodiments of this application provide a traffic network optimization device, comprising: an initial acquisition module, configured to obtain the initial absolute phase of each intersection in each direction of the trunk line based on the signal control scheme of each intersection and the initial phase difference of each pair of adjacent intersections; an adjustment acquisition module, configured to obtain a set of phase adjustment combinations based on several selectable phase adjustment amounts for each intersection, wherein each phase adjustment combination includes a selected selectable phase adjustment amount for each intersection; a green wave acquisition module, configured to adjust the initial absolute phase based on each phase adjustment combination to obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line; and a green wave optimization module, configured to obtain the optimal bidirectional green wave score of the trunk line based on each green wave width, and thereby obtain the phase difference of adjacent intersections after green wave optimization of the trunk line.
[0021] Based on the above, the two directions of the trunk line are searched separately, and the two-way green wave score is optimized according to the two-way green wave score. This method is suitable for trunk line green wave optimization in any scenario, especially in scenarios where the green light on-time is asymmetrical in the two directions of the trunk line.
[0022] In one possible implementation of the second aspect, the green wave optimization module, when obtaining the optimal bidirectional green wave score of the trunk line based on each of the green wave widths, specifically includes: obtaining the green wave score corresponding to each phase adjustment combination in each direction of the trunk line based on each of the green wave widths, and thereby obtaining the bidirectional green wave score corresponding to the phase adjustment combination, wherein the green wave score in each direction changes positively with the green wave width in that direction, the trunk line flow rate, and the trunk line length, and the bidirectional green wave score is equal to the product of the average and minimum values of the green wave scores in the two directions of the trunk line corresponding to the phase adjustment combination; and taking the maximum value among the bidirectional green wave scores as the optimal bidirectional green wave score of the trunk line.
[0023] As described above, by making the bidirectional green wave score equal to the product of the average and minimum green wave scores of the two directions of the trunk line, the problem of large green wave scores consuming small green wave scores is prevented. The weight of the direction with poor traffic is increased, and the smooth flow of traffic on the trunk line is truly achieved.
[0024] In one possible implementation of the second aspect, the green wave optimization module, when obtaining the phase difference of adjacent intersections after trunk line green wave optimization based on the optimal bidirectional green wave score, specifically includes: obtaining the phase adjustment combination corresponding to the optimal bidirectional green wave score, and thereby obtaining the phase difference adjustment amount of each adjacent intersection of the trunk line, wherein the phase difference adjustment amount of each adjacent intersection of the trunk line is equal to the difference between the selectable phase adjustment amounts of the second intersection and the first intersection in the corresponding phase adjustment combination in any direction; the phase difference of each pair of adjacent intersections after trunk line green wave optimization is equal to the sum of the initial phase difference of the adjacent intersections and the phase difference adjustment amount of the adjacent intersections divided by the positive remainder of the trunk line signal control cycle.
[0025] Based on the above, the phase difference of each adjacent intersection on the trunk line after green wave optimization is obtained by the phase adjustment combination corresponding to the optimal bidirectional green wave score of the trunk line. The time start of the signal control cycle of each intersection is obtained according to the phase difference, so as to achieve smooth bidirectional traffic on the trunk line.
[0026] In one possible implementation of the second aspect, the initial acquisition module is specifically used to include: obtaining the green light start time of the intersection in each direction of the trunk line according to the signal control scheme of each intersection; in each direction of the trunk line, with the initial absolute phase of the first intersection in that direction as 0, the initial absolute phase of any other intersection is equal to the initial absolute phase of the previous intersection of that intersection plus the initial phase difference of the adjacent intersection plus the green light start time of that intersection in that direction.
[0027] Based on the initial phase difference of the intersection and the initial absolute phase obtained from the intersection's signal control scheme, the initial phase values suitable for various trunk line green wave optimization scenarios are obtained.
[0028] In one possible implementation of the second aspect, the green wave acquisition module is specifically used to include: in each direction of the trunk line, the absolute phase of the first intersection is its initial absolute phase, and the absolute phase corresponding to each phase adjustment combination of any other intersection is equal to the initial absolute phase of the intersection plus the selectable phase adjustment amount selected by the intersection in the phase adjustment combination; and obtaining the green wave width corresponding to each phase adjustment combination in each direction of the trunk line based on the absolute phase of each intersection corresponding to each phase adjustment combination in each direction of the trunk line.
[0029] Based on the above, for each phase adjustment combination, the green wave width is calculated independently in both directions of the trunk line, which is suitable for green wave optimization in various scenarios.
[0030] In one possible implementation of the second aspect, it further includes: a cycle unification module, used to obtain the trunk line signal control cycle based on the maximum value among the signal control cycles of each intersection on the trunk line, and adjust the green light time at each intersection accordingly.
[0031] Therefore, trunk line green wave optimization is performed within a unified signal control cycle to achieve the maximum green wave effect.
[0032] In one possible implementation of the second aspect, the adjustment obtaining module is specifically used to obtain an optional phase adjustment amount for each intersection based on the trunk signal control cycle, wherein the maximum value is less than half of the trunk signal control cycle and the minimum value is a negative value greater than half of the trunk signal control cycle.
[0033] As shown above, the range of selectable phase adjustment amounts for each intersection set by the above method includes the range of absolute phase adjustment amounts for each intersection, which is suitable for green wave optimization in various scenarios.
[0034] Thirdly, embodiments of this application provide a computing device, including,
[0035] bus;
[0036] A communication interface, which is connected to the bus;
[0037] At least one processor connected to the bus; and
[0038] At least one memory is connected to the bus and stores program instructions that, when executed by the at least one processor, cause the at least one processor to perform any of the embodiments described in the first aspect of this application.
[0039] Fourthly, embodiments of this application provide a computer-readable storage medium having program instructions stored thereon, which, when executed by a computer, cause the computer to perform any of the embodiments described in the first aspect. Attached Figure Description
[0040] Figure 1 This is a flowchart illustrating an embodiment of a trunk line green wave optimization method according to this application;
[0041] Figure 2 This is a flowchart illustrating a second embodiment of a trunk line green wave optimization method according to this application;
[0042] Figure 3 This is a schematic diagram of the structure of a trunk line green wave optimization device according to one embodiment of this application;
[0043] Figure 4 This is a schematic diagram of a second embodiment of a trunk line green wave optimization device according to this application;
[0044] Figure 5 This is a schematic diagram of a computing device according to various embodiments of this application. Detailed Implementation
[0045] In the following description, references are made to “some embodiments,” which describe a subset of all possible embodiments. However, it is understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.
[0046] In the following description, the terms “first, second, third, etc.” or module A, module B, module C, etc. are used only to distinguish similar objects or different embodiments, and do not represent a specific ordering of objects. It is understood that a specific order or sequence may be interchanged where permitted so that the embodiments of this application described herein can be implemented in an order other than that illustrated or described herein.
[0047] In the following description, the labels of the steps, such as S110, S120, etc., do not necessarily mean that the steps will be executed in this way. The order of the steps can be interchanged or executed simultaneously if permitted.
[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to limit this application.
[0049] This application provides a trunk line green wave optimization method, apparatus, device, and storage medium. Based on the signal control scheme of each intersection on the trunk line and the initial phase difference of each pair of adjacent intersections, the initial absolute phase of each intersection in each direction of the trunk line is obtained. Based on several selectable phase adjustment amounts for each intersection, a set of phase adjustment combinations is obtained, where each phase adjustment combination includes a selected selectable phase adjustment amount for each intersection. Based on each phase adjustment combination, the initial absolute phase is adjusted to obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line. Based on each green wave width, the optimal bidirectional green wave score of the trunk line is obtained, and the phase difference between adjacent intersections after trunk line green wave optimization is obtained accordingly.
[0050] The technical solution of this application embodiment searches separately for the two directions of the trunk line and optimizes the two-way green wave based on the bidirectional green wave score. It is suitable for trunk line green wave optimization in any scenario, especially in scenarios where the green light on-time is asymmetrical in the two directions of the trunk line.
[0051] The embodiments of this application are described below with reference to the accompanying drawings.
[0052] First, combine Figure 1 This paper introduces an embodiment of a trunk line green wave optimization method.
[0053] Figure 1 The flowchart of a trunk line green wave optimization method embodiment one is shown, including steps S110 to S140.
[0054] S110: Based on the signal control schemes of each intersection on the trunk line and the initial phase difference of each pair of adjacent intersections, obtain the initial absolute phase of each intersection in each direction on the trunk line.
[0055] The initial phase difference between two adjacent intersections is equal to the distance between the two intersections divided by the vehicle speed.
[0056] In some embodiments, the green light activation time for each intersection on the main road in each direction is obtained according to the signal control scheme of each intersection. In each direction of the main road, with the initial absolute phase of the first intersection in that direction set to 0, the initial absolute phase of any other intersection is equal to the initial absolute phase of the previous intersection plus the initial phase difference of the adjacent intersection plus the green light activation time for that direction. The initial absolute phase obtained above is used as the initial value for green wave optimization, suitable for various scenarios.
[0057] In some embodiments, prior to this step, the trunk line signal control period is obtained based on the maximum value among the signal control periods of each intersection, and the green light time at each intersection is adjusted accordingly, thereby optimizing the trunk line green wave within a unified signal control period to achieve the maximum green wave effect.
[0058] In some embodiments, before performing trunk line green wave optimization, the signal control scheme of each intersection is also optimized based on the traffic flow in each direction at each intersection of the trunk line, and the intersection optimization is performed in real time.
[0059] In some embodiments, the trunk line length is a predetermined length, not exceeding the green wave optimized length, so that traffic flow characteristics at intersections along the trunk line can be transmitted. For example, each trunk line is approximately 500 meters to 1 kilometer long, with a smooth flow passage time of approximately 45 to 90 seconds, slightly less than the trunk line signal control cycle length. The trunk line signal control cycle length is the unified control cycle of the traffic lights at all intersections along the trunk line.
[0060] S120: Obtain a set of phase adjustment combinations based on several selectable phase adjustment amounts for each intersection.
[0061] Each phase adjustment combination includes a selected optional phase adjustment amount for each intersection on the trunk line. During trunk line green wave optimization, the selected optional phase adjustment amounts in each phase adjustment combination are used together to form an adjustment scheme.
[0062] In some embodiments, the selectable phase adjustment amount for each intersection is obtained based on the trunk signal control cycle, with a maximum value less than half of the trunk signal control cycle and a minimum value greater than a negative half of the trunk signal control cycle, and this range includes the range of selectable phase adjustment amounts for each intersection.
[0063] S130: Adjust the initial absolute phase of each intersection according to each phase adjustment combination to obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line.
[0064] In some embodiments, in each direction of the trunk line, the absolute phase of the first intersection is its initial absolute phase. The absolute phase corresponding to each phase adjustment combination of any other intersection is equal to the initial absolute phase of that intersection plus the selectable phase adjustment amount selected for that intersection in that phase adjustment combination. Based on the absolute phases of each intersection corresponding to each phase adjustment combination in each direction of the trunk line, combined with the distance to adjacent intersections and vehicle speed, the green wave width corresponding to each phase adjustment combination in each direction of the trunk line is obtained. Therefore, for each phase adjustment combination, the green wave width is calculated independently for both directions of the trunk line, suitable for green wave optimization in various scenarios.
[0065] In some embodiments, the optimization period for trunk line green wave optimization includes several trunk line signal control cycles, with time-division precise optimization.
[0066] S140: Based on the green wave width corresponding to each phase adjustment combination in each direction of the trunk line, obtain the optimal bidirectional green wave score of the trunk line, and obtain the phase difference of adjacent intersections after green wave optimization of the trunk line.
[0067] Among them, the bidirectional green wave score is related to the green wave width in both directions of the trunk line.
[0068] In some embodiments, based on the green wave width corresponding to each phase adjustment combination in each direction of the trunk line, the green wave score corresponding to each phase adjustment combination in each direction is obtained, and the bidirectional green wave score corresponding to that phase adjustment combination is obtained accordingly. The green wave score in each direction changes positively with the green wave width in that direction, the trunk line traffic flow, and the trunk line length. The bidirectional green wave score is equal to the product of the mean and the minimum of the green wave scores corresponding to that phase adjustment combination in the two directions of the trunk line. The maximum value among all bidirectional green wave scores is the optimal bidirectional green wave score for the trunk line. Therefore, by using the bidirectional green wave score as the product of the mean and the minimum of the green wave scores in the two directions of the trunk line, the problem of large numbers consuming small numbers is prevented, and the weight of directions with poor traffic is significantly increased, thus achieving smooth bidirectional traffic flow.
[0069] In some embodiments, the phase adjustment combination corresponding to the optimal bidirectional green wave score of the trunk line is obtained, and the phase difference adjustment amount of each adjacent intersection of the trunk line is obtained accordingly. The phase difference adjustment amount of each adjacent intersection of the trunk line is equal to the difference between the selectable phase adjustment amounts of the second and first intersections in the corresponding phase adjustment combination in any direction. After the trunk line green wave optimization, the phase difference of each pair of adjacent intersections is equal to the sum of the initial phase difference of the adjacent intersections and the phase difference adjustment amount of the adjacent intersections, divided by the positive remainder of the trunk line signaling cycle. The positive remainder means that the number is positive and less than the divisor (trunk line signaling cycle). Therefore, by obtaining the phase difference of each adjacent intersection of the trunk line after green wave optimization based on the phase adjustment combination corresponding to the optimal bidirectional green wave score of the trunk line, the time starting point of the signaling cycle of each intersection can be obtained according to the phase difference, thus achieving smooth bidirectional traffic on the trunk line.
[0070] In summary, one embodiment of the trunk line green wave optimization method searches the two directions of the trunk line separately and optimizes the two-way green wave based on the bidirectional green wave score. It is suitable for trunk line green wave optimization in any scenario, especially in scenarios where the green light on-time of the two directions of the trunk line is asymmetrical.
[0071] The following is combined with Figure 2 Example 2 of a trunk line green wave optimization method is introduced.
[0072] Example 2 of a trunk line green wave optimization method is a detailed implementation of Example 1 of a trunk line green wave optimization method. It has all the advantages of the former and includes the optimization of both intersections and trunk lines, combining the optimization of the green signal ratio of intersections and the optimization of trunk line green waves.
[0073] Figure 2 The flowchart of a second embodiment of a trunk line green wave optimization method is shown, including steps S210 to S280.
[0074] S210: Optimize the signal control scheme for each intersection based on the traffic flow in each direction at each intersection of the trunk line.
[0075] This step optimizes the green light ratio at the intersection, improving traffic flow. The optimized signal control scheme includes the signal control cycle, green light time for each stage, yellow light time, and all-red light time.
[0076] S220: Obtain the trunk line signal control cycle based on the maximum value among the signal control cycles of each intersection, and adjust the green light time at each intersection accordingly.
[0077] The trunk line signal control cycle is a unified signal control cycle for all intersections. It can be the maximum value, average value or other methods of the signal control cycle for each intersection. The preferred method is the maximum value of the signal control cycle for each intersection. In this embodiment, it is the maximum value of the signal control cycle for each intersection.
[0078] Specifically, when the maximum signal control period at each intersection of a trunk line is greater than the set maximum signal control period, the trunk line signal control period is the set maximum signal control period; when the maximum signal control period at each intersection of a trunk line is less than the set minimum signal control period, the trunk line signal control period is the set minimum signal control period; when the maximum signal control period at each intersection of a trunk line is between the set minimum signal control period and the set maximum signal control period, the trunk line signal control period is that maximum value.
[0079] Adjusting the green light times at an intersection on a main road includes:
[0080] The signal control cycle of the trunk line is taken as the signal control cycle of the intersection, and the total yellow light time and all red light time are subtracted from it to obtain the remaining green light time, which is then distributed to each stage according to the proportion of green light time in the previous stages.
[0081] Determine whether the new green light time for a phase is greater than the set maximum green light time. If it is, adjust the green light time for that phase to the set maximum green light time, and proportionally redistribute the remaining green light time for that phase to other phases that have not exceeded the set maximum green light time.
[0082] S230: Based on the signal control schemes of each intersection on the trunk line and the initial phase difference of each pair of adjacent intersections, obtain the initial absolute phase of each intersection in each direction on the trunk line.
[0083] This step includes the following process:
[0084] 1) Based on the distance and speed of each pair of adjacent intersections, the initial phase difference between the two intersections is equal to the distance between the corresponding adjacent intersections divided by the speed.
[0085] 2) Obtain the green light start time for each intersection on the main line in each direction based on the signal control scheme for each intersection. The green light start time for an intersection in one direction on the main line is the sum of the green and yellow light times in each stage before the green light stage of the signal control for that direction, plus the all-red time between these stages. When the travel time in each direction of an intersection is asymmetrical, the green light start time will be different in each direction on the main line.
[0086] 3) In each direction of the main road, with the initial absolute phase of the first intersection in that direction as 0, the initial absolute phase of any other intersection is equal to the initial absolute phase of the previous intersection plus the initial phase difference of the adjacent intersection plus the green light start time for that direction at that intersection. When the travel time in each direction of an intersection is asymmetrical, the initial absolute phase in each direction of the main road will be different.
[0087] S240: Obtain the selectable phase adjustment amount for each intersection based on the trunk line signal control cycle, and obtain a set of phase adjustment combinations accordingly.
[0088] The range of selectable phase adjustment amounts for each intersection is as follows: its maximum value is half of the trunk signal control cycle, and its minimum value is a negative value of half of the trunk signal control cycle. The number of selectable phase adjustment amounts for each intersection is also set, and the range of selectable phase adjustment amounts for each intersection divided by the number of selectable phase adjustment amounts is the adjustment step size of the selectable phase adjustment amounts.
[0089] Each phase adjustment combination includes a selected, optional phase adjustment amount for each intersection.
[0090] The order of the phase adjustment combinations in the set of phase adjustment combinations starts with the negative values of the selectable phase adjustment amount, which is equivalent to starting with negative values when selecting the selectable phase adjustment amount for each intersection during green wave optimization.
[0091] S250: Adjust the initial absolute phase of each intersection according to each phase adjustment combination to obtain the absolute phase of each intersection corresponding to that phase adjustment combination in each direction of the trunk line.
[0092] In each direction of the trunk line, the absolute phase of the first intersection is set as its initial absolute phase, and the absolute phase corresponding to each phase adjustment combination of any other intersection is equal to the initial absolute phase of the intersection plus the optional phase adjustment amount selected by the intersection in the phase adjustment combination.
[0093] S260: Based on the absolute phase of each intersection corresponding to each phase adjustment combination in each direction of the trunk line, obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line.
[0094] Specifically, based on the absolute phase of each intersection corresponding to each phase adjustment combination in each direction of the trunk line, and combined with the distance and vehicle speed of adjacent intersections, the green wave width corresponding to each phase adjustment combination in each direction of the trunk line is obtained through a relevant algorithm. The specific algorithm is not limited. For example, this algorithm is the Multiband algorithm.
[0095] S270: Adjust the green wave width corresponding to each phase in each direction of the trunk line to obtain the optimal bidirectional green wave score of the trunk line.
[0096] This step includes the following process:
[0097] 1) Based on the green wave width corresponding to each phase adjustment combination in each direction of the trunk line, obtain the green wave score corresponding to each phase adjustment combination in each direction of the trunk line, and obtain the bidirectional green wave score corresponding to the phase adjustment combination accordingly. The green wave score in each direction changes positively with the green wave width in that direction, the trunk line flow rate, and the trunk line length. The bidirectional green wave score is equal to the product of the mean and the minimum of the two green wave scores corresponding to the phase adjustment combination in the two directions of the trunk line.
[0098] 2) The maximum value among the obtained bidirectional green wave scores is the optimal bidirectional green wave score for the trunk line.
[0099] S280: Based on the phase adjustment combination corresponding to the optimal bidirectional green wave score, obtain the phase difference between adjacent intersections after the optimization of the trunk green wave.
[0100] This step includes the following process:
[0101] 1) Obtain the phase adjustment combination corresponding to the optimal bidirectional green wave fraction, and accordingly obtain the phase difference adjustment amount of each adjacent intersection in one direction of the trunk line. The phase difference adjustment amount of each adjacent intersection in that direction of the trunk line is equal to the difference between the selectable phase adjustment amount of the second intersection and the first intersection in that direction in the corresponding phase adjustment combination.
[0102] 2) After optimization of the trunk line green wave, the phase difference of each pair of adjacent intersections is equal to the sum of the initial phase difference of the adjacent intersection and the phase difference adjustment amount of the adjacent intersection, divided by the positive remainder of the trunk line signal control cycle.
[0103] In summary, Embodiment 2 of the trunk line green wave optimization method, based on Embodiment 1, further improves the smoothness of the traffic network by combining the optimization of the green signal ratio at intersections and the optimization of trunk line green waves.
[0104] The following is combined with Figure 3 This paper introduces an embodiment of a trunk line green wave optimization device.
[0105] An embodiment of a trunk line green wave optimization device performs a trunk line green wave optimization method, which has all its advantages.
[0106] Figure 3 The structure of a trunk line green wave optimization device according to an embodiment 1 is shown, including: an initial acquisition module 310, an adjustment acquisition module 320, a green wave acquisition module 330, and a green wave optimization module 340.
[0107] The initial acquisition module 310 is used to obtain the initial absolute phase of each intersection in each direction of the trunk line based on the signal control scheme of each intersection and the initial phase difference of each pair of adjacent intersections. For its working principle and advantages, please refer to step S110 of Embodiment 1 of a Trunk Line Green Wave Optimization Method.
[0108] The adjustment acquisition module 320 is used to obtain a set of phase adjustment combinations based on several selectable phase adjustment amounts for each intersection. For its working principle and advantages, please refer to step S120 of Embodiment 1 of a trunk green wave optimization method.
[0109] The green wave acquisition module 330 is used to adjust the initial absolute phase of each intersection according to each phase adjustment combination, and obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line. For its working principle and advantages, please refer to step S130 of Embodiment 1 of a trunk line green wave optimization method.
[0110] The green wave optimization module 340 is used to adjust the green wave width corresponding to each phase in each direction of the trunk line to obtain the optimal bidirectional green wave score of the trunk line, and thereby obtain the phase difference between adjacent intersections after the trunk line green wave optimization. For its working principle and advantages, please refer to step S140 of Embodiment 1 of a trunk line green wave optimization method.
[0111] The following is combined with Figure 4 This paper introduces a second embodiment of a trunk line green wave optimization device.
[0112] A second embodiment of a trunk line green wave optimization device executes a second embodiment of a trunk line green wave optimization method, which has all its advantages.
[0113] Figure 4 The structure of a trunk line green wave optimization device according to embodiment 2 is shown, including: intersection optimization module 410, unified cycle module 420, initial acquisition module 430, adjustment acquisition module 440, green wave acquisition module 450, and green wave optimization module 460.
[0114] The intersection optimization module 410 is used to optimize the signal control scheme of each intersection based on the traffic flow in each direction at each intersection on the trunk line. For its working principle and advantages, please refer to step S210 of Embodiment 2 of a Trunk Line Green Wave Optimization Method.
[0115] The unified cycle module 420 is used to obtain the trunk line signal control cycle based on the maximum value among the signal control cycles of each intersection, and adjust the green light time at each intersection accordingly. For its working principle and advantages, please refer to step S220 of Embodiment 2 of a Trunk Line Green Wave Optimization Method.
[0116] The initial acquisition module 430 is used to obtain the initial absolute phase of each intersection in each direction of the trunk line based on the signal control scheme of each intersection and the initial phase difference of each pair of adjacent intersections. For its working principle and advantages, please refer to step S230 of Embodiment 2 of a Trunk Line Green Wave Optimization Method.
[0117] The adjustment module 440 is used to obtain the selectable phase adjustment amount for each intersection based on the trunk line signal control cycle, and thereby obtain a set of phase adjustment combinations. For its working principle and advantages, please refer to step S240 of Embodiment 2 of a trunk line green wave optimization method.
[0118] The green wave acquisition module 450 is used to adjust the initial absolute phase of each intersection according to each phase adjustment combination, and obtain the absolute phase of each intersection corresponding to that phase adjustment combination in each direction of the trunk line; it is also used to obtain the green wave width corresponding to each phase adjustment combination in each direction of the trunk line according to the absolute phase of each intersection corresponding to each phase adjustment combination in each direction of the trunk line. For its working principle and advantages, please refer to steps S250 and S260 of Embodiment 2 of a trunk line green wave optimization method.
[0119] The green wave optimization module 460 is used to adjust the green wave width corresponding to each phase adjustment combination in each direction of the trunk line to obtain the optimal bidirectional green wave score of the trunk line; it is also used to adjust the phase combination corresponding to the optimal bidirectional green wave score to obtain the phase difference between adjacent intersections after the trunk line green wave optimization. For its working principle and advantages, please refer to steps S270 and S280 of Embodiment 2 of a trunk line green wave optimization method.
[0120] This application also provides a computing device, which will be described below in conjunction with... Figure 5 Detailed introduction.
[0121] The computing device 500 includes a processor 510, a memory 520, a communication interface 530, and a bus 540.
[0122] It should be understood that the communication interface 530 in the computing device 500 shown in the figure can be used to communicate with other devices.
[0123] The processor 510 can be connected to the memory 520. The memory 520 can be used to store the program code and data. Therefore, the memory 520 can be a storage unit inside the processor 510, an external storage unit independent of the processor 510, or a component that includes both the storage unit inside the processor 510 and the external storage unit independent of the processor 510.
[0124] Optionally, the computing device 500 may also include a bus 540. The memory 520 and communication interface 530 can be connected to the processor 510 via the bus 540. The bus 540 can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The bus 540 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one line is used in this figure, but this does not mean that there is only one bus or one type of bus.
[0125] It should be understood that in the embodiments of this application, the processor 510 may be a central processing unit (CPU). The processor may also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor. Alternatively, the processor 510 may employ one or more integrated circuits to execute related programs to implement the technical solutions provided in the embodiments of this application.
[0126] The memory 520 may include read-only memory and random access memory, and provides instructions and data to the processor 510. A portion of the processor 510 may also include non-volatile random access memory. For example, the processor 510 may also store device type information.
[0127] When the computing device 500 is running, the processor 510 executes computer execution instructions stored in the memory 520 to perform the operation steps of each method embodiment.
[0128] It should be understood that the computing device 500 according to the embodiments of this application can correspond to the corresponding subject in executing the methods according to the various embodiments of this application, and the above and other operations and / or functions of each module in the computing device 500 are respectively for implementing the corresponding processes of the methods of this embodiment. For the sake of brevity, they will not be described in detail here.
[0129] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0130] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.
[0131] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.
[0132] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0133] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.
[0134] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0135] This application also provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, is used to perform the operation steps of the various method embodiments.
[0136] The computer storage medium in this application embodiment can be any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. For example, a computer-readable storage medium can be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this document, a computer-readable storage medium can be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.
[0137] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, capable of sending, propagating, or transmitting programs for use by or in connection with an instruction execution system, apparatus, or device.
[0138] The program code contained on a computer-readable medium may be transmitted using any suitable medium, including, but not limited to, wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.
[0139] Computer program code for performing the operations of this application can be written in one or more programming languages or a combination thereof, including object-oriented programming languages such as Java, Smalltank, and C++, and conventional procedural programming languages such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0140] Note that the above are merely preferred embodiments and the technical principles employed in this application. Those skilled in the art will understand that this application is not limited to the specific embodiments described herein, and various obvious changes, readjustments, and substitutions can be made without departing from the scope of protection of this application. Therefore, although this application has been described in detail through the above embodiments, this application is not limited to the above embodiments, and may include many other equivalent embodiments without departing from the concept of this application, all of which fall within the scope of protection of this application.
Claims
1. A method for arterial green wave optimization, the method comprising: The method comprises the following steps: obtaining initial absolute phases of each intersection in each direction of the arterial road according to the signal control scheme of each intersection of the arterial road and the initial phase difference of each pair of adjacent intersections; obtaining a set of phase adjustment combinations according to a plurality of optional phase adjustment amounts of each intersection, each phase adjustment combination comprising a selected optional phase adjustment amount of each intersection; adjusting the initial absolute phases according to each phase adjustment combination to obtain a green wave width corresponding to each phase adjustment combination in each direction of the arterial road; obtaining an optimal bidirectional green wave score of the arterial road according to the green wave widths, and obtaining the phase difference of adjacent intersections after the green wave optimization of the arterial road according to the optimal bidirectional green wave score.
2. The method of claim 1, wherein, The step of obtaining the optimal bidirectional green wave score of the arterial road according to the green wave widths comprises the following steps: obtaining a green wave score corresponding to each phase adjustment combination in each direction of the arterial road according to the green wave widths, and obtaining a bidirectional green wave score corresponding to the phase adjustment combination according to the green wave scores, wherein the green wave score in each direction changes positively with the green wave width in the direction, the length of the arterial road and the traffic volume of the arterial road, the bidirectional green wave score is equal to the product of the mean value of the green wave scores in the two directions of the arterial road corresponding to the phase adjustment combination and the minimum value of the green wave scores in the two directions of the arterial road corresponding to the phase adjustment combination; the maximum value of the bidirectional green wave scores is the optimal bidirectional green wave score of the arterial road.
3. The method of claim 2, wherein, The step of obtaining the phase difference of adjacent intersections after the green wave optimization of the arterial road according to the optimal bidirectional green wave score comprises the following steps: obtaining the phase adjustment combination corresponding to the optimal bidirectional green wave score, and obtaining the phase difference adjustment amount of each adjacent intersection of the arterial road according to the phase adjustment combination, wherein the phase difference adjustment amount of each adjacent intersection of the arterial road is equal to the difference between the optional phase adjustment amount of the second intersection and the first intersection in the corresponding phase adjustment combination in any direction; the phase difference of each pair of adjacent intersections after the green wave optimization of the arterial road is equal to the sum of the initial phase difference of the adjacent intersections and the phase difference adjustment amount of the adjacent intersections divided by the positive remainder of the signal control period of the arterial road.
4. The method of claim 1, wherein, The step of obtaining the initial absolute phases of each intersection in each direction of the arterial road according to the signal control scheme of each intersection of the arterial road and the initial phase difference of each pair of adjacent intersections comprises the following steps: obtaining the green light start time of each intersection in each direction of the arterial road according to the signal control scheme of each intersection of the arterial road; in each direction of the arterial road, taking the initial absolute phase of the first intersection as 0, and taking the initial absolute phase of any intersection in the other intersections as the initial absolute phase of the last intersection plus the initial phase difference of the adjacent intersection plus the green light start time of the intersection in the direction.
5. The method of claim 1, wherein, The step of adjusting the initial absolute phases according to each phase adjustment combination to obtain the green wave width corresponding to each phase adjustment combination in each direction of the arterial road comprises the following steps: in each direction of the arterial road, the absolute phase of the first intersection is the initial absolute phase, and the absolute phase of any intersection in the other intersections corresponding to each phase adjustment combination is equal to the initial absolute phase of the intersection plus the selected optional phase adjustment amount of the intersection in the phase adjustment combination. According to the absolute phases of each intersection corresponding to each phase adjustment combination in each direction of the arterial road, the green wave width corresponding to each phase adjustment combination in each direction of the arterial road is obtained.
6. The method of claim 1, wherein, Further comprising: According to the maximum value of the signal control period of each intersection of the arterial road, the signal control period of the arterial road is obtained, and the green time in each intersection is adjusted accordingly.
7. The method of claim 6, wherein, Further comprising: According to the signal control period of the arterial road, the optional phase adjustment amount of each intersection is obtained, the maximum value of which is less than half of the signal control period of the arterial road, and the minimum value of which is greater than the negative value of half of the signal control period of the arterial road.
8. A traffic network optimization apparatus, characterized by, Comprising: An initial obtaining module, configured to obtain the initial absolute phase of each intersection in each direction of the arterial road according to the signal control scheme of each intersection of the arterial road and the initial phase difference of each pair of adjacent intersections; An adjustment obtaining module, configured to obtain a set of phase adjustment combinations according to a plurality of optional phase adjustment amounts of each intersection, each phase adjustment combination comprising a selected optional phase adjustment amount of each intersection; A green wave obtaining module, configured to obtain the green wave width corresponding to each phase adjustment combination in each direction of the arterial road according to the adjustment of the initial absolute phase by each phase adjustment combination; A green wave optimization module, configured to obtain the optimal bidirectional green wave score of the arterial road according to the green wave widths, and to obtain the phase difference of adjacent intersections after the green wave optimization of the arterial road accordingly.
9. A computing device, comprising: Comprising, a bus; a communication interface connected with the bus; at least one processor connected with the bus; and at least one memory connected with the bus and storing program instructions, the program instructions causing the at least one processor to execute the method of any one of claims 1 to 7 when executed by the at least one processor.
10. A computer-readable storage medium, characterized in that, A computer program product having program instructions stored thereon, the program instructions causing the computer to execute the method of any one of claims 1 to 7 when executed by the computer.