CN106297293A - A kind of overhead piecewise interval real-time speed self-adaptive computing method based on the big data of bayonet socket - Google Patents

Abstract

The present invention relates to a kind of overhead piecewise interval real-time speed self-adaptive computing method based on the big data of bayonet socket, this method, by being numbered overhead, bayonet socket, removes the bayonet socket without crossing car record, it is achieved adaptive segmentation；By the bayonet socket that can not be gone directly by vehicle, journey time is changed into the many groups of bayonet sockets that can go directly to journey time difference, can calculate overhead upper any pair bayonet socket between journey time, overcome existing method and cannot calculate overhead any adjacent card mouth to overall travel speed problem.

Description

A kind of overhead piecewise interval real-time speed adaptive polo placement based on the big data of bayonet socket Method

Technical field

The present invention relates to intelligent transportation field, particularly relate to a kind of overhead piecewise interval based on the big data of bayonet socket the fastest Degree self-adaptive computing method.

Background technology

It is the basis of all traffic algorithms that overall travel speed calculates, many traffic indicators all based on overall travel speed, example Such as congestion index, stifled some detection, the duration that blocks up, block up mileage etc..Overhead real-time speed calculate typically with microwave data or Floating car data is as Data Source.

In modern city, bayonet system is the very important source of transport information.The most all can in important crossing, section Lay bayonet socket.Bayonet socket refers to skills such as using the photoelectricity of advanced person, computer, image procossing, pattern recognition, remote data access Art, carries out round-the-clock real-time monitoring to the monitoring car lane in section, bicycle lane and records dependent image data, and automatically Obtain vehicle by data such as time, place, travel direction, brand number, number plate color, body colors.Bayonet socket number at present According to being generally used for support towards traffic administration and the application of traffic safety, the less application for traffic congestion perception Yu improvement.

In patent in published patent and examination, utilizing bayonet socket data to calculate road interval speed, ultimate principle is Vehicle is utilized directly to be calculated by the time difference between adjacent bayonet socket and the distance between bayonet socket.These methods include: method one (patent Number: 201510225291.9) " the road real-time passage rate computational methods of car data of making a slip of the tongue based on extensive card ": set car Amount threshold value, reads history and crosses car data, sequentially passes through the vehicle number of two bayonet sockets more than this threshold value, then it is assumed that this two bayonet socket is a pair Adjacent bayonet socket pair.Then shortest path and this road along map is obtained calculating between two adjacent bayonet sockets according to shortest path first The length in footpath.Cross car data finally according to real-time, obtain adjacent bayonet socket to speed list, rejecting abnormalities speed, the average speed of calculating Degree is as bayonet socket to speed, and weighted average obtains the real-time passage rate of road.Method two (patent No.: 201510834256.7) " bayonet socket calculated towards road real-time speed and floating car data fusion method ": the Real-time Road calculated by floating car data Speed and card make a slip of the tongue car data calculate real-time bayonet socket between speed be weighted merge.Wherein bayonet socket data calculating side Formula is: reads the current time card of first 5 minutes and makes a slip of the tongue car data, and calculates speed as current time according to crossing car time GCSJ Bayonet socket to real-time speed.

The premise of these methods is that vehicle is directly over two bayonet sockets and can cover whole road network, and these methods are in road, ground Use preferably on road, but on Viaduct Network, sequence of cars process be frequently not adjacent bayonet socket (in upper and lower ring road bayonet socket Between may be spaced several bayonet sockets), adjacent bayonet socket the most direct cross car record (such as two adjacent upper ring roads), The bayonet socket that vehicle is directly over, to covering whole road network, causes a lot of sections overall travel speed to calculate.

Summary of the invention

The present invention is to overcome above-mentioned weak point, it is therefore intended that provide a kind of overhead segment identifier based on the big data of bayonet socket Between real-time speed self-adaptive computing method, this method by overhead, bayonet socket is numbered, combine, and determines computing formula, it is possible to Calculate overhead upper any pair bayonet socket between real-time overall travel speed, overcome existing method and cannot calculate overhead any phase Adjacent bayonet socket is to overall travel speed problem.

The present invention is to reach above-mentioned purpose by the following technical programs: a kind of overhead piecewise intervals based on the big data of bayonet socket Real-time speed self-adaptive computing method, comprises the steps:

(1) being numbered overpass and bayonet socket, wherein overpass numbering is denoted as Road_ID；Each overhead road Bayonet socket on road is numbered respectively, is denoted as KKXH；

(2) add up each bayonet socket car quantity LL excessively in time slot T, reject the bayonet socket that car quantity LL is 0；

(3) bayonet socket having car record is grouped according to overpass numbering Road_ID, adjacent in each group KKXH order combination of two, was formed with the adjacent bayonet socket of minimum of car record to (Road_ID, KKXHi, KKXHj), completed whole The adaptive segmentation of individual Viaduct Network, the section between bayonet socket KKXHi and bayonet socket KKXHj is the interval section divided, wherein KKXHi represents the i-th bayonet socket numbering of corresponding overpass numbering Road_ID, and KKXHj represents corresponding overpass numbering The jth bayonet socket numbering of Road_ID；

(4) average row in each interval section is determined according to the bayonet type at the two ends, interval section divided in step (3) The calculation of journey time；

(5) according to real-time bayonet socket data, Dynamic Array records each nearest two the current records of car, and screens position Car record excessively in time slot T；Calculate the time difference crossing car record, suppressing exception record twice；According to bayonet socket to by record Packet, statistics is often organized average travel time and crosses car record number and be stored in Hash table 2；

(6) obtain according to the calculation of the average travel time in the described each interval section of step (4) and step (5) Hash table 2 calculates the average travel time in all sections in Viaduct Network；And calculate viaduct according to each interval road section length The average speed in all sections in net.

As preferably, the described method that is numbered overpass and bayonet socket is according to different overhead in Viaduct Network Overpass is numbered by road, different overpass direction of traffics, for the different direction of traffics of each overpass Arranging 1 Road_ID, numbering is from the beginning of 1；According to Road_ID, this overhead all of bayonet socket is grouped, in each group Bayonet socket starts to start serial number successively from 1 in overhead starting position according to direction of traffic, is denoted as KKXH.

As preferably, described bayonet socket is divided into three types, is respectively upper ring road bayonet socket, lower ring road bayonet socket, bridge floor bayonet socket； According to the adjacent bayonet socket of each minimum between the two ends bayonet type in section different, then the compound mode of bayonet socket pair has 9 kinds.

As preferably, the calculation of the described average travel time determining each interval section includes the following:

If i) vehicle can then be added up all directly pass through sequentially by bayonet socket KKXHi, the KKXHj at interval two ends, section The average travel time T of the vehicle of bayonet socket KKXHi, KKXHj (R, i, j)；

Ii) if vehicle cannot then utilize vehicle to pass through to comprise sequentially by bayonet socket KKXHi, the KKXHj at interval two ends, section Interval section (R, i, bayonet socket j) between the average travel time in section, and do not comprise interval section (R, i, bayonet socket pair j) Between the difference of average travel time in section, computation interval section (R, i, average travel time T j) (R, i, j).

As preferably, if described vehicle cannot be sequentially by the bayonet socket KKXHi at interval two ends, section, the calculating side of KKXHj Method is as follows:

1) if there is a bayonet socket, two cards directly arriving interval two ends, section can be distinguished by the vehicle of this bayonet socket Mouthful, or can the most directly arrive this bayonet socket by the vehicle of interval two ends, section bayonet socket, then calculation includes following two Kind situation:

1.1) if there is a bayonet socket KKXHk, can be distinguished by the vehicle of this bayonet socket and directly arriving interval two ends, section Two bayonet socket KKXHi and KKXHj, calculate this bayonet socket respectively to bayonet socket KKXHi and the average travel time of bayonet socket KKXHj, and Calculating both average travel times poor, take all result weighted means, formula is as follows:

$T(R,i,j)=\underset{k}{\Σ}\left(\right(T\left(R,i,k\right)-T\left(R,j,k\right))*\min (LL\left(R,i,k\right),LL\left(R,j,k\right)\left)\right)/\underset{k}{\Σ}min\left(LL\right(R,i,k),LL(R,j,k\left)\right)$

KKXHk be all KKXHk of meeting < KKXHi and KKXHk type be bridge floor bayonet socket or upper ring road bayonet socket；

1.2) if there is a bayonet socket KKXHk, can the most directly be arrived by the vehicle of bayonet socket KKXHi and bayonet socket KKXHj Dacca mouth KKXHk, calculates the vehicle average travel time from KKXHi and KKXHj to KKXHk respectively, and calculates both average row Journey time difference, takes all result weighted means, and formula is as follows:

$T(R,i,j)=\underset{k}{\&Sigma;}\left(\right(T\left(R,k,j\right)-T\left(R,k,i\right))*\min (LL\left(R,k,j\right),LL\left(R,k,i\right)\left)\right)/\underset{k}{\&Sigma;}min\left(LL\right(R,k,j),LL(R,k,i\left)\right)$

KKXHk be all KKXHk of meeting > KKXHj and KKXHk type be bridge floor bayonet socket or lower ring road bayonet socket；

2) if there is not a bayonet socket, KKXHi and KKXHj can the most directly be arrived, also from the vehicle of this bayonet socket There is not a bayonet socket, this bayonet socket can be arrived from the vehicle of KKXHi and KKXHj simultaneously, can be by finding bayonet socket KKXHk and KKXHl, wherein KKXHk can directly arrive KKXHi, KKXHj and can directly arrive KKXHl, by between KKXHi and KKXHj Average travel time be converted into three groups of bayonet sockets can directly calculating between average travel time poor, take the weighting of all results flat Average, formula is as follows:

$T(R,i,j)=\underset{k}{\&Sigma;}\left(\right(T\left(R,k,l\right)-T\left(R,k,i\right)-T\left(R,j,l\right))*\min (LL\left(R,k,l\right),LL\left(R,k,i\right),LL\left(R,j,l\right)\left)\right)/\underset{k}{\&Sigma;}min\left(LL\right(R,k,l),LL(R,k,i),LL(R,j,l\left)\right)$

Wherein KKXHk meets KKXHk < KKXHi and KKXHk type is bridge floor bayonet socket or upper ring road bayonet socket；KKXHl meets KKXHl > KKXHj and KKXHk type is bridge floor bayonet socket or lower ring road bayonet socket；(R, i are j) that time slot is interior through bayonet socket to LL KKXHi and bayonet socket KKXHj crosses car quantity, i.e. section, interval (R, i, weight j).

As preferably, the calculation that the compound mode of described bayonet socket pair is corresponding is as follows:

I) bayonet socket is to being combined as (upper ring road bayonet socket, upper ring road bayonet socket), time (bridge floor bayonet socket, upper ring road bayonet socket), then uses 1.1) described method calculate the adjacent bayonet socket of each minimum between the average running time in section；

II) bayonet socket is to being combined as (upper ring road bayonet socket, bridge floor bayonet socket), (upper ring road bayonet socket, lower ring road bayonet socket), (bridge floor card Mouth, bridge floor bayonet socket), time (bridge floor bayonet socket, lower ring road bayonet socket), then use i) described method to calculate the adjacent bayonet socket of each minimum to it Between the average running time in section；

III) bayonet socket is to being combined as (lower ring road bayonet socket, bridge floor bayonet socket), time (lower ring road bayonet socket, lower ring road bayonet socket), then adopts With 1.2) described method calculate the adjacent bayonet socket of each minimum between the average running time in section；

IV) bayonet socket is to when being combined as (lower ring road bayonet socket, upper ring road bayonet socket), then use 2) the described method each minimum of calculating Adjacent bayonet socket between the average running time in section.

As preferably, the step method of described step (5) is as follows: (5.1) set up a Dynamic Array, and its data structure is (HPHM, KKID1, JGSJ1, KKID2, JGSJ2)；HPHM represents number plate of vehicle number, and KKID2, JGSJ2 represent the nearest warp of vehicle The bayonet socket point position crossed and elapsed time, KKID1, JGSJ1 represent bayonet socket point position and the elapsed time of process last time on vehicle, dynamically Array is deposited two mistake car records that all vehicles are up-to-date；

(5.2) setting up a Hash table 1, wherein Key is HPHM, and different HPHM is mapped to different cryptographic Hash, value It is from increasing sequence ID；Often reading one is real-time crosses car record, checks and whether there is this HPHM in Hash table 1, if it does not, will (HPHM, ID) inserts Hash table 1, inserts (HPHM, 1900-01-01 00:00:00,1900-01-at Dynamic Array end simultaneously 01 00:00:00, KKID2, JGSJ2), wherein HPHM, KKID2, JGSJ2 are the car record data excessively read, from increasing sequence ID From increasing 1；If it is present perform step (5.3)；

(5.3) obtain the ID value in Hash table 1 according to HPHM, find the ID article record in Dynamic Array according to ID value, order KKID1=KKID2, JGSJ1=JGSJ2, will originally vehicle process bayonet socket point position KKID2 and elapsed time JGSJ2 update To KKID1 and JGSJ1 position, KKID2 simultaneously, JGSJ2 are updated to the bayonet socket point position of vehicle process and the elapsed time just read；

(5.4) all car records of crossing in obtaining time slot T, and remove the number plate of vehicle number of repetition, according to number plate of vehicle Number ID value in Hash table 1, that finds this car in corresponding Dynamic Array crosses car record, calculate these record JGSJ1 and Time difference SJC of JGSJ2, SJC=JGSJ2-JGSJ1, rejects the record that time difference is abnormal, i.e. as SJC > T_max time, it is right to reject That answers vehicle crosses car record, and wherein T_max is that time difference rejects threshold value；Being grouped according to key-value pair (KKID1, KKID2), statistics is every The meansigma methods of SJC in group, is designated as SJC_AVG, and statistics was often organized car record number, and was denoted as COU,；

(5.5) set up a Hash table 2, (5.4) statistical result be placed in Hash table 2, wherein Key be (KKID1, KKID2), Value is (SJC_AVG, COU).

As preferably, described time slot T is artificial presetting, and is preferably set to 5-10 minute.

As preferably, described T_max, for manually preset, is preferably set to 2 hours.

As preferably, described step (6) calculates the average travel time in all interval sections in Viaduct Network and average car The method of speed is as follows:

A) using the SJC_AVG of Hash table 2 as two bayonet socket KKID1, the average travel time between KKID2, COU is as process Two bayonet socket KKID1, the vehicle number of KKID2, the calculation of each link travel time obtained according to step (4) calculates average Journey time；

B) (R, i, length j) calculate each section (R, i, average speed j), (R, i, j) flat to combine each section All speed=section (R, i, length/section (R, i, average travel times j) j).

The beneficial effects of the present invention is: 1) Data Source of the present invention is bayonet system, it is not necessary to dispose extras, have The stronger suitability；2) present invention has the fireballing feature of calculating, by safeguarding two Hash tables and a Dynamic Array, energy Enough data are calculated in real time；3) pavement section of the present invention is thin, has the bayonet socket of car record as interval section using adjacent Partitioning standards, it is simple to follow-up every calculating based on overall travel speed index；4) present invention can adaptive polo placement.It is directed to part Bayonet socket shortage of data, it is possible to automatically adapt to, skips the bayonet socket of shortage of data.

Accompanying drawing explanation

Fig. 1 is the schematic flow sheet of the present invention；

Fig. 2 is that the S3 of the embodiment of the present invention calculates process schematic.

Detailed description of the invention

Below in conjunction with specific embodiment, the present invention is described further, but protection scope of the present invention is not limited in This:

Embodiment: the present embodiment is as a example by the through street net of Hangzhou, and Hangzhou has 8 through streets at present, " the pool on middle river Overhead " it is wherein one, two-way 4 tracks.Its one-way road length about 27 kilometers, adds up to have 48 bayonet sockets, and wherein 10 are Bridge floor bayonet socket, 19 is upper ring road, and 19 is lower ring road, and each direction all has 24 bayonet sockets.In the present embodiment, time slot T For " 2016-01-05 21:00:00--2016-01-05 21:05:00 ".

Used data are that card is made a slip of the tongue car record, the bayonet socket numbering (card at a unique corresponding crossing of bayonet socket numbering Mouthful), bayonet socket coordinate (gps coordinate), the actual range between bayonet socket, bayonet type is (in upper ring road bayonet socket, lower ring road bayonet socket, bridge floor Between bayonet socket).

As it is shown in figure 1, a kind of overhead piecewise interval real-time speed self-adaptive computing method based on the big data of bayonet socket, specifically Step is as follows:

S1. overpass and the numbering of bayonet socket, adds up the vehicle flowrate in each bayonet socket time slot T；The purpose of this step is Specify whether bayonet socket lacks relative to position and bayonet socket data, facilitate next step interval division.

" the overhead north orientation in pool south on middle river " Road_ID numbering is set to 1, by " the overhead south orientation in pool north on middle river " Road_ID numbering is set to 2, and the upper all bayonet sockets of Road_ID=1, according to vehicle forward direction, number consecutively is 1-24, by Road_ The upper all bayonet sockets of ID=2, according to vehicle forward direction, number consecutively is 1-24, and in timing statistics groove T, each bayonet socket crosses car number Amount, is denoted as LL, as shown in table 1.In table, KKID is bayonet socket numbering, and KKLB is bayonet socket classification.

Table 1

S2. according to table 1, road network is divided into section；The purpose of this step is according to there being car record bayonet socket by viaduct To carrying out interval division, what minimum was adjacent had the bayonet socket of car record to determining a section；

The bayonet socket of LL=0 all in S1 form is removed, remains 24 bayonet sockets.Wherein Road_ID=1 remains 12 cards Mouthful, its KKXH is respectively Isosorbide-5-Nitrae, and 6,7,11,12,14,16,17,19,20,22.Road_ID=2 remains 12 bayonet sockets, its KKXH It is respectively 1,5,6,7,9,11,12,14,15,19,23,24.

By bayonet socket composition key-value pair adjacent to the bayonet socket in each Road_ID group and the next one, Road_ID=1 can draw Being divided into 11 interval sections, Road_ID=2 can be divided into 11 interval sections, and total can be divided into 22 interval sections, As shown in table 2:

Sequence number	Road_ID	KKXH1	KKLB1	KKXH2	KKLB2
						1	1	1	Upper ring road bayonet socket	4	Upper ring road bayonet socket
2	1	4	Upper ring road bayonet socket	6	Lower ring road bayonet socket
						3	1	6	Lower ring road bayonet socket	7	Bridge floor bayonet socket
4	1	7	Bridge floor bayonet socket	11	Lower ring road bayonet socket
						5	1	11	Lower ring road bayonet socket	12	Bridge floor bayonet socket
6	1	12	Bridge floor bayonet socket	14	Lower ring road bayonet socket
						7	1	14	Lower ring road bayonet socket	16	Upper ring road bayonet socket
8	1	16	Upper ring road bayonet socket	17	Upper ring road bayonet socket
						9	1	17	Upper ring road bayonet socket	19	Lower ring road bayonet socket
10	1	19	Lower ring road bayonet socket	20	Bridge floor bayonet socket
						11	1	20	Bridge floor bayonet socket	22	Lower ring road bayonet socket
12	2	1	Bridge floor bayonet socket	5	Bridge floor bayonet socket
						13	2	5	Bridge floor bayonet socket	6	Upper ring road bayonet socket
14	2	6	Upper ring road bayonet socket	7	Lower ring road bayonet socket
						15	2	7	Lower ring road bayonet socket	9	Lower ring road bayonet socket
16	2	9	Lower ring road bayonet socket	11	Upper ring road bayonet socket
						17	2	11	Upper ring road bayonet socket	12	Lower ring road bayonet socket
18	2	12	Lower ring road bayonet socket	14	Upper ring road bayonet socket
						19	2	14	Upper ring road bayonet socket	15	Lower ring road bayonet socket
20	2	15	Lower ring road bayonet socket	19	Upper ring road bayonet socket
						21	2	19	Upper ring road bayonet socket	23	Lower ring road bayonet socket
22	2	23	Lower ring road bayonet socket	24	Lower ring road bayonet socket

Table 2

S3. according in S2 to overhead division, determine each interval section computational methods (card that will not directly arrive Mouthful between journey time be converted into the many groups of bayonet sockets that can directly the arrive difference to journey time).Overhead bayonet socket is altogether It is segmented into three basic forms of it, upper ring road bayonet socket, lower ring road bayonet socket, bridge floor bayonet socket.According to each interval two ends, section bayonet socket The difference of type, the compound mode one of bayonet socket pair has 9 kinds, and each combination basic calculation is as shown in table 3.

Table 3

Wherein, (R, i j) represent the average travel time in section (Road_ID, KKXHi, KKXHj) to the T in upper table.LL (R, i, j) represent section (Road_ID, KKXHi, KKXHj) weight, in time slot from bayonet socket KKXHi to bayonet socket KKXHj's Vehicle number.

Representing i-th bayonet socket in this packet as illustrated in fig. 2, it is assumed that section Road_ID is R, Ki, T (R, Ki, Kj) represents card The journey time of mouth Ki and Kj.In legend, K1 and K2 is upper ring road, and K3 is lower ring road, and K4 is bridge floor bayonet socket, then section (R, K1, K2) journey time T (R, K1, K2) can use T (R, K1, K4)-T (R, K2, K4) to represent, it is also possible to use T (R, K1, K3)-T (R, K2, K3) represents.According to the computational methods of table 1, we take the weighted mean of all result of calculation as this road Section speed average.The average speed that wherein T (1, K1, K4)-T (1, K2, K4) calculates, weight take LL (1, K1, K4) and LL (1, K2, K4) smaller value, the average speed that T (1, K1, K3)-T (1, K2, K3) calculates, weight take LL (1, K1, K3) and LL (1, K2, K3) smaller value, LL (1, Ki, Kj) be in time slot T Ki to Kj cross car record number.

In the present embodiment, synopsis 3 (KKLB1, KKLB2) key-value pair be (upper ring road bayonet socket, lower ring road bayonet socket), (on Ring road bayonet socket, bridge floor bayonet socket), (bridge floor bayonet socket, lower ring road bayonet socket), (bridge floor bayonet socket, bridge floor bayonet socket), can directly calculate bayonet socket Between journey time.Wherein road section ID is: 2,4,6,9,11,12,14,17,19,21 meet the condition of directly calculating.

(KKLB1, KKLB2) key-value pair is (bridge floor bayonet socket, upper ring road bayonet socket), (upper ring road bayonet socket, upper ring road bayonet socket), can With by finding the bayonet socket that KKID1 and KKID2 can directly arrive, the journey time between KKID1 and KKID2 being converted into can be direct Calculate two groups of bayonet sockets between time difference.Wherein road section ID is 1,8,13 to meet this condition.

(KKLB1, KKLB2) key-value pair is (lower ring road bayonet socket, bridge floor bayonet socket), (lower ring road bayonet socket, lower ring road bayonet socket), can With by finding the bayonet socket that can directly arrive KKID1 and KKID2, by the journey time between KKID1 and KKID2 by between bayonet socket pair Journey time be converted into two groups of bayonet sockets can directly calculating between time difference.Wherein road section ID is 3,5,10,15,22 to meet This condition.

(KKLB1, KKLB2) key-value pair is (lower ring road bayonet socket, upper ring road), can directly arrive KKID1 by searching Bayonet socket and the bayonet socket that can directly arrive of KKID2, by the journey time between KKID1 and KKID2 by the journey time between bayonet socket pair Be converted into three groups of bayonet sockets can directly calculating between time difference.Wherein road section ID is 7,16,18,20 to meet this condition.

S4. by real-time bayonet socket data, calculate the average travel time between bayonet socket and cross car record number.This step is by place Reason real time data, by nearest for all vehicles two car record records excessively in Hash table, the car of crossing filtered out in time slot T is remembered Record, calculates time difference, removes irrational record, is grouped by record according to bayonet socket, calculates each group of average travel time With car record quantity excessively；Concrete grammar is as follows:

1, safeguarding a Dynamic Array, wherein element is a data structure, comprise (HP HM, KKID1, JGSJ1, KKID2, JGSJ2), HPHM represents number plate of vehicle number, and KKID2, JGSJ2 represent bayonet socket point position and the process of vehicle process recently Time, KKID1, JGSJ1 represent bayonet socket point position and the elapsed time of a process on vehicle.

2, safeguarding a Hash table 1, wherein Key is HPHM (brand number), and different HPHM is mapped to different Hash Value, value value is from increasing sequence ID.Often reading one is real-time crosses car record, checks and whether there is this HPHM in Hash table 1, as Fruit does not exists, and (H PHM, ID) is inserted Hash table 1, insert at Dynamic Array end (HPHM, " 1900-01-01 00:. simultaneously 00:00 ", " 1900-01-01 00:00:00 ", KKID2, JGSJ2), wherein H PHM, KKID2, JGSJ2 are that the car of crossing read is remembered Record data, from increasing sequence ID from increasing 1.If it does, forward step 3 to.

3, obtain the ID value in Hash table 1 according to HPHM, find the ID article record in Dynamic Array according to ID value, order KKID1=KKID2, JGSJ1=JGSJ2, simultaneously KKID2, JG SJ2 is updated to just read car record data.

4, all car records of crossing, extraction car plate in obtaining time slot T (being typically set to 5-10 minute), and remove repetition car Board.Traversal car plate, according to car plate ID value in Hash table 1, finds the car record excessively of this car plate in corresponding Dynamic Array, calculates Time difference SJC of these records JGSJ1 and JGSJ2, removes SJC > record of T_max (being typically set to 2 hours).According to key assignments Being grouped (KKID1, KKID2), add up the meansigma methods of SJC in every group, be designated as SJC_AVG, statistics was often organized car record number, was denoted as COU, is placed into statistical result in Hash table 2, and wherein Key is (KKID1, KKID2), and Value is (SJC_AVG, COU).

In the present embodiment, the field that the real-time bayonet socket packet used contains has (HPHM, K KID, JGSJ), basic number As shown in table 4 below according to form:

Sequence number	KKID	HPHM	JGSJ
				1	310003000088**	Zhejiang ACD6****	2016-01-05 21:00:27
2	310003000114**	Zhejiang A917****	2016-01-05 21:00:18
				3	310003000126**	Zhejiang AW59****	2016-01-05 21:00:56
4	310003000070**	Zhejiang ABY2****	2016-01-05 21:00:32
				5	310003000126**	Zhejiang A0AB****	2016-01-05 21:00:23
6	310003000045**	Zhejiang A5F6****	2016-01-05 21:00:53
				7	310003000045**	The Liao Dynasty C607****	2016-01-05 21:00:37
8	310003000114**	Zhejiang A292****	2016-01-05 21:00:25
				9	310003000028**	Zhejiang AT91****	2016-01-05 21:00:07
10	310003000019**	Zhejiang ACD6****	2016-01-05 21:04:44

Table 4

As a example by processing this 10 data of table 4, the maintenance process of Hash table 1 and Dynamic Array is described.Read the 1st article of number According to, find that HPHM " Zhejiang ACD6**** " does not exists in Hash table 1, now (the present embodiment is to run a period of time to ID=15000 After state), therefore (" Zhejiang ACD6**** ", 15000) is inserted in Hash table 1, simultaneously by (" Zhejiang ACD6**** ", " 1900- 01-01 00:00:00 ", " 1900-01-01 00:00:00 ", 31000300008 8**, " 2016-01-05 21:00:27 ") Being inserted in Dynamic Array, this record is exactly positioned at 15000 in Dynamic Array, and first element is positioned at 0, is updated by ID It is 15001.Read the 2nd data, find that HPHM " Zhejiang A917**** " is present in Hash table 1, obtain " Zhejiang A917**** " and exist ID=9578 corresponding in Hash table 1.According to ID, find and be positioned in Hash table 1 element, namely (" Zhejiang at 9578 A917**** ", " 1900-01-0 1 00:00:00 ", " 1900-01-01 00:00:00 ", 310003000148**, " 2016-0 1-05 20:45:52 "), KKID1 is updated to KKID2, JGSJ1 is updated to JGSJ2, simultaneously KKID2, JGSJ2 is updated to work as Front car record data excessively, are namely updated to (" Zhejiang A917**** ", 310003000148**, " 2016-01-05 by this record 20:45:52 ", 310003000114**, " 2016-01-05 21:00:18 ")；Process the data received successively.

All car records excessively in obtaining time slot T, and remove repetition car plate.As a example by this 10 data, amount to 9 differences Car plate.Travel through this 9 car plates, according to car plate ID value in Hash table 1, find the record in corresponding Dynamic Array.At this In embodiment, according to these 9 car plates, recording of taking out from Dynamic Array is as shown in table 5 below:

Table 5

Calculate time difference SJC of JGSJ1 and JGSJ2, as shown in table 6 below:

Sequence number	HPHM	KKID1	KKID2	SJC
					1	Zhejiang ACD6****	310003000088**	310003000019**	257S
2	Zhejiang A917****	310003000148**	310003000114**	866S
					3	Zhejiang AW59****	310003000147**	310003000126**	414S
4	Zhejiang ABY2****	310003000147**	310003000070**	21140S
					5	Zhejiang A0AB****	310003000147**	310003000126**	423S
6	Zhejiang A5F6****	310003000126**	310003000045**	269S
					7	The Liao Dynasty C607****	310003000144**	310003000045**	3661102837S
8	Zhejiang A292****	310003000148**	310003000114**	877S
					9	Zhejiang AT91****	310003000139**	310003000028**	383S

Table 6

In the present embodiment, T_max is set to 7200S, and (in the case of the overwhelming majority, the one single pass time is not on overhead for vehicle More than 2 hours, therefore the present embodiment is set to 7200S, can arrange according to the situation that each city is different).Wherein 21140S Exceed T_max with 3661102837S, remove this two records.

By remaining 7 records, it is grouped according to key-value pair (KKID1, KKID2), is segmented into 5 groups, adds up each group of SJC Meansigma methods, be designated as SJC_AVG, added up car record number, and be denoted as COU, can obtain table 7 below:

Sequence number	KKID1	KKID2	SJC_AVG	COU
					1	310003000088**	310003000019**	257S	1
2	310003000148**	310003000114**	872S	2
					3	310003000147**	310003000126**	419S	2
4	310003000126**	310003000045**	269S	1
					5	310003000139**	310003000028**	383S	1

Table 7

Statistical result being placed in Hash table 2, wherein Key is (KKID1, KKID2), Va lue be (SJC_AVG, COU)。

S5. according to computational methods and the Hash table 2 of S4 of S3, calculate all interval sections in S2 average travel time and Speed.By the average travel time in sections all in S2, change into the expression formula of journey time in S4, thus calculate institute in S2 There are average travel time and the speed in section.

In Table 1, accumulative have different calculation methods in 4, and in embodiment, the case of each computational methods is as follows:

1, directly calculate.

As a example by section (1,7,11), corresponding (KKID1, KKID2) be (31000300 0097**, 310003000070**), bayonet socket classification is (bridge floor bayonet socket, lower ring road bayonet socket) respectively.With (310003000097**, 310003000070**) it is Key, from Hash table 2, takes out the Value of correspondence.

The value taken out from Hash table 2 in the present embodiment is (249S, 15), it is known that road section length is 4500M, then In time slot T, section (1,7,11) average speed is 4500/249*0.036=65.1KM/H.

2, utilize direction of advance bridge floor bayonet socket or lower ring road bayonet socket, calculate both time differences.

As a example by section (1, Isosorbide-5-Nitrae), corresponding (KKID1, KKID2) be (310003000125**, 310003000088**), bayonet socket classification is (upper ring road bayonet socket, upper ring road bayonet socket) respectively.

Obtain in this packet, bayonet socket in the middle of the lower ring road bayonet socket in road direction of advance front and bridge floor (current vehicle number > 0), 8 bayonet sockets altogether；As shown in table 8:

Table 8

As a example by the bayonet socket of KKXH=6, and KKXH=1 and KKXH=4 bayonet socket is respectively combined, calculate respectively section (1,1, 6) and the journey time of section (1,4,6).Respectively obtain two groups of journey times and weight (550S, 8), (210S, 4), 550S- 210S=340S, i.e. this average travel time for road sections are 340S, and the smaller value of 8 and 4 is 4, i.e. weight is 4.So pass through KKXH =6, we calculate the journey time in section (1, Isosorbide-5-Nitrae) and weight is (340S, 4).

Being similar to, we are respectively with KKXH=7, and bayonet socket and KKXH=1 and the KKXH=4 bayonet socket of 11,12 are respectively combined, meter The transit time and the weight that calculate section (1, Isosorbide-5-Nitrae) are respectively (336S, 22), (351S, 2), (343S, 2).

Work as KKXH=14, when 19,20,22 bayonet sockets and KKXH=1 and KKXH=4 bayonet socket are respectively combined, it has been found that corresponding Key do not exist in Hash table 2, section (1, Isosorbide-5-Nitrae) speed will be calculated by these bayonet sockets and be designated as "-", weight is designated as 0.

Being weighted averagely by accumulative 8 groups of result of calculations, we obtain journey time 338S of section (1, Isosorbide-5-Nitrae), it is known that Section (1, Isosorbide-5-Nitrae) a length of 6400M, then in time slot T, section (1, Isosorbide-5-Nitrae) average speed is 6400/338*0.036= 68.2KM/H。

3, use the vehicle to direction, source bridge floor bayonet socket or upper ring road bayonet socket, calculate both time differences.

As a example by section (1,6,7), corresponding (KKID1, KKID2) be (310003000126**, 310003000097**), bayonet socket classification is (lower ring road bayonet socket, bridge floor bayonet socket) respectively.

Obtain in this packet, and source vehicle direction bridge floor bayonet socket or upper ring road bayonet socket (current vehicle number > 0), 2 altogether Bayonet socket；As shown in table 9:

Table 9

As a example by the bayonet socket of KKXH=1, and KKXH=6 and KKXH=7 bayonet socket is respectively combined, calculate respectively section (1,1, 6) and the journey time of section (1,1,7).Respectively obtain two groups of journey times and weight (550S, 8), (623S, 48), 623S- 550S=73S, i.e. this average travel time for road sections are 73S, and the smaller value of 8 and 48 is 8, i.e. weight is 8.So pass through KKXH= 1, we calculate the journey time in section (1,6,7) and weight is (73S, 8).

Be similar to, we respectively bayonet socket and KKXH=6 and KKXH=7 bayonet socket with KKXH=4 be respectively combined, calculate outlet The journey time of section (1,6,7) and weight are respectively (70S, 18).

Being weighted averagely by 2 groups of result of calculations, we obtain the journey time in section (1,6,7) is 71S, it is known that section (1,6,7) a length of 1400M, then in time slot T, section (1,6,7) average speed is 1400/71*0.036= 70.9KM/H。

4, use the vehicle to direction, source bridge floor bayonet socket or upper ring road bayonet socket and vehicle forward direction bridge floor bayonet socket or Lower ring road bayonet socket, respectively with interval starting position, section bayonet socket, the end position bayonet socket combination of interval section, and calculates three's time Difference.

As a example by section (1,14,16), corresponding (KKID1, KKID2) be (3100030 00151**, 310003000131**), bayonet socket classification is (lower ring road bayonet socket, upper ring road) respectively.

Obtain in this packet, and source vehicle direction bridge floor bayonet socket or upper ring road bayonet socket (current vehicle number > 0), 4 altogether Bayonet socket；As shown in table 10:

ID	KKXH	KKLB	KKID
				1	1	Upper ring road bayonet socket	310003000125**
2	4	Upper ring road bayonet socket	310003000088**
				3	7	Bridge floor bayonet socket	310003000097**
4	12	Bridge floor bayonet socket	310003000284**

Table 10

Obtain in this packet, and vehicle forward direction bridge floor bayonet socket or lower ring road bayonet socket (current vehicle number > 0), 2 altogether Bayonet socket；As shown in table 11:

ID	KKXH	KKLB	KKID
				1	19	Lower ring road bayonet socket	310003000132**
2	22	Lower ring road bayonet socket	310003000123**

Table 11

In two tables, take a bayonet socket and the combination of KKXH=14 and KKXH=16 bayonet socket respectively.With KKXH=in table 1 12, in table 2 as a example by KKXH=19, section (1,12,14), section (1,12,19) and section (1,16,19) can the most directly count Calculate.So journey time of section (1,14,16) is equal to T (1,12,19)-T (1,12,14)-T (1,14,19).

In embodiment, section (1,12,19) journey time and weight are (648S, 16), section (1,12,14) journey time It is (157S, 9) that section (1,16,19) journey time and weight are (352S, 34) with weight.So section (1,14,16) stroke Time and weight are (139S, 9).

Traversal list 10 and table 11, obtain altogether 8 groups of section (1,14,16) journey times and weight.8 groups of result of calculations are entered Row weighted average, we obtain journey time 145S of section (1,14,16), it is known that section (1,14,16) a length of 1900M, So in time slot T, section (1,6,7) average speed is 1900/145*0.035=47.2KM/H.

Hash table 2 is emptied, starts the calculating of next time slot.

In the present embodiment, time slot T (2016-01-05 21:00:00--2016-01-05 21:05:00) overhead each Interval section speed calculation result is as shown in table 12 below:

Table 12

In the present embodiment, bayonet socket shortage of data rate (miss rate=pass through bayonet socket quantity/bayonet socket sum that record number is 0) In the case of having reached 50%, existing bayonet socket data are still utilized preferably to complete the piecewise interval real-time speed of whole viaduct Calculating, comparison of computational results is accurate.

It is the specific embodiment of the present invention and the know-why used described in Yi Shang, if conception under this invention institute Make change, function produced by it still without departing from description and accompanying drawing contained spiritual time, must belong to the present invention's Protection domain.

Claims (10)

1. an overhead piecewise interval real-time speed self-adaptive computing method based on the big data of bayonet socket, it is characterised in that include as Lower step:

(1) being numbered overpass and bayonet socket, wherein overpass numbering is denoted as Road_ID；On each overpass Bayonet socket number respectively, be denoted as KKXH；

(2) add up each bayonet socket car quantity LL excessively in time slot T, reject the bayonet socket that car quantity LL is 0；

(3) being grouped according to overpass numbering Road_ID by the bayonet socket having car record, in each group, adjacent KKXH is suitable Sequence combination of two, was formed with the adjacent bayonet socket of minimum of car record to (Road_ID, KKXHi, KKXHj), completed whole overhead The adaptive segmentation of road network, the section between bayonet socket KKXHi and bayonet socket KKXHj is the interval section divided, and wherein KKXHi represents The i-th bayonet socket numbering of corresponding overpass numbering Road_ID, KKXHj represents the jth of corresponding overpass numbering Road_ID Individual bayonet socket is numbered；

(4) when determining the average stroke in each interval section according to the bayonet type at the two ends, interval section divided in step (3) Between calculation；

(5) according to real-time bayonet socket data, Dynamic Array records each nearest two the current records of car, and when screening is positioned at Between cross car record in groove T；Calculate the time difference crossing car record, suppressing exception record twice；It is grouped by record according to bayonet socket, Statistics is often organized average travel time and crosses car record number and be stored in Hash table 2；

(6) Hash obtained according to calculation and the step (5) of the average travel time in the described each interval section of step (4) Table 2 calculates the average travel time in all sections in Viaduct Network；And calculate in Viaduct Network according to each interval road section length The average speed in all sections.

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 1 Method, it is characterised in that: the described method that is numbered overpass and bayonet socket is, according to overhead roads different in Viaduct Network Road, different overpass direction of traffics, be numbered overpass, and the different direction of traffics for each overpass set Putting 1 Road_ID, numbering is from the beginning of 1；According to Road_ID, this overhead all of bayonet socket is grouped, the card in each group Mouth starts to start serial number successively from 1 in overhead starting position according to direction of traffic, is denoted as KKXH.

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 1 Method, it is characterised in that: described bayonet socket is divided into three types, is respectively upper ring road bayonet socket, lower ring road bayonet socket, bridge floor bayonet socket；Root Bayonet type according to two ends, each demarcation interval section is different, and the compound mode of bayonet socket pair has 9 kinds, and different combination correspondences is different Calculation.

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 3 Method, it is characterised in that: the calculation of the described average travel time determining each interval section includes the following:

If i) vehicle can then be added up all directly pass through bayonet socket sequentially by bayonet socket KKXHi, the KKXHj at interval two ends, section The average travel time T of the vehicle of KKXHi, KKXHj (R, i, j)；

Ii) if vehicle cannot then utilize vehicle by comprising interval sequentially by bayonet socket KKXHi, the KKXHj at interval two ends, section Section (R, i, bayonet socket j) between the average travel time in section, with do not comprise interval section (R, i, bayonet socket j) between The difference of the average travel time in section, computation interval section (R, i, and average travel time T j) (R, i, j).

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 4 Method, it is characterised in that: if described vehicle cannot sequentially by the computational methods of the bayonet socket KKXHi, KKXHj at interval two ends, section such as Under:

1) if there is a bayonet socket, two bayonet sockets directly arriving interval two ends, section can be distinguished by the vehicle of this bayonet socket, Or can the most directly arrive this bayonet socket by the vehicle of interval two ends, section bayonet socket, then calculation includes the following two kinds feelings Shape:

1.1) if there is a bayonet socket KKXHk, can be distinguished by the vehicle of this bayonet socket and directly arriving the two of interval two ends, section Individual bayonet socket KKXHi and KKXHj, calculates this bayonet socket respectively to bayonet socket KKXHi and the average travel time of bayonet socket KKXHj, and calculates Both average travel times are poor, take all result weighted means, and formula is as follows:

$T(R,i,j)=\underset{k}{\&Sigma;}\left(\left(T\left(R,i,k\right)-T\left(R,j,k\right)\right)*\min \left(LL\left(R,i,k\right),LL\left(R,j,k\right)\right)\right)/\underset{k}{\&Sigma;}\min \left(LL\left(R,i,k\right),LL\left(R,j,k\right)\right)$

KKXHk be all KKXHk of meeting < KKXHi and KKXHk type be bridge floor bayonet socket or upper ring road bayonet socket；

1.2) if there is a bayonet socket KKXHk, can be distinguished by the vehicle of bayonet socket KKXHi and bayonet socket KKXHj and directly arriving Dacca Mouth KKXHk, calculates the vehicle average travel time from KKXHi and KKXHj to KKXHk respectively, and when calculating both average stroke Between poor, take all result weighted means, formula is as follows:

$T(R,i,j)=\underset{k}{\&Sigma;}\left(\left(T\left(R,k,j\right)-T\left(R,k,i\right)\right)*\min \left(LL\left(R,k,j\right),LL\left(R,k,i\right)\right)\right)/\underset{k}{\&Sigma;}\min \left(LL\left(R,k,j\right),LL\left(R,k,i\right)\right)$

KKXHk be all KKXHk of meeting > KKXHj and KKXHk type be bridge floor bayonet socket or lower ring road bayonet socket；

2) if there is not a bayonet socket, can the most directly arrive KKXHi and KKXHj from the vehicle of this bayonet socket, not depositing At a bayonet socket, this bayonet socket can be arrived from the vehicle of KKXHi and KKXHj simultaneously, can by find bayonet socket KKXHk and KKXHl, wherein KKXHk can directly arrive KKXHi, KKXHj and can directly arrive KKXHl, by the average row between KKXHi and KKXHj The journey time be converted into three groups of bayonet sockets can directly calculating between average travel time poor, take all result weighted means, Formula is as follows:

$T\left(R,i,j\right)=\underset{k}{\&Sigma;}(\left(T\left(R,k,l\right)-T\left(R,k,i\right)-T\left(R,j,l\right)\right)*\min \left(LL\left(R,k,l\right),LL\left(R,k,i\right),LL\left(R,j,l\right)\right)/\underset{k}{\&Sigma;}\min \left(LL\left(R,k,l\right),LL\left(R,k,i\right),LL\left(R,j,l\right)\right)$

Wherein KKXHk meets KKXHk < KKXHi and KKXHk type is bridge floor bayonet socket or upper ring road bayonet socket；KKXHl meets KKXHl > KKXHj and KKXHk type is bridge floor bayonet socket or lower ring road bayonet socket；(R, i are j) that time slot is interior through bayonet socket to LL KKXHi and bayonet socket KKXHj crosses car quantity, i.e. section, interval (R, i, weight j).

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 5 Method, it is characterised in that: the calculation that the compound mode of described bayonet socket pair is corresponding is as follows:

I) bayonet socket is to being combined as (upper ring road bayonet socket, upper ring road bayonet socket), time (bridge floor bayonet socket, upper ring road bayonet socket), then uses 1.1) Described method calculates the average travel time in each interval section；II) bayonet socket is to being combined as (upper ring road bayonet socket, bridge floor bayonet socket), (upper ring road bayonet socket, lower ring road bayonet socket), (bridge floor bayonet socket, bridge floor bayonet socket), time (bridge floor bayonet socket, lower ring road bayonet socket), then use i) Described method calculates the average travel time in each interval section；

III) bayonet socket is to being combined as (lower ring road bayonet socket, bridge floor bayonet socket), time (lower ring road bayonet socket, lower ring road bayonet socket), then uses 1.2) described method calculates the average travel time in each interval section；

IV) bayonet socket is to when being combined as (lower ring road bayonet socket, upper ring road bayonet socket), then use 2) each interval section of described method calculating Average travel time.

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 1 Method, it is characterised in that: the step method of described step (5) is as follows:

(5.1) setting up a Dynamic Array, its data structure is (HPHM, KKID1, JGSJ1, KKID2, JGSJ2)；HPHM represents Number plate of vehicle number, KKID2, JGSJ2 represent bayonet socket point position and the elapsed time of vehicle process recently, and KKID1, JGSJ1 represent On vehicle last time process bayonet socket point position and the elapsed time, Dynamic Array is deposited all vehicles up-to-date two and crosses car records；

(5.2) setting up a Hash table 1, wherein Key is HPHM, and different HPHM is mapped to different cryptographic Hash, and value is certainly Increasing sequence ID；Often reading one is real-time crosses car record, checks and whether there is this HPHM in Hash table 1, if it does not, will (HPHM, ID) inserts Hash table 1, inserts (HPHM, 1900-01-01 00:00:00,1900-01-at Dynamic Array end simultaneously 01 00:00:00, KKID2, JGSJ2), wherein HPHM, KKID2, JGSJ2 are the car record data excessively read, from increasing sequence ID From increasing 1；If it is present perform step (5.3)；

(5.3) obtain the ID value in Hash table 1 according to HPHM, find the ID article record in Dynamic Array according to ID value, make KKID1 =KKID2, JGSJ1=JGSJ2, will the bayonet socket point position KKID2 and elapsed time JGSJ2 of vehicle process originally update KKID1 and JGSJ1 position, simultaneously KKID2, JGSJ2 is updated to the bayonet socket point position of vehicle process and the elapsed time just read；

(5.4) all car records of crossing in obtaining time slot T, and remove the number plate of vehicle number of repetition, according to number plate of vehicle number ID value in Hash table 1, finds the car record excessively of this car in corresponding Dynamic Array, calculates these records JGSJ1's and JGSJ2 Time difference SJC, SJC=JGSJ2-JGSJ1, rejects the record that time difference is abnormal, i.e. as SJC > T_max time, reject corresponding vehicle Cross car record, wherein T_max be time difference reject threshold value；It is grouped according to key-value pair (KKID1, KKID2), adds up often in group The meansigma methods of SJC, is designated as SJC_AVG, and statistics was often organized car record number, and was denoted as COU,；

(5.5) set up a Hash table 2, (5.4) statistical result be placed in Hash table 2, wherein Key be (KKID1, KKID2), Value is (SJC_AVG, COU).

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 7 Method, it is characterised in that: described time slot T is artificial presetting, and is preferably set to 5-10 minute.

A kind of overhead piecewise interval real-time speed adaptive polo placement sides based on the big data of bayonet socket the most according to claim 7 Method, it is characterised in that: described T_max is artificial presetting, and is preferably set to 2 hours.

A kind of overhead piecewise interval real-time speed adaptive polo placement based on the big data of bayonet socket the most according to claim 1 Method, it is characterised in that: described step (6) calculates average travel time and the average speed in all interval sections in Viaduct Network Method as follows:

A) using the SJC_AVG of Hash table 2 as two bayonet socket KKID1, the average travel time between KKID2, COU is as through two cards Mouth KKID1, KKID2 cross car quantity, according to the calculation meter of each interval average travel time for road sections that step (4) obtains Calculate average travel time；

B) (R, i, length j) calculate each interval section (R, i, average speed j), interval road to combine each interval section Section (R, i, average speed j)=section, interval (R, i, length j)/section, interval (R, i, average travel time j).