CN106529608B - A kind of telemetering motor vehicle tail equipment complex system for arranging gravity points - Google Patents

Abstract

The invention discloses a kind of telemetering motor vehicle tail equipment complex system for arranging gravity points, including the cloth point module based on road similitude, the cloth point module based on road network topology structure and the cloth point module based on particular vehicle route.Cloth point module based on road similitude is realized using a kind of telemetering motor vehicle tail equipment points distributing method based on road similitude；Cloth point module based on road network topology structure is realized using a kind of motor-vehicle tail-gas remote sensing monitoring equipment Layout algorithm based on graph theory；Cloth point module based on particular vehicle route realizes that the generaI investigation progress tail gas remote-measuring equipment addressing for urban mass-transit system tail gas is layouted using a kind of based on the telemetering motor vehicle tail equipment points distributing method of graph theory and Boolean algebra.Three modules can be used alone, and also can be used in combination, and realize that the sensor distributing for different target designs.

Description

A kind of telemetering motor vehicle tail equipment complex system for arranging gravity points

Technical field

Present invention relates particularly to a kind of telemetering motor vehicle tail equipment complex system for arranging gravity points, belongs to communal facility and layout addressing Technical field.

Background technique

Since national vehicle guaranteeding organic quantity rapidly increases in recent years, cause urban district and various regions traffic congestion phenomenon increasingly tight Weight, atmosphere quality also show degradating trend, and Maneuver seeker monitoring work is faced with stern challenge.It is motor-driven Tail gas is the important pollutant of urban air pollution, is the major source of urban air pollution, in city environmental pollution Monitoring aspect, motor-vehicle tail-gas monitoring proportion is higher and higher, has become the important component of environmental protection and management.

Since 2000, environmental protection administration constantly reinforces the supervision of motor-vehicle tail-gas, on the one hand, is discharged by improving The speed that standard accelerates old motor vehicle superseded: automotive emission standard is continuously improved, from Europe I, Europe II to five standard of state, The time in more than 10 years is only passed through.On the other hand, motor-vehicle tail-gas detection means and technology continue to develop, and successively experience is double idle In the stages such as fast method, simple condition method, simulation operating condition method, remote sensing monitoring method, detection device is also from hand-held, portable, detecting field It is fixed that have developed to vehicle-mounted removable, trackside fixed.Wherein, short with detection cycle due to emerging remote sensing monitoring method, Without manually participating in, accuracy height and the characteristics of do not influence traffic, become the important technology hand of motor-vehicle tail-gas detection gradually Section, has obtained the generally approval of industry.Nevertheless, remote sensing monitoring method can solve also be only Tail gas measuring the problem of, it is right In the whole control problem of urban automobile (especially with motor vehicle), still cannot be fully solved.

Since telemetering motor vehicle tail equipment is not yet used widely in city road network, the cloth of remote-measuring equipment is clicked Location problem, existing research are seldom.A kind of " city road network motor-vehicle tail-gas Real-time Remote Sensing monitoring plot choosing method " (application Number: 201510214145.6) disclose it is a kind of take remote measurement the site selecting method of equipment in entire city road network region, this method Purpose is the spot optimization by tail gas remote-measuring equipment so that the remote-measuring equipment on city road network is detectable more as far as possible Vehicle, this method lay particular emphasis on the generaI investigation of individual vehicle emission level, are not suitable for such as emphasis vehicle exhaust emission situation investigation, city The research of city's road network area alignment concentration sealing etc..

In environmental monitoring field, the location problem of layouting for having air quality monitoring similarly, about this problem Research it is more.The site selecting method of layouting of traditional air quality monitoring mainly has: lattice method, function division layout method, Sector is layouted method and the multi-faceted method of layouting of concentric circles.Liu Pan Wei etc. is " regional air quality-monitoring network optimization points distributing method is ground Study carefully " in (China Environmental Science, 07 phase in 2010) using maximum approach value as optimization aim, propose a kind of regional air quality-monitoring The integer programming model of network spot optimization problem, and solved using branch and bound method.Since tail gas remote-measuring equipment is peace On road, the population constraint and spatial coverage constraint considered in the document is not suitable for this project, and target letter Number is also different.Ten thousand open etc. " application of the automatic Quality Control of network in the monitoring of air Optimizing " (Environmental science and technology, 2010 Year 6E phase) in fixed and mobile automatic monitoring is combined, use network remote Quality Control technology to realize air quality monitoring Optimizing, substantially or lattice method.However we to be carried out installation laying remote-measuring equipment be it is fixed, Therefore this method is also not suitable for.Patent of invention " a kind of air quality monitoring station's Optimizing method " (application number: 201610037653.6) disclose it is a kind of using gram in golden least squares optimization as the Optimizing side, air quality monitoring station of target Method, this method consideration, which increases on the basis of having existed monitoring location network in survey region in the region, layouts.And for For motor-vehicle tail-gas remote sensing monitoring, such network is not yet formed, therefore method provided by the invention can not be suitable for machine Motor-car tail gas remote-measuring equipment is layouted.

Although domestic remote sensing monitoring method slowly starts, development is universal, and blank is still compared in its follow-up work.Wherein, Layout problem of the telemetering motor vehicle tail equipment on road network is particularly critical, therefore needs to propose a series of effective layout Scheme promotes telemetering motor vehicle tail industry in China's fast-developing, is to push the practical application of road Vehicle Emissions Remote Sensing System The groupcontrol of environmental pollution region and the policy of nitrogen oxides total amount emission reduction provide strong technical support.

Summary of the invention

Traditional remote sensing monitoring method can only detect wherein few Some vehicles, and each monitoring point disperses, without real Existing systematization and integrated, does not make full use of connecting each other for each data of monitoring point, cannot achieve the supervision of higher level, be Relevant department provides decision-making foundation or suggestion.The technology of the present invention can overcome disadvantages mentioned above, really play the excellent of tail gas remote-measuring equipment Gesture realizes networking, the systematization of city management, provides a kind of telemetering motor vehicle tail equipment complex system for arranging gravity points.

The technology of the present invention solution: a kind of telemetering motor vehicle tail equipment complex system for arranging gravity points, including it is based on road phase Cloth point module like property, the cloth point module based on road network topology structure and the cloth point module based on particular vehicle route；

Solve the problems, such as that addressing of the telemetering motor vehicle tail equipment in city road network is layouted, it can be by road network topology, road Information, weather information, traffic information and region of layouting have the data of detector number as input, realize effectively detection vehicle Number is maximum, vehicle detection distinctiveness is minimum and the maximum target of Route coverage, is relevant departments according to the difference of performance indicator A variety of addressing sensor distributings are provided, are set up an office using addressing points distributing method to cloth of the telemetering motor vehicle tail equipment in city road network Position optimizes, it can be ensured that the integrality and diversity for acquiring data preferably serve subsequent data processing and analysis.

Cloth point module based on road similitude uses a kind of telemetering motor vehicle tail equipment cloth based on road similitude Point methods are realized, have been fully considered link characteristics, road surrounding environment and meteorologic factor, are extracted wherein key property and gathered Class clusters the different sections of highway of city road network using the method for hierarchical clustering, can set any number of tail gas telemetering Standby optimize is layouted；

Cloth point module based on road network topology structure uses a kind of motor-vehicle tail-gas remote sensing monitoring equipment cloth based on graph theory Algorithm is put to realize, based on city road network topological structure, is aided with vehicle flowrate grade, the regional function information in city, based on figure Problem is modeled with Hypergraph Theory, minimum is converted by the location problem of layouting of remote-measuring equipment and traverses problem, it is final to use Greedy algorithm solves the section set for laying tail gas remote-measuring equipment；

Cloth point module based on particular vehicle route uses a kind of telemetering motor vehicle tail based on graph theory and Boolean algebra Equipment points distributing method realizes, the generaI investigation for urban mass-transit system tail gas carries out tail gas remote-measuring equipment addressing and layouts, first base In Hypergraph Theory, bus routes hypergraph is converted by bus running route, the relative theory of Boolean algebra is then used, determines tail Installation position of the gas remote-measuring equipment in city road network；

The above-mentioned cloth point module based on road similitude, the cloth point module based on road network topology structure be based on particular vehicle The cloth point module of route can be used alone, and also can be used in combination, selection criteria depend on input information number and policymaker Functional requirement to the tail gas remote-measuring equipment for being laid in city road network；

In all obtainable situation of Tail gas measuring information, information of vehicle flowrate on road, Weather information and road relevant information Using the cloth point module based on road similitude；Only include the topological structure of traffic network in input information and some is easy to get Traffic information opened up when including section affiliated area function, the grade of the magnitude of traffic flow and whether having overline bridge using based on road network Flutter the cloth point module of structure；Using the cloth point module based on particular vehicle route when needing to bus progress key monitoring.

In the cloth point module based on road network topology structure, a kind of telemetering motor vehicle tail based on road similitude is set Standby points distributing method, comprising the following steps:

Step 1: sample data needed for acquiring simultaneously pre-processes sample data, and the required sample data refers to use Tail gas remote-measuring equipment obtains the Tail gas measuring information that every section is interior for a period of time in target road network, information of vehicle flowrate on road, day Gas information and road relevant information；Data prediction includes that data cleansing, hough transformation and data convert three aspects；

Step 2: it is carried out using the method for hierarchical clustering to passing through data prediction treated sample data in step 1 Clustering；Each sample is classified as one kind first by the measurement using Euclidean distance as clustering distance, calculates every two Similarity between a class, that is, sample with sample measured between any two by distance；Then wherein similarity degree highest It namely is polymerized to one kind, circulating repetition similarity measurement and the merging for carrying out nearest class apart from the smallest sample, reduces one every time Class obtains cluster result finally until all samples are gathered into one kind；

Step 3: according to the cluster result in step 2, drawing Cluster tendency, the visual result that each step is clustered It is shown on Cluster tendency；

Step 4: assigning weight to the section investigated, represent the significance level in section and pay the utmost attention to degree, will appoint The tail gas remote-measuring equipment of meaning number correspond to the cluster result of respective number, found on Cluster tendency comprising class number equal to pair The cluster result for answering number chooses the maximum section of weight in each class and lays tail gas remote-measuring equipment, finally obtains arbitrary number The scheme that purpose tail gas remote-measuring equipment is layouted.

In a kind of telemetering motor vehicle tail equipment points distributing method based on road similitude, the step 1 is specifically real It is now as follows:

(1) the sample data acquisition before clustering, using every section in target road network as a sample, obtains each sample This section interior for a period of time Tail gas measuring information, information of vehicle flowrate on road, Weather information and road relevant information；Wherein:

Tail gas measuring information, including data item have: detection device number, detection time, the license plate number of detection, vehicle Speed, vehicle acceleration, Vehicle length, CO2, CO, HC, NO concentration, smoke intensity value, capture pictures；

Information of vehicle flowrate on road, including data item have: road name, time, including station wagon, middle bus Different type vehicle vehicle flowrate；

Weather information, including data item have: the time, city, weather conditions, temperature, humidity, wind speed, PM2.5, PM10, AQI；

Road relevant information, including data item have: geographical location id, place province, place city, place street, even Connect mode, roadside tree and grass coverage, building average height；

(2) sample data preprocessing part includes that data cleansing, hough transformation and data convert three aspects；Data are clear It washes, is exactly to find out missing values by the analysis to data, deviate excessive individual extremums progress discard processing；Hough transformation, It deletes to considered a problem uncorrelated, weak related or redundancy attribute, merges same alike result, while constantly to association attributes Selection is modified, to reach required Clustering Effect；Data after hough transformation are standardized place by data transformation Reason is converted into the appropriate format convenient for processing, to adapt to the needs of clustering.

In a kind of telemetering motor vehicle tail equipment points distributing method based on road similitude, in the step 2, adopt Clustering is carried out to the sample data handled in step 1 with the method for hierarchical clustering specifically includes the following steps:

(1) processing in step 1 is obtained into each of sample sample and is all classified as one kind, calculated between every two class Similarity measures sample with sample at a distance between any two；The similitude measured between sample uses euclidean Measurement of the distance as clustering distance, Euclidean distance are as follows:

Wherein, d (i, j) indicates Euclidean distance, and i and j are the specimen number of i-th of sample and j-th of sample, respectively Represent i-th section and j-th strip section, M₄Indicate the association attributes number chosen, association attributes include the dirt after attribute merges Contaminate total vehicle flowrate after object total concentration, smoke intensity value, attribute merge, connection type, roadside tree and grass coverage, building average height, x Indicate numerical value of the association attributes after standardization, x_i1Indicate the 1st attribute of i-th of sample, x_i2Indicate i-th of sample 2nd attribute,Indicate the M of i-th of sample₄A attribute, x_j1Indicate the 1st attribute of j-th of sample, x_j2Indicate jth 2nd attribute of a sample,Indicate the M of j-th of sample₄A attribute；

(2) similarity degree highest in step (1) is namely polymerized to one kind apart from the smallest two samples, it is assumed that be sample N₅With sample M₆, by sample N₅, M₆A new class is merged into, Cla is denoted as₁={ N₅,M₆, newly generated class Cla₁Association attributes use Section N₅, M₆The mean value of corresponding attribute indicates that the attribute of that is, new class is expressed as

Wherein, N₅And M₆For N₅A sample and M₆The specimen number of a sample, M₄Indicate the association attributes number chosen, X indicates numerical value of the association attributes after standardization,Indicate N₅1st attribute of a sample,Indicate N₅It is a The M of sample₄A attribute,Indicate M₆1st attribute of a sample,Indicate M₆The M of a sample₄A category Property；

(3) new class and other classes obtain a N together₄The sample of -1 capacity calculates all sample point every two in sample Between similarity, i.e., distance between any two measured；It will wherein to be polymerized to one kind apart from the smallest two samples, remember For Cla₂, newly generated class Cla₂Association attributes indicated with the mean value of the correspondence attribute for two samples for including in class；

(4) similarly, repeat the merging of similarity measurement and nearest class, reduce one kind every time, successively obtain new classThe number of last class is reduced to 1, and all samples are gathered into one kind, and cluster result is obtained.

In a kind of telemetering motor vehicle tail equipment points distributing method based on road similitude, in the step 3, root Cluster tendency is drawn according to cluster process, and abscissa is represents clustering for the first time at 1 as a result, abscissa is represents second at 2 Secondary cluster as a result, and so on, on Cluster tendency, Cluster tendency fills for the display for the visual result that each step is clustered Point every a one-step process of cluster is illustrated, allows and recognize which section of each step is gathered for one kind from visual level, it is each Which section separately included in inhomogeneous number and these classes after step end of clustering.

It is right in the step 4 in a kind of telemetering motor vehicle tail equipment points distributing method based on road similitude The section investigated assigns weight, after weight comprehensively considers the implantation of device cost in the section, implantation of device complexity element It determines, the bigger significance level for representing section of weight is bigger and to pay the utmost attention to degree higher；Assuming that needing number to be M₅'s Tail gas remote-measuring equipment is laid, and finding corresponding class number from Cluster tendency is M₅Cluster result, i.e. N₄-M₅Secondary cluster Afterwards as a result, choosing this M₅Tail gas remote-measuring equipment is laid in the maximum section of the weight of each class in a class, is finally obtained to any The scheme that the tail gas remote-measuring equipment of number is layouted.

In the cloth point module based on road network topology structure, a kind of telemetering motor vehicle tail equipment based on graph theory is layouted Method, comprising the following steps:

Step 1: urban road network is abstracted into a digraph according to topological structure and traffic flow direction, by traffic Road network information is abstracted into a data matrix, and all oriented times in the digraph are found using Depth Priority Algorithm Road；

Step 2: using all sections as the vertex of directed circuit hypergraph, all directed circuits are as directed circuit hypergraph Super side, establish the directed circuit hypergraph of city road network, simplify the directed circuit hypergraph, obtain simple directed cycle hypergraph, build The weighting degree model on vertex, finds the maximum vertex of weighting degree in weighting degree model in vertical simple directed cycle hypergraph, using greedy The minimum that greedy algorithm finds out simple directed cycle hypergraph is traversed, as the section of layouting of motor-vehicle tail-gas remote sensing monitoring equipment；Institute It states weighting degree and refers to that the degree for having merged the vertex of simple directed cycle hypergraph of traffic network information, the simple directed cycle are super It is the minimum vertex set for referring to covering all sides of simple directed cycle hypergraph that the minimum of figure, which is traversed,.

In a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory, in the step 1, by traffic road Net information is as follows at a data matrix:

Wherein,Indicate all sections of traffic network, M₇For section sum in road network；Table Show the information in section, including section affiliated area function, the grade of the magnitude of traffic flow, if having overline bridge；N₇For in points distributing method The road section information type utilized；R_ij, i=1,2 ..., M₇, j=1,2 ..., N₇Indicate specific after digitizing road section information Numerical value.

In a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory, in the step 1, using depth The process that first search algorithm finds all directed circuits in the digraph is as follows:

(1) urban road network is abstracted into a digraph according to topological structure and traffic flow direction first, then will Digraph is converted to line chart；

(2) it from an initial vertax of the line chart in step (1), is sought along the directed arc and different vertex of line chart Directed walk is looked for, until directed arc being judged whether there is and returning to initial vertax, if depositing there is no the next vertex of directed arc arrival Showing to detect a circle；

(3) the upper vertex for retracting directed walk in step (2) continues to expand directed walk along other directed arcs, Until judging whether there is directed arc and returning to initial vertax, and if it exists, show to detect there is no the next vertex of directed arc arrival It is enclosed to one；

(4) step (3) are repeated, until retracting initial vertax；

(5) successively using other vertex as initial vertax, repeat step (2) (3) (4), all circles of line chart be it is original to All directed circuits of figure.

In a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory, the step 2 specific implementation is such as Under:

(1) using all sections as the vertex of directed circuit hypergraph, side of all directed circuits as directed circuit hypergraph, Establish the directed circuit hypergraph model of city road network；

(2) two sides for successively comparing the directed circuit hypergraph established in (1), judge whether there is inclusion relation, if depositing , then leave out that longer side in directed circuit hypergraph, and this step is repeated to the directed circuit hypergraph behind deletion side, Inclusion relation is not present all while deleting any two of the directed circuit hypergraph after to get super to simple directed cycle Figure；

(3) the weighting degree model on vertex is established in the simple directed cycle hypergraph that step (2) obtains, and finds weighting degree mould The maximum vertex of weighting degree in type, is traversed using the minimum that greedy algorithm finds out simple directed cycle hypergraph.Greedy algorithm is asked Solution preocess is as follows: in simple directed cycle hypergraph, deleting the maximum vertex of weighting degree in weighting degree model and includes the vertex All sides, and this step is repeated to the simple directed cycle hypergraph behind vertex and side is deleted, until simple directed cycle is super Figure is sky, then the vertex set deleted is that the minimum of simple directed cycle hypergraph is traversed, i.e. motor-vehicle tail-gas remote sensing monitoring equipment Section of layouting.

It is simple oriented in the step 2 in a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory The mathematical expression of the weighting degree model on vertex is as follows in the hypergraph of circuit:

Wherein, D^*(i) the weighting degree of simple directed cycle hypergraph vertex i, R are indicated_ijFor traffic network data matrix model In element, i=1,2 ..., M₇；r_jFor road section information, r_jmaxIndicate r_jMaximum value, w_atr,jIndicate the power of each road section information Value meetsDeg (i) indicates the degree of vertex i in simple directed cycle hypergraph, deg_maxIndicate simple oriented The maximum value of the degree on all vertex in the hypergraph of circuit.

In the cloth point module based on particular vehicle route, a kind of motor-vehicle tail-gas based on graph theory and Boolean algebra is distant Measurement equipment points distributing method, comprising the following steps:

Step 1: bus travel route is abstracted as bus routes hypergraph；

Step 2: all of bus routes hypergraph are solved using Boolean algebra correlation theory and minimum traverse collection；

Step 3: the minimum for solving bus routes hypergraph traverses collection, and the minimum, which is traversed collection and referred to, all minimum traverses collection Middle radix is the smallest one minimum to traverse collection, and minimum traverses collection and refers to minimum monitoring section set in the present invention, that is, needs to lay The set in the section of tail gas remote-measuring equipment.

In a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra, the step 1 tool Body is accomplished by

(1) based on the actual traffic route network in city, each section passed through in bus travel route is abstracted For hypergraph vertex, vertex set is obtained；

(2) bus vehicle line is abstracted as super side, super side is the subset of vertex set；

(3) set on all super sides is hypergraph, and hypergraph is obtained by bus travel route, and referred to as bus routes are super Figure.

In a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra, the step 2 tool Body is accomplished by

(1) Boolean variable χ is set to each vertex in bus routes hypergraph_i, χ_iIndicate whether section i lays tail gas telemetering and set It is standby, if χ_i=1 indicates that this section needs to lay remote-measuring equipment；

(2) by its contained vertex progress Boolean addition, boolean's each edge for obtaining each side extracts in bus routes hypergraph Formula, it may be assumed thatψ_jIndicate the section for including in j-th strip public transport operation route；

(3) boolean's disjunction expression on all sides is subjected to Boolean multiplication, obtains the Boolean conjunction formula of bus routes hypergraph, it may be assumed that Indicate the entirety in section contained by all routes in entire bus routes net, N_hyFor public transport Exceeded number in route hypergraph；

(4) abbreviation is arranged to resulting conjunction expression Boolean calculation rule, obtains most simple disjunction expression, it may be assumed that Wherein each minor λ_tCorresponding vertex set, which is that one of bus routes hypergraph is minimum, traverses collection, All λ_tConstitute all minimum set for traversing collection of bus routes hypergraphIt indicates and bus every fortune The section that walking along the street line all intersects is all.

In a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra, step 3 is specifically real It is now as follows:

(1) each minimum radix for traversing collection, i.e., the number on contained vertex are asked；

(2) determine radix it is the smallest it is minimum traverse collection, this is minimum, and to traverse collection be that minimum traverses collection, and minimum is traversed concentration and pushed up The corresponding section of point is the section for needing to lay tail gas remote-measuring equipment, and the collection that these sections are constituted is combined into minimum monitoring section Set.

The present invention compared with prior art the advantages of:

(1) traditional remote sensing monitoring method can only detect wherein few Some vehicles, and each monitoring point disperses, and does not have It realizes systematization and integrated, does not make full use of connecting each other for each data of monitoring point, cannot achieve the supervision of higher level, Decision-making foundation or suggestion are provided for relevant department.The technology of the present invention can overcome disadvantages mentioned above, really play tail gas remote-measuring equipment Advantage realizes networking, the systematization of city management.

(2) a kind of telemetering motor vehicle tail equipment complex system for arranging gravity points proposed by the present invention includes based on road similitude Cloth point module, the cloth point module based on road network topology structure and the cloth point module based on particular vehicle route, using different choosings Location points distributing method optimizes laying point of the telemetering motor vehicle tail equipment in city road network for different target, can The integrality and diversity for ensuring to acquire data, can preferably serve subsequent data process&analysis.

(3) a kind of telemetering motor vehicle tail equipment points distributing method based on road similitude of the present invention, will be limited Resource focus on the part of high value, realize the target of maximizing the benefits.Any number of tail gas remote-measuring equipment is carried out Optimization is laid so that sensor distributing is more flexible, on the one hand, the idle waste with fund for avoiding equipment can make every distant Measurement equipment is made the best use of everything；On the other hand, exhaust information as much as possible can be obtained to greatest extent and system-wide net tail gas is believed Breath is made prediction.

(4) a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra of the present invention, it is special Safety pin designs tail gas remote-measuring equipment points distributing method to bus, based on graph theory and Boolean algebra theory by the cloth of tail gas remote-measuring equipment The minimum that point problem is converted into bus routes hypergraph traverses Solve problems, then finds out minimum with the method for Boolean calculation and traverse i.e. Sensor distributing is obtained, and algorithm is simple, it is easier to operate.Temporary not grinding using bus as the points distributing method of application background now Study carefully, therefore the present invention has filled up technological gap of the prior art under the application background, has very big practice significance.

(5) a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory of the present invention, the information needed is more It is few, the topological structure and some traffic informations being easy to get of traffic network, such as the vehicle flowrate grade in section, city is only utilized Whether the regional function in city, section have overline bridge etc., can be obtained the section of layouting of motor-vehicle tail-gas remote sensing monitoring equipment；Pass through Traffic network data matrix is established, converts digital information for analog informations such as traffic datas, analysis of being more convenient for, classification and place Reason.

Detailed description of the invention

Fig. 1 is the composition block diagram of present system；

Fig. 2 is the telemetering motor vehicle tail equipment points distributing method flow chart based on road similitude；

Fig. 3 is that the embodiment Cluster tendency of the telemetering motor vehicle tail equipment points distributing method based on road similitude shows It is intended to；

Fig. 4 is the telemetering motor vehicle tail equipment points distributing method flow chart based on graph theory；

Fig. 5 is the traffic network digraph of the telemetering motor vehicle tail equipment points distributing method based on graph theory；

Fig. 6 is the traffic network directed circuit hypergraph of the telemetering motor vehicle tail equipment points distributing method based on graph theory；

Fig. 7 is the telemetering motor vehicle tail equipment points distributing method flow chart based on graph theory and Boolean algebra；

Fig. 8 is that the bus routes hypergraph of the telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra is minimum It traverses, minimum traverses solution flow chart.

Specific embodiment

As shown in Figure 1, the invention discloses a kind of telemetering motor vehicle tail equipment complex system for arranging gravity points, including it is based on road The cloth point module of similitude, the cloth point module based on road network topology structure and the cloth point module based on particular vehicle route；Three Module can be used alone, and also can be used in combination, and solve the problems, such as that addressing of the telemetering motor vehicle tail equipment in city road network is layouted, Road network topology, road information, weather information, traffic information and region of layouting can be had the data of detector number as defeated Enter, realizes that effectively detection vehicle number is maximum, vehicle detection distinctiveness is minimum and the maximum target of Route coverage, referred to according to performance Target is different, provides a variety of addressing sensor distributings for relevant departments.Using addressing points distributing method, to telemetering motor vehicle tail equipment Laying point in city road network optimizes, it can be ensured that the integrality and diversity for acquiring data can be served preferably Subsequent data process&analysis；

Cloth point module based on road similitude uses a kind of telemetering motor vehicle tail equipment cloth based on road similitude Point methods are realized, have been fully considered link characteristics, road surrounding environment and meteorologic factor, are extracted wherein key property and gathered Class clusters the different sections of highway of city road network using the method for hierarchical clustering, can set any number of tail gas telemetering Standby optimize is layouted；

Cloth point module based on road network topology structure uses a kind of motor-vehicle tail-gas remote sensing monitoring equipment cloth based on graph theory Algorithm is put to realize, based on city road network topological structure, is aided with vehicle flowrate grade, the regional function information in city, based on figure Problem is modeled with Hypergraph Theory, minimum is converted by the location problem of layouting of remote-measuring equipment and traverses problem, it is final to use Greedy algorithm solves the section set for laying tail gas remote-measuring equipment；

Cloth point module based on particular vehicle route uses a kind of telemetering motor vehicle tail based on graph theory and Boolean algebra Equipment points distributing method realizes, the generaI investigation for urban mass-transit system tail gas carries out tail gas remote-measuring equipment addressing and layouts, first base In Hypergraph Theory, bus routes hypergraph is converted by bus running route, the relative theory of Boolean algebra is then used, determines tail Installation position of the gas remote-measuring equipment in city road network；

Cloth point module based on road similitude be suitable for Tail gas measuring information, information of vehicle flowrate on road, Weather information and Addressing sensor distributing design in all obtainable situation of road relevant information, the cloth point module based on road network topology structure are applicable in In topological structure and some traffic informations being easy to get that input information only includes traffic network, including section affiliated area function Can, the grade of the magnitude of traffic flow and whether overline bridge be had, the cloth point module based on particular vehicle route is applicable to bus Carry out addressing sensor distributing design when key monitoring.

Related important technology above-mentioned to the present invention is described in detail separately below.

One, the telemetering motor vehicle tail equipment points distributing method of the present invention based on road similitude, specific implementation Mode is as follows:

Embodiment chooses Hefei City somewhere road network specific detection data interior for a period of time, which includes section Number is N₄=10, it obtains to be M by arbitrary number using clustering₅Tail gas remote-measuring equipment optimize the side of laying Case, as shown in Fig. 2, the specific implementation process is as follows shown.

Step 1: sample data needed for acquiring before cluster simultaneously pre-processes sample data.It will be every in target road network Section as a sample, obtain each sample section for a period of time in specific Tail gas measuring information, including data item Have: detection device number, detection time, the license plate number of detection, speed, vehicle acceleration, Vehicle length, CO2, CO, HC, NO Concentration, smoke intensity value, capture pictures etc..Information of vehicle flowrate on road, including data item have: road name, the time, station wagon, The vehicle flowrate of middle bus and other different type vehicles.Weather information, including data item have: time, city, day are vaporous Condition, temperature, humidity, wind speed, PM2.5, PM10, AQI.Road relevant information, including data item have: geographical location id, place Province, place city, place street, connection type, roadside tree and grass coverage, building average height.

Data cleansing is carried out first, by the analysis to data, is found out missing values, is deviateed excessive individual extremums progress Discard processing, this step need to spend the more time.Then hough transformation is carried out, is deleted and considered a problem uncorrelated, weak phase The attribute (such as temperature, humidity, wind speed, the license plate number of detection, speed, vehicle acceleration) of pass or redundancy merges like attribute (vehicle flowrate of station wagon, middle bus and other different type vehicles merges into vehicle flowrate, and CO2, CO, HC, NO concentration merge For pollutant concentration), finally have chosen wherein M₄(association attributes include that the pollutant after attribute merges is total to=8 association attributes Total vehicle flowrate, connection type, roadside tree and grass coverage, building average height after concentration, smoke intensity value, attribute merging).It is most laggard The transformation of row data, the data of not commensurate, different number grade are standardized.

Step 2: Hierarchical clustering analysis is carried out to the sample data handled in step 1 using the method for hierarchical clustering Specifically includes the following steps:

(1) processing in step 1 is obtained into each of sample sample and is all classified as one kind, amount to 10 classes, calculate every two Similarity between a class, that is, the Euclidean distance of sample point between any two is calculated, it is as follows to obtain distance matrix:

Wherein d indicates Euclidean distance.

(2) choosing the smallest element in the lower triangle of diagonal line or less is d (3,6), and it is new that section 3 and section 6 are merged into one Class is denoted as Cla₁={ 3,6 } are recalculated to obtain new class Cla using the association attributes in section 3 and section 6₁Attribute.

(3) N can be obtained in new class and other classes together₄The sample of -1=9 capacity calculates all sample points in new samples Distance between any two, wherein section 4 and section 10 to be polymerized to one kind apart from the smallest, are denoted as Cla2=for d (4,10) { 4,10 }, the number of class are reduced to 9.It recalculates to obtain new class Cla using the association attributes in section 4 and section 10₂Category Property.

(4) similarly, repeat similarity measurement and the merging apart from infima species, reduce one kind every time, it can be successively Obtain new class Cla₃, Cla₄..., Cla₉, in step 9 cluster, the number of class is reduced to 1, and all samples are gathered for one kind, Obtain cluster result.Cluster result is as shown in the table:

Cluster step number	Clustering and selection	Cluster result
			1	3,6	1,2,4,5,7,8,9,10, { 3,6 }
2	4,10	1,2,5,7,8,9, { 3,6 }, { 4,10 }
			3	8,9	1,2,5,7, { 8,9 }, { 3,6 }, { 4,10 }
4	C1a2, Cla3	1,2,5,7, { 3,6 }, { 4,8,9,10 }
			5	5, Cla4	1,2,7, { 3,6 }, { 4,5,8,9,10 }
6	7, Cla5	1,2, { 3,6 }, { 4,5,7,8,9,10 }
			7	1,2	{ 1,2 }, { 3,6 }, { 4,5,7,8,9,10 }
8	Cla1, C1a7	{ 1,2,3,6 }, { 4,5,7,8,9,10 }
			9	Cla6, Cla8	{ 1,2,3,4,5,6,7,8,9,10 }

Step 3: drawing Cluster tendency according to the cluster result in step 2, the visual result that each step is clustered It is shown on Cluster tendency as shown in Figure 3.Abscissa be 1 at represents for the first time cluster as a result, comprising 9 classes { 1 }, { 2 }, { 4 }, { 5 }, { 7 }, { 8 }, { 9 }, { 10 }, { 3,6 } }.Abscissa be represented at 2 second cluster as a result, including 8 classes { { 1 }, { 2 }, { 5 }, { 7 }, { 8 }, { 9 }, { 4,10 }, { 3,6 } }, and so on.

Step 4: assigning weight to the section investigated, represent the significance level in section and pay the utmost attention to degree, weight It is determined after comprehensively considering the elements such as implantation of device cost, the implantation of device complexity in the section.1 weight of section is 4, section 2, 3,4 weights are 3, and 5,6 weight of section is 2, and 7,8,9,10 weight of section is 1.Assuming that needing number to be M₅=3 tail gas telemetering Implantation of device finds the cluster result that corresponding class number is 3 into the road network, from Cluster tendency, i.e., the knot after the 7th time cluster Fruit is { { 1,2 }, { 3,6 }, { 4,5,7,8,9,10 } }, chooses the maximum section of weight { 1,3,4 } cloth of each class in this 3 classes If tail gas remote-measuring equipment, finally obtaining to the scheme that tail gas remote-measuring equipment is layouted is the cloth on section 1, section 3, section 4 Point.

Two, the telemetering motor vehicle tail equipment points distributing method of the present invention based on graph theory, specific implementation is such as Under:

As shown in figure 4, the specific implementation of the telemetering motor vehicle tail equipment points distributing method of the present invention based on graph theory It is as follows:

Step 1: urban road network is abstracted into a digraph according to topological structure and traffic flow direction, wherein having To the intersection of the vertex representation road network of figure, the directed arc of digraph indicates an one direction section of road network, directed arc Direction is determined by the traffic flow direction in the section.

By traffic network information at a M₇×N₇Data matrix, it is as follows:

Wherein,Indicate all sections of traffic network, M₇For section sum in road network； The information for indicating section, such as section affiliated area function, the grade of the magnitude of traffic flow, if having overline bridge etc., N₇For points distributing method Middle utilized road section information type；R_ij(i=1,2 ..., M₇, j=1,2 ..., N₇) indicate after digitizing road section information Specific value.Method for digitizing is as follows: if section is located at the Polluted areas such as factory, r₁=0, otherwise r₁=1；Section Vehicle flowrate grade can be divided into L₇A grade, with 1,2 ..., L₇Indicate vehicle flowrate from low to high；Whether section has overline bridge, with 1 table It is shown with overline bridge, 0 indicates no overline bridge etc..

Then all directed circuits in traffic network digraph are found using Depth Priority Algorithm, due to oriented time The searching algorithm on road is more complex, and the algorithm of directed cycle is easily achieved, therefore directed circuit in traffic network digraph is searched Rope is converted to the search of directed cycle in its line chart.Line chart is also a digraph, the arc of vertex representation original digraph, in line chart Two vertex are adjacent adjacent and if only if two arcs corresponding in former digraph.The line chart D of digraph D^*It indicates, if D's has It is to arc setD^*Vertex set be thenWherein v_i=a_i, i=1,2 ..., M₇。 In D^*The process of middle search directed cycle is as follows:

1, with v₁For initial vertax, directed walk is found along different vertexUntil from top PointThere is no directed arcs to reach next vertex.

2, check whether that there are directed arcsIf it exists, judge whether path length is greater than the set value L₈.If so, Show to detect that a coil is denoted as P₁。

3, it retractsContinue to expand directed walk along other directed arcs, under reaching there is no directed arc One vertex.It judges whether there is directed arc and returns to initial vertax, and if it exists, judge whether path length is greater than the set value L₈。 If so, showing to detect that a coil is denoted as P₂。

4, it returns toStep 3 is repeated until returning to v₁。

5, successively withFor initial vertax, step 1 is repeated, 2,3,4.

So far D is had found^*In all length be greater than the set value L₈Directed cycleWherein M₈For The sum of directed circuit in the sum and D of directed cycle.It should be noted that in order to avoid repeating, i.e., containing q vertex A certain directed cycle is detected repeatedly q times, with v_iIt looks for when circle for initial vertax without accessing vertex v_j(j≤i)。

Step 2: the directed circuit hypergraph model I=(χ of city road network is established_atr, F), wherein χ_atrIt is the vertex of hypergraph I Set, each element therein represent a section, and F is the super line set of hypergraph I, and each super side represents a directed circuit. Hypergraph I=(χ_atr, F) if be simple hypergraph and if only ifThen i=j.Due to the directed circuit by actual traffic road network The hypergraph of modeling may not be simple hypergraph, carry out simplifying directed circuit hypergraph I=(χ first_atr, F) operation, process It is as follows:

1, i=1, F'=F are enabled.

2, j=i+1 is enabled, judges F_iWhether F is contained in_j, if so, by F'-F_jIt is attached to F'；Otherwise judge F_jWhether F is contained in_i, such as It is, by F'-F_iIt is attached to F'.

3, j increases by 1, repeats second step until j=| F |.

4, i increases by 1, repeats second step and third step until i=| F | -1.

The maximum vertex of weighting degree in simplified directed circuit hypergraph is then looked for, it is simple to find out this using greedy algorithm The minimum of hypergraph is traversed, as the section set of layouting of motor-vehicle tail-gas remote sensing monitoring equipment.Wherein, simple directed cycle hypergraph The mathematical expression of the weighting degree on middle vertex is as follows:

Wherein, D* (i) indicates the weighting degree of vertex i in simple directed cycle hypergraph, R_ij(i=1,2 ..., M₁, j=1, 2,…,N₇) be traffic network data matrix model in element, r_j(j=1,2,3 ..., N₇) it is road section information, r₁Indicate section Affiliated regional function, if section is located at the Polluted areas such as factory, r₁=0, otherwise r₁=1, r_jmaxIndicate r_j(j=1,2, 3,…,N₇) maximum value, w_atr,j(j=1,2 ..., N₇) weight that indicates each road section information, meet Deg (i) indicates the degree of vertex i in simple directed cycle hypergraph, deg_maxIndicate the degree on all vertex in simple directed cycle hypergraph Maximum value.

The specific steps traversed using the minimum that greedy algorithm solves the simple hypergraph are as follows:

1, it enablesT_rFor empty set.

2, an empty vertex t is created_i, the vertex in searching with maximum weighting degree is assigned to t_i.By t_iIt is added to set T_rIn.

3, i increases by 1, enables figureTo delete selected vertex and the figure on all sides comprising the vertexRepeat step 2 UntilTo terminate when empty set.Then set T_rThe minimum of as directed circuit hypergraph is traversed, that is, motor-vehicle tail-gas remote sensing prison The section of layouting of measurement equipment.

For convenience of description, a simply example is chosen here introduce the motor-vehicle tail-gas of the present invention based on graph theory The detailed process of remote-measuring equipment points distributing method.Fig. 5 is digraph D=(V, A) made of certain urban parts traffic network is abstract, is handed over The method that access net is modeled as digraph are as follows: the section by the intersection vertex representation in traffic network, in traffic network It is indicated with directed arc, section here refers to the single section in traffic flow direction, and the road modeling of a two way is at two sides To opposite directed arc.Digraph shown in fig. 5 includes 7 vertex, and 11 directed arcs are equipped with to arc set A={ a₁,a₂,…, a₁₁}.Wherein, 7 intersections in 7 vertex representation actual traffic road networks, 11 directed arcs indicate in actual traffic road network 11 sections, arc a here₁,a₂,a₃,a₈,a₁₁Indicate the section of 5 one-way traffics, arc a₄And a₅, a₆And a₇And a₉And a₁₀ Indicate the road of three two ways, the direction of directed arc indicates wagon flow direction.Wherein at vertex 3 exist turn to limitation, i.e., from a₃Turn to a₆Do not allow.Traffic network data matrix is established according to road section information, as follows:

Wherein r₁Regional function belonging to section is indicated, if section is located at the Polluted areas such as factory, r₁=0, otherwise r₁ =1；r₂It indicates section vehicle flowrate grade, is divided into 5 grades, indicate vehicle flowrate from low to high with 1,2 ..., 5；r₃Indicating section is No to have overline bridge, use 1 indicates overline bridge, and 0 indicates no overline bridge.

Then all directed circuits in traffic network digraph are found using Depth Priority Algorithm, due to oriented time The searching algorithm on road is more complex, and the algorithm of directed cycle is easily achieved, therefore directed circuit in traffic network digraph is searched Rope is converted to the search of directed cycle in its line chart.Line chart is also a digraph, the arc of vertex representation original digraph, in line chart Two vertex are adjacent adjacent and if only if two arcs corresponding in former digraph.The line chart D of digraph D^*It indicates, then D^*Top Point set is combined into { v₁,v₂,…,v₁₁, wherein v_i=a_i, i=1,2 ..., 11.In D^*The process of middle search directed cycle is as follows:

1, with v₁For initial vertax, directed walk is found along different vertexUntil from top PointThere is no directed arcs to reach next vertex.

2, check whether that there are directed arcsIf it exists, judge whether path length is greater than the set value L₈=2.Such as It is to show to detect that a coil is denoted as P₁。

3, it retractsContinue to expand directed walk along other directed arcs, under reaching there is no directed arc One vertex.It judges whether there is directed arc and returns to initial vertax, and if it exists, judge whether path length is greater than the set value L₂。 If so, showing to detect that a coil is denoted as P₂。

4, it returns toStep 3 is repeated until returning to v₁。

5, successively withFor initial vertax, step 1 is repeated, 2,3,4.

So far D is had found^*In all length be greater than the set value L₈=2 directed cycle

P₁={ a₄, a₁₀, a₉, a₅}

P₂={ a₄, a₁₀, a₇, a₆, a₉, a₅}

P₃={ a₄, a₁₀, a₇, a₂, a₁}

P₄={ a₄, a₁₀, a₇, a₆, a₁₁, a₈, a₃, a₂, a₁}

P₅={ a₄, a₁₀, a₁₁, a₈, a₃, a₂, a₁}

P₆={ a₆, a₉, a₁₀, a₇}

It should be noted that a certain directed cycle that is, containing q vertex is detected repeatedly q times in order to avoid repeating, with v_iIt looks for when circle for initial vertax without accessing vertex v_j(j≤i)。

Then the directed circuit hypergraph model I=(χ of city road network is established_atr, F), wherein χ_atrIt is the vertex set of hypergraph I It closes, each element therein represents a section, and F is the super line set of hypergraph I, and each super side represents one in city road network Directed circuit, i.e. F_i=P_i, i=1,2 .., 6, as shown in Figure 6.Simplify hypergraph I:

1, i=1, F '=F are enabled.

2, j=i+1 is enabled, judges F_iWhether F is contained in_j, if so, by F '-F_jIt is attached to F '；Otherwise judge F_jWhether F is contained in_i, such as It is, by F '-F_iIt is attached to F '.

3, j increases by 1, repeats second step until j=| F |.

4, i increases by 1, repeats second step and third step until i=| F | -1.

In the present embodiment, simplified directed circuit hypergraph, '=(χ_atr, F '), wherein F '=F- { F₂, F₄}.Then it seeks The maximum vertex of weighting degree in simplified directed circuit hypergraph is looked for, the minimum for finding out the simple hypergraph using greedy algorithm is horizontal It passes through, as the section set of layouting of motor-vehicle tail-gas remote sensing monitoring equipment.In example of the present invention, the weighting degree of directed circuit hypergraph Mathematical expression it is as follows:

Wherein, D^*(i) the weighting degree of vertex i, R are indicated_ij(i=1,2 ..., 11, j=1,2,3) is traffic network data Element in matrix, r_jmax(j=1,2,3) indicates r_jThe maximum value of (j=1,2,3), λ_j(j=1,2,3) indicates each road information Weight, weight is determined as λ according to the reference value and significance level of each road section information₁=0.4, λ₂=0.4, λ₃=0.2, it is full FootDeg (i) indicates the degree of vertex i, deg_maxIndicate the maximum value of the degree on all vertex.

It is traversed using the minimum that greedy algorithm solves I ':

1, it enablesT_rFor empty set.

2, an empty vertex t is created_{R, i}, the vertex in searching with maximum weighting degree is assigned to t_{R, i}.By t_{R, i}It is added to Set T_rIn.

3, i increases by 1, enables figureTo delete selected vertex and the figure on all sides comprising the vertexRepeat step 2 UntilTo terminate when empty set.Then set Tr is that the minimum of directed circuit hypergraph is traversed, that is, motor-vehicle tail-gas remote sensing is supervised The section of layouting of measurement equipment.

In the telemetering motor vehicle tail equipment points distributing method embodiment of the present invention based on graph theory, finally find out Set Tr={ a₄, a₉, the section of layouting of as motor-vehicle tail-gas remote sensing monitoring equipment is gathered.

In short, the telemetering motor vehicle tail equipment points distributing method of the present invention based on graph theory is more feasible, compare In existing urban road network traffic road network motor-vehicle tail-gas remote sensing monitoring equipment points distributing method, the information that the present invention needs is less, The topological structure and some traffic informations being easy to get of traffic network, such as the vehicle flowrate grade in section, city is only utilized Regional function, whether section has overline bridge etc., and traffic information is digitized, and is more convenient for analyzing, be classified and being handled, to city Motor-vehicle tail-gas remote sensing monitoring equipment layout research of problem in city's provides new idea and method.

Three, the telemetering motor vehicle tail equipment points distributing method of the present invention based on graph theory and Boolean algebra, it is specific Implementation is as follows:

Telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra monitors the public transport tailstock with real-time high-efficiency Gas emission behaviour is target, according to graph theory and Boolean algebra correlation theory, carries out mathematical modeling and solves, and then studies motor vehicle Laying problem of the tail gas remote-measuring equipment in urban road network.

As shown in fig. 7, the specific implementation of the telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra walks It is rapid as follows:

(1) bus travel route is abstracted as bus routes hypergraph.

There is the definition of following hypergraph in graph theory:

IfIt is a finite aggregate, thenOn a hypergraphThe finite subset cluster referred to, so that (1) F_{Rou, i}≠ φ (i=1,2 ..., N)(2)WhereinFor hypergraphI-th of vertex, total M_vA vertex,For vertex set；F_{Rou, i}For HypergraphI-th surpass side, total N_hyA super side, φ indicate empty set,For super line set, that is, hypergraph.

In conjunction with urban road network, each section passed through in bus vehicle line is abstracted as hypergraph vertex, it will be whole Route is abstracted as super side, obtains bus routes hypergraph.

Hypergraph traverses in graph theory is defined as:

IfIt isOn a hypergraph, if vertex subsetMeet T_r ∩F_{Rou, i}≠ φ (i=1,2 ..., N_hy), i.e. T_rWithEach edge all intersects, then claims T_rIt is hypergraphOne traverse (collection).

If any one proper subclass traversed is not traversed, it is referred to as minimum to traverse collection that this, which is traversed,.It is all The minimum concentration the smallest minimum collection that traverses of radix that traverses is that minimum traverses collection.

Based on traverse above, it is minimum traverse, the minimum definition traversed, after public bus network is abstracted as hypergraph model, tail gas The problem of layouting of remote-measuring equipment, which is just converted into, asks the minimum of bus routes hypergraph to traverse collection problem.

(2) the minimum of bus routes hypergraph is asked to traverse collection.

On the basis of first two steps, the minimum of bus routes hypergraph is asked to traverse with Boolean algebra correlation theory.It introduces first Boolean algebra correlation theory.

The value of Boolean variable only has 0, and 1 two kinds of situations indicate the " Boolean addition (logic in Boolean algebra with "+" and " " Or) " and " Boolean multiplication (logical AND) ", it also referred to as " extracts " and is known as disjunction expression with " conjunction ", the expression formula containing only Boolean addition, Expression formula containing only Boolean multiplication is known as conjunction expression.

It is described below and seeks bus routes hypergraphAll minimum specific steps for traversing collection:

IfIt is vertex setOn a bus routes hypergraph, by public transport garage Route is sailed to be abstracted and obtain.Vertex is in hypergraphSuper side is F_{Rou, j}(j=1,2 ..., N_hy)。

It is used in the present inventionIndicate bus routes hypergraph, hypergraphA vertexIt indicates to pass through in bus routes A section；The super side F of one of hypergraph_{Rou, j}Indicate a bus running route.

1. to each vertexIf Boolean variable χ_iIt is corresponding to it, χ_iIndicate whether section i lays remote exhaust emission monitoring and set It is standby, if χ_i=1 indicates that this section needs to lay monitoring device.

2. to bus routes hypergraphEach side In vertexBoolean addition operation is carried out, each edge F is obtained_{Rou, j}Corresponding boolean's disjunction expression ψ_jIndicate the section for including in j-th strip public transport operation route；

3. the bus routes hypergraph 2. walked toIn all sides boolean's disjunction expression ψ_jBoolean multiplication operation is carried out, Obtain entire bus routes hypergraphBoolean conjunction formula: Indicate entire public bus network The entirety in section contained by all routes in net；

4. right First it is unfolded using boolean's distributive law, then carries out abbreviation with associative law, law of communication, idempotent law, Finally obtain most simple disjunction expression:Wherein λ_tCorresponding vertex set is bus routes HypergraphOne minimum traverse collection, all λ_tConstitute bus routes hypergraphIt is all it is minimum traverse collection,Indicate with The section that every working line of bus all intersects is all.

(3) minimum of bus routes hypergraph is asked to traverse collection.

Comparing and traverses all minimum radixes for traversing collection in hypergraph, the smallest minimum collection that traverses of radix is that minimum traverses collection, I.e. minimum monitoring section set, is the section for needing to lay motor-vehicle tail-gas remote sensing monitoring equipment in practice.

Fig. 8, which is that bus routes hypergraph is minimum, traverses collection, the minimum flow chart for traversing collection and solving.Firstly, super to bus routes Each vertex sets Boolean variable in figure, and variate-value takes 0 or 1, indicates that the section of vertex representative will lay Tail gas measuring and set when taking 1 It is standby；Then, to each edge in bus routes hypergraph, Boolean addition operation is carried out according to vertex contained by the side, is corresponded to Boolean's disjunction expression of each edge；Then boolean's disjunction expression on all super sides is subjected to Boolean multiplication operation, obtains entire public transport road The Boolean conjunction formula of line hypergraph；Abbreviation is arranged to resulting conjunction expression with the property of Boolean calculation later, obtains most simple extract Formula, wherein each minor, which represents the one minimum of hypergraph, traverses collection；Finally more each minimum radix for traversing collection, i.e., contained member The number of element, take radix it is the smallest it is minimum traverse integrate traverse collection as minimum, it is minimum to traverse section corresponding to the element of concentration i.e. To need to lay the section of tail gas remote-measuring equipment, and then the telemetering motor vehicle tail equipment based on graph theory and Boolean algebra is obtained Sensor distributing.

Compared to existing monitor sensor distributing, the motor-vehicle tail-gas of the present invention based on graph theory and Boolean algebra Remote-measuring equipment points distributing method is specifically for urban mass-transit system, more uniqueness, and derivation algorithm is simply easily realized, operability is more By force.

Basic principle and major function of the invention has been shown and described above.It should be understood by those skilled in the art that The present invention is not limited by examples detailed above, and the description in examples detailed above and specification merely illustrates the principles of the invention, and is not being taken off Under the premise of from spirit and scope of the invention, various changes and improvements may be made to the invention, these changes and improvements, which are both fallen within, to be wanted It asks in the invention scope of protection.The claimed scope of the invention is by the appended claims and its equivalent thereof.

Claims (15)

1. a kind of telemetering motor vehicle tail equipment complex system for arranging gravity points, it is characterised in that: including layouting based on road similitude Module, the cloth point module based on road network topology structure and the cloth point module based on particular vehicle route；

Cloth point module based on road similitude uses a kind of telemetering motor vehicle tail equipment side of layouting based on road similitude Method is realized, has been fully considered link characteristics, road surrounding environment and meteorologic factor, is extracted wherein key property and clustered, The different sections of highway of city road network is clustered using the method for hierarchical clustering, can by any number of tail gas remote-measuring equipment into Row Optimizing；

Cloth point module based on road network topology structure is counted using a kind of motor-vehicle tail-gas remote sensing monitoring equipment cloth based on graph theory Method is realized, based on city road network topological structure, is aided with vehicle flowrate grade, the regional function information in city, based on figure and super Figure theory models problem, converts minimum for the location problem of layouting of remote-measuring equipment and traverses problem, final using greedy Algorithm solves the section set for laying tail gas remote-measuring equipment；

Cloth point module based on particular vehicle route uses a kind of telemetering motor vehicle tail equipment based on graph theory and Boolean algebra Points distributing method realizes, the generaI investigation for urban mass-transit system tail gas carries out tail gas remote-measuring equipment addressing and layouts, and is primarily based on super Figure is theoretical, converts bus routes hypergraph for bus running route, then uses the relative theory of Boolean algebra, determines that tail gas is distant Installation position of the measurement equipment in city road network；

The above-mentioned cloth point module based on road similitude, the cloth point module based on road network topology structure be based on particular vehicle route Cloth point module can be used alone, also can be used in combination, selection criteria depend on input information number and policymaker to cloth Set on the functional requirement of the tail gas remote-measuring equipment of city road network；

It is adopted in the case where Tail gas measuring information, information of vehicle flowrate on road, Weather information and road relevant information are required and obtained With the cloth point module based on road similitude；Only include the topological structure of traffic network in input information and some is easy to get Traffic information, when including section affiliated area function, the grade of the magnitude of traffic flow and whether having overline bridge, using based on road network topology The cloth point module of structure；Using the cloth point module based on particular vehicle route when needing to bus progress key monitoring.

2. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 1, it is characterised in that: described to be based on road In the cloth point module of road similitude, a kind of telemetering motor vehicle tail equipment points distributing method based on road similitude, including it is following Step:

Step 1: sample data needed for acquiring simultaneously pre-processes sample data, and the required sample data, which refers to, uses tail gas Remote-measuring equipment obtains the Tail gas measuring information that every section is interior for a period of time in target road network, information of vehicle flowrate on road, weather letter Breath and road relevant information；Data prediction includes that data cleansing, hough transformation and data convert three aspects；

Step 2: using the method for hierarchical clustering, to data prediction is passed through in step 1, treated that sample data clusters Analysis；Each sample is classified as one kind first by the measurement using Euclidean distance as clustering distance, calculates every two class Between similarity, that is, sample with sample measured between any two by distance；Then also wherein similarity degree highest It is to be polymerized to one kind, circulating repetition similarity measurement and the merging for carrying out nearest class apart from the smallest sample, reduces one kind every time, most Afterwards until all samples are gathered into one kind, cluster result is obtained；

Step 3: according to the cluster result in step 2, Cluster tendency, the display for the visual result that each step is clustered are drawn On Cluster tendency；

Step 4: weight is assigned to the section investigated, the significance level in section is represented and pays the utmost attention to degree, by arbitrary number Purpose tail gas remote-measuring equipment corresponds to the cluster result of respective number, finds on Cluster tendency and is equal to corresponding number comprising class number Purpose cluster result chooses the maximum section of weight in each class and lays tail gas remote-measuring equipment, and finally obtaining will be any number of The scheme that tail gas remote-measuring equipment is layouted.

3. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 2, it is characterised in that: a kind of base In the telemetering motor vehicle tail equipment points distributing method of road similitude, the step 1 is implemented as follows:

(1) the sample data acquisition before clustering, using every section in target road network as a sample, obtains each sample arm Tail gas measuring information, information of vehicle flowrate on road, Weather information and road relevant information in section a period of time；Wherein:

Tail gas measuring information, including data item have: detection device number, detection time, the license plate number of detection, speed, vehicle Acceleration, Vehicle length, CO2, CO, HC, NO concentration, smoke intensity value, capture pictures；

Information of vehicle flowrate on road, including data item have: road name, the time, including station wagon, middle bus not The vehicle flowrate of same types of vehicles；

Weather information, including data item have: time, city, weather conditions, temperature, humidity, wind speed, PM2.5, PM10, AQI；

Road relevant information, including data item have: geographical location id, place province, place city, place street, connection side Formula, roadside tree and grass coverage, building average height；

(2) sample data preprocessing part includes that data cleansing, hough transformation and data convert three aspects；Data cleansing, just It is to find out missing values by the analysis to data, deviate excessive individual extremums progress discard processing；Hough transformation is deleted To considered a problem uncorrelated, weak related or redundancy attribute, merge same alike result, while constantly to the selection of association attributes It modifies, to reach required Clustering Effect；Data transformation, the data after hough transformation are standardized, and are turned The appropriate format convenient for processing is turned to, to adapt to the needs of clustering.

4. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 2, it is characterised in that: a kind of base In the telemetering motor vehicle tail equipment points distributing method of road similitude, in the step 2, using the method pair of hierarchical clustering The sample data that is handled in step 1 carry out clustering specifically includes the following steps:

(1) processing in step 1 is obtained into each of sample sample and is all classified as one kind, calculated similar between every two class Degree, i.e., measure sample with sample at a distance between any two；The similitude measured between sample uses Euclidean distance As the measurement of clustering distance, Euclidean distance is as follows:

Wherein, d (i, j) indicates Euclidean distance, and i and j are the specimen number of i-th of sample and j-th of sample, respectively represents I-th section and j-th strip section, M₄Indicate the association attributes number chosen, association attributes include the pollutant after attribute merges Total vehicle flowrate, connection type, roadside tree and grass coverage, building average height after total concentration, smoke intensity value, attribute merging, x are indicated Numerical value of the association attributes after standardization, x_i1Indicate the 1st attribute of i-th of sample, x_i2Indicate the 2nd of i-th of sample Attribute,Indicate the M of i-th of sample₄A attribute, x_j1Indicate the 1st attribute of j-th of sample, x_j2Indicate j-th of sample The 2nd attribute,Indicate the M of j-th of sample₄A attribute；

(2) similarity degree highest in step (1) is namely polymerized to one kind apart from the smallest two samples, it is assumed that be sample N₅With Sample M₆, by sample N₅, M₆A new class is merged into, Cla is denoted as₁={ N₅, M₆, newly generated class Cla₁Association attributes section N₅, M₆The mean value of corresponding attribute indicates that the attribute of that is, new class is expressed as

Wherein, N₅And M₆For N₅A sample and M₆The specimen number of a sample, M₄Indicate the association attributes number chosen, x table Show numerical value of the association attributes after standardization,Indicate N₅1st attribute of a sample,Indicate N₅A sample This M₄A attribute,Indicate M₆1st attribute of a sample,Indicate M₆The M of a sample₄A attribute；

(3) new class and other classes obtain a N together₄The sample of -1 capacity calculates in sample between all sample point every two Similarity, i.e., distance between any two are measured；It will wherein to be polymerized to one kind apart from the smallest two samples, be denoted as Cla₂, newly generated class Cla₂Association attributes indicated with the mean value of the correspondence attribute for two samples for including in class；

(4) repeat the merging of similarity measurement and nearest class, reduce one kind every time, successively obtain new classThe number of last class is reduced to 1, and all samples are gathered into one kind, and cluster result is obtained.

5. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 2, it is characterised in that: a kind of base In the telemetering motor vehicle tail equipment points distributing method of road similitude, in the step 3, is drawn and clustered according to cluster process Pedigree chart, abscissa be represent cluster for the first time at 1 as a result, abscissa as represent at 2 second of cluster as a result, successively class It pushes away, on Cluster tendency, Cluster tendency sufficiently illustrates each of cluster for the display for the visual result that each step is clustered Step process allows and recognizes which section of each step is gathered for one kind from visual level, inhomogeneity after each step end of clustering Number and these classes in which section separately included.

6. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 2, it is characterised in that: one kind is based on road In the telemetering motor vehicle tail equipment points distributing method of road similitude, in the step 4, weight, power are assigned to the section investigated It is determined after comprehensively considering the implantation of device cost in the section, implantation of device complexity element again, weight is bigger to represent section Significance level is bigger and to pay the utmost attention to degree higher；Assuming that needing number to be M₅Tail gas remote-measuring equipment laid, from It is M that Cluster tendency, which finds corresponding class number,₅Cluster result, i.e. N₄-M₅It is after secondary cluster as a result, choosing this M₅In a class Tail gas remote-measuring equipment is laid in the maximum section of the weight of each class, is finally obtained and is carried out cloth to any number of tail gas remote-measuring equipment The scheme of point.

7. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 1, it is characterised in that: described to be based on road In the cloth point module of net topology structure, a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory, comprising the following steps:

Step 1: urban road network is abstracted into a digraph according to topological structure and traffic flow direction, by traffic network Information finds all directed circuits in the digraph using Depth Priority Algorithm at a data matrix；

Step 2: using all sections as the vertex of directed circuit hypergraph, all directed circuits are as the super of directed circuit hypergraph The directed circuit hypergraph of city road network is established on side, simplifies the directed circuit hypergraph, obtains simple directed cycle hypergraph, establishes letter The weighting degree model on vertex in single directed circuit hypergraph finds the maximum vertex of weighting degree in weighting degree model, is calculated using greediness The minimum that method finds out simple directed cycle hypergraph is traversed, as the section of layouting of motor-vehicle tail-gas remote sensing monitoring equipment；It is described to add Measures and weights refers to the degree for having merged the vertex of simple directed cycle hypergraph of traffic network information, the simple directed cycle hypergraph It is the minimum vertex set for referring to covering all sides of simple directed cycle hypergraph that minimum, which is traversed,.

8. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 7, it is characterised in that: a kind of base In the telemetering motor vehicle tail equipment points distributing method of graph theory, in the step 1, by traffic network information at a number It is as follows according to matrix:

Wherein,Indicate all sections of traffic network, M₇For section sum in road network；Indicate road The information of section, including section affiliated area function, the grade of the magnitude of traffic flow, if having overline bridge；N₇By in points distributing method benefit Road section information type；R_ij, i=1,2 ..., M₇, j=1,2 ..., N₇Indicate the specific number after digitizing road section information Value.

9. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 7, it is characterised in that: a kind of base In the telemetering motor vehicle tail equipment points distributing method of graph theory, in the step 1, institute is found using Depth Priority Algorithm The process for stating all directed circuits in digraph is as follows:

(1) urban road network is abstracted into a digraph according to topological structure and traffic flow direction first, it then will be oriented Figure is converted to line chart；

(2) from an initial vertax of the line chart in step (1), finding along the directed arc and different vertex of line chart has To path, until judging whether there is directed arc and returning to initial vertax there is no the next vertex of directed arc arrival, and if it exists, Show to detect a circle；

(3) the upper vertex for retracting directed walk in step (2) continues to expand directed walk along other directed arcs, until There is no directed arcs to reach next vertex, judges whether there is directed arc and returns to initial vertax, and if it exists, shows to detect one A circle；

(4) step (3) are repeated, until retracting initial vertax；

(5) it successively using other vertex as initial vertax, repeats step (2) (3) (4), all circles of line chart are former digraph All directed circuits.

10. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 7, it is characterised in that: described one kind In telemetering motor vehicle tail equipment points distributing method based on graph theory, the step 2 is implemented as follows:

(1) using all sections as the vertex of directed circuit hypergraph, side of all directed circuits as directed circuit hypergraph is established The directed circuit hypergraph model of city road network；

(2) two sides for successively comparing the directed circuit hypergraph established in (1), judge whether there is inclusion relation, and if it exists, then Leave out that longer side in directed circuit hypergraph, and this step is repeated to the directed circuit hypergraph behind deletion side, until Inclusion relation is not present when deleting any two of the directed circuit hypergraph after all to get simple directed cycle hypergraph is arrived；

(3) the weighting degree model of corner is established in the simple directed cycle hypergraph that step (2) obtains, and is found in weighting degree model The maximum vertex of weighting degree, is traversed using the minimum that greedy algorithm finds out simple directed cycle hypergraph；The solution of greedy algorithm Journey is as follows: in simple directed cycle hypergraph, deleting the maximum vertex of weighting degree and the institute comprising the vertex in weighting degree model There is side, and this step is repeated to the simple directed cycle hypergraph behind deletion vertex and side, until simple directed cycle hypergraph is Sky, the then vertex set deleted are that the minimum of simple directed cycle hypergraph is traversed, i.e. the cloth of motor-vehicle tail-gas remote sensing monitoring equipment Point section.

11. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 7, it is characterised in that: described one kind In telemetering motor vehicle tail equipment points distributing method based on graph theory, in the step 2, vertex in simple directed cycle hypergraph The mathematical expression of weighting degree model is as follows:

Wherein, D^*(i) the weighting degree of simple directed cycle hypergraph vertex i, R are indicated_ijFor in traffic network data matrix model Element, i=1,2 ..., M₇, N₇By the road section information type utilized in points distributing method；r_jFor road section information, r_jmaxIndicate r_j's Maximum value, w_{Atr, j}It indicates the weight of each road section information, meetsDeg (i) indicates that simple directed cycle is super The degree of vertex i, deg in figure_maxIndicate the maximum value of the degree on all vertex in simple directed cycle hypergraph.

12. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 1, it is characterised in that: described to be based on In the cloth point module of particular vehicle route, a kind of telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra, The following steps are included:

Step 1: bus travel route is abstracted as bus routes hypergraph；

Step 2: all of bus routes hypergraph are solved using Boolean algebra correlation theory and minimum traverse collection；

Step 3: the minimum for solving bus routes hypergraph traverses collection, and the minimum, which is traversed collection and referred to, all minimum traverses concentration base Number it is the smallest it is one minimum traverse collection, minimum traverses collection and refers to that minimum monitoring section is gathered in the present invention, that is, needs to lay tail gas The set in the section of remote-measuring equipment.

13. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 12, it is characterised in that: described one kind In telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra, the step 1 is implemented as follows:

(1) based on the actual traffic route network in city, each section passed through in bus travel route is abstracted as super Figure vertex, obtains vertex set；

(2) bus vehicle line is abstracted as super side, super side is the subset of vertex set；

(3) set on all super sides is hypergraph, and hypergraph is by bus travel route gained, referred to as bus routes hypergraph.

14. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 12, it is characterised in that: described one kind In telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra, the step 2 is implemented as follows:

(1) Boolean variable χ is set to each vertex in bus routes hypergraph_i, χ_iIndicate whether section i lays tail gas remote-measuring equipment, if χ_i=1 indicates that this section needs to lay remote-measuring equipment；

(2) each edge obtains boolean's disjunction expression on each side by its contained vertex progress Boolean addition in bus routes hypergraph, That is:ψ_jIndicate the section for including in j-th strip public transport operation route；

(3) boolean's disjunction expression on all sides is subjected to Boolean multiplication, obtains the Boolean conjunction formula of bus routes hypergraph, it may be assumed that Indicate the entirety in section contained by all routes in entire bus routes net, N_hyFor public transport Exceeded number in route hypergraph；

(4) abbreviation is arranged to resulting conjunction expression Boolean calculation rule, obtains most simple disjunction expression, it may be assumed that Wherein each minor λ_tCorresponding vertex set, which is that one of bus routes hypergraph is minimum, traverses collection, All λ_tConstitute all minimum set for traversing collection of bus routes hypergraph It indicates and bus every fortune The section that walking along the street line all intersects is all.

15. telemetering motor vehicle tail equipment complex system for arranging gravity points according to claim 12, it is characterised in that: described one kind In telemetering motor vehicle tail equipment points distributing method based on graph theory and Boolean algebra, step 3 is implemented as follows:

(1) each minimum radix for traversing collection, i.e., the number on contained vertex are asked；

(2) determine radix it is the smallest it is minimum traverse collection, this is minimum, and to traverse collection be that minimum traverses collection, and minimum traverses concentration vertex institute Corresponding section is the section for needing to lay tail gas remote-measuring equipment, and the collection that these sections are constituted is combined into minimum monitoring section collection It closes.