TWI704533B - A method for dividing the traffic network by origin-destination tree(od-tree) - Google Patents

A method for dividing the traffic network by origin-destination tree(od-tree) Download PDF

Info

Publication number
TWI704533B
TWI704533B TW108112797A TW108112797A TWI704533B TW I704533 B TWI704533 B TW I704533B TW 108112797 A TW108112797 A TW 108112797A TW 108112797 A TW108112797 A TW 108112797A TW I704533 B TWI704533 B TW I704533B
Authority
TW
Taiwan
Prior art keywords
traffic
network
intersection
tree
ending
Prior art date
Application number
TW108112797A
Other languages
Chinese (zh)
Other versions
TW201928904A (en
Inventor
曾明德
Original Assignee
創新交通科技有限公司
曾明德
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 創新交通科技有限公司, 曾明德 filed Critical 創新交通科技有限公司
Priority to TW108112797A priority Critical patent/TWI704533B/en
Publication of TW201928904A publication Critical patent/TW201928904A/en
Priority to CN202010278741.1A priority patent/CN111583629B/en
Application granted granted Critical
Publication of TWI704533B publication Critical patent/TWI704533B/en

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125—Traffic data processing
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/065—Traffic control systems for road vehicles by counting the vehicles in a section of the road or in a parking area, i.e. comparing incoming count with outgoing count

Abstract

The invention is a method for dividing the traffic network by origin-destination tree(OD-Tree), and providing a structure of origin-destination tree(OD-Tree). According to the parameters of analyzing the traffic network, including the traffic flow ratio, the stop queue length, or origin-destination trip(OD-Trip), the traffic network is divided into at least one OD-Tree. The invention provides a new method of dividing traffic network. After the traffic network is divided into the origin-destination tree(OD-Tree), the regional barrier obstacle can be eliminated, the traffic flow blocking can be reduced. The origin-destination tree(OD-Tree) can be further divided into upstream, midstream and downstream groups to effectively apply in the development of the traffic control strategy, improve the continuity of traffic flow, and improve the coordination of traffic flow.

Description

以起訖旅次樹劃分交通路網的方法 The method of dividing the traffic road network by starting and ending journey trees

本發明係為一種提供一起訖旅次樹結構，將交通路網劃分為起訖旅次樹的方法，特別是指能有效應用在交通控制的起訖旅次樹。 The present invention is a method for providing a travel sub-tree structure and dividing a traffic road network into travel sub-trees, in particular to a travel sub-tree that can be effectively applied to traffic control.

目前劃分交通路網的方法有二種，第一種為將交通路網劃分為至少一路口群組，請參照第一圖，透過步驟S50係先透過地理特性與特別行政區的劃分，參照第二圖，於該路網10中找出至少一交通控制區域20、22。接續 There are currently two ways to divide the traffic network. The first is to divide the traffic network into at least one intersection group. Please refer to the first figure. Through step S50, the division of geographical features and special administrative regions is first performed. Refer to the second In the figure, at least one traffic control area 20, 22 is found in the road network 10. Continue

步驟S52，蒐集並檢核該交通控制區域的靜態屬性資料，包括兩相鄰路口的路段長度、道路環境因素及車流方向，以初步將該交通路網分類為至少一路口群組。 Step S52: Collect and check the static attribute data of the traffic control area, including the length of two adjacent intersections, road environmental factors, and traffic direction to preliminarily classify the traffic network into at least one intersection group.

檢核該路段長度，當該路段長度大於臨界長度600公尺時則代表行駛於兩相鄰路口間的車隊已經擴散不再形成車隊，則該兩相鄰路口可不劃分為同一路口群組。 Check the length of the road section. When the length of the road section is greater than the critical length of 600 meters, it means that the convoy driving between two adjacent intersections has spread and no longer forms a convoy, and the two adjacent intersections may not be divided into the same intersection group.

檢核道路環境因素，當該交通控制區域的至少一路口的道路使用型態與道路幾何配置、至少一路段的道路使用型態與道路幾何配置差異過大，則該路口或路段可不劃分為同一路口群組。 Check the road environment factors. When the road usage pattern and road geometric configuration of at least one intersection of the traffic control area, and the road usage pattern and road geometric configuration of at least one section of the traffic control area are too different, the intersection or road section may not be divided into the same intersection Group.

檢核車流方向的原因係為不同車流方向的路段會使用不同的控制目標，例如：單行道系統以單一車流方向的最大車輛通過量為其目標；而雙向車道系統則須考慮雙向車流方向的最小負效用績效值為控制目標，因此不同的車流方向可不劃分為同一路口群組。接續 The reason for checking the direction of traffic flow is that sections in different directions of traffic flow will use different control targets. For example, the one-way system takes the maximum vehicle throughput in a single traffic direction as its target; while the two-way lane system must consider the minimum of the two-way traffic direction. The negative utility performance value is the control target, so different traffic directions can not be divided into the same intersection group. Continue

步驟S54，再利用動態原則分析進行該路口群組的檢視及修正， 以得到最終的該路口群組30、32、34、36。 Step S54, using dynamic principle analysis to review and modify the intersection group, To get the final intersection group 30, 32, 34, 36.

該動態原則分析資料包括旅行速率及車流轉向流量比率，利用該旅行速率與該車流轉向流量比率來檢視該交通控制區域中車流的情況，旅行速率相近的路段可將該路段相鄰的路口劃為同一路口群組，車流轉向流量比率係指該路段之特定時段中所有車輛流動於該路口時，該特定時段中各流動方向之車輛數占該路段所有車輛之比率，值越大則表示鄰近路段間之關係越密切，大部分的車流量由該路段所而來，可將該路段的相鄰路口劃為同一路口群組。 The dynamic principle analysis data includes travel rate and traffic turning flow ratio. Use the travel rate and the traffic turning flow ratio to examine the traffic flow in the traffic control area. Road sections with similar travel speeds can be classified as adjacent intersections. For the same intersection group, the ratio of traffic turning flow refers to the ratio of the number of vehicles in each flow direction to all vehicles on the road section when all vehicles flow at the intersection in a specific time period of the road section. The larger the value, the adjacent road section. The closer the relationship is, the most of the traffic flow comes from the road section, and the adjacent intersections of the road section can be classified into the same intersection group.

第二種劃分交通路網的方法係為將該交通路網劃分為至少一幹道車流路徑，該幹道車流路徑係為至少一路段或至少一路口組成的一起訖路徑(Origin-Destination Path)，該幹道車流路徑可以為轉彎路徑，亦可以一直線路徑。請參照第三圖與第四圖，透過步驟S60蒐集該交通路網10至少一特定時段的至少一路口的車流轉向流量比率，該車流轉向流量比率，如同第一種分類交通路網方式的動態原則分析，採用車流轉向流量比率，計算在該特定時段中各流動方向之車輛數占該路段所有車輛之比率，值越大則表示鄰近路段間之關係越密切。接續 The second method of dividing the traffic road network is to divide the traffic road network into at least one trunk road traffic path. The trunk road traffic path is an Origin-Destination Path composed of at least one section or at least one exit. The main road traffic path can be a turning path or a straight path. Please refer to the third and fourth diagrams to collect the traffic turning flow rate of at least one intersection of the traffic network 10 during at least one specific period of time through step S60. The traffic turning flow rate is similar to the dynamics of the first traffic network classification method. Principle analysis, using the ratio of vehicle flow to turn flow to calculate the ratio of the number of vehicles in each direction to all vehicles on the road segment during the specific time period. The larger the value, the closer the relationship between adjacent road segments. Continue

步驟S62於該特定時段的該路口中找出該路口最大車流轉向流量比率，該最大車流轉向流量比率的轉向方向係為該路口的主要車流轉向方向。接續步驟S64，找出至少一路口的主要車流轉向方向後，透過該路口與主要車流轉向方向的路段串接相連後，係為該交通路網的幹道車流路徑40、42、44。 Step S62 finds the maximum turning flow rate of traffic flow at the intersection in the specific time period, and the turning direction of the maximum turning flow rate is the main turning direction of the traffic flow at the intersection. Following step S64, after finding the main traffic turning direction of at least one intersection, after connecting in series with the road section of the main traffic turning direction through the intersection, it is the arterial traffic flow path 40, 42, 44 of the traffic network.

第一種劃分交通路網方法將路網劃分為至少一路口群組，該路口群組會因該交通路網劃分為至少一交通控制區域而產生交通控制區域之間的區域邊界阻隔障礙；接續在該交通控制區域中劃分為至少一路口群組，亦可能在劃分於不同的交通控制區域中的相鄰路口群組間有車流阻斷情形。 The first method of dividing the traffic road network divides the road network into at least one intersection group, and the intersection group will cause the regional boundary barrier between the traffic control areas due to the division of the traffic road network into at least one traffic control area; The traffic control area is divided into at least one intersection group, and there may also be traffic blockage between adjacent intersection groups divided in different traffic control areas.

第二種劃分交通路網方法雖直接劃分該交通路網為至少一幹道 車流路徑以減少車流阻斷情形，但該幹道車流路徑僅考慮到主要車流轉向方向，故將交通路網劃分為幹道車流路徑確實可提高車流的連貫性，卻忽略其他車流轉向方向的車流狀況。 Although the second method of dividing the traffic network directly divides the traffic network into at least one trunk road The traffic flow path is used to reduce the blocking of traffic flow, but the main road traffic flow path only considers the main traffic flow direction. Therefore, dividing the traffic network into the main road traffic flow path can indeed improve the continuity of the traffic flow, but ignores the traffic flow conditions in other directions.

有鑑於此，本發明遂針對上述習知技術之缺失，提出一起訖旅次樹路網結構，將該交通路網直接劃分為至少一起訖旅次樹，消除區域阻隔障礙、減少車流阻斷情形，並考量該起訖旅次樹的各車流轉向方向，除了考慮到其他車流轉向方向的車流狀況，並增加各車流轉向方向的協調性，故本發明以有效克服上述之該等問題。 In view of this, the present invention addresses the deficiencies of the above-mentioned conventional technologies, and proposes a road network structure of a trip tree, which directly divides the traffic road network into at least one trip tree to eliminate regional barriers and reduce traffic blockage. , And considering the turning directions of the traffic flow of the starting and ending trip tree, in addition to considering the traffic conditions of other turning directions of the traffic flow, and increasing the coordination of the turning directions of the traffic flow, the present invention effectively overcomes the above-mentioned problems.

本發明之主要目的係提供一起訖旅次樹結構，可以將交通路網劃分為起訖旅次樹的方法，透過將該交通路網劃分為起訖旅次樹的結構，以消除區域阻隔障礙、減少車流阻斷情形，該起訖旅次樹可以考量到各車流轉向方向，以有效應用在研擬交通控制策略，提高車流協調性。 The main purpose of the present invention is to provide a method for dividing the traffic network into the starting and ending sub-trees, and to eliminate the regional barriers and reduce the obstacles by dividing the traffic network into the starting and ending sub-trees. In the case of traffic interruption, the starting and ending trip tree can consider the direction of each traffic flow, so as to effectively apply to the research and development of traffic control strategies and improve the coordination of traffic flow.

本發明之另一目的係提供一起訖旅次樹結構，可以將交通路網劃分為起訖旅次樹的方法，透過將該交通路網劃分為起訖旅次樹的結構，以消除區域阻隔障礙、減少車流阻斷情形，該起訖旅次樹亦可以考量到各車流轉向方向，提高車流協調性，且可再將該起訖旅次樹針對不同的車流特性切分為上、中、下游群組，將葉節點(Leaf Node)端區域的至少一車流路徑切分為上游群組；車流屬通過路徑的至少一車流路徑切分為中游群組；匯聚至瓶頸路口的至少一車流路徑切分為下游群組，以有效應用在研擬交通控制策略，提高車流連貫性。 Another object of the present invention is to provide a method for dividing the traffic road network into the starting and ending sub-trees structure to eliminate the regional barriers by dividing the traffic network into the starting and ending sub-tree structures. To reduce traffic interruption, the starting and ending trip tree can also consider the direction of each traffic flow to improve the coordination of traffic flow, and the starting and ending trip tree can be divided into upper, middle and downstream groups according to different traffic characteristics. At least one vehicle flow path in the leaf node end area is divided into upstream groups; at least one vehicle flow path that is a passing path is divided into midstream groups; at least one vehicle flow path converging to a bottleneck junction is divided into downstream groups Groups are used to effectively apply traffic control strategies to improve the continuity of traffic flow.

為達上述之目的，本發明係提供一起訖旅次樹結構，應用車流轉向流量比率、停等車隊長度或起訖旅次量等分析交通路網的參數，將該交通路網劃分為至少一起訖旅次樹。 In order to achieve the above-mentioned purpose, the present invention provides a trip-time tree structure, which analyzes the parameters of the traffic road network using the ratio of traffic flow, the length of the parked fleet, or the number of trips, and divides the traffic road network into at least one trip. Travel time tree.

另外，本發明係提供一起訖旅次樹結構，應用車流轉向流量比 率、停等車隊長度或起訖旅次量等可分析交通路網的參數，即可以將該交通路網劃分成至少一起訖旅次樹，並可再將該起訖旅次樹針對不同的車流特性切分為上、中、下游群組，以有效應用在研擬交通控制策略。 In addition, the present invention provides a trip tree structure together, using the traffic flow ratio Analyze the parameters of the traffic network such as speed, parking fleet length or the number of departure and departure trips, that is, the traffic network can be divided into at least one trip trip tree, and then the trip trip tree can be targeted to different traffic flow characteristics Divide into upper, middle and downstream groups for effective application in the development of traffic control strategies.

為達到上述之目的，本發明係提供一起訖旅次樹結構，應用車流轉向流量比率、停等車隊長度或起訖旅次量等可分析交通路網的參數，將該交通路網劃分為至少一起訖旅次樹，該起訖旅次樹再針對不同的車流特性切分為上、中、下游群組。 In order to achieve the above-mentioned purpose, the present invention provides a trip schedule tree structure, which can analyze the parameters of the traffic network by using the traffic turning flow rate, the length of the parked fleet, or the number of trips to divide the traffic network into at least one The starting and ending journey tree, the starting and ending journey tree is divided into upper, middle and downstream groups according to different traffic characteristics.

其中，劃分交通路網為至少一起訖旅次樹可應用的參數有三種，第一種係為「車流轉向流量比率」，該車流轉向流量比率的意思係各臨近路段之各轉向方向的車流轉向流量與其總車流量之百分比，蒐集該交通路網至少一特定時段的至少一路口的各方向車流轉向流量比率，接著參照第六圖，找出該交通路網至少一瓶頸路口與至少一路口的大於設定門檻值的車流轉向流量比率之轉向方向，以得到至少一多車流路徑，該設定門檻值由交通規劃師訂定或採用預設值15%，將該多車流路徑串接成型，即可劃分該交通路網為至少一起訖旅次樹。 Among them, there are three applicable parameters for dividing the traffic network into at least one trip tree. The first is the "vehicle turning flow rate". The meaning of the traffic turning flow rate is the turning of the traffic in each direction of each adjacent section. Percentage of traffic volume to total traffic volume, collect the traffic turning flow ratios of at least one intersection in at least one specific period of the traffic network, and then refer to Figure 6 to find out the difference between at least one bottleneck intersection and at least one intersection of the traffic network The turning direction of the traffic flow rate greater than the set threshold value to obtain at least one multi-vehicle flow path. The set threshold value is set by the traffic planner or the preset value 15% is adopted. The multi-vehicle flow path is formed in series. Divide the traffic road network into at least one trip tree.

第二種係為「停等車隊長度」，該停等車隊長度的意思係因號誌或路況影響產生最長車隊的總停等車輛數，可依經驗推估或調查該交通路網至少一特定時段的至少一路段的停等車隊長度，接著參照第六圖，根據停等車隊的主要停等方向與次要停等方向，以找出該路網至少一瓶頸路口與至少一多車流路徑，將該多車流路徑串接成型，即可劃分該路網為至少一起訖旅次樹。 The second type is "the length of the parked fleet". The length of the parked fleet means the total number of parked vehicles in the longest fleet due to the influence of signs or road conditions. At least one specific traffic network can be estimated or investigated based on experience. The length of the parking fleet for at least one section of the time period, and then referring to the sixth figure, according to the main parking direction and the secondary parking direction of the parking fleet, to find at least one bottleneck intersection and at least one multi-vehicle flow path of the road network, By concatenating the multi-vehicle flow paths, the road network can be divided into at least one trip tree.

第三種係為「起訖旅次量」，該起訖旅次量的意思係為一出發地點(起點Origin)至一目的地點(迄點Destination)所產生的車流量，依所蒐集到該交通路網的至少一起訖旅次量，找出該交通路網起訖旅次量最大的迄點路口，該起訖旅次量最大的迄點路口係為瓶頸路口，從該瓶頸路口回溯串接鄰近路口的 起訖旅次量仍佔瓶頸路口的起訖旅次量大於設定門檻值比率，該設定門檻值由交通規劃師訂定或採用預設值15%，可劃分該交通路網為至少一起訖旅次樹。 The third type is "start and end trips", which means the amount of traffic generated from a departure point (origin) to a destination point (destination), according to the collected traffic route At least one trip number of the network, find the intersection with the largest number of start and end trips of the traffic network, the end intersection with the largest number of start and end trips is the bottleneck intersection, and trace back from the bottleneck intersection to the adjacent intersection. Starting and ending trips still account for the bottleneck intersection. The starting and ending trips are greater than the set threshold ratio. The set threshold is set by the traffic planner or a default value of 15%. This traffic network can be divided into at least one trip tree .

接續應用該起訖旅次樹，將該起訖旅次樹針對不同的車流特性切分為上、中、下游群組，將葉節點(Leaf Node)端區域的至少一車流路徑切分為上游群組；車流屬通過路徑的至少一車流路徑切分為中游群組；匯聚至瓶頸路口的至少一車流路徑切分為下游群組。 Continue to apply the start and end travel sub-trees, divide the start and end travel sub-trees into upper, middle, and downstream groups for different traffic characteristics, and cut at least one vehicle flow path in the leaf node end area into upstream groups ; At least one vehicle flow path that belongs to the passing path is divided into a midstream group; at least one vehicle flow path converging to a bottleneck intersection is divided into a downstream group.

該葉節點端係為在樹狀結構中，指一分支的最後的一個節點，而葉節點端區域係為包含該葉節點的鄰近點皆包含在內稱為一葉節點端區域。 The leaf node end system refers to the last node of a branch in the tree structure, and the leaf node end area is a leaf node end area including all adjacent points of the leaf node.

底下藉由具體實施例詳加說明，當更容易瞭解本發明之目的、技術內容、特點及其所達成之功效。 Detailed descriptions are given below by specific embodiments, so that it will be easier to understand the purpose, technical content, features, and effects of the present invention.

10:路網 10: Road network

20、22:交通控制區域 20, 22: Traffic control area

30、32、34、36:路口群組 30, 32, 34, 36: intersection group

40、42、44:幹道車流路徑 40, 42, 44: main road traffic path

50、52:起訖旅次樹 50, 52: The Tree

60:上游群組 60: Upstream group

70:中游群組 70: Midstream Group

80:下游群組 80: Downstream group

第一圖係為習知將交通路網劃分為路口群組的步驟流程圖。 The first figure is a flow chart of the conventional steps for dividing the traffic network into intersection groups.

第二圖係為習知將交通路網劃分為路口群組的示意圖。 The second figure is a schematic diagram of conventionally dividing the traffic network into intersection groups.

第三圖係為習知將交通路網劃分為幹道車流路徑的步驟流程圖。。 The third figure is a flow chart of the conventional steps in dividing the traffic network into arterial traffic paths. .

第四圖係為習知將交通路網劃分為主要車流路徑的示意圖。 The fourth picture is a schematic diagram of the conventional traffic network divided into main traffic paths.

第五圖係為本發明將交通路網劃分為起訖旅次樹的步驟流程圖。 The fifth figure is a flow chart of the steps of dividing the traffic road network into starting and ending travel sub-trees according to the present invention.

第六圖係為本發明將交通路網劃分為起訖旅次樹的示意圖。 The sixth figure is a schematic diagram of the present invention dividing the traffic road network into starting and ending travel sub-trees.

第七圖係為本發明應用交通參數將交通路網劃分為起訖旅次樹的示意圖。 The seventh figure is a schematic diagram of the application of traffic parameters to divide the traffic road network into start and end travel sub-trees.

第八圖係為本發明提供的起訖旅次樹結構。 The eighth figure is the origin and destination trip tree structure provided by the present invention.

請參照第五圖、第六圖與第七圖，說明本發明之劃分交通路網為起訖旅次樹的流程，該劃分交通路網為起訖旅次樹的流程可應用的參數有三 種，第一種係為車流轉向流量比率；第二種係為停等車隊長度；第三種係為起訖旅次量。 Please refer to the fifth, sixth and seventh figures to illustrate the process of dividing the traffic network into the starting and ending travel subtree of the present invention. The process of dividing the traffic network into the starting and ending travel subtree has three applicable parameters. Types, the first type is the ratio of vehicle flow to turn flow; the second type is the length of the waiting fleet; the third type is the number of departure and departure trips.

說明採用第一種參數「車流轉向流量比率」的流程，參照第七圖的圖90，該車流轉向流量比率的意思係各臨近路段之各轉向方向的車流轉向流量與其總車流量之百分比，接著進入步驟S10，參照第六圖，蒐集交通路網10至少一特定時段的至少一路口的各方向車流轉向流量比率，接著步驟S12，分析該交通路網10的至少一路口的車流轉向流量比率，找出該交通路網10至少一瓶頸路口與至少一路口的大於設定門檻值的車流轉向流量比率之轉向方向，以得到至少一多車流路徑，該設定門檻值由交通規劃師訂定或採用預設值15%，接續步驟S14，將該多車流路徑串接成型，即可劃分該交通路網10為至少一起訖旅次樹50、52。 Explain the flow of using the first parameter "vehicle turning flow rate", referring to Figure 90 of the seventh figure, the meaning of the turning flow rate of the traffic flow is the percentage of the turning flow of the turning flow of each turning direction of each adjacent road section to the total traffic flow, and then Proceed to step S10, refer to the sixth figure, collect the traffic turning flow rate of at least one intersection of the traffic network 10 in at least one specific period of time, and then step S12, analyze the traffic turning flow rate of at least one intersection of the traffic network 10, Find out the turning direction of at least one bottleneck intersection and at least one intersection of the traffic network 10 that are greater than the set threshold value of the vehicle flow turning flow ratio to obtain at least one multi-vehicle flow path. The set threshold value is determined by the traffic planner or adopted by the traffic planner. Set the value to 15%, and continue with step S14 to form the multi-vehicle flow paths in series, and then the traffic network 10 can be divided into at least one trip tree 50 and 52.

說明採用第二種參數「停等車隊長度」的流程，參照第七圖的圖92，該停等車隊長度的意思係因號誌或路況影響產生最長車隊的總停等車輛數，接著進入步驟S10，參照第六圖，依經驗推估或調查該交通路網10至少一特定時段的至少一路段的停等車隊長度，接著步驟S12，根據停等車隊的主要停等方向與次要停等方向，找出該交通路網10至少一瓶頸路口與至少一多車流路徑，接續步驟S14，將該多車流路徑串接成型，即可劃分該交通路網10為至少一起訖旅次樹50、52。 Explain the process of using the second parameter "Parking Fleet Length". Refer to Figure 92 in the seventh figure. The length of the parking fleet means the total number of parked vehicles in the longest fleet due to signs or road conditions. Then proceed to step S10, referring to the sixth figure, estimate or investigate the length of the parking fleet of at least one section of the traffic network 10 at least in a specific period of time based on experience, and then step S12, according to the main parking direction and the secondary parking direction of the parking fleet Direction, find at least one bottleneck intersection and at least one multi-vehicle flow path of the traffic road network 10, continue with step S14, connect the multi-vehicle flow paths in series, and then divide the traffic road network 10 into at least one trip tree 50, 52.

說明採用第三種參數「起訖旅次量」的流程，參照第七圖的圖94，該起訖旅次量的意思係為一出發地點(起點Origin)至一目的地點(迄點Destination)所產生的車流量，接著進入步驟S10，參照第六圖，依所蒐集到該交通路網10的至少一起訖旅次量，找出該交通路網10起訖旅次量最大的迄點路口，該起訖旅次量最大的迄點路口係為瓶頸路口，從該瓶頸路口回溯串接鄰近路口的起訖旅次量仍佔瓶頸路口的起訖旅次量大於設定門檻值比率，該設定門 檻值由交通規劃師訂定或採用預設值15%，即可劃分該交通路網10為至少一起訖旅次樹50、52。 Explain the flow of using the third parameter "start and end trip amount", referring to Figure 94 in the seventh figure, the start and end trip amount means a departure point (origin) to a destination point (Destination) Then go to step S10, refer to the sixth figure, and find the intersection with the largest number of trips from the traffic network 10 based on the collected at least one trip of the traffic network 10, the start and end The ending intersection with the largest number of trips is the bottleneck intersection. From the bottleneck intersection, the number of starting and ending trips that are connected to adjacent intersections still accounts for the bottleneck intersection. The number of starting and ending trips is greater than the set threshold. The threshold is set by the traffic planner or a preset value of 15% is used, and the traffic network 10 can be divided into at least one trip tree 50, 52.

接續可應用該起訖旅次樹50、52，將該起訖旅次樹切分為上、中、下游群組，以起訖旅次樹52為例，為了因應該起訖旅次樹52不同的車流特性將切分為上、中、下游群組，分析該起訖旅次樹52，將葉節點(Leaf Node)端區域的至少一車流路徑切分為上游群組60；車流屬通過路徑的至少一車流路徑切分為中游群組70；匯聚至瓶頸路口的至少一車流路徑切分為下游群組80。 The starting and ending travel subtrees 50 and 52 can be used for connection to divide the starting and ending travel subtrees into upper, middle and downstream groups. Take the starting and ending travel subtree 52 as an example, in order to account for the different traffic characteristics of the start and end travel subtree 52 Divide into upper, middle, and downstream groups, analyze the start and end travel subtree 52, and divide at least one vehicle flow path in the leaf node end area into the upstream group 60; the vehicle flow belongs to at least one vehicle flow of the passing path The path is divided into a midstream group 70; at least one vehicle flow path converging to a bottleneck intersection is divided into a downstream group 80.

綜上所述，參考第八圖，其能將交通路網劃分為起訖旅次樹的結構，以消除區域阻隔障礙、減少車流阻斷情形，該起訖旅次樹亦可以考量到各車流轉向方向，提高車流協調性，並再將該起訖旅次樹針對不同的車流特性，切分為上、中、下游群組，以有效應用在研擬交通控制策略，提高車流連貫性。 In summary, referring to the eighth figure, it can divide the traffic road network into the structure of starting and ending travel sub-trees to eliminate regional barriers and reduce traffic blockage. The starting and ending travel sub-trees can also consider the direction of each traffic flow. , Improve the coordination of traffic flow, and divide the starting and ending trip tree into upper, middle, and downstream groups according to different traffic characteristics, so as to effectively apply in the development of traffic control strategies and improve the continuity of traffic flow.

唯以上所述者，僅為本發明之較佳實施例而已，並非用來限定本發明實施之範圍。故即凡依本發明申請範圍所述之特徵及精神所為之均等變化或修飾，均應包括於本發明之申請專利範圍內。 Only the above are merely preferred embodiments of the present invention, and are not used to limit the scope of the present invention. Therefore, all equivalent changes or modifications made in accordance with the characteristics and spirit of the application scope of the present invention shall be included in the patent application scope of the present invention.

S10、S12、S14:步驟 S10, S12, S14: steps

Claims (8)

一種以起訖旅次樹劃分交通路網的方法，其係提供一起訖旅次樹結構，將交通路網劃分為起訖旅次樹的方法，該劃分路網為起訖旅次樹的方法包括下列步驟：蒐集該交通路網至少一特定時段的至少一路口的車流轉向流量比率或停等車隊長度或起訖旅次量，接續；應用該車流轉向流量比率或該停等車隊長度或該起訖旅次量等參數以找出至少一瓶頸路口與至少一多車流路徑，接續；將該多車流路徑串接成型，可劃分該交通路網為至少一起訖旅次樹。 A method for dividing the traffic road network by the start and end travel sub-trees, which provides a structure of the start and end travel sub-trees, and divides the traffic road network into the start and end travel sub-trees. The method of dividing the road network into the start and end travel sub-trees includes the following steps : Collect the traffic turning flow rate or the length of the waiting fleet or the number of starting and ending trips for at least one intersection of the traffic network at least for a specific period of time, and continue; apply the traffic turning flow rate or the length of the stopping fleet or the amount of starting and ending trips Equal parameters to find at least one bottleneck intersection and at least one multi-vehicle flow path, and connect them; the multi-vehicle flow path is formed in series, and the traffic network can be divided into at least one trip tree. 如請求項1所述之以起訖旅次樹劃分交通路網的方法，其中該車流轉向流量比率的意思係各臨近路段之各轉向方向的車流轉向流量與其總車流量之百分比，蒐集該交通路網至少一特定時段的至少一路口的各方向車流流量轉向比率，分析該交通路網的至少一路口的車流轉向流量比率，找出該交通路網至少一瓶頸路口與至少一路口的大於設定門檻值的車流轉向流量比率之轉向方向，以得到至少一多車流路徑，該設定門檻值由交通規劃師訂定或採用預設值15%，將該多車流路徑串接成型，即可劃分該交通路網為至少一起訖旅次樹。 As described in claim 1, the method of dividing the traffic road network by the starting and ending travel subtree, wherein the traffic turning flow rate means the percentage of the turning flow of each turning direction of each adjacent road section to the total traffic flow, and collecting the traffic road Analyze the turning rate of traffic flow in each direction of at least one intersection of the traffic network at least for a specific period of time, analyze the traffic turning flow rate of at least one intersection of the traffic network, and find out that the traffic network has at least one bottleneck intersection and at least one intersection greater than the set threshold The value of the vehicle flow is turned to the direction of the flow rate to obtain at least one multi-vehicle flow path. The set threshold is set by the traffic planner or a preset value of 15%. The multi-vehicle flow path is formed in series to divide the traffic The road network is at least one of the trees. 如請求項1所述之以起訖旅次樹劃分交通路網的方法，其中該停等車隊長度的意思係因號誌或路況影響產生最長車隊的總停等車輛數，依經驗推估或調查該交通路網至少一特定時段的至少一路段的停等車隊長度，根據停等車隊的主要停等方向與次要停等方向，找出該交通路網至少一瓶頸路口與至少一多車流路徑，將該多車流路徑串接成型，即可劃分該交通路網為至少一起訖旅次樹。 As described in claim 1, the method of dividing the traffic road network with the starting and ending trip tree, where the length of the parked fleet means the total number of parked vehicles in the longest fleet due to signs or road conditions. Estimate or investigate based on experience The length of the parking fleet of at least one section of the traffic network at least for a specific period of time, and at least one bottleneck intersection and at least one multi-vehicle flow path of the traffic network are found according to the main parking direction and the secondary parking direction of the parking fleet , The multi-vehicle flow path is formed in series, and the traffic network can be divided into at least one trip tree. 如請求項1所述之以起訖旅次樹劃分交通路網的方法，其中該起訖旅 次量的意思係為一出發地點(起點Origin)至一目的地點(迄點Destination)所產生的車流量，依所蒐集到該交通路網的至少一起訖旅次量，找出該交通路網起訖旅次量最大的迄點路口，該起訖旅次量最大的迄點路口係為瓶頸路口，從該瓶頸路口回溯串接鄰近路口的起訖旅次量仍佔瓶頸路口的起訖旅次量大於設定門檻值比率，該設定門檻值由交通規劃師訂定或採用預設值15%，即可劃分該交通路網為至少一起訖旅次樹。 As described in claim 1, the method of dividing the traffic road network with the starting and ending trip tree, wherein the starting and ending trip The number of times means the traffic flow generated from a departure point (origin) to a destination point (destination), and the traffic network is found based on at least one trip number of the collected traffic network The ending point intersection with the largest number of starting and ending trips, the ending point intersection with the largest amount of starting and ending trips is the bottleneck intersection. From the bottleneck intersection, the amount of starting and ending trips that connect to adjacent intersections still accounts for the bottleneck intersection. Threshold ratio. The set threshold is set by the traffic planner or a default value of 15% is used to divide the traffic network into at least one trip tree. 如請求項1所述之以起訖旅次樹劃分交通路網的方法，其中該起訖旅次樹針對不同的車流特性切分為上、中、下游群組，將葉節點(Leaf Node)端區域的至少一車流路徑切分為上游群組；車流屬通過路徑的至少一車流路徑切分為中游群組；匯聚至瓶頸路口的至少一車流路徑切分為下游群組。 As described in claim 1, the method of dividing the traffic road network by the starting and ending travel sub-tree, wherein the starting and ending travel sub-tree is divided into upper, middle, and downstream groups for different traffic flow characteristics, and the leaf node (Leaf Node) end area At least one vehicle flow path of the vehicle flow is divided into an upstream group; at least one vehicle flow path of a vehicle flow belonging to a passing path is divided into a midstream group; at least one vehicle flow path converging to a bottleneck intersection is divided into a downstream group. 如請求項5所述之以起訖旅次樹劃分交通路網的方法，其中該車流轉向流量比率的意思係各臨近路段之各轉向方向的車流轉向流量與其總車流量之百分比，蒐集該交通路網至少一特定時段的至少一路口的各方向車流流量轉向比率，分析該交通路網的至少一路口的車流轉向流量比率，找出該交通路網至少一瓶頸路口與至少一路口的大於設定門檻值的車流轉向流量比率之轉向方向，以得到至少一多車流路徑，該設定門檻值由交通規劃師訂定或採用預設值15%，將該多車流路徑串接成型，即可劃分該交通路網為至少一起訖旅次樹。 As described in claim 5, the method of dividing the traffic road network with the starting and ending trip subtree, wherein the traffic turning flow rate means the percentage of the turning flow of each turning direction of each adjacent road section to the total traffic flow, and collecting the traffic road Analyze the turning rate of traffic flow in each direction of at least one intersection of the traffic network at least for a specific period of time, analyze the traffic turning flow rate of at least one intersection of the traffic network, and find out that the traffic network has at least one bottleneck intersection and at least one intersection greater than the set threshold The value of the vehicle flow is turned to the direction of the flow rate to obtain at least one multi-vehicle flow path. The set threshold is set by the traffic planner or a preset value of 15%. The multi-vehicle flow path is formed in series to divide the traffic The road network is at least one of the trees. 如請求項5所述之以起訖旅次樹劃分交通路網的方法，其中該停等車隊長度的意思係因號誌或路況影響產生最長車隊的總停等車輛數，依經驗推估或調查該交通路網至少一特定時段的至少一路段的停等車隊長度，根據停等車隊的主要停等方向與次要停等方向，找出該 交通路網至少一瓶頸路口與至少一多車流路徑，將該多車流路徑串接成型，即可劃分該交通路網為至少一起訖旅次樹。 As described in claim 5, the method of dividing the traffic road network by the starting and ending trip tree, where the length of the parked fleet means the total number of parked vehicles in the longest fleet due to signs or road conditions. Estimate or investigate based on experience The length of the parking fleet of at least one section of the traffic network at least for a specific period of time, according to the main parking direction and the secondary parking direction of the parking fleet, find out the At least one bottleneck junction and at least one multi-vehicle flow path are formed in series by connecting at least one bottleneck intersection of the traffic road network to form the traffic road network into at least one trip tree. 如請求項5所述之以起訖旅次樹劃分交通路網的方法，其中該起訖旅次量的意思係為一出發地點(起點Origin)至一目的地點(迄點Destination)所產生的車流量，依所蒐集到該交通路網的至少一起訖旅次量，找出該交通路網起訖旅次量最大的迄點路口，該起訖旅次量最大的迄點路口係為瓶頸路口，從該瓶頸路口回溯串接鄰近路口的起訖旅次量仍佔瓶頸路口的起訖旅次量大於設定門檻值比率，該設定門檻值由交通規劃師訂定或採用預設值15%，即可劃分該交通路網為至少一起訖旅次樹。 As described in claim 5, the method of dividing the traffic road network by the origin and destination trip tree, where the origin and destination trip amount means the traffic flow generated from a departure point (origin) to a destination point (Destination) According to the collected at least one trip of the traffic network, find the intersection with the largest number of start and end trips in the traffic network. The end intersection with the largest number of start and end trips is the bottleneck intersection. The start and end trips of the bottleneck intersection that connect back to the adjacent intersection still account for the rate that the start and end trips of the bottleneck intersection are greater than the set threshold. The set threshold is set by the traffic planner or the default value 15% is used to divide the traffic The road network is at least one of the trees.
TW108112797A 2019-04-12 2019-04-12 A method for dividing the traffic network by origin-destination tree(od-tree) TWI704533B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
TW108112797A TWI704533B (en) 2019-04-12 2019-04-12 A method for dividing the traffic network by origin-destination tree(od-tree)
CN202010278741.1A CN111583629B (en) 2019-04-12 2020-04-10 Method for dividing traffic road network by origin-destination trip tree

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW108112797A TWI704533B (en) 2019-04-12 2019-04-12 A method for dividing the traffic network by origin-destination tree(od-tree)

Publications (2)

Publication Number Publication Date
TW201928904A TW201928904A (en) 2019-07-16
TWI704533B true TWI704533B (en) 2020-09-11

Family

ID=68048688

Family Applications (1)

Application Number Title Priority Date Filing Date
TW108112797A TWI704533B (en) 2019-04-12 2019-04-12 A method for dividing the traffic network by origin-destination tree(od-tree)

Country Status (2)

Country Link
CN (1) CN111583629B (en)
TW (1) TWI704533B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110660233B (en) * 2019-09-30 2021-08-13 山东理工大学 Method for setting optimal signal period calculation of reverse variable lane intersection
CN112950932B (en) * 2021-01-26 2023-05-02 阿里巴巴集团控股有限公司 Method and device for merging regional units and electronic equipment
TWI813043B (en) * 2021-10-21 2023-08-21 曾明德 A Method of Regulating Traffic Congestion Through Origin-Destination Trees
CN114267186A (en) * 2021-12-15 2022-04-01 曾明德 Method for adjusting traffic congestion through origin-destination tree

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7813870B2 (en) * 2006-03-03 2010-10-12 Inrix, Inc. Dynamic time series prediction of future traffic conditions
CN108364467A (en) * 2018-02-12 2018-08-03 北京工业大学 A kind of traffic information prediction technique based on modified decision Tree algorithms

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI410905B (en) * 2008-12-12 2013-10-01 Syscom Comp Engineering Co Method and system for determining vehicle trip
CN104091460B (en) * 2014-06-25 2016-09-14 中国安全生产科学研究院 A kind of evacuation control method for tree net and system
US9558666B2 (en) * 2014-12-02 2017-01-31 Robert Bosch Gmbh Collision avoidance in traffic crossings using radar sensors
CN105894809B (en) * 2014-12-25 2018-03-20 杭州远眺科技有限公司 A kind of segmented urban road traffic state method of estimation
CN105046949A (en) * 2015-06-12 2015-11-11 中南大学 Method for achieving vehicle source prediction by calculating O-D flow based on mobile phone data
CN109584553B (en) * 2018-11-29 2020-09-22 浙江海康智联科技有限公司 Road section relevance missing completion method based on space-time information
CN109544925B (en) * 2018-11-30 2021-07-20 江苏智通交通科技有限公司 Coordination trunk line rationality analysis and coordination mode configuration method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7813870B2 (en) * 2006-03-03 2010-10-12 Inrix, Inc. Dynamic time series prediction of future traffic conditions
CN108364467A (en) * 2018-02-12 2018-08-03 北京工业大学 A kind of traffic information prediction technique based on modified decision Tree algorithms

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
周諺鴻,顏郁航,王志綱,"電信與車輛偵測大數據應用 -高雄市旅運特性分析與易壅塞道路分析",Vol. 45, No. 5 October 2018 土木水利 第四十五卷 第五期 *

Also Published As

Publication number Publication date
CN111583629A (en) 2020-08-25
TW201928904A (en) 2019-07-16
CN111583629B (en) 2021-11-26

Similar Documents

Publication Publication Date Title
TWI704533B (en) A method for dividing the traffic network by origin-destination tree(od-tree)
CN103000027B (en) Intelligent traffic guidance method based on floating car under congestion condition
CN106530694B (en) A kind of traffic congestion prediction technique and system based on traffic congestion propagation model
CN102419905B (en) Traffic-wave theory-based traffic influence area determining method of expressway accidents
CN109887289A (en) A kind of network vehicle flowrate maximization approach of urban traffic network model
CN104778835B (en) High-grade road multi-bottleneck-point congestion evolution space-time range identification method
CN104778834A (en) Urban road traffic jam judging method based on vehicle GPS data
CN104680788B (en) A kind of eco-resi stance computational methods for traffic route selection
CN108122420B (en) Method for setting clearing distance of on-road dynamic bus lane
CN107248299B (en) Special-lane bus priority trunk line coordination control method based on standing time
CN106683450A (en) Recognition method for key paths of urban signal control intersection groups
CN107240264B (en) A kind of non-effective driving trace recognition methods of vehicle and urban road facility planing method
CN104574970A (en) Method for evaluating traffic state in connection position of entrances and exits of urban underground parking lot system
CN107490384A (en) A kind of optimal static path system of selection based on city road network
CN106469507A (en) Dynamic green wave system and method automatically adjusted based on Real-Time Traffic Volume data
CN104464311A (en) City road intersection signal coordination control optimization method
CN106097718A (en) Signal cross port area transit time method of estimation based on gps data
CN107886718A (en) A kind of road condition analyzing method, apparatus and network system
CN104182633B (en) Hierarchical traffic operation evaluation method
CN110211405B (en) Travel path planning method based on traffic information element model
CN106816018A (en) A kind of city changeable-message sign traffic above-ground induction section determines method
CN109147327B (en) Road traffic bottleneck improvement method for urban road and railway crossing part
CN111275989A (en) Single-point signal timing optimization method driven by congestion alarm
CN110211392A (en) A kind of signal priority control method for variable public transport entrance driveway
CN108389405A (en) Road traffic capacity control method