随着城市道路交通的快速发展，日益严峻的交通拥堵、事故等交通管控问题为交警日常勤务工作带来了压力。目前的交警勤务工作中，大多需要在路面配置执勤岗点，并安排警员负责岗点周边区域的排堵保畅、事故处理等工作。常用的岗点部署方法，通常是根据路网规模、关键点分布情况以及警员数量等实际情况，结合勤务工作经验进行岗点排布。但此类方法容易出现岗点安排不合理的情况，岗点覆盖不全、岗点排布过密均会影响警员在现场的勤务工作处理效率，尤其在处理道路拥堵、交通事故等时效性要求较高的勤务工作时，对岗点布设的合理性要求更高。With the rapid development of urban road traffic, increasingly severe traffic congestion, accidents and other traffic management and control issues have put pressure on traffic police's daily duties. In the current traffic police service work, most of them need to configure duty posts on the road surface, and arrange police officers to be responsible for traffic jam prevention and accident handling in the area around the posts. The commonly used post deployment methods are usually based on the actual situation of the road network scale, the distribution of key points and the number of police officers, and the placement of posts based on the work experience. However, this type of method is prone to unreasonable arrangement of posts. Incomplete coverage of posts and densely arranged posts will affect the efficiency of police officers' on-site duty handling, especially when dealing with road congestion and traffic accidents. The higher the duty, the higher the rationality of the placement of posts.

发明内容Summary of the invention

本发明的目的是提供一种城市道路交警执勤岗点配置方法解决现有技术中存在的岗点安排不合理的情况，岗点覆盖不全、岗点排布过密均会影响警员在现场的勤务工作处理效率的问题。The purpose of the present invention is to provide an urban road traffic police duty station configuration method to solve the unreasonable situation in the prior art. The incomplete coverage of the duty stations and the densely arranged positions will affect the police officers on the spot. The efficiency of service work.

本发明的技术解决方案是：The technical solution of the present invention is:

一种城市道路交警执勤岗点配置方法，以路网交通运行实测数据为支撑，对路网做网格化处理，综合考虑岗点对重点关注点的覆盖情况以及警员从岗点至关注点的时间成本，确定路网内的执勤岗点位置；包括以下步骤，An urban road traffic police duty post configuration method, supported by actual measured data of road network traffic operation, gridding the road network, comprehensively considering the coverage of the post to the key points of concern and the police officers from the post to the point of concern Time cost, determine the position of the duty station in the road network; including the following steps,

S1、获取城市路网内各路段的行程时间数据，获取城市路网中的关键点位置信息；S1. Obtain the travel time data of each road segment in the urban road network and obtain the position information of key points in the urban road network;

S2、对城市路网做网格化处理，将关键点对应所属单元作为中心单元c_i，生成路网中心集合C＝{c₁,c₂,...,c_n}，其中i为中心单元序号，n为路网内中心单元数量；S2. Perform grid processing on the urban road network, take the key point corresponding to the unit as the central unit c_i , and generate the road network center set C = {c₁ , c₂ , ..., c_n }, where i is the center Unit number, n is the number of central units in the road network;

S3、对于任一中心单元c_i，将其作为初始起点，遍历与c_i存在共同边界的单元集L1(i)＝{l1₁,...,l1_j,...,l1_k1}中元素，计算其中任一单元l1_j至单元c_i的行程时间TT(l1_j→c_i)，其中k1为与c_i存在共同边界的单元数量，j∈[1,k1]；S3. For any central cell c_i , use it as an initial starting point, and traverse the cell set L1 (i) = {l1₁ , ..., l1_j , ..., l1_k1 } that has a common boundary with c_i Element, calculate the travel time TT (l1_j → c_i ) from any unit l1_j to unit c_i , where k1 is the number of units that share a common boundary with c_i , j∈ [1, k1];

S4、若TT(l1_j→c_i)＜TT₀，其中，TT₀为行程时间临界值，则在单元l1_j中进行行程时间标记；否则，将单元l1_j从单元集L1(i)中删除；S4. If TT (l1_j → c_i ) <TT₀ , where TT₀ is the critical value of the travel time, the travel time is marked in the unit l1_j ; otherwise, the unit l1_{j is} removed from the unit set L1 (i) delete;

S5、检查所有单元集是否均不为空集，若是，则将当前单元集中元素作为新一级遍历的起点，对其中任一单元，将与其存在共同边界且不属于该单元集的相邻单元组成下一级单元集，计算其中任一元素至单元c_i的行程时间；若行程时间低于TT₀，则在单元中标记行程时间，否则将该元素从单元集中删除；重复S5；若所有单元集均为空集，则进入步骤S6；S5. Check whether all cell sets are not empty sets. If so, use the elements in the current cell set as the starting point for a new level of traversal. For any cell, there will be a common boundary with its neighbors that are not part of the cell set. Form the next-level unit set, and calculate the travel time from any element to unit c_i ; if the travel time is less than TT₀ , mark the travel time in the unit, otherwise delete the element from the unit set; repeat S5; if all If the unit sets are all empty sets, go to step S6;

S6、路网中心集合C＝{c₁,c₂,...,c_n}中的任一单元c_i，都在遍历过程中生成了一组多级数据集，组成以c_i为中心的辐射区域A_i，在该区域中的每一单元均标记了到达c_i的行程时间；识别出辐射区域A_i的边界，将所有位于A_i边界的单元组成边界单元集B_i；S6. Any unit c_i in the set C = {c₁ , c₂ , ..., c_n } of the road network center generates a set of multi-level data sets during the traversal process, composed of c_i as the center The radiation area A_i of each cell in the area is marked with the travel time to reach c_i ; the boundary of the radiation area A_i is identified, and all the cells located at the boundary of A_i form the boundary cell set B_i ;

S7、边界单元集合B₁,B₂,...,B_n中的任一边界单元unit_u，u为单元序号，确定其所属的边界单元，并计算其边界叠加数num_is_u，即该单元所属边界单元集合数；若num_is_u＞N₀，则根据unit_u中标记的到各中心单元的行程时间，选出行程时间最小的N₀个作为unit_u的关联中心并组成集合CC_u；其中N₀为单元最大叠加阈值；若num_is_u≤N₀，则将其所有归属边界单元对应的中心作为其关联中心；S7. Any boundary unit unit_u in the boundary unit set B₁ , B₂ , ..., B_n , u is the unit number, determine the boundary unit to which it belongs, and calculate the boundary superposition number num_is_u , that is, the unit The number of boundary unit sets to which it belongs; if num_is_u > N₀ , according to the travel time marked in unit_u to each central unit, the N_{0 with the} smallest travel time are selected as the associated centers of unit_u and form the set CC_u ; N₀ is the maximum stacking threshold of the unit; if num_is_u ≤ N₀ , then the centers corresponding to all its belonging boundary cells are taken as its associated centers;

S8、从关联中心数量最多的单元unit_max开始配置关键点的服务岗点，逐级更新边界单元与关联中心集，为步骤S2的所有中心配置服务岗点。S8. Starting from the unit_max with the largest number of associated centers, configure service posts for key points, update the boundary cell and associated center set step by step, and configure service posts for all centers in step S2.

进一步地，步骤S1中，行程时间数据通过直接估计方式或通过行驶速度间接估计方式得到，其中直接估计方式包括通过号牌识别、RFID检测、GPS定位方式。Further, in step S1, the travel time data is obtained by a direct estimation method or an indirect estimation method by driving speed, where the direct estimation method includes number plate recognition, RFID detection, and GPS positioning method.

进一步地，步骤S8具体为：Further, step S8 is specifically:

S81、从关联中心数量最多的单元unit_max开始配置环节，将该单元作为其关联中心集合CC_max对应岗点；S81, the configuration link starts with the unit_max with the largest number of associated centers, and the unit is used as a post corresponding to its associated center set CC_max ;

S82、检查在以该单元为中心、以r为半径的区域内，是否存在其他边界单元；若存在，则删除其他边界单元以及其关联中心集合；其中r为设置的岗点服务半径长度；S82. Check if there are other boundary cells in the area centered on the cell and r as the radius; if there are, delete the other boundary cells and their associated center sets; where r is the set radius of the post service radius;

S83、其他所有单元的关联中心集均去除CC_max中的元素，更新其他单元的关联中心集；S83. The associated center sets of all other units remove the elements in CC_max , and update the associated center sets of other units;

S84、返回步骤S81，开始新一轮岗点配置与更新，直至所有单元的关联中心集为空集；S84. Return to step S81, and start a new round of post configuration and update until the associated center set of all units is an empty set;

S85、检测步骤S2中的所有关键点是否均配置有岗点，若是，则结束流程；否则，将未配置岗点的关键点组成降级中心集DC，将其中各元素在步骤S6中生成的辐射区域与边界单元集进行更新，更新方法为：对于任一降级中心c_d，原辐射区域A_d与对应边界单元集为B_d，辐射区域更新为

将更新后的辐射区域的边界单元组成更新后的边界单元集B_d’；对于降级中心集DC，返回至步骤S7。S85. Check whether all the key points in step S2 are equipped with post points, and if so, end the process; otherwise, the key points without the post points are formed into a degraded center set DC, and the radiation generated by each element in step S6 The region and the boundary element set are updated by updating the method as follows: For any degraded center c_d , the original radiation area A_d and the corresponding boundary element set are B_d , and the radiation area is updated as

The updated boundary unit of the radiated area is composed of the updated boundary unit set B_d ′; for the degraded center set DC, return to step S7.

进一步地，步骤S81中，若存在多个单元的关联中心数量一致，则从中随机取一单元作为unit_max。Further, in step S81, if the number of associated centers of multiple units is the same, a unit is randomly selected as unit_max .

本发明的有益效果是：该种城市道路交警执勤岗点配置方法，以常发拥堵点、事故黑点等交通管控工作中重点关注的位置为核心，以路网交通运行实测数据为支撑，对路网做网格化处理，综合考虑岗点对重点关注点的覆盖情况以及警员从岗点至关注点的时间成本，确定路网内的执勤岗点位置，并明确每一岗点主要服务区域。该种城市道路交警执勤岗点配置方法，能够改变当前以经验为主的岗点部署方法，使得岗点能够全面覆盖路网所有重点关注点位，在岗点的辐射范围内，将警员到达事件发生位置所需投入的时间成本最小化。The beneficial effect of the present invention is that this method of configuring urban road traffic police duty posts is centered on the locations that are most concerned in traffic management and control such as frequent congestion points and accident black spots, and is supported by actual measured data of road network traffic operations. The road network is grid-processed, comprehensively considering the coverage of the posts to the key points of interest and the time cost of the police officers from the posts to the points of interest, to determine the positions of the duty posts in the road network, and to clarify the main services of each post region. This kind of urban road traffic police duty post configuration method can change the current experience-based deployment method of the post, so that the post can fully cover all key points of attention in the road network, and within the radiation range of the post, the police will arrive at the incident The time cost required to invest in the location is minimized.

附图说明BRIEF DESCRIPTION

图1是本发明实施例城市道路交警执勤岗点配置方法的结构示意图。FIG. 1 is a schematic structural diagram of an urban road traffic police duty station allocation method according to an embodiment of the present invention.

具体实施方式detailed description

下面结合附图详细说明本发明的优选实施例。The preferred embodiments of the present invention will be described in detail below with reference to the drawings.

实施例Examples

一种城市道路交警执勤岗点配置的方法，以路网交通运行实测数据为支撑，对路网做网格化处理，综合考虑岗点对重点关注点的覆盖情况以及警员从岗点至关注点的时间成本，确定路网内的执勤岗点位置；A method for the allocation of duty posts for urban road traffic police, supported by the actual measured data of road network traffic operation, gridding the road network, comprehensively considering the coverage of the posts to the key points of concern and the police officers from the posts to the attention The time cost of the point, determine the position of the duty post in the road network;

如图1，包括以下步骤：As shown in Figure 1, includes the following steps:

S1、获取城市路网内各路段的行程时间数据，实施例中行程时间数据可通过号牌识别、RFID检测、GPS定位等方式直接估计，或通过行驶速度间接估计；在一个实施例中，以一个月内的在早高峰时段的各路段行驶速度实测值作为基础数据，估计路段平均行程时间；获取城市路网中的关键点位置信息，所述关键点是指需要重点关注的路口、路段，包括拥堵常发点、事故黑点等。S1. Obtain the travel time data of each road segment in the urban road network. In the embodiment, the travel time data can be estimated directly by means of number plate identification, RFID detection, GPS positioning, etc., or indirectly estimated by the driving speed; in one embodiment, the The measured values of the driving speed of each road segment in the morning peak period within one month are used as the basic data to estimate the average travel time of the road segment; obtain the location information of key points in the urban road network, the key points refer to the intersections and road segments that need to be focused on, Including frequent points of congestion, black spots of accidents, etc.

S2、对城市路网做网格化处理，实施例中，网格化处理形式包括四边形网格、正六边形蜂窝网格；将关键点对应所属单元作为中心单元c_i，生成路网中心集合C＝{c₁,c₂,...,c_n}，其中i为中心单元序号，n为路网内中心单元数量。S2. Perform grid processing on the urban road network. In the embodiment, the grid processing includes a quadrilateral grid and a regular hexagonal honeycomb grid; the key point corresponding to the unit as the central unit c_i to generate a road network center set C = {c₁ , c₂ , ..., c_n }, where i is the serial number of the central unit and n is the number of central units in the road network.

S3、对于任一中心单元c_i，将其作为初始起点，遍历与c_i存在共同边界的单元集L1(i)＝{l1₁,...,l1_j,...,l1_k1}中元素，计算其中任一单元l1_j至单元c_i的行程时间TT(l1_j→c_i)，其中k1为与c_i存在共同边界的单元数量，j∈[1,k1]。S3. For any central cell c_i , use it as an initial starting point, and traverse the cell set L1 (i) = {l1₁ , ..., l1_j , ..., l1_k1 } that has a common boundary with c_i Element, calculate the travel time TT (l1_j → c_i ) from any unit l1_j to unit c_i , where k1 is the number of units that share a common boundary with c_i , j∈ [1, k1].

S4、若TT(l1_j→c_i)＜TT₀，其中，TT₀为行程时间临界值，则在单元l1_j中进行行程时间标记；否则，将单元l1_j从单元集L1(i)中删除。S4. If TT (l1_j → c_i ) <TT₀ , where TT₀ is the critical value of the travel time, the travel time is marked in the unit l1_j ; otherwise, the unit l1_{j is} removed from the unit set L1 (i) delete.

S5、检查所有单元集是否均不为空集，若是，则将当前单元集中元素作为新一级遍历的起点，对其中任一单元，将与其存在共同边界且不属于该单元集的相邻单元组成下一级单元集，计算其中任一元素至单元c_i的行程时间；若行程时间低于TT₀，则在单元中标记行程时间，否则将该元素从单元集中删除；重复S5；若所有单元集均为空集，则进入步骤S6。S5. Check whether all cell sets are not empty sets. If so, use the elements in the current cell set as the starting point for a new level of traversal. For any cell, there will be a common boundary with its neighbors that are not part of the cell set. Form the next-level unit set, and calculate the travel time from any element to unit c_i ; if the travel time is less than TT₀ , mark the travel time in the unit, otherwise delete the element from the unit set; repeat S5; if all If the cell sets are all empty sets, step S6 is entered.

S6、路网中心集合C＝{c₁,c₂,...,c_n}中的任一单元c_i，都在遍历过程中生成了一组多级数据集，组成以c_i为中心的辐射区域A_i，在该区域中的每一单元均标记了到达c_i的行程时间；识别出辐射区域A_i的边界，将所有位于A_i边界的单元组成边界单元集B_i。S6. Any unit c_i in the set C = {c₁ , c₂ , ..., c_n } of the road network center generates a set of multi-level data sets during the traversal process, composed of c_i as the center The radiation area A_i of each area in the area is marked with the travel time to reach c_i ; the boundary of the radiation area A_i is identified, and all the cells located at the boundary of A_i form the boundary cell set B_i .

S7、边界单元集合B₁,B₂,...,B_n中的任一边界单元unit_u，u为单元序号，确定其所属的边界单元，并计算其边界叠加数num_is_u，即该单元所属边界单元集合数；若num_is_u＞N₀，则根据unit_u中标记的到各中心单元的行程时间，选出行程时间最小的N₀个作为unit_u的关联中心并组成集合CC_u；其中N₀为单元最大叠加阈值；若num_is_u≤N₀，则将其所有归属边界单元对应的中心作为其关联中心。S7. Any boundary unit unit_u in the boundary unit set B₁ , B₂ , ..., B_n , u is the unit number, determine the boundary unit to which it belongs, and calculate the boundary superposition number num_is_u , that is, the unit The number of boundary unit sets to which it belongs; if num_is_u > N₀ , according to the travel time marked in unit_u to each central unit, the N_{0 with the} smallest travel time are selected as the associated centers of unit_u and form the set CC_u ; N₀ is the maximum stacking threshold of the unit; if num_is_u ≤ N₀ , then the centers corresponding to all its belonging boundary cells are taken as their associated centers.

S8、从关联中心数量最多的单元unit_max开始配置关键点的服务岗点，逐级更新边界单元与关联中心集，为步骤S2的所有中心配置服务岗点；具体步骤为：S8. Starting from the unit_max with the largest number of associated centers, configure the service points of key points, update the boundary unit and the set of associated centers step by step, and configure the service points for all centers in step S2; the specific steps are:

S81、从关联中心数量最多的单元unit_max开始配置环节，若存在多个单元的关联中心数量一致，则从中随机取一单元作为unit_max；将该单元作为其关联中心集合CC_max对应岗点。S81. The configuration link starts from the unit_max with the largest number of associated centers. If there are multiple units with the same number of associated centers, a unit is randomly selected as the unit_max ; this unit is used as the corresponding point of its associated center set CC_max .

S82、检查在以该单元为中心、以r为半径的区域内，是否存在其他边界单元；若存在，则删除其他边界单元以及其关联中心集合；其中r为设置的岗点服务半径长度。S82. Check if there are other boundary cells in the area centered on the cell and r as the radius; if there are, delete the other boundary cells and their associated center sets; where r is the set service point radius length.

S83、其他所有单元的关联中心集均去除CC_max中的元素，更新其他单元的关联中心集。S83. The associated center sets of all other units remove the elements in CC_max , and update the associated center sets of other units.

S84、返回步骤S81，开始新一轮岗点配置与更新，直至所有单元的关联中心集为空集。S84. Return to step S81 to start a new round of post location configuration and update until the associated central set of all units is an empty set.

该种城市道路交警执勤岗点配置方法，以常发拥堵点、事故黑点等交通管控工作中重点关注的位置为核心，以路网交通运行实测数据为支撑，对路网做网格化处理，综合考虑岗点对重点关注点的覆盖情况以及警员从岗点至关注点的时间成本，确定路网内的执勤岗点位置，并明确每一岗点主要服务区域。This kind of urban road traffic police duty station configuration method focuses on the locations that are often focused on in traffic management and control such as frequent congestion points and accident black spots. It is supported by the actual measurement data of the road network traffic operation, and the road network is meshed. , Comprehensively consider the coverage of the post to the key points of interest and the time cost of the police officers from the post to the point of interest, determine the position of the duty post in the road network, and clarify the main service area of each post.

实施例中，交警执勤岗点位置根据道路交通实际运行情况确定，同时重点考虑岗点对于重点关注点的覆盖情况以及从岗点到达重点关注点的行程时间，达到节约警力资源同时提升警员勤务工作效率的目的，与传统岗点布置方式相比更具合理性。In the embodiment, the position of the traffic police duty post is determined according to the actual operation situation of road traffic, and at the same time, the coverage of the post to the key focus point and the travel time from the post to the key focus point are taken into consideration, so as to save the police force resources and improve the police service The purpose of work efficiency is more reasonable compared with the traditional post layout.

该种城市道路交警执勤岗点配置方法，能够改变当前以经验为主的岗点部署方法，使得岗点能够全面覆盖路网所有重点关注点位，在岗点的辐射范围内，将警员到达事件发生位置所需投入的时间成本最小化。This kind of urban road traffic police duty post configuration method can change the current experience-based deployment method of the post, so that the post can fully cover all key points of attention in the road network, and within the radiation range of the post, the police will arrive at the incident The time cost required to invest in the location is minimized.

Claims

Translated fromChinese

一种城市道路交警执勤岗点配置方法，其特征在于：以路网交通运行实测数据为支撑，对路网做网格化处理，综合考虑岗点对重点关注点的覆盖情况以及警员从岗点至关注点的时间成本，确定路网内的执勤岗点位置；包括以下步骤，An urban road traffic police duty station allocation method, which is characterized by: the road network traffic measurement data as the support, grid processing of the road network, comprehensive consideration of the coverage of the point of focus to the key points of attention and the police officer The time cost from point to point of interest, to determine the position of the duty station in the road network; including the following steps,

S2、对城市路网做网格化处理，将关键点对应所属单元作为中心单元c_i，生成路网中心集合C＝{c₁,c₂,…,c_n}，其中i为中心单元序号，n为路网内中心单元数量；S2. Perform grid processing on the urban road network, take the key point corresponding to the unit as the central unit c_i , and generate the road network center set C = {c₁ , c₂ , ..., c_n }, where i is the serial number of the central unit , N is the number of central units in the road network;

S3、对于任一中心单元c_i，将其作为初始起点，遍历与c_i存在共同边界的单元集L1(i)＝{l1₁,…,l1_j,…,l1_k1}中元素，计算其中任一单元l1_j至单元c_i的行程时间TT(l1_j→c_i)，其中k1为与c_i存在共同边界的单元数量，j∈[1,k1]；S3. For any central cell c_i , use it as an initial starting point, traverse the elements in the cell set L1 (i) = {l1₁ , ..., l1_j , ..., l1_k1 } that share a common boundary with c_i , and calculate The travel time TT (l1_j → c_i ) of any unit l1_j to unit c_i , where k1 is the number of units that share a common boundary with c_i , j∈ [1, k1];

S6、路网中心集合C＝{c₁,c₂,…,c_n}中的任一单元c_i，都在遍历过程中生成了一组多级数据集，组成以c_i为中心的辐射区域A_i，在该区域中的每一单元均标记了到达c_i的行程时间；识别出辐射区域A_i的边界，将所有位于A_i边界的单元组成边界单元集B_i；S6. Any unit c_i in the road network center set C = {c₁ , c₂ , ..., c_n } generates a set of multi-level data sets during the traversal process, forming a radiation centered on c_i In the area A_i , each unit in the area is marked with the travel time to reach c_i ; the boundary of the radiation area A_i is identified, and all the units located at the boundary of A_i form the boundary unit set B_i ;

S7、边界单元集合B₁,B₂,…,B_n中的任一边界单元unit_u，u为单元序号，确定其所属的边界单元，并计算其边界叠加数num_is_u，即该单元所属边界单元集合数；若num_is_u＞N₀，则根据unit_u中标记的到各中心单元的行程时间，选出行程时间最小的N₀个作为unit_u的关联中心并组成集合CC_u；其中N₀为单元最大叠加阈值；若num_is_u≤N₀，则将其所有归属边界单元对应的中心作为其关联中心；S7. Any boundary unit unit_u in the boundary unit set B₁ , B₂ , ..., B_n , u is the unit number, determine the boundary unit to which it belongs, and calculate the boundary superposition number num_is_u , that is, the boundary to which the unit belongs The number of unit sets; if num_is_u > N₀ , according to the travel time to each central unit marked in unit_u , the N_{0 with the} smallest travel time are selected as the associated centers of unit_u and form the set CC_u ; where N₀ Is the maximum superposition threshold of the unit; if num_is_u ≤N₀ , then the centers corresponding to all its belonging boundary cells are taken as their associated centers;

如权利要求1所述的城市道路交警执勤岗点配置方法，其特征在于：步骤S1中，行程时间数据通过直接估计方式或通过行驶速度间接估计方式得到，其中直接估计方式包括通过号牌识别、RFID检测、GPS定位方式。The urban road traffic police duty post allocation method according to claim 1, characterized in that: in step S1, the travel time data is obtained by a direct estimation method or an indirect estimation method of driving speed, wherein the direct estimation method includes identification by number plate, RFID detection, GPS positioning method.

如权利要求1所述的城市道路交警执勤岗点配置方法，其特征在于：步骤S8具体为：The urban road traffic police duty station allocation method according to claim 1, wherein step S8 is specifically:

如权利要求3所述的城市道路交警执勤岗点配置方法，其特征在于：步骤S81中，若存在多个单元的关联中心数量一致，则从中随机取一单元作为unit_max。The method for allocating duty posts for urban road traffic police according to claim 3, wherein in step S81, if the number of associated centers of multiple units is the same, a unit is randomly selected as unit_max .