A phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase

Abstract

The present invention discloses a method for designing a phase sequence scheme that satisfies the equalization constraint of each flow direction in the same phase, and relates to the field of intelligent traffic control technology, and includes the following steps: S1. Collecting at least one week of intersection peak hour traffic flow data, and taking the average flow rate of each phase; S2. Traversing each lane function of each lane; S3. Calculating the green interval matrix between each phase according to the conflict point of the vehicle flow trajectory; S4. Enumerating and searching all feasible basic signal stages; S5. Enumerating and combining a specified number of non-repeating basic signal stages; S6. Searching for the optimal phase scheme among all feasible phase schemes; S7. Enumerating and searching for the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme. The present invention solves the optimal phase scheme with the minimum product of the sum of the key phase flow rate ratios of each signal stage and the number of signal stages as the objective function; enumerating and searching for the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme.

Description

Technical Field

[0001] The invention relates to the technical field of intelligent traffic control, and in particular to a method for designing a phase sequence scheme that satisfies the equalization constraint of each flow direction in the same phase. Background Art

[0002] The rapid growth in the number of motor vehicles has made urban traffic congestion, especially traffic congestion at intersections, more and more serious. The phase sequence scheme of intersections has become increasingly important to the traffic efficiency of intersections, and the design of phase sequence schemes has become a focus of intersection management and control.

[0003] The current phase sequence design method takes into account the principles that the vehicle flow trajectory of the released phases in the same signal stage does not conflict, each phase is released at least once, and the number of entrance lanes and exit lanes is balanced. The traffic balance at the intersection mainly involves two levels of evaluation: on the one hand, it refers to the balance between the signal stages. By adjusting the time allocation between the signal stages, the saturation of the key phases of each signal stage is balanced; on the other hand, it refers to the balance of each phase within the signal stage. If the traffic flow of each phase in the signal stage is very different, no matter how the signal timing is adjusted, it cannot change the imbalance of each phase in the signal stage. However, the current phase sequence design method mostly aims to minimize the sum of the flow rate ratios of the key phases in each signal stage, and pays less attention to the evergreen phase, the overlapping phase, and the balance of each phase in the signal stage. As a result, the generated phase sequence scheme is prone to the situation of empty green lights or oversaturation of some entrance lanes, and has poor adaptability to complex phase schemes.

[0004] Therefore, the present invention proposes a phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase. Summary of the invention

[0005] The present invention provides a phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase, which promotes solving the problems mentioned in the above background technology.

[0006] The present application provides a phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase, and adopts the following technical scheme: A phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase, comprising the following steps:

[0007] S1. Collect at least one week of intersection peak hour traffic flow data and take the average flow rate of each phase;

[0008] The phase refers to the period in which one or more traffic flows obtain exactly the same signal light color display at any time within a signal cycle, and the continuous time sequence in which they obtain different light colors is called a signal phase;

[0009] S2. traverse the lane functions of each lane, generate a Bezier curve from the end point of the entrance lane to the starting point of the exit lane to represent the corresponding vehicle flow trajectory, and find the conflict points between all vehicle flow trajectories;

[0010] S3. Calculate the green interval matrix between each phase according to the conflict point of the traffic trajectory;

[0011] S4. Enumerate and search for all feasible basic signal stages, where a feasible basic signal stage means that the vehicle flow trajectories of any two phases in each basic signal stage do not conflict;

[0012] The signal phase refers to the change of the right of way in the intersection affected by the signal control, and each change is called a signal phase;

[0013] S5. enumerate and combine a specified number of non-repeating basic signal phases, and if the basic signal phase combination includes all phases of the intersection, define it as a feasible phase solution;

[0014] S6. With the constraints of balanced flow rate ratios between phases in the same signal stage, not too small flow rate ratios of overlapping phases in each signal stage, and balanced number of entrance and exit lanes in the signal stage, and the objective function of minimizing the product of the sum of flow rate ratios of key phases in each signal stage and the number of signal stages, find the optimal phase plan from all feasible phase plans;

[0015] S7. Take the full arrangement of each signal phase in the optimal phase scheme as all feasible phase sequence schemes, and enumerate and search for the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme.

[0016] By adopting the above technical solution, Bezier curves are used to generate the traffic trajectories of each lane and each turn at the intersection, the conflict points between the traffic trajectories are found, and the green interval matrix between each phase is calculated accordingly; all feasible basic signal stages are enumerated and found, and a feasible phase plan is generated by combination; the number of releases of overlapping phases and evergreen phases is considered, and the flow rate ratio between each phase in the same signal stage is balanced, the flow rate ratio of the overlapping phase in each signal stage should not be too small, and the number of entrance and exit lanes released in the signal stage is balanced. The objective function is to minimize the product of the sum of the flow rate ratios of the key phases in each signal stage and the number of signal stages, and solve the optimal phase plan; the phase sequence plan with the shortest total green interval time is enumerated and found as the optimal phase sequence plan.

[0017] Furthermore, in step S2, traversing the lane functions of each lane, generating a Bezier curve from the end point of the entrance lane to the start point of the exit lane to represent the corresponding vehicle flow trajectory, and finding the conflict points between all vehicle flow trajectories specifically includes the following steps:

[0018] S21. Note the entrance The end point coordinates are , the first The coordinates of the starting point of the exit road corresponding to the turn are ;

[0019] S22. If If the turn is straight ahead, then and Linear interpolation is performed between the two values ​​to generate the trajectory of straight traffic flow;

[0020] S23. If If the turn is left or right, the entrance lane The coordinates of the intersection point with the straight line corresponding to the exit road are taken as the intermediate reference point; if the If the turn is a U-turn, the center point of the intersection is taken as the middle reference point; the middle reference point is recorded as ;

[0021] S24. Get the number of interpolation points of the Bezier curve , take the control points of the Bezier curve as , ;

[0022] S25. No. The coordinates of the interpolation points are as follows. The coordinates of each interpolation point are calculated to generate the vehicle flow trajectory;

[0023] ;

[0024] S26. Calculate all traffic trajectories of each lane and find conflicting points of the traffic trajectories.

[0025] Furthermore, the step S3 of calculating the green interval matrix between each phase according to the conflict point of the vehicle flow trajectory specifically includes the following steps:

[0026] S31. Remember the phase The set of controlled lanes is ;

[0027] S32. If the phase Middle Lane No. Traffic trajectories With phase Middle Lane No. Traffic trajectories If there is no conflict point, the vehicle flow trajectory With traffic trajectory The green interval time is ;

[0028] S33. If and There is a conflict point, record the conflict point to the lane The distance is the clearing distance , record the conflict point to the lane The distance is the driving distance , then the traffic trajectory With traffic trajectory The green interval time is ;

[0029] S34. Calculate phase The trajectories and phases of each vehicle flow The green interval time of each vehicle flow trajectory in the phase With phase Green interval time .

[0030] Furthermore, the enumeration and searching of all feasible basic signal stages in step S4 to ensure that the vehicle flow trajectories of any two phases in each basic signal stage do not conflict specifically includes the following steps:

[0031] S41. The number of phases allowed to be released in the basic signal stage is ,make Start from 1 and increment until all phases of the intersection are reached. , loop through steps S42 to S44;

[0032] S42. Take out all phases from the intersection non-repeating phases, if this If a phase does not include all evergreen phases, or does not include any non-evergreen phase, it cannot constitute a feasible basic signal phase;

[0033] S43. If this If there are two phases in the phases whose vehicle flow trajectories conflict, they cannot form a feasible basic signal phase;

[0034] S44. Enumeration traversal All combinations of non-repeating phases are calculated and the feasible basis signal phases are extracted from them.

[0035] Furthermore, in step S5, a specified number of non-repeating basic signal phases are enumerated and combined. If the basic signal phase combination includes all phases of the intersection, it is defined as a feasible phase scheme, which specifically includes the following steps:

[0036] S51. The number of signal stages in the phase scheme is ,make From the minimum number of signal stages Increment the value until the maximum number of signal stages , loop through step S52 to step S53;

[0037] S52. Remove from all base signal stages non-repeating basic signal phase, if this The non-repeating basic signal phase includes all the phases of the intersection and is considered to be a feasible phase scheme;

[0038] S53. Traversal enumeration All combinations of non-repeating basic signal phases are selected and feasible phase solutions are extracted.

[0039] Furthermore, the step S6 specifically includes the following steps:

[0040] S61. Count the number of times each phase is allowed to be released in the phase scheme, recorded as ;

[0041] S62. Phase The flow rate ratio is ,in Indicates phase The total flow of each lane, Indicates phase The total capacity of each lane;

[0042] S63. If the phase The number of allowed releases And phase The flow rate ratio is , then the phase The flow rate ratio is less than the minimum setting threshold of the overlap phase, but is still set to the overlap phase;

[0043] Signal recording stage The maximum and minimum flow rate ratios of each phase are and ,like and , and the signal phase The number of times the phase with the largest flow rate ratio is allowed to release , then the signal phase There is an imbalance in the flow rate ratio between phases;

[0044] S64. Signal recording stage The number of entry lanes allowed to be released and the corresponding number of exit lanes are and ,like , then the signal phase There are too many lanes in the system;

[0045] S65. If the phenomenon of step S63 occurs in any phase of the phase scheme, or the phenomenon of step S64 occurs in any signal stage, the score of the phase scheme is infinite;

[0046] S66. The sum of the key phase flow rate ratios of each signal stage in the phase scheme is , the score of this phase scheme is ;

[0047] S67. Traverse all feasible phase solutions, calculate the score of each phase solution, and select the phase solution with the smallest score as the optimal phase solution.

[0048] Furthermore, the enumeration and search for the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme in step S7 specifically includes the following steps:

[0049] S71. The signal phase set included in the optimal phase solution is , the total number of its permutations is Phase sequence scheme;

[0050] S72.Remember a phase sequence scheme as , where the signal phase include phase, that is ;

[0051] Signal Phase include phase, that is , signal acquisition stage Each phase to the signal stage The maximum value of the green interval time of each phase is taken as the green interval time of two adjacent signal stages:

[0052] ;

[0053] S73. The total green interval time of the phase sequence scheme is ;

[0054] S74. Calculate the total green interval time of all phase sequence schemes, and select the phase sequence scheme with the smallest total green interval time as the optimal phase sequence scheme.

[0055] By adopting the above technical scheme, the influence of evergreen phase, overlapping phase, etc. is taken into account, which is more suitable for the generation and evaluation of complex phase schemes; phase balance constraints are added in the calculation process to ensure that the generated phase scheme is not prone to imbalance among phases in the same signal stage; the objective function is to minimize the product of the sum of the key phase flow rate ratios of each signal stage and the number of signal stages, thereby realizing the coordinated optimization of the phase scheme and the number of signal stages.

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

[0057] 1. The present invention generates the traffic trajectory of each lane and each turn of the intersection by using Bezier curves, finds the conflict points between the traffic trajectories, and calculates the green interval matrix between each phase accordingly; enumerates and finds all feasible basic signal stages, and combines them to generate feasible phase plans; considers the release times of overlapping phases and evergreen phases, takes the flow rate ratio between each phase in the same signal stage as balanced, the flow rate ratio of the overlapping phase in each signal stage should not be too small, and the number of released entrance lanes and exit lanes in the signal stage as balanced constraints, takes the product of the sum of the flow rate ratios of the key phases in each signal stage and the number of signal stages as the minimum as the objective function, and solves the optimal phase plan; enumerates and finds the phase sequence plan with the shortest total green interval time as the optimal phase sequence plan.

[0058] 2. The present invention takes into account the influence of evergreen phase, overlapping phase, etc., and is more suitable for the generation and evaluation of complex phase schemes; phase balance constraints are added in the calculation process to ensure that the generated phase scheme is not prone to imbalance among phases in the same signal stage; the objective function is to minimize the product of the sum of the key phase flow rate ratios of each signal stage and the number of signal stages, thereby realizing the coordinated optimization of the phase scheme and the number of signal stages. BRIEF DESCRIPTION OF THE DRAWINGS

[0059] Figure 1 It is a schematic diagram of the process of the present invention;

[0060] Figure 2 This is a schematic diagram of the channelization of the intersection of G106 National Highway and Yidong Road;

[0061] Figure 3 This is a schematic diagram of the traffic trajectory and conflict points on G106 National Highway-Yidong Road. DETAILED DESCRIPTION

[0062] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not 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] Example 1

[0064] Reference Figure 1 A phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase includes the following steps:

[0065] S1. Collect at least one week of intersection peak hour traffic flow data and take the average flow rate of each phase;

[0066] Phase refers to the period in which one or more traffic flows receive exactly the same signal light color display at any time within a signal cycle. The continuous sequence of different light colors is called a signal phase.

[0067] S2. traverse the lane functions of each lane, generate a Bezier curve from the end point of the entrance lane to the starting point of the exit lane to represent the corresponding vehicle flow trajectory, and find the conflict points between all vehicle flow trajectories;

[0068] S3. Calculate the green interval matrix between each phase according to the conflict point of the traffic trajectory;

[0069] S4. Enumerate and search for all feasible basic signal stages, where a feasible basic signal stage means that the vehicle flow trajectories of any two phases in each basic signal stage do not conflict;

[0070] Signal phase refers to the change of right of way in the intersection affected by signal control. Each change is called a signal phase.

[0071] S5. enumerate and combine a specified number of non-repeating basic signal phases, and if the basic signal phase combination includes all phases of the intersection, define it as a feasible phase solution;

[0072] S6. With the constraints of balanced flow rate ratios between phases in the same signal stage, not too small flow rate ratios of overlapping phases in each signal stage, and balanced number of entrance and exit lanes in the signal stage, and the objective function of minimizing the product of the sum of flow rate ratios of key phases in each signal stage and the number of signal stages, find the optimal phase plan from all feasible phase plans;

[0073] S7. Take the full arrangement of each signal phase in the optimal phase scheme as all feasible phase sequence schemes, and enumerate and search for the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme.

[0074] Bezier curves are used to generate the traffic trajectories of each lane and each turn at the intersection, and the conflict points between the traffic trajectories are found. Based on this, the green interval matrix between each phase is calculated. All feasible basic signal stages are enumerated and found, and a feasible phase plan is generated by combining them. The number of releases of overlapping phases and evergreen phases is considered. The flow rate ratio between each phase in the same signal stage is balanced, the flow rate ratio of the overlapping phase in each signal stage should not be too small, and the number of entrance and exit lanes released in the signal stage is balanced. The objective function is to minimize the product of the sum of the flow rate ratios of the key phases in each signal stage and the number of signal stages, and solve the optimal phase plan. The phase sequence plan with the shortest total green interval time is enumerated and found as the optimal phase sequence plan.

[0075] In step S2, the lane functions of each lane are traversed, a Bezier curve from the end point of the entrance lane to the start point of the exit lane is generated to represent the corresponding vehicle flow trajectory, and the conflict points between all vehicle flow trajectories are found. Specifically, the following steps are included:

[0076] S21. Note the entrance The end point coordinates are , the first The coordinates of the starting point of the exit road corresponding to the turn are ;

[0077] S22. If If the turn is straight ahead, then and Linear interpolation is performed between the two values ​​to generate the trajectory of straight traffic flow;

[0078] S23. If If the turn is left or right, the entrance lane The coordinates of the intersection point with the straight line corresponding to the exit road are taken as the intermediate reference point; if the If the turn is a U-turn, the center point of the intersection is taken as the middle reference point; the middle reference point is recorded as ;

[0079] S24. Get the number of interpolation points of the Bezier curve , take the control points of the Bezier curve as , ;

[0080] S25. No. The coordinates of the interpolation points are as follows. The coordinates of each interpolation point are calculated to generate the vehicle flow trajectory;

[0081] ;

[0082] S26. Calculate all traffic trajectories of each lane and find conflicting points of the traffic trajectories.

[0083] Calculating the green interval matrix between each phase according to the conflict point of the vehicle flow trajectory in step S3 specifically includes the following steps:

[0084] S31. Remember the phase The set of controlled lanes is ;

[0085] S32. If the phase Middle Lane No. Traffic trajectories With phase Middle Lane No. Traffic trajectories If there is no conflict point, the vehicle flow trajectory With traffic trajectory The green interval time is ;

[0086] S33. If and There is a conflict point, record the conflict point to the lane The distance is the clearing distance , record the conflict point to the lane The distance is the driving distance , then the traffic trajectory With traffic trajectory The green interval time is ;

[0087] S34. Calculate phase The trajectories and phases of each vehicle flow The green interval time of each vehicle flow trajectory in the phase With phase Green interval time .

[0088] In step S4, all feasible basic signal stages are enumerated and searched to ensure that the vehicle flow trajectories of any two phases in each basic signal stage do not conflict, which specifically includes the following steps:

[0089] S41. The number of phases allowed to be released in the basic signal stage is ,make Start from 1 and increment until all phases of the intersection are reached. , loop through steps S42 to S44;

[0090] S42. Take out all phases from the intersection non-repeating phases, if this If a phase does not include all evergreen phases, or does not include any non-evergreen phase, it cannot constitute a feasible basic signal phase;

[0091] S43. If this If there are two phases in the phases whose vehicle flow trajectories conflict, they cannot form a feasible basic signal phase;

[0092] S44. Enumeration traversal All combinations of non-repeating phases are calculated and the feasible basis signal phases are extracted from them.

[0093] In step S5, a specified number of non-repeating basic signal phases are enumerated and combined. If the basic signal phase combination includes all phases of the intersection, it is defined as a feasible phase scheme, which specifically includes the following steps:

[0094] S51. The number of signal stages in the phase scheme is ,make From the minimum number of signal stages Increment the value until the maximum number of signal stages , loop through step S52 to step S53;

[0095] S52. Remove from all base signal stages non-repeating basic signal phase, if this The non-repeating basic signal phase includes all the phases of the intersection and is considered to be a feasible phase scheme;

[0096] S53. Traversal enumeration All combinations of non-repeating basic signal phases are selected and feasible phase solutions are extracted.

[0097] Step S6 specifically includes the following steps:

[0098] S61. Count the number of times each phase is allowed to be released in the phase scheme, recorded as ;

[0099] S62. Phase The flow rate ratio is ,in Indicates phase The total flow of each lane, Indicates phase The total capacity of each lane;

[0100] S63. If the phase The number of allowed releases And phase The flow rate ratio is , then the phase The flow rate ratio is less than the minimum setting threshold of the overlap phase, but is still set to the overlap phase;

[0101] Signal recording stage The maximum and minimum flow rate ratios of each phase are and ,like and , and the signal phase The number of times the phase with the largest flow rate ratio is allowed to release , then the signal phase There is an imbalance in the flow rate ratio between phases;

[0102] S64. Signal recording stage The number of entry lanes allowed to be released and the corresponding number of exit lanes are and ,like , then the signal phase There are too many lanes in the system;

[0103] S65. If the phenomenon of step S63 occurs in any phase of the phase scheme, or the phenomenon of step S64 occurs in any signal stage, the score of the phase scheme is infinite;

[0104] S66. The sum of the key phase flow rate ratios of each signal stage in the phase scheme is , the score of this phase scheme is ;

[0105] S67. Traverse all feasible phase solutions, calculate the score of each phase solution, and select the phase solution with the smallest score as the optimal phase solution.

[0106] In step S7, enumerating and searching for the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme specifically includes the following steps:

[0107] S71. The signal phase set included in the optimal phase solution is , the total number of its permutations is Phase sequence scheme;

[0108] S72.Remember a phase sequence scheme as , where the signal phase include phase, that is ;

[0109] Signal Phase include phase, that is , signal acquisition stage Each phase to the signal stage The maximum value of the green interval time of each phase is taken as the green interval time of two adjacent signal stages:

[0110] ;

[0111] S73. The total green interval time of the phase sequence scheme is ;

[0112] S74. Calculate the total green interval time of all phase sequence schemes, and select the phase sequence scheme with the smallest total green interval time as the optimal phase sequence scheme.

[0113] Example 2

[0114] See also Figure 1-Figure 3 Specifically, the present invention relates to a phase sequence scheme design method that satisfies the equalization constraints of each flow direction in the same phase, including the following steps.

[0115] Step 1. Collect at least one week of intersection peak hour traffic flow data and take the average flow rate of each phase;

[0116] In this example, we take the G106 National Highway-Yidong Road in Baiyun District, Guangzhou as an example, and collect peak traffic flow data with a granularity of 5 minutes for one week through the radar sensing equipment. The intersection channelization of G106 National Highway-Yidong Road and the phase number of the signal lights of each lane are shown in the attached figure. Figure 2 shown.

[0117] The average flow rates of each phase are: Phase 1 (108 pcu / h), Phase 2 (852 pcu / h), Phase 3 (300 pcu / h), Phase 5 (408 pcu / h), Phase 6 (288 pcu / h), Phase 7 (348 pcu / h), Phase 10 (200 pcu / h), and Phase 14 (240 pcu / h).

[0118] Step 2. Traverse each lane function of each lane, generate a Bezier curve from the end point of the entrance lane to the starting point of the exit lane to represent the corresponding vehicle flow trajectory, and find the conflict points between all vehicle flow trajectories;

[0119] The trajectories and conflict points of each lane of G106 National Highway-Yidong Road are as follows Figure 3 shown.

[0120] Step 3. Calculate the green interval matrix between each phase according to the conflict points of the traffic trajectory;

[0121] The green interval matrix between each phase is shown in the following table:

[0122] 1 2 3 5 6 7 10 14 1 5 5 8 5 2 6 4 5 3 6 4 5 5 4 4 4 7 6 5 4 4 7 5 5 4 10 4 7 7 7 4 4 14 7 4 3 4 8 8

[0123] Step 4. Enumerate and search for all feasible basic signal stages to ensure that the vehicle trajectories of any two phases in each basic signal stage do not conflict;

[0124] All feasible basis signal stages are as follows: (1,), (2,), (3,), (5,), (6,), (7,), (10,),(14,), (1, 2), (1, 3), (1, 5), (2, 3), (2, 6), (2, 7), (3, 6), (3, 7), (5,6), (5, 7), (6, 7), (10, 14), (1, 2, 3), (2, 3, 6), (2, 3, 7), (2, 6, 7), (3,6, 7), (5, 6, 7), (2, 3, 6, 7).

[0125] Step 5. Enumerate and combine a specified number of non-repeating basic signal phases. If the basic signal phase combination includes all phases of the intersection, it is defined as a feasible phase solution.

[0126] Step 5-1) Take the minimum number of signal stages , maximum number of signal stages ;

[0127] Step 5-3) There is no feasible phase solution with a signal phase number of 2;

[0128] The feasible phase scheme for a signal stage number of 3 is as follows:

[0129] ((1, 5), (10, 14), (2, 3, 6, 7))

[0130] ((10, 14), (1, 2, 3), (5, 6, 7))

[0131] The feasible phase scheme for a signal stage number of 4 is as follows:

[0132] ((1,), (5,), (10, 14), (2, 3, 6, 7))

[0133] ((1,), (1, 5), (10, 14), (2, 3, 6, 7))

[0134] ((1,), (2, 3), (10, 14), (5, 6, 7))

[0135] ((1,), (5, 6), (10, 14), (2, 3, 7))

[0136] ((1,), (5, 6), (10, 14), (2, 3, 6, 7))

[0137] ((1,), (5, 7), (10, 14), (2, 3, 6))

[0138] ((1,), (5, 7), (10, 14), (2, 3, 6, 7))

[0139] ((1,), (10, 14), (1, 2, 3), (5, 6, 7))

[0140] ((1,), (10, 14), (2, 3, 6), (5, 6, 7))

[0141] ((1,), (10, 14), (2, 3, 7), (5, 6, 7))

[0142] ((1,), (10, 14), (5, 6, 7), (2, 3, 6, 7))

[0143] ((2,), (1, 3), (10, 14), (5, 6, 7))

[0144] ((2,), (1, 5), (10, 14), (3, 6, 7))

[0145] ((2,), (1, 5), (10, 14), (2, 3, 6, 7))

[0146] ((2,), (10, 14), (1, 2, 3), (5, 6, 7))

[0147] ((3,), (1, 2), (10, 14), (5, 6, 7))

[0148] ((3,), (1, 5), (10, 14), (2, 6, 7))

[0149] ((3,), (1, 5), (10, 14), (2, 3, 6, 7))

[0150] ((3,), (10, 14), (1, 2, 3), (5, 6, 7))

[0151] ((5,), (1, 2), (10, 14), (3, 6, 7))

[0152] ((5,), (1, 2), (10, 14), (2, 3, 6, 7))

[0153] ((5,), (1, 3), (10, 14), (2, 6, 7))

[0154] ((5,), (1, 3), (10, 14), (2, 3, 6, 7))

[0155] ((5,), (1, 5), (10, 14), (2, 3, 6, 7))

[0156] ((5,), (6, 7), (10, 14), (1, 2, 3))

[0157] ((5,), (10, 14), (1, 2, 3), (2, 6, 7))

[0158] ((5,), (10, 14), (1, 2, 3), (3, 6, 7))

[0159] ((5,), (10, 14), (1, 2, 3), (5, 6, 7))

[0160] ((5,), (10, 14), (1, 2, 3), (2, 3, 6, 7))

[0161] ((6,), (1, 5), (10, 14), (2, 3, 7))

[0162] ((6,), (1, 5), (10, 14), (2, 3, 6, 7))

[0163] ((6,), (5, 7), (10, 14), (1, 2, 3))

[0164] ((6,), (10, 14), (1, 2, 3), (5, 6, 7))

[0165] ((7,), (1, 5), (10, 14), (2, 3, 6))

[0166] ((7,), (1, 5), (10, 14), (2, 3, 6, 7))

[0167] ((7,), (5, 6), (10, 14), (1, 2, 3))

[0168] ((7,), (10, 14), (1, 2, 3), (5, 6, 7))

[0169] ((10,), (14,), (1, 5), (2, 3, 6, 7))

[0170] ((10,), (14,), (1, 2, 3), (5, 6, 7))

[0171] ((10,), (1, 5), (10, 14), (2, 3, 6, 7))

[0172] ((10,), (10, 14), (1, 2, 3), (5, 6, 7))

[0173] ((14,), (1, 5), (10, 14), (2, 3, 6, 7))

[0174] ((14,), (10, 14), (1, 2, 3), (5, 6, 7))

[0175] ((1, 2), (1, 3), (10, 14), (5, 6, 7))

[0176] ((1, 2), (1, 5), (10, 14), (3, 6, 7))

[0177] ((1, 2), (1, 5), (10, 14), (2, 3, 6, 7))

[0178] ((1, 2), (2, 3), (10, 14), (5, 6, 7))

[0179] ((1, 2), (3, 6), (5, 7), (10, 14))

[0180] ((1, 2), (3, 6), (10, 14), (5, 6, 7))

[0181] ((1, 2), (3, 7), (5, 6), (10, 14))

[0182] ((1, 2), (3, 7), (10, 14), (5, 6, 7))

[0183] ((1, 2), (5, 6), (10, 14), (2, 3, 7))

[0184] ((1, 2), (5, 6), (10, 14), (3, 6, 7))

[0185] ((1, 2), (5, 6), (10, 14), (2, 3, 6, 7))

[0186] ((1, 2), (5, 7), (10, 14), (2, 3, 6))

[0187] ((1, 2), (5, 7), (10, 14), (3, 6, 7))

[0188] ((1, 2), (5, 7), (10, 14), (2, 3, 6, 7))

[0189] ((1, 2), (10, 14), (1, 2, 3), (5, 6, 7))

[0190] ((1, 2), (10, 14), (2, 3, 6), (5, 6, 7))

[0191] ((1, 2), (10, 14), (2, 3, 7), (5, 6, 7))

[0192] ((1, 2), (10, 14), (3, 6, 7), (5, 6, 7))

[0193] ((1, 2), (10, 14), (5, 6, 7), (2, 3, 6, 7))

[0194] ((1, 3), (1, 5), (10, 14), (2, 6, 7))

[0195] ((1, 3), (1, 5), (10, 14), (2, 3, 6, 7))

[0196] ((1, 3), (2, 3), (10, 14), (5, 6, 7))

[0197] ((1, 3), (2, 6), (5, 7), (10, 14))

[0198] ((1, 3), (2, 6), (10, 14), (5, 6, 7))

[0199] ((1, 3), (2, 7), (5, 6), (10, 14))

[0200] ((1, 3), (2, 7), (10, 14), (5, 6, 7))

[0201] ((1, 3), (5, 6), (10, 14), (2, 3, 7))

[0202] ((1, 3), (5, 6), (10, 14), (2, 6, 7))

[0203] ((1, 3), (5, 6), (10, 14), (2, 3, 6, 7))

[0204] ((1, 3), (5, 7), (10, 14), (2, 3, 6))

[0205] ((1, 3), (5, 7), (10, 14), (2, 6, 7))

[0206] ((1, 3), (5, 7), (10, 14), (2, 3, 6, 7))

[0207] ((1, 3), (10, 14), (1, 2, 3), (5, 6, 7))

[0208] ((1, 3), (10, 14), (2, 3, 6), (5, 6, 7))

[0209] ((1, 3), (10, 14), (2, 3, 7), (5, 6, 7))

[0210] ((1, 3), (10, 14), (2, 6, 7), (5, 6, 7))

[0211] ((1, 3), (10, 14), (5, 6, 7), (2, 3, 6, 7))

[0212] ((1, 5), (2, 3), (6, 7), (10, 14))

[0213] ((1, 5), (2, 3), (10, 14), (2, 6, 7))

[0214] ((1, 5), (2, 3), (10, 14), (3, 6, 7))

[0215] ((1, 5), (2, 3), (10, 14), (5, 6, 7))

[0216] ((1, 5), (2, 3), (10, 14), (2, 3, 6, 7))

[0217] ((1, 5), (2, 6), (3, 7), (10, 14))

[0218] ((1, 5), (2, 6), (10, 14), (2, 3, 7))

[0219] ((1, 5), (2, 6), (10, 14), (3, 6, 7))

[0220] ((1, 5), (2, 6), (10, 14), (2, 3, 6, 7))

[0221] ((1, 5), (2, 7), (3, 6), (10, 14))

[0222] ((1, 5), (2, 7), (10, 14), (2, 3, 6))

[0223] ((1, 5), (2, 7), (10, 14), (3, 6, 7))

[0224] ((1, 5), (2, 7), (10, 14), (2, 3, 6, 7))

[0225] ((1, 5), (3, 6), (10, 14), (2, 3, 7))

[0226] ((1, 5), (3, 6), (10, 14), (2, 6, 7))

[0227] ((1, 5), (3, 6), (10, 14), (2, 3, 6, 7))

[0228] ((1, 5), (3, 7), (10, 14), (2, 3, 6))

[0229] ((1, 5), (3, 7), (10, 14), (2, 6, 7))

[0230] ((1, 5), (3, 7), (10, 14), (2, 3, 6, 7))

[0231] ((1, 5), (5, 6), (10, 14), (2, 3, 7))

[0232] ((1, 5), (5, 6), (10, 14), (2, 3, 6, 7))

[0233] ((1, 5), (5, 7), (10, 14), (2, 3, 6))

[0234] ((1, 5), (5, 7), (10, 14), (2, 3, 6, 7))

[0235] ((1, 5), (6, 7), (10, 14), (1, 2, 3))

[0236] ((1, 5), (6, 7), (10, 14), (2, 3, 6))

[0237] ((1, 5), (6, 7), (10, 14), (2, 3, 7))

[0238] ((1, 5), (6, 7), (10, 14), (2, 3, 6, 7))

[0239] ((1, 5), (10, 14), (1, 2, 3), (2, 6, 7))

[0240] ((1, 5), (10, 14), (1, 2, 3), (3, 6, 7))

[0241] ((1, 5), (10, 14), (1, 2, 3), (5, 6, 7))

[0242] ((1, 5), (10, 14), (1, 2, 3), (2, 3, 6, 7))

[0243] ((1, 5), (10, 14), (2, 3, 6), (2, 3, 7))

[0244] ((1, 5), (10, 14), (2, 3, 6), (2, 6, 7))

[0245] ((1, 5), (10, 14), (2, 3, 6), (3, 6, 7))

[0246] ((1, 5), (10, 14), (2, 3, 6), (5, 6, 7))

[0247] ((1, 5), (10, 14), (2, 3, 6), (2, 3, 6, 7))

[0248] ((1, 5), (10, 14), (2, 3, 7), (2, 6, 7))

[0249] ((1, 5), (10, 14), (2, 3, 7), (3, 6, 7))

[0250] ((1, 5), (10, 14), (2, 3, 7), (5, 6, 7))

[0251] ((1, 5), (10, 14), (2, 3, 7), (2, 3, 6, 7))

[0252] ((1, 5), (10, 14), (2, 6, 7), (3, 6, 7))

[0253] ((1, 5), (10, 14), (2, 6, 7), (2, 3, 6, 7))

[0254] ((1, 5), (10, 14), (3, 6, 7), (2, 3, 6, 7))

[0255] ((1, 5), (10, 14), (5, 6, 7), (2, 3, 6, 7))

[0256] ((2, 3), (10, 14), (1, 2, 3), (5, 6, 7))

[0257] ((2, 6), (5, 7), (10, 14), (1, 2, 3))

[0258] ((2, 6), (10, 14), (1, 2, 3), (5, 6, 7))

[0259] ((2, 7), (5, 6), (10, 14), (1, 2, 3))

[0260] ((2, 7), (10, 14), (1, 2, 3), (5, 6, 7))

[0261] ((3, 6), (5, 7), (10, 14), (1, 2, 3))

[0262] ((3, 6), (10, 14), (1, 2, 3), (5, 6, 7))

[0263] ((3, 7), (5, 6), (10, 14), (1, 2, 3))

[0264] ((3, 7), (10, 14), (1, 2, 3), (5, 6, 7))

[0265] ((5, 6), (5, 7), (10, 14), (1, 2, 3))

[0266] ((5, 6), (6, 7), (10, 14), (1, 2, 3))

[0267] ((5, 6), (10, 14), (1, 2, 3), (2, 3, 7))

[0268] ((5, 6), (10, 14), (1, 2, 3), (2, 6, 7))

[0269] ((5, 6), (10, 14), (1, 2, 3), (3, 6, 7))

[0270] ((5, 6), (10, 14), (1, 2, 3), (5, 6, 7))

[0271] ((5, 6), (10, 14), (1, 2, 3), (3, 6, 7))

[0272] ((5, 6), (10, 14), (1, 2, 3), (5, 6, 7))

[0273] ((5, 6), (10, 14), (1, 2, 3), (2, 3, 6, 7))

[0274] ((5, 7), (6, 7), (10, 14), (1, 2, 3))

[0275] ((5, 7), (10, 14), (1, 2, 3), (2, 3, 6))

[0276] ((5, 6), (10, 14), (1, 2, 3), (2, 3, 6, 7))

[0277] ((5, 7), (6, 7), (10, 14), (1, 2, 3))

[0278] ((5, 7), (10, 14), (1, 2, 3), (2, 3, 6))

[0279] ((5, 7), (10, 14), (1, 2, 3), (2, 6, 7))

[0280] ((5, 7), (10, 14), (1, 2, 3), (2, 6, 7))

[0281] ((5, 7), (10, 14), (1, 2, 3), (3, 6, 7))

[0282] ((5, 7), (10, 14), (1, 2, 3), (3, 6, 7))

[0283] ((5, 7), (10, 14), (1, 2, 3), (5, 6, 7))

[0284] ((5, 7), (10, 14), (1, 2, 3), (2, 3, 6, 7))

[0285] ((5, 7), (10, 14), (1, 2, 3), (5, 6, 7))

[0286] ((5, 7), (10, 14), (1, 2, 3), (2, 3, 6, 7))

[0287] ((6, 7), (10, 14), (1, 2, 3), (5, 6, 7))

[0288] ((6, 7), (10, 14), (1, 2, 3), (5, 6, 7))

[0289] ((10, 14), (1, 2, 3), (2, 3, 6), (5, 6, 7))

[0290] ((10, 14), (1, 2, 3), (2, 3, 7), (5, 6, 7))

[0291] ((10, 14), (1, 2, 3), (2, 6, 7), (5, 6, 7))

[0292] ((10, 14), (1, 2, 3), (3, 6, 7), (5, 6, 7))

[0293] ((10, 14), (1, 2, 3), (5, 6, 7), (2, 3, 6, 7))

[0294] Step 6. With the constraints of balanced flow rate ratios between phases in the same signal stage, not too small flow rate ratios of overlapping phases in each signal stage, and balanced number of entrance and exit lanes in the signal stage, and the objective function of minimizing the product of the sum of the flow rate ratios of the key phases in each signal stage and the number of signal stages, find the optimal phase plan from all feasible phase plans.

[0295] All feasible phase solutions with non-infinite scores and their scores are as follows:

[0296] ((5,), (1, 2), (10, 14), (2, 3, 6, 7)) Rating: 4.62

[0297] ((5,), (10, 14), (1, 2, 3), (2, 6, 7)) Rating: 4.62

[0298] ((5,), (10, 14), (1, 2, 3), (2, 3, 6, 7)) Rating: 4.62

[0299] ((1, 2), (5, 7), (10, 14), (2, 3, 6)) Rating: 4.62

[0300] ((2, 6), (5, 7), (10, 14), (1, 2, 3)) Rating: 4.62

[0301] ((5, 7), (10, 14), (1, 2, 3), (2, 3, 6)) Rating: 4.62

[0302] The above six solutions have the same score and can all be used as the optimal phase solution. In this example, ((5,), (1, 2), (10, 14), (2, 3, 6, 7)) is selected as the optimal phase solution.

[0303] Step 7. Take the full arrangement of each signal phase in the optimal phase solution as all feasible phase sequence solutions, and enumerate and find the phase sequence solution with the shortest total green interval time as the optimal phase sequence solution.

[0304] Step 7-1) The total number of phase sequence schemes for the optimal phase scheme is Species, as follows:

[0305] ((5,), (1, 2), (10, 14), (2, 3, 6, 7))

[0306] ((5,), (1, 2), (2, 3, 6, 7), (10, 14))

[0307] ((5,), (10, 14), (1, 2), (2, 3, 6, 7))

[0308] ((5,), (10, 14), (2, 3, 6, 7), (1, 2))

[0309] ((5,), (2, 3, 6, 7), (1, 2), (10, 14))

[0310] ((5,), (2, 3, 6, 7), (10, 14), (1, 2))

[0311] Step 7-3) The total green interval time of each phase sequence scheme is:

[0312] ((5,), (1, 2), (10, 14), (2, 3, 6, 7)) Total green interval time: 26.0

[0313] ((5,), (1, 2), (2, 3, 6, 7), (10, 14)) Total green interval time: 21.0

[0314] ((5,), (10, 14), (1, 2), (2, 3, 6, 7)) Total green interval time: 25.0

[0315] ((5,), (10, 14), (2, 3, 6, 7), (1, 2)) Total green interval time: 26.0

[0316] ((5,), (2, 3, 6, 7), (1, 2), (10, 14)) Total green interval time: 24.0

[0317] ((5,), (2, 3, 6, 7), (10, 14), (1, 2)) Total green interval time: 22.0

[0318] Step 7-4) The total green interval time of the phase sequence scheme ((5,), (1, 2), (2, 3, 6, 7), (10, 14)) is the shortest, which is 21 seconds. This scheme is selected as the optimal phase sequence scheme, where phase 2 is the overlap phase of signal phase 2 and signal phase 3.

[0319] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0320] The above are only preferred embodiments 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 technical principles of the present invention. These improvements and modifications should also be regarded as within the scope of protection of the present invention.

Claims

1. A phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase, characterized in that: The following steps are involved: S1. Collect at least one week of intersection peak hour traffic flow data and take the average flow rate of each phase; The phase refers to the period in which one or more traffic flows obtain exactly the same signal light color display at any time within a signal cycle, and the continuous time sequence in which they obtain different light colors is called a signal phase; S2. traverse the lane functions of each lane, generate a Bezier curve from the end point of the entrance lane to the starting point of the exit lane to represent the corresponding vehicle flow trajectory, and find the conflict points between all vehicle flow trajectories; S3. Calculate the green interval matrix between each phase according to the conflict point of the traffic trajectory; S4. Enumerate and search for all feasible basic signal stages, where a feasible basic signal stage means that the vehicle flow trajectories of any two phases in each basic signal stage do not conflict; The signal phase refers to the change of the right of way in the intersection affected by the signal control, and each change is called a signal phase; S5. enumerate and combine a specified number of non-repeating basic signal phases, and if the basic signal phase combination includes all phases of the intersection, define it as a feasible phase solution; S6. With the constraints of balanced flow rate ratios between phases in the same signal stage, not too small flow rate ratios of overlapping phases in each signal stage, and balanced number of entrance and exit lanes in the signal stage, and the objective function of minimizing the product of the sum of flow rate ratios of key phases in each signal stage and the number of signal stages, find the optimal phase plan from all feasible phase plans; The step S6 specifically comprises the following steps: S61. Count the number of times each phase is allowed to pass in the phase scheme, denoted as A = {a1, a2, ..., a M }; S62. The flow rate ratio of phase m is y m =v m / (a m *c m ), where v m represents the total flow of each lane in phase m, c m represents the total capacity of each lane in phase m; S63. If the number of allowed releases for phase m is a m >1 and the flow rate ratio of phase m is y m <0.3, the flow rate ratio of phase m is considered to be less than the minimum setting threshold of the overlapping phase, but it is still set as the overlapping phase; The maximum and minimum flow rate ratios of each phase in signal stage n are and like and And the phase with the largest flow rate ratio in signal phase n allows the number of releases a n，max =1, it is considered that there is an imbalance in the flow rate ratio between phases in the signal stage n; S64. Record the number of entry lanes allowed to be released in signal stage n and the corresponding number of exit lanes respectively. and like It is considered that there are too many released lanes in signal stage n; S65. If the phenomenon of step S63 occurs in any phase of the phase scheme, or the phenomenon of step S64 occurs in any signal stage, the score of the phase scheme is infinite; S66. The sum of the key phase flow rate ratios of each signal stage in the phase scheme is The score of this phase scheme is Y*N; S67. Traverse all feasible phase solutions, calculate the score of each phase solution, and select the phase solution with the smallest score as the optimal phase solution; S7. Take the full arrangement of each signal phase in the optimal phase scheme as all feasible phase sequence schemes, and enumerate and search for the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme.

2. The phase sequence scheme design method satisfying the equalization constraint of each flow direction in the same phase according to claim 1 is characterized in that: In step S2, the lane functions of each lane are traversed, a Bezier curve from the end point of the entrance lane to the start point of the exit lane is generated to represent the corresponding vehicle flow trajectory, and the conflict points between all vehicle flow trajectories are found, which specifically include the following steps: S21. The coordinates of the end point of entry channel i are The starting point coordinates of the exit road corresponding to the jth turn of the entrance road are S22. If the jth turn is straight ahead, then and Linear interpolation is performed between the two values ​​to generate the trajectory of straight traffic flow; S23. If the jth turn is a left turn or a right turn, the coordinates of the intersection of the entrance lane i and the corresponding exit lane are used as the intermediate reference point; if the jth turn is a U-turn, the center point of the intersection is used as the intermediate reference point; the intermediate reference point is recorded as (lon i，j ,lat i，j ); S24. Take the number of interpolation points of the Bezier curve U = 100, and take the control points of the Bezier curve as S25. The coordinates of the u-th interpolation point are as follows. The coordinates of each interpolation point are calculated to generate a vehicle flow trajectory. S26. Calculate all traffic trajectories of each lane and find conflicting points of the traffic trajectories.

3. A phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase according to claim 2, characterized in that: The step S3 in which the green interval matrix between each phase is calculated according to the conflict point of the vehicle flow trajectory specifically includes the following steps: S31. The set of lanes controlled by phase i is PL i = {pl i，1 ,pl i，2 , ..., pl i，n }; S32. If the p-th vehicle flow trajectory traj of the n-th lane in phase i i，n，p and the qth vehicle flow trajectory traj of the mth lane in phase j j,m,q If there is no conflict point, the vehicle flow trajectory traj i，n，p and traffic trajectory j,m,q The green interval time is GI inp，jmq =0; S33. If traj i，n，p With traj j，m，q There is a conflict point, record the conflict point to lane pl i，n The distance from the conflict point to the lane pl is the clearing distance SC, and the distance from the conflict point to the lane pl is the clearing distance SC. j，m The distance is the driving distance SE, then the vehicle flow trajectory traj i，n，p and traffic trajectory j，m，q The green interval time is GI inp，jmq =3+(SC+7) / 6-SE / 11; S34. Calculate the green interval time of each vehicle flow trajectory in phase i and each vehicle flow trajectory in phase j, and take the maximum value as the green interval time GI between phase i and phase j i，j .

4. A phase sequence scheme design method that satisfies the equalization constraint of each flow direction in the same phase according to claim 3, characterized in that: The step S4 of enumerating and searching for all feasible basic signal stages to ensure that the vehicle flow trajectories of any two phases in each basic signal stage do not conflict specifically includes the following steps: S41. The number of phases allowed to be released during the basic signal stage is m, and m is incremented from 1 until the number of all phases at the intersection is M, and steps S42 to S44 are executed in a loop; S42. m non-repeating phases are selected from all phases of the intersection. If the m phases do not include all evergreen phases or any non-evergreen phases, they cannot constitute a feasible basic signal phase. S43. If there are two phases in the m phases whose vehicle flow trajectories conflict, they cannot constitute a feasible basic signal phase; S44. Enumerate all combinations of m non-repeating phases and extract feasible basic signal phases therefrom.

5. A phase sequence scheme design method satisfying the equalization constraint of each flow direction in the same phase according to claim 4, characterized in that: In step S5, a specified number of non-repeating basic signal phases are enumerated and combined. If the basic signal phase combination includes all phases of the intersection, it is defined as a feasible phase scheme, which specifically includes the following steps: S51. Let the number of signal stages in the phase scheme be N, and let N be the minimum number of signal stages N. min Increment the value until the maximum signal stage number N max , loop through step S52 to step S53; S52. Take out N non-repeating basic signal stages from all basic signal stages. If these N non-repeating basic signal stages include all phases of the intersection, they are considered to be feasible phase solutions. S53. Traverse and enumerate all combinations of N non-repetitive basic signal phases, and extract feasible phase solutions therefrom.

6. A phase sequence scheme design method satisfying the equalization constraint of each flow direction in the same phase according to claim 5, characterized in that: The enumeration and search of the phase sequence scheme with the shortest total green interval time as the optimal phase sequence scheme in step S7 specifically includes the following steps: S71. The signal phase set included in the optimal phase solution is {S1, S2, ...S N }, the total number of its permutations is Phase sequence scheme; S72. Let a phase sequence scheme be [S1, S2, ...S N ], where the signal phase S n Including P phases, that is Signal Phase S n+1 Including Q phases, that is Signal acquisition stage S n Each phase to signal stage S n+1 The maximum value of the green interval time of each phase is taken as the green interval time of two adjacent signal stages: S73. The total green interval time of the phase sequence scheme is S74. Calculate the total green interval time of all phase sequence schemes, and select the phase sequence scheme with the smallest total green interval time as the optimal phase sequence scheme.

Images