CN104332051B - Urban road RFID detector optimizes distribution method - Google Patents

Urban road RFID detector optimizes distribution method Download PDF

Info

Publication number
CN104332051B
CN104332051B CN201410613935.7A CN201410613935A CN104332051B CN 104332051 B CN104332051 B CN 104332051B CN 201410613935 A CN201410613935 A CN 201410613935A CN 104332051 B CN104332051 B CN 104332051B
Authority
CN
China
Prior art keywords
section
detector
road
traffic
basic
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201410613935.7A
Other languages
Chinese (zh)
Other versions
CN104332051A (en
Inventor
孙棣华
郑林江
刘卫宁
赵敏
韩坤琳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing Kezhiyuan Technology Co ltd
Original Assignee
Chongqing University
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 Chongqing University filed Critical Chongqing University
Priority to CN201410613935.7A priority Critical patent/CN104332051B/en
Publication of CN104332051A publication Critical patent/CN104332051A/en
Application granted granted Critical
Publication of CN104332051B publication Critical patent/CN104332051B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Traffic Control Systems (AREA)

Abstract

The invention discloses a kind of urban road RFID detector based on journey time estimation and flow similarity analysis and optimize distribution method.The method first passes through the volume of traffic to each basic road in city road network and carries out similarity analysis and average travel time is estimated, determine the correlation matrix between basic road flow and Loop detector layout number, then set up, with this, the Mathematical Modeling that RFID detector optimum is layouted, finally by genetic algorithm, model is solved, obtain optimizing layout scheme.The method considers the optimal selection laying problem of detection equipment own characteristic and test point, internal relation between topological structure according to urban road network and each road section traffic volume parameter, lay the traffic data that as far as possible few detector obtains given accuracy and integrity degree in road network, reduce the cost laid on section needed for RFID detector.

Description

Urban road RFID detector optimizes distribution method
Technical field
The present invention relates to urban highway traffic detector field, be specifically related to a kind of similar based on journey time estimation and flow Property analyze urban road RFID detector optimize distribution method.
Background technology
Intelligent transportation system (ITS) is acknowledged as currently solving China urban traffic congestion and improves the effective of road safety Means.Traffic detector is utilized to collect one of basic function that traffic data is ITS.Existing traffic detector mainly has Ground sense formula detector, microwave detector, Floating Car detector, video detector etc..Through years development, RFID detects Technology is progressively applied to urban highway traffic detection, compares conventional traffic detection technique, and RFID detector has: become This is relatively low, and have read convenient, can accurately track each information of vehicles, the data volume that can store greatly, not by environment The advantages such as impact, security are high and easy to maintenance.
Traditional RFID detector distribution method is mainly having the local detector of laying of traffic conflict, i.e. uses contingency Empirical detector layout method, do not consider detection equipment own characteristic, do not account for test point yet Preferably select laying problem.But with the development in city, city road network density is increasing, if will be on each section Laying RFID detector, required cost will be very surprising.So, the topological structure according to urban road network and Internal relation between each road section traffic volume parameter, research urban road RFID detector optimizes distribution method, at road network The as far as possible few detector of middle laying just can obtain the traffic data of given accuracy and integrity degree, and this is for the friendship based on RFID The construction of logical data collecting system is very important beyond doubt.
Content of the invention
In view of this, the technical problem to be solved is to provide and a kind of divides based on journey time estimation and flow similitude The urban road RFID detector of analysis optimizes distribution method.
The object of the present invention is achieved like this:
The urban road RFID detector that the present invention provides optimizes distribution method, comprises the following steps:
S1: obtain the traffic parameter of each basic road in urban road network;
S2: the journey time that is averaged the basic journey time in the traffic parameter of basic road is estimated and obtains Loop detector layout Number;
S3: carry out flow similarity analysis to the volume of traffic in the traffic parameter of basic road and set up section similar matrix;
S4: set up the Mathematical Modeling that RFID detector optimum is layouted according to section similar matrix and Loop detector layout number,
S5: Mathematical Modeling is solved by genetic algorithm;
S6: obtain RFID detector optimum and layout layout scheme.
Further, the journey time that in described step S2 is averaged the basic journey time in the traffic parameter of basic road is estimated Calculate, according to the average travel time estimated between the upstream and downstream RFID detector calculating upstream and downstream section of section;By the length estimating section Distance ratio between degree and upstream and downstream RFID detector is multiplied by average travel time and obtains Link Travel Time Estimation value;Concrete bag Include following steps:
S21: use below equation to calculate and estimate average travel time for road sections:
t ‾ = Σ i = 1 n ( t i 1 - t i 2 ) n - - - ( 1 )
In formula, n is sample vehicle number,It is the i-th vehicle by time during the first detector,It is that the i-th vehicle passes through second Time during detector;
S22: the ratio between calculating estimation road section length and upstream and downstream RFID detector distance as follows:
λ = l L - - - ( 2 )
In formula, l is for estimating road section length, and L is upstream and downstream RFID detector distance;
S23: estimation Link Travel Time as follows:
t i = λ * t ‾ - - - ( 3 )
In formula, tiIt is that the i-th vehicle is by estimating Link Travel Time.
Further, in described step S2, Loop detector layout number determines and specifically includes following steps:
S24: obtain Loop detector layout density straight line, the evaluated error curve of journey time and investment curve;
S25: calculate Loop detector layout density straight line and intersect at A, B 2 point respectively with error curve and investment curve, then described A, The corresponding detector density of B 2 be corresponding reasonable detector density interval (a, b).
S26: according to actual conditions choose reasonable detector density interval (a, b) in numeral as Loop detector layout number.
Further, described step S3 carry out flow similarity analysis to the volume of traffic in the traffic parameter of basic road and set up road Section similar matrix, specifically includes following steps:
S31: obtain the magnitude of traffic flow in the multiple section in city and any two road section traffic volume flows are calculated two basic roads as follows Similarity degree between the section magnitude of traffic flow:
ρ ( X , Y ) = cov ( X , Y ) δ X · δ Y - - - ( 4 )
Wherein,
δ Y = 1 n Σ i = 1 n ( Y i - Y ‾ ) 2 - - - ( 6 )
In formula, X represents the volume of traffic X array of section X, and Y represents the volume of traffic Y array of section Y;ρ (X, Y) represents section Coefficient correlation between X and the Y magnitude of traffic flow;
S32: differentiate whether two basic road magnitudes of traffic flow are similar according to coefficient correlation, if coefficient correlation is more than or equal to phase Like degree index, then it represents that have similitude between two basic road volume of traffic, " 1 " is used to represent similar;
S33: if coefficient correlation is less than index of similarity, then it represents that between two basic road volume of traffic, not there is similitude, adopt Represent similar with " 0 ";
S34: all basic roads carry out similarity analysis between any two to road network, and obtained coefficient correlation similarity is referred to After mark is carried out qualitatively, used the section similar matrix in all sections that " 0 " and " 1 " represent.
Further, described step S4 is set up the Mathematical Modeling that RFID detector optimum layouts as follows:
min Z = Σ i = 1 n C i D i , i = 1 , 2 , ... , n - - - ( 7 )
s . t . Σ j = 1 n α i j D j ≥ 1 , i , j = 1 , 2 , ... , n - - - ( 8 )
Σ i = 1 n D i = k , i = 1 , 2 , ... , n - - - ( 9 )
In formula, αijFor element value in the similar matrix of section, CiRepresent the comprehensive cloth dot factor in i section, represent in this section The importance degree layouted, for calculating, based on journey time estimation optimization method, the RFID detector number obtaining;Z represents detector Optimum is layouted minimum of a value;Di represents the test point in the i-th section;N represents section sum.
Further, the iterative process of model is laid in the genetic algorithm for solving urban road RFID detector optimization in described step S5, Specifically include following steps:
S51: initializing, putting genetic algebra T=0, initial population randomly generates, at the beginning of utilizing fitness function evaluation each after coding Begin individual ideal adaptation degree;
S52: select the individuality that fitness is relatively low, rejects the higher individuality of fitness;
S53: application crossover operator and mutation operator generate colony of a new generation, and keep population at individual number m constant;
S54: the fitness of a new generation's population at individual being evaluated, and checks stop criterion, if meeting end condition, then turning To step S55, otherwise T=T+1, forward step S52 to;
S55: jump out, exports optimized individual, it is thus achieved that optimum RF ID Loop detector layout method.
Further, the coding in described step S51, specific as follows:
Basic road in road network is laid test point coding and uses binary coding;If a gene segment table shows what trunk section formed Road network detector layout set, in this set represents a section detector layout situation, and detection is laid in 1 expression section Point, test point is not laid in 0 expression section;In the chromosome of a construction, according to order from left to right, meet constraint bar One gene segment table of part shows a kind of test point selection scheme.
Further, the fitness in described step S54 uses following optimization laying object function to calculate as fitness function:
f = Σ i = 1 n C i D i ;
In formula, f represents global minimum;CiRepresent the comprehensive cloth dot factor in i section, represent the weight layouted in this section Spend;DiRepresent and whether lay test point in i section.
Further, the stop criterion in described step S54, specifically employing equation below:
Q ( T ) = Σ t = 2 T | f m i n t - f m i n t - 1 | - - - ( 12 )
Algorithm end condition: Q (T)-Q (T-1)≤ε;
In formula, Q (T) tends to convergency value for current;Genetic algebra appeared in current calculating for the T,Represent in t generation Minimum fitness value, whereinε represents predetermined threshold value.
The beneficial effects of the present invention is: the present invention uses a kind of road, city based on journey time estimation and flow similarity analysis Road RFID detector optimizes distribution method.The method first passes through the volume of traffic to each basic road in city road network and carries out similar Property analysis and average travel time are estimated, determine the correlation matrix between basic road flow and Loop detector layout number, Then set up, with this, the Mathematical Modeling that RFID detector optimum is layouted, finally by genetic algorithm, model is solved, obtain excellent Change layout scheme.The method considers the optimal selection laying problem of detection equipment own characteristic and test point, according to city Internal relation between the topological structure of city's road network and each road section traffic volume parameter, lays as far as possible few detection in road network Device obtains the traffic data of given accuracy and integrity degree, reduces the cost laid on section needed for RFID detector.
Brief description
In order to make the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the present invention is made into one The detailed description of step, wherein:
The optimization distribution method flow chart that Fig. 1 provides for the embodiment of the present invention;
Graph of a relation between detector density that Fig. 2 provides for the embodiment of the present invention and investment, error;
The genetic algorithm that Fig. 3 provides for the embodiment of the present invention solve flow chart;
The RFID simple section artwork that Fig. 4 provides for the embodiment of the present invention;
The coding schematic diagram that Fig. 5 provides for the embodiment of the present invention;
The single-point intersection schematic diagram that Fig. 6 provides for the embodiment of the present invention.
Detailed description of the invention
Hereinafter with reference to accompanying drawing, the preferred embodiments of the present invention are described in detail.It should be appreciated that preferred embodiment is only The explanation present invention, rather than in order to limit the scope of the invention.
Embodiment 1
As shown in Figures 1 to 6, a kind of urban road based on journey time estimation and flow similarity analysis that the present invention provides RFID detector optimizes distribution method;First pass through the volume of traffic to each basic road in city road network carry out similarity analysis and Average travel time is estimated, determines the correlation matrix between basic road flow and Loop detector layout number, then with this Set up the Mathematical Modeling that RFID detector optimum is layouted, finally by genetic algorithm, model is solved, obtain optimizing laying side Case;Specifically include following steps:
S1: obtain the traffic parameter of each basic road in urban road network;
S2: the journey time that is averaged the basic journey time in the traffic parameter of basic road is estimated and obtains Loop detector layout Number;
S3: carry out flow similarity analysis to the volume of traffic in the traffic parameter of basic road and set up section similar matrix;
S4: set up the Mathematical Modeling that RFID detector optimum is layouted according to section similar matrix and Loop detector layout number,
S5: Mathematical Modeling is solved by genetic algorithm;
S6: obtain RFID detector optimum and layout layout scheme.
The journey time that in described step S2 is averaged the basic journey time in the traffic parameter of basic road is estimated, according to Estimate that section upstream and downstream RFID detector calculates the average travel time between upstream and downstream section;By the length estimating section and upstream and downstream Distance ratio between RFID detector is multiplied by average travel time and obtains Link Travel Time Estimation value;Specifically include following steps:
S21: use below equation to calculate and estimate average travel time for road sections:
t ‾ = Σ i = 1 n ( t i 1 - t i 2 ) n - - - ( 1 )
In formula, n is sample vehicle number,It is the i-th vehicle by time during the first detector,It is that the i-th vehicle passes through second Time during detector;
S22: the ratio between calculating estimation road section length and upstream and downstream RFID detector distance as follows:
λ = l L - - - ( 2 )
In formula, l is for estimating road section length, and L is upstream and downstream RFID detector distance;
S23: estimation Link Travel Time as follows:
t i = λ * t ‾ - - - ( 3 )
In formula, tiIt is that the i-th vehicle is by estimating Link Travel Time.
In described step S2, Loop detector layout number determines and specifically includes following steps:
S24: obtain Loop detector layout density straight line, the evaluated error curve of journey time and investment curve;
S25: calculate Loop detector layout density straight line and intersect at A, B 2 point respectively with error curve and investment curve, then described A, The corresponding detector density of B 2 be corresponding reasonable detector density interval (a, b).
S26: according to actual conditions choose reasonable detector density interval (a, b) in numeral as Loop detector layout number.
The volume of traffic in the traffic parameter of basic road is carried out flow similarity analysis by described step S3 and to set up section similar Matrix, specifically includes following steps:
S31: obtain the magnitude of traffic flow in the multiple section in city and any two road section traffic volume flows are calculated two basic roads as follows Similarity degree between the section magnitude of traffic flow:
ρ ( X , Y ) = cov ( X , Y ) δ X · δ Y - - - ( 4 )
Wherein,
δ Y = 1 n Σ i = 1 n ( Y i - Y ‾ ) 2 - - - ( 6 )
In formula, X represents the volume of traffic X array of section X, and Y represents the volume of traffic Y array of section Y;ρ (X, Y) represents section Coefficient correlation between X and the Y magnitude of traffic flow;
S32: differentiate whether two basic road magnitudes of traffic flow are similar according to coefficient correlation, if coefficient correlation is more than or equal to phase Like degree index, then it represents that have similitude between two basic road volume of traffic, " 1 " is used to represent similar;
S33: if coefficient correlation is less than index of similarity, then it represents that between two basic road volume of traffic, not there is similitude, adopt Represent similar with " 0 ";
S34: all basic roads carry out similarity analysis between any two to road network, and obtained coefficient correlation similarity is referred to After mark is carried out qualitatively, used the section similar matrix in all sections that " 0 " and " 1 " represent.
Described step S4 is set up the Mathematical Modeling that RFID detector optimum layouts as follows:
min Z = Σ i = 1 n C i D i , i = 1 , 2 , ... , n - - - ( 7 )
s . t . Σ j = 1 n α i j D j ≥ 1 , i , j = 1 , 2 , ... , n - - - ( 8 )
Σ i = 1 n D i = k , i = 1 , 2 , ... , n - - - ( 9 )
In formula, αijFor element value in the similar matrix of section, CiRepresent the comprehensive cloth dot factor in i section, represent in this section The importance degree layouted, for calculating, based on journey time estimation optimization method, the RFID detector number obtaining.
The iterative process of model is laid in genetic algorithm for solving urban road RFID detector optimization in described step S5, specifically wraps Include following steps:
S51: initializing, putting genetic algebra T=0, initial population randomly generates, at the beginning of utilizing fitness function evaluation each after coding Begin individual ideal adaptation degree;
S52: select the individuality that fitness is relatively low, rejects the higher individuality of fitness;
S53: application crossover operator and mutation operator generate colony of a new generation, and keep population at individual number m constant;
S54: the fitness of a new generation's population at individual being evaluated, and checks stop criterion, if meeting end condition, then turning To step S55, otherwise T=T+1, forward step S52 to;
S55: jump out, exports optimized individual, it is thus achieved that optimum RF ID Loop detector layout method.
Coding in described step S51, specific as follows:
Basic road in road network is laid test point coding and uses binary coding;If a gene segment table shows what trunk section formed Road network detector layout set, in this set represents a section detector layout situation, and detection is laid in 1 expression section Point, test point is not laid in 0 expression section;In the chromosome of a construction, according to order from left to right, meet constraint bar One gene segment table of part shows a kind of test point selection scheme.
Fitness in described step S54 uses following optimization to lay object function and calculates as fitness function:
f = Σ i = 1 n C i D i ;
In formula, f represents global minimum;CiRepresent the comprehensive cloth dot factor in i section, represent the weight layouted in this section Spend;DiRepresent and whether lay test point in i section.
Stop criterion in described step S54, specifically employing equation below:
Q ( T ) = Σ t = 2 T | f m i n t - f m i n t - 1 | - - - ( 12 )
Algorithm end condition: Q (T)-Q (T-1)≤ε;
In formula, Q (T) tends to convergency value for current;Genetic algebra appeared in current calculating for the T,Represent in t generation Minimum fitness value, whereinε represents predetermined threshold value.
Embodiment 2
The present embodiment differs only in embodiment 1:
Lay spacing there is certain relation based on the Link Travel Time Estimation and RFID detector of RFID detector data, detection The density that device is laid is bigger, and detected data more can reflect road network traffic flow operation characteristic exactly, same journey time Evaluated error reduces as well as the increase of Loop detector layout density, as shown in Figure 1.But it is as the increase of detector density Corresponding cost also can linear rise, in the case of so rational investment and error should be considered, select rational detector Layout density.
The relation of Loop detector layout density, investment and error three is as shown in Figure 1.Fig. 1 is detector density and investment, error Between relation;As can be seen from Figure 1, with the increase of detector density invest accordingly also can linear rise, examine so comprehensive Considering rational investment and in the case of error, this straight line and error curve and investment curve meet at A, B 2 point respectively, and 2 corresponding Detector density is that (what detector density institute no matter a b), choose right on this interval in corresponding reasonable detector density interval The Travel Time Error answered and investment are all in the range of can receiving.In actual application, if evaluated error can be allowed Determine, then Loop detector layout density selects close proximity to the border a in above-mentioned interval, thus to reduce investment.
It based on the Link Travel Time Estimation method of RFID detector is: first according to estimation section upstream and downstream RFID detector Calculate the average travel time between upstream and downstream section, rear with the distance ratio between the length estimating section and upstream and downstream RFID detector Value is multiplied by average travel time then can obtain Link Travel Time Estimation value.
The method of the present embodiment is applicable to the planning of city road network detector and layouts, and its scope of application is to need certain city layouted many There is between the magnitude of traffic flow in individual section certain similitude.
Just it is believed that there is linear dependence, so between two link flows when index of similarity α refers to that coefficient correlation is much Just can quantitative coefficient correlation qualitatively.Index of similarity determine that have between two basic road volume of traffic similitude or Not there is the threshold values of similitude." 1 " represents similar, and " 0 " represents dissmilarity.The determination of index of similarity and data acquisition system The precision of data to be gathered of uniting is relevant.If the data precision requiring is high, then index of similarity to be arranged greatly, otherwise As the same.
For key road segment, detector can be laid in this section and directly gather data, to improve the Data Detection essence of key road segment Degree.For the neighbouring section having auxiliary facility (communication line, mounting bracket), lay detector in this section, in order to can fill Divide and utilize existing resource, reduce deployment cost.
Determine CiMethod be: if it is considered to certain section important (being such as major trunk roads or a traffic particular location), Then make CiTaking less, vice versa.If it is considered to all of section is of equal importance, then make Ci=1.
During genetic algorithm for solving, an initial population can be extracted at the beginning of m by random from the feasible zone meet constraints Beginning test point selection scheme (m chromosome), i.e. feasible is deconstructed into, and wherein each feasible solution is referred to as a parent.
During genetic algorithm for solving, calculate each ideal adaptation degree functional value in current population, and press fitness function value row Row population at individual order, if the fitness of the optimized individual in current group is higher than the fitness of best individuality up to now, The then new preferably individual optimized individual making in current group of being changed so far, otherwise, with fitness up to now the highest Body replaces the minimum individuality of the fitness in current group.
During genetic algorithm for solving, the present embodiment uses single-point cross method, and as shown in Figure 6, Fig. 6 is that the present invention implements The single-point intersection schematic diagram that example provides;First two father's strings of A and B are chosen by roulette and optimal save strategy method choice mechanism, so After randomly choose a cross-point locations, the individual M of father and the individual N of father exchanges being positioned at the portion gene code on the right side of crosspoint, shape The individual M ' of son of Cheng Xin and the individual N ' of son, what same method was similar completes the intersection operation of other individualities.
During genetic algorithm for solving, crossing operation can not produce new gene, can only carry out permutation and combination to existing gene. And mutation operator is some genic value changing individual in population string.Mutation operation is to negate some gene for two-value sequence Genic value on seat, namely 1 → 0 or 0 → 1.
Through repeatedly genetic algorithm for solving, it is possible to obtain the many groups of optimization layout schemes meeting constraints, can answer as in reality Alternative in, prevents the scheme that makes a difference of special circumstances from implementing.
Finally illustrate, above example only in order to technical scheme being described and unrestricted, although by referring to Invention has been described for the preferred embodiments of the present invention, it should be appreciated by those of ordinary skill in the art that can To make various change, the spirit and scope being limited without departing from the present invention in the form and details to it.

Claims (8)

1. urban road RFID detector optimizes distribution method, it is characterised in that: comprise the following steps:
S1: obtain the traffic parameter of each basic road in urban road network;
S2: the journey time that is averaged the basic journey time in the traffic parameter of basic road is estimated and obtains Loop detector layout Number;
S3: carry out flow similarity analysis to the volume of traffic in the traffic parameter of basic road and set up section similar matrix;
S4: set up the Mathematical Modeling that RFID detector optimum is layouted according to section similar matrix and Loop detector layout number,
S5: Mathematical Modeling is solved by genetic algorithm;
S6: obtain RFID detector optimum and layout layout scheme;
In described step S2, Loop detector layout number determines and specifically includes following steps:
S24: obtain Loop detector layout density straight line, the evaluated error curve of journey time and investment curve;
S25: calculate Loop detector layout density straight line and intersect at A, B 2 point respectively with error curve and investment curve, then described A, The corresponding detector density of B 2 be corresponding reasonable detector density interval (a, b);
S26: according to actual conditions choose reasonable detector density interval (a, b) in numeral as Loop detector layout number.
2. urban road RFID detector according to claim 1 optimizes distribution method, it is characterised in that: described step The journey time that in S2 is averaged the basic journey time in the traffic parameter of basic road is estimated, upper and lower according to estimation section Trip RFID detector calculates the average travel time between upstream and downstream section;With the length estimating section and upstream and downstream RFID detector Between distance ratio be multiplied by average travel time obtain Link Travel Time Estimation value;Specifically include following steps:
S21: use below equation to calculate and estimate average travel time for road sections:
t ‾ = Σ i = 1 n ( t i 1 - t i 2 ) n - - - ( 1 )
In formula, n is sample vehicle number,It is the i-th vehicle by time during the first detector,It is that the i-th vehicle passes through second Time during detector;
S22: the ratio between calculating estimation road section length and upstream and downstream RFID detector distance as follows:
λ = l L - - - ( 2 )
In formula, l is for estimating road section length, and L is upstream and downstream RFID detector distance;
S23: estimation Link Travel Time as follows:
t i = λ * t ‾ - - - ( 3 )
In formula, tlIt is that the i-th vehicle is by estimating Link Travel Time.
3. urban road RFID detector according to claim 1 optimizes distribution method, it is characterised in that: described step The volume of traffic in the traffic parameter of basic road carried out flow similarity analysis by S3 and sets up section similar matrix, specifically including Following steps:
S31: obtain the magnitude of traffic flow in the multiple section in city and any two road section traffic volume flows are calculated two basic roads as follows Similarity degree between the section magnitude of traffic flow:
ρ ( X , Y ) = cov ( X , Y ) δ X · δ Y - - - ( 4 )
Wherein,
δ Y = 1 n Σ i = 1 n ( Y i - Y ‾ ) 2 - - - ( 6 )
In formula, X represents the volume of traffic X array of section X, and Y represents the volume of traffic Y array of section Y;ρ (X, Y) represents section Coefficient correlation between X and the Y magnitude of traffic flow;
S32: differentiate whether two basic road magnitudes of traffic flow are similar according to coefficient correlation, if coefficient correlation is more than or equal to phase Like degree index, then it represents that have similitude between two basic road volume of traffic, " 1 " is used to represent similar;
S33: if coefficient correlation is less than index of similarity, then it represents that between two basic road volume of traffic, not there is similitude, adopt Represent similar with " 0 ";
S34: all basic roads carry out similarity analysis between any two to road network, and obtained coefficient correlation similarity is referred to After mark is carried out qualitatively, used the section similar matrix in all sections that " 0 " and " 1 " represent.
4. urban road RFID detector according to claim 1 optimizes distribution method, it is characterised in that: described step S4 sets up the Mathematical Modeling that RFID detector optimum layouts as follows:
min Z = Σ i = 1 n C i D i , i = 1 , 2 , ... , n - - - ( 7 )
s . t . Σ j = 1 n α i j D j ≥ 1 , i , j = 1 , 2 , ... , n - - - ( 8 )
Σ i = 1 n D i = k , i = 1 , 2 , ... , n - - - ( 9 )
In formula, αijFor element value in the similar matrix of section, CiRepresent the comprehensive cloth dot factor in i section, represent in this section The importance degree layouted, k is for calculating, based on journey time estimation optimization method, the RFID detector number obtaining;Z represents detector Optimum is layouted minimum of a value;Di represents the test point in the i-th section;N represents section sum.
5. urban road RFID detector according to claim 1 optimizes distribution method, it is characterised in that: described step The iterative process of model is laid in genetic algorithm for solving urban road RFID detector optimization in S5, specifically includes following steps:
S51: initializing, putting genetic algebra T=0, initial population randomly generates, at the beginning of utilizing fitness function evaluation each after coding Begin individual ideal adaptation degree;
S52: select the individuality that fitness is relatively low, rejects the higher individuality of fitness;
S53: application crossover operator and mutation operator generate colony of a new generation, and keep population at individual number m constant;
S54: the fitness of a new generation's population at individual being evaluated, and checks stop criterion, if meeting end condition, then turning To step S55, otherwise T=T+1, forward step S52 to;
S55: jump out, exports optimized individual, it is thus achieved that optimum RF ID Loop detector layout method.
6. urban road RFID detector according to claim 5 optimizes distribution method, it is characterised in that: described step Coding in S51, specific as follows:
Basic road in road network is laid test point coding and uses binary coding;If a gene segment table shows what trunk section formed Road network detector layout set, in this set represents a section detector layout situation, and detection is laid in 1 expression section Point, test point is not laid in 0 expression section;In the chromosome of a construction, according to order from left to right, meet constraint bar One gene segment table of part shows a kind of test point selection scheme.
7. urban road RFID detector according to claim 5 optimizes distribution method, it is characterised in that: described step Fitness in S54 uses following optimization to lay object function and calculates as fitness function:
f = Σ i = 1 n C i D i ;
In formula, f represents global minimum;CiRepresent the comprehensive cloth dot factor in i section, represent the weight layouted in this section Spend;DiRepresent and whether lay test point in i section.
8. urban road RFID detector according to claim 5 optimizes distribution method, it is characterised in that: described step Stop criterion in S54, specifically employing equation below:
Q ( T ) = Σ t = 2 T | f m i n t - f m i n t - 1 | - - - ( 12 )
Algorithm end condition: Q (T)-Q (T-1)≤ε;
In formula, Q (T) tends to convergency value for current;Genetic algebra appeared in current calculating for the T,Represent in t generation Minimum fitness value, whereinε represents predetermined threshold value.
CN201410613935.7A 2014-10-31 2014-10-31 Urban road RFID detector optimizes distribution method Active CN104332051B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410613935.7A CN104332051B (en) 2014-10-31 2014-10-31 Urban road RFID detector optimizes distribution method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410613935.7A CN104332051B (en) 2014-10-31 2014-10-31 Urban road RFID detector optimizes distribution method

Publications (2)

Publication Number Publication Date
CN104332051A CN104332051A (en) 2015-02-04
CN104332051B true CN104332051B (en) 2016-11-09

Family

ID=52406770

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410613935.7A Active CN104332051B (en) 2014-10-31 2014-10-31 Urban road RFID detector optimizes distribution method

Country Status (1)

Country Link
CN (1) CN104332051B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105844038B (en) * 2016-03-31 2019-02-05 东南大学 A kind of highway polymorphic type traffic detector Combinatorial Optimization distribution method
CN106781487B (en) * 2016-12-28 2019-10-25 安徽科力信息产业有限责任公司 Road fixed detector lays type choosing method
CN107622664B (en) * 2017-09-25 2020-08-25 山东交通学院 Traffic flow detector layout method, server and system based on building block splicing
CN109376396B (en) * 2018-09-27 2022-10-28 中国科学技术大学 Site selection and point distribution method for road network general survey facilities
CN114724323B (en) * 2022-06-09 2022-09-02 北京科技大学 Point distribution method of portable intelligent electronic fence for fire scene protection

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102306450B (en) * 2011-08-30 2014-04-16 同济大学 Layout method for traffic detectors of sparse road network
JP2013232110A (en) * 2012-04-27 2013-11-14 Toshiba Corp Vehicle detection device and toll collection system
GB201221150D0 (en) * 2012-11-23 2013-01-09 Tomtom Belgium Nv Method of extracting gps traces to display driving trajectories through an area over one or more junctions
CN103065469B (en) * 2012-12-14 2015-02-04 中国航天系统工程有限公司 Travel time determination method and travel time determination device
CN103198672A (en) * 2013-03-27 2013-07-10 大连海事大学 Method for laying urban road network traffic flow detectors
CN103489316B (en) * 2013-09-10 2016-05-18 同济大学 A kind of network traffic flow detector distribution method based on road network topology relation

Also Published As

Publication number Publication date
CN104332051A (en) 2015-02-04

Similar Documents

Publication Publication Date Title
CN104332051B (en) Urban road RFID detector optimizes distribution method
Singh et al. Towards baseflow index characterisation at national scale in New Zealand
CN105512767B (en) A kind of Flood Forecasting Method of more leading times
CN104484996B (en) Road segment traffic state distinguishing method based on multi-source data
CN102722986B (en) Urban road network traffic control subarea dynamic partitioning method
CN109272146A (en) A kind of Forecasting Flood method corrected based on deep learning model and BP neural network
Kar et al. Rain gauge network design for flood forecasting using multi-criteria decision analysis and clustering techniques in lower Mahanadi river basin, India
CN109035767A (en) A kind of tide lane optimization method considering Traffic Control and Guidance collaboration
CN107991873A (en) A kind of metro stray current leakage class Forecasting Methodology based on convolutional neural networks and BP neural network
Herrero Self-avoiding walks on scale-free networks
CN108694278A (en) A kind of city discrete network design problem method based on road load equilibrium
CN103208034B (en) A kind of track traffic for passenger flow forecast of distribution model is set up and Forecasting Methodology
Ma et al. Process-oriented SWMM real-time correction and urban flood dynamic simulation
CN109191849A (en) A kind of traffic congestion Duration Prediction method based on multi-source data feature extraction
CN109584552A (en) A kind of public transport arrival time prediction technique based on network vector autoregression model
CN103049829B (en) Integrated fusion method of urban and rural passenger line network and hub station
CN109919819A (en) Building, evaluation and the optimization method of local area ecological network
CN109377048A (en) A kind of comprehensive traffic network hub node selection method
CN106781464A (en) A kind of congestion in road situation method of testing
CN104992249B (en) A kind of flood-diversion area hedging metastasis model method for building up under passive flood diversion scene
CN104574968A (en) Determining method for threshold traffic state parameter
CN104821086B (en) Method for positioning low-efficient road section combination in large-scale traffic network
CN112699610A (en) Sponge city optimization design method based on high-dimensional multi-objective evolutionary algorithm
CN110543660B (en) Low-impact development simulation method, system and related device
Damangir et al. System identification and subsequent discharge estimation based on level data alone—Gradually varied flow condition

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20201228

Address after: 402460 station No.14, no.6, 10th floor, innovation and development center, No.19 Lingfang Avenue, Changzhou street, Rongchang District, Chongqing

Patentee after: Chongqing kezhiyuan Technology Co.,Ltd.

Address before: 400030 No. 174 Sha Jie street, Shapingba District, Chongqing

Patentee before: Chongqing University

TR01 Transfer of patent right