CN108053062A - A kind of customization public bus network generation method based on multi-source data - Google Patents
A kind of customization public bus network generation method based on multi-source data Download PDFInfo
- Publication number
- CN108053062A CN108053062A CN201711303923.4A CN201711303923A CN108053062A CN 108053062 A CN108053062 A CN 108053062A CN 201711303923 A CN201711303923 A CN 201711303923A CN 108053062 A CN108053062 A CN 108053062A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- website
- bus network
- demand
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000010353 genetic engineering Methods 0.000 claims abstract description 12
- 239000000284 extract Substances 0.000 claims abstract description 10
- 238000013461 design Methods 0.000 claims abstract description 8
- 210000000349 chromosome Anatomy 0.000 claims description 23
- 238000004422 calculation algorithm Methods 0.000 claims description 13
- 238000013459 approach Methods 0.000 claims description 7
- 108090000623 proteins and genes Proteins 0.000 claims description 7
- 238000000605 extraction Methods 0.000 claims description 6
- 238000009826 distribution Methods 0.000 claims description 5
- 230000035772 mutation Effects 0.000 claims description 5
- 230000002068 genetic effect Effects 0.000 claims description 4
- 230000002123 temporal effect Effects 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 2
- 238000000205 computational method Methods 0.000 claims description 2
- 238000013075 data extraction Methods 0.000 claims description 2
- 238000001514 detection method Methods 0.000 claims description 2
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 241001269238 Data Species 0.000 claims 1
- 238000003064 k means clustering Methods 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 5
- 238000009472 formulation Methods 0.000 abstract description 2
- 230000010365 information processing Effects 0.000 abstract description 2
- 239000000203 mixture Substances 0.000 abstract description 2
- 238000011835 investigation Methods 0.000 abstract 1
- 238000005457 optimization Methods 0.000 description 6
- 238000011161 development Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- VYPSYNLAJGMNEJ-UHFFFAOYSA-N Silicium dioxide Chemical compound O=[Si]=O VYPSYNLAJGMNEJ-UHFFFAOYSA-N 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000007621 cluster analysis Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000008595 infiltration Effects 0.000 description 1
- 238000001764 infiltration Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000000523 sample Substances 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of customization public bus network generation methods based on multi-source data, belong to public traffic information processing technology field.The method includes matching between the customization public transport requirement extract based on multi-source data, website Cluster-Fusion, demand and website, the structure for customizing public bus network Optimized model, the heuristic design based on genetic manipulation and solving model and obtains customizing public bus network collection.This method combination bus IC card, GPS data and Novel Internet data, passenger's trip requirements are extracted, while consider that the coverage rate of circuit and passenger's average travel time cost structure customize public bus network Optimized model and outlet line scheme, the physical planning to customize public transport provides theoretical method.Compared with tradition is based on the method for investigation, this method can identify potential demand, to extract customization bus trip demand to a greater extent.Acquired results of the present invention can be actually to customize the formulation of public bus network and the frequency of subsequently dispatching a car, and the optimizing scheduling of timetable and crew member are provided decision support.
Description
Technical field
The present invention relates to public traffic information processing technology field, specifically a kind of customization based on multi-source data is public
Intersection road generation method.
Background technology
With the continuous quickening of Chinese Urbanization, motorization process, Urban traffic demand increases rapidly, road traffic peace
Entirely, the traffic problems getting worse such as congestion and environmental degradation.Therefore, " public traffic in priority " development strategy has become reply urban transportation
The common recognition of problem.However, due to current China's urban public traffic network layout and organizational scheduling and resident trip characteristic, road network
Lack of uniformity in terms of structure and means of transportation time-space distribution configuration, resident cannot be met increasingly by resulting in existing public transit system
The trip requirements of growth.Under the conspicuous contradiction of the diversification of citizens' activities demand and regular public traffic service mode unification, energetically
Develop diversification public transportation system, it is further Traffic Development to efficient, harmonious, ecological mode development to guide it
Inexorable trend.
In this context, to alleviate traffic above-ground congestion, one kind that passenger's diversification trip requirements are target is met
Demand response formula Public Transport Service pattern is come into being, that is, customizes public transport.It is this as the supplement of regular public traffic service mode
Emerging bus service pattern is by integrating individual trip requirements, for crowd's amount of offer that trip origin and destination, travel time are similar
The Public Transport Service of body customization, to provide efficiently through trip service.
Since customization public transport is a kind of emerging bus service pattern, developing history is shorter, therefore comes from present case
It sees and there is also some problems.Since current customization public transit system demand data acquisition method is relatively single, in most cases
Based on survey data, trip requirements can not be accurately captured, cause line network planning unreasonable, the circuit coverage rate started is low, can not
The trip requirements of resident are adapted to, so that attendance is not high, cause the waste of public resource.In recent years, " internet+traffic " is borrowed
The technologies such as mobile Internet, big data and theory are helped, internet is subjected to effectively infiltration with merging with conventional traffic transport service, and
Provide new collecting method.Therefore, in this context, traditional public transport data and Novel Internet data how are combined,
The trip requirements of abundant mining analysis passenger rationally design customization public bus network, promote public transport entirety efficiency of operation and clothes
Quality of being engaged in is the problem of needing to probe into.
The content of the invention
For deficiency existing for current technology, it is an object of the invention to provide a kind of customization public transport based on multi-source data
Circuit generation method, i.e., by analyzing data acquisitions passenger's trip requirements such as IC card, GPS, mobile terminal navigation programming;In this base
On plinth, the demand coverage rate of gauze and passenger's travel time cost, structure multiple target customization public bus network generation mould are taken into full account
Type, and design the corresponding corresponding customization public bus network of intelligent heuristics derivation algorithm generation.The realization of the present invention includes following
Step:
The first step, according to Based on Bus IC Card Data, GPS data, mobile terminal layout data extraction passenger's trip requirements.For
The situation of IC card data record passenger getting on/off website can directly extract the origin and destination of passenger;It is not recorded for IC card data
The situation of passenger getting on/off website need to combine GPS data and extract passenger getting on/off website.Mobile terminal layout data includes user
The starting point of inquiry, terminal, time and desired trip mode, reflect a kind of potential demand.By this step, obtain user's
Go out beginning-of-line, terminal and temporal information.Passenger's trip information based on extraction, according to the time and space frequency of its trip, and
With reference to corresponding professional standard, determine whether the origin and destination are the demand point for customizing public bus network.
Second step clusters website.Due to same demand region, there are multiple bus platforms, it is contemplated that following right
The planning of bus platform is customized, multiple bus platforms adjacent in demand region are carried out by Cluster-Fusion by K-means methods,
Determine candidate's website of customization public bus network, the scope of usual bus station service impact is 500 meters to 1000 meters of radius.
3rd step, the demand that the first step is extracted, which is spatially distributed, is assigned to corresponding public transport after second step Cluster-Fusion
Website.The demand distribution situation of each candidate's platform is thus obtained.
4th step, on the basis of trip requirements extraction, consider gauze demand coverage rate and passenger's travel time into
This structure customizes public bus network Optimized model.
Finally, design a kind of heuritic approach based on genetic manipulation and solve the Optimized model, according to the target optimized,
Different types of customization public bus network set is generated, reference is provided for actual railroad embankment.
The advantage of the invention is that:
1. the present invention is different from most of research at present based on survey data design customization public transport network, but using multi-source
Data structure customization public bus network Optimized model, identifies potential demand, can extract customization bus trip demand to a greater extent.
2. considering demand coverage rate and time cost structure multiple target line optimization model, meet multiply to greatest extent
Visitor uses the trip requirements for customizing public transport;And heuritic approach generation customization public bus network collection is designed, can be actual customization public transport
Offer support is provided.
3. acquired results of the present invention can be the formulation of actual customization public bus network and the frequency of subsequently dispatching a car, timetable and
The optimizing scheduling of crew member is provided decision support.
Description of the drawings
Fig. 1 is flow chart of the method for the present invention;
Fig. 2 is bus station cluster result schematic diagram in embodiment;
Fig. 3 be embodiment in resident trip spatial and temporal distributions schematic diagram, (a) departure place;(b) destination;
Fig. 4 is the conspectus of model generation.
Specific embodiment
The present invention is described in further detail with reference to the accompanying drawings and examples, to make those skilled in the art's reference
Specification word can be implemented according to this.
The first step, the customization public transport requirement extract based on multi-source data.Data source according to the present invention includes public transport IC
Card, public transport GPS and mobile facility planning data.Based on Bus IC Card Data critical field includes card number, charge time, circuit volume
Number, car number, website of getting on the bus (urban), get-off stop (urban);Public transport GPS data critical field includes vehicle
Number, timestamp, longitude, latitude, bus platform number.In the case of IC card data recorded passenger getting on/off website,
The origin and destination (OD) of passenger can directly be extracted;In the case of IC card data do not record passenger getting on/off website, GPS need to be combined
Data extract passenger getting on/off website.Mobile facility planning data critical field includes User ID, planning time, trip mode
(such as walking is ridden, automobile), starting point longitude, starting point latitude, terminal longitude, terminal latitude;The data type reflects a kind of latent
In demand.By this step, the beginning-of-line that goes out of user, terminal and temporal information can be extracted.Passenger based on extraction, which goes on a journey, to be believed
Breath according to the time and space frequency of its trip, and combines corresponding professional standard, determines whether the origin and destination are customization public transport
The demand point of circuit.In the present invention, monthly to get on or off the bus 5 times in same time period and identical platform and above for standard, system
It counts in passenger's whole day period (using a hour as section) in the frequency of getting on or off the bus of all bus platforms, determines customization public transport demand
OD。
Second step carries out Cluster-Fusion to website.It is since same demand region is there are multiple bus platforms, i.e., identical
Beginning or end, but nearby can there are multiple bus platforms, these platforms can serve the beginning or end, Cheng Kehui
One of platform is selected to go on a journey, this has resulted in the overlapping of bus platform.Therefore in view of following to customizing bus platform
Planning is, it is necessary to cluster these platforms.The present invention is by K-means methods by multiple bus stations adjacent in demand region
Platform carries out Cluster-Fusion, determines candidate's website of customization public bus network, the scope of a usual bus station service impact is half
500 meters to 1000 meters of footpath.I.e. centered on a platform, all platforms in 500 meters to 1000 meters radius overlay areas all belong to
In same class.K-means algorithm steps are as follows:
(1) n website coordinates are inputted, from K initial website is wherein chosen as K initial cluster center.
(2) n website is calculated to the Euclidean distance of this K cluster centre, with 500 meters of cluster centre for radius, owning
Website be all referred to distance and each nearest center go.If there is the situation of coincidence, select in the cluster nearest from the website
The heart.
(3) after whole websites is all classified, K cluster is generated, recalculates the center of this K cluster at this time,
It has been changed the K new cluster of cluster centre.
(4) after step (2) and the update of step (3) iteration, relatively it is front and rear respectively cluster twice in website to cluster centre
Distance if remaining unchanged, is gone to step (5);Otherwise (2) are gone to step and continue iteration.
(5) result of website cluster is exported.
Passenger's trip terminus that the first step extracts is corresponded to the candidate stations in second step after Cluster-Fusion by the 3rd step
Point has thus obtained the volume of the flow of passengers of each candidate's website.
4th step, on the basis of trip requirements extraction, consider gauze demand coverage rate and passenger's travel time into
This structure customizes public bus network Optimized model.Make P={ P1,P2,…,PNIt is the customization public transport candidate stations extracted in second step
Point, any two website PiTo PjBetween passenger flow demand can be represented respectively with matrix TD and TC with hourage, wherein travelling
Time obtains after being extracted by GPS data.Define R={ R1,R2,..,RnIt is to meet one group of sets of lines of model constraints, R
Middle kth line definitions are Rk=R1kR2k…Rik…Rnk, wherein RikFor website sequence number described in P.The model is excellent comprising two
Change target, first aim function is:
Wherein, TDijIt is vacancies of the website i to website j, the denominator in formula (1) represents whole trips of survey region
Demand. TD(Ri) represent circuit RiAggregate demand;The molecule of formula (1) represents whole demands of candidate line collection R.For actual fortune
The public bus network of battalion considers the factors such as cost, possibly can not cover whole trip requirements.Therefore, the first aim of model
It is the trip requirements for looking after more passengers as far as possible, i.e. optimization customizes the coverage rate of public bus network.
Second target function is:
Wherein, rij(R) be in sets of lines R website i to the aggregate demand of website j, TCijIt is the trip between website i to website j
The Trip Costs of row time, i.e. passenger can be extracted by public transport GPS data and obtained.The object function is to optimize sets of lines R
In all passengers average hourage, promoted customization public transport traffic efficiency.
In addition, the model includes following constraints.(1) in order to improve the efficiency of service and comfort of customization public transport, with
It provides to go directly to passenger and service, the quantity of website cannot be excessive in every circuit, controls within five stations.(2) according to actual need
It asks and Planning Standard, the length of circuit should be controlled in rational scope, within 15KM;(3) non-linear coefficient of circuit is about
The ratio between the distance between Euclidean distance and circuit physical length between beam, i.e. circuit first and last station should within the scope of rational,
It should be less than 1.4 under normal circumstances;(4) there should not be the circuit of repetition in each sets of lines.
5th step designs the heuritic approach based on genetic manipulation and solves the line optimization model, and this method includes following
Step:(1) chromosome coding.Every chromosome represents a sets of lines.It is defined and known by the 4th step, every circuit is by website
Represented by digital number.Therefore, algorithm uses integer coding, if for example, there is 8 candidate's websites, is encoded to 1 to 8.
(2) initiating line collection.The sets of lines that random device generation meets model constraints can be used in this step, also may be used
By voluntarily selection generation sets of lines.Define NpopsizeFor the quantity of the population scale of genetic algorithm, i.e. sets of lines.Each sets of lines
The quantity of circuit can be defined as Nroutenum。
(3) fitness calculates.Fitness is used for evaluating the quality of each individual, the high chromosome of fitness or individual inheritance
It is larger to follow-on probability, to ensure the quality of genetic algorithm solution.The computational methods of fitness f are to each object function
Value is weighted:
Wherein, fk(x) and wkThe functional value and weight of respectively k-th target.
(4) selection operation.According to the fitness result of calculation of (3) step, using a method choice part for roulette
Body enters follow-on genetic manipulation.The selected probability P of i-th of chromosome in populationiIt is calculated by fitness:
Wherein, fiAnd fminThe fitness of all chromosome minimums in the fitness value of respectively i-th chromosome and population
Value.
(5) crossover operation.The operation follows the steps below.First, the chromosome of selection or individual are carried out two-by-two
Pairing.For each pair chromosome, according to given crossover probability, judge whether two individuals carry out crossover operation.Second, at random
Generate a crossover frequency.3rd step, for each pair chromosome intersected, each chromosome selects a gene position at random
Carry out crossover operation;4th step repeats second step, until reaching the crossover frequency specified.
(6) mutation operation.The operation follows the steps below.A line is randomly choosed firstly, for every chromosome
Road.Second step for each gene position for the circuit chosen, randomly generates the random number between one [0,1].3rd step,
For each gene position, if the random number that second step generates is less than given crossover probability, mutation operation is carried out;Otherwise,
Keep gene invariant position.
(7) offspring is detected.This step is whether new individual of the detection after the operations such as select, intersect, make a variation meets mould
Type constrains.If satisfied, then regarding it as offspring, and enter follow-on genetic manipulation;If not satisfied, it removes it.
(8) elitism strategy.The high individual of fitness in population or chromosome are directly introduced to next-generation progress by the step
Genetic manipulation.
(9) population scale is detected.Detect whether quantity individual in new population reaches preset value NpopsizeIf
Meet, go in next step;Otherwise, (4) step is returned.
(10) end condition.If algorithm reaches preset iterations, the algorithm is terminated, exports result;Otherwise, return
Return (3) step.
Embodiment
A kind of customization public bus network generation method based on multi-source data, it is specific as follows:
This example is navigated in May, 2017 using Hangzhou public transport on May 1st, 2017 to IC card on May 31 and GPS data, high moral
Hangzhou layout data planning customization public bus network.
Due to the supreme get-off stop of Hangzhou IC card data, it is therefore desirable to extract passenger getting on/off website with reference to GPS data.It
Cluster analysis, with 500 meters for radius, cluster result are carried out to website afterwards as shown in Fig. 2, obtaining customization public transport candidate's website.It connects
Get off, judge whether each trip origin and destination are OD pairs of customization public transport demand;With monthly in same time period and identical in this example
Platform gets on or off the bus 5 times and is above standard, counts in passenger's whole day period (using a hour as section) in all bus platforms
The frequency of getting on or off the bus, determine customization public transport demand OD.By the convergence analysis of several data, families in Hangzhou City trip origin and destination
Spatial distribution is as shown in Figure 3.
Model is solved followed by the heuritic approach based on genetic manipulation.In this example, since website is excessive,
70 demand OD of passenger flow maximum are filtered out to carrying out example.The parameter of genetic manipulation is arranged to population scale 60, each circuit
Line concentration way is 10, crossover probability 0.6, mutation probability 0.1.In 500 generation of iterations, the results are shown in Table 1 for each objective optimization.
Table 1. customizes public bus network Optimized model test result
As shown in table 1, option A is the highest scheme of demand coverage rate, and option b is the minimum side of passenger's average time cost
Case.As can be seen that according to different optimization aims, algorithm can export different circuit types, and option A looks after more passengers'
Trip requirements.Option b is in order to optimize the trip of passenger and customize the efficiency of operation of public transport, the shorter Decision Making of Line Schemes of output distance.
In actually runing, planning personnel can carry out according to different situations on the circuit of generation being adapted to needs.Fig. 4 is output
One of public bus network scheme example, which includes 4 websites, 965 people of demand, 13 kilometers of line length, run time
45 minutes.
The present invention, with reference to traditional public transport data and Novel Internet data, passes through multi-source under " internet+traffic " background
Passenger's trip requirements are extracted in data analysis.Structure customization public bus network Model for Multi-Objective Optimization on this basis, while consider line
The demand coverage rate on road and the average travel time cost of passenger;And it designs a kind of heuritic approach based on genetic manipulation and solves
Optimized model, generation customization public bus network collection.The method for being planned customization public transport based on survey data with tradition, this method can recognize that
Potential trip requirements, can be the planning of customization public transport, and operation and management provides reference.
The case study on implementation of the present invention described in detail above, but it is specific the invention is not limited in above-mentioned case study on implementation
Details in the range of the overall structure of the present invention, can carry out the part steps of the present invention a variety of conversion and reconfigure, this
Various combinations of possible ways are not listed in invention, these conversion combinations all belong to the scope of protection of the present invention.
Claims (4)
1. a kind of customization public bus network generation method based on multi-source data, which is characterized in that comprise the following steps:
The first step, the customization public transport requirement extract based on multi-source data
According to Based on Bus IC Card Data, GPS data, mobile terminal layout data extraction passenger's trip requirements;Remember for IC card data
The situation of passenger getting on/off website is recorded, directly extracts the origin and destination of passenger;Passenger getting on/off station is not recorded for IC card data
The situation of point extracts passenger getting on/off website with reference to GPS data.Mobile facility planning data critical field includes User ID, rule
Draw time, trip mode, starting point longitude, starting point latitude, terminal longitude, terminal latitude;By this step, the trip of user is obtained
Starting point, terminal and temporal information;Passenger's trip information based on extraction according to the time and space frequency of its trip, and combines
Corresponding professional standard determines whether the origin and destination are the demand point for customizing public bus network.
Second step clusters website
Multiple bus platforms adjacent in demand region are carried out by Cluster-Fusion by K-means clustering methods, determine that customization is public
Candidate's website on intersection road, the scope of bus station service impact is 500 meters to 1000 meters of radius.
3rd step, the demand that the first step is extracted, which is spatially distributed, is assigned to corresponding bus station after second step Cluster-Fusion
Point.The demand distribution situation of each candidate's platform is thus obtained;
4th step on the basis of trip requirements extraction, considers gauze demand coverage rate and passenger's travel time cost structure
Build customization public bus network Optimized model;
5th step designs a kind of heuritic approach based on genetic manipulation and solves the Optimized model, raw according to the target optimized
Into different types of customization public bus network set, reference is provided for actual railroad embankment.
2. a kind of customization public bus network generation method based on multi-source data according to claim 1, which is characterized in that the
In one step, multi-source data includes IC card data, GPS data and mobile facility planning data, can also include other related datas.
3. a kind of customization public bus network generation method based on multi-source data according to claim 1, which is characterized in that the
In four steps, the customization public bus network Optimized model of structure is as described below.
First aim function is:
<mrow>
<mi>max</mi>
<mfrac>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
<mo>&Element;</mo>
<mi>R</mi>
</mrow>
</munder>
<mi>T</mi>
<mi>D</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>n</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>n</mi>
</munderover>
<msub>
<mi>TD</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
</mfrac>
</mrow>
Wherein, TDijIt is vacancies of the website i to website j, the denominator in formula represents whole trip requirements of survey region;TD
(Ri) represent circuit RiAggregate demand;The molecule of formula represents whole demands of candidate line collection R;
Second target function is:
<mrow>
<mi>min</mi>
<mfrac>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
</munder>
<msub>
<mi>r</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>R</mi>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msub>
<mi>TC</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
<mo>&Element;</mo>
<mi>R</mi>
</mrow>
</munder>
<mi>T</mi>
<mi>D</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>R</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
</mrow>
Wherein, rij(R) be in sets of lines R website i to the aggregate demand of website j, TCijWhen being the travelling between website i to website j
Between, i.e. the Trip Costs of passenger can be extracted by public transport GPS data and obtained;
In addition, the model includes following constraints:(1) quantity of website cannot be excessive in every circuit, control five stations with
It is interior;(2) according to actual demand and Planning Standard, the length of circuit should be controlled in rational scope, within 15KM;(3) line
The non-linear coefficient constraint on road, i.e. the ratio between the distance between Euclidean distance between circuit first and last station and circuit physical length should be
Within the scope of rational, 1.4 are should be less than under normal circumstances;(4) there should not be the circuit of repetition in each sets of lines.
4. a kind of customization public bus network generation method based on multi-source data according to claim 1, which is characterized in that the
In five steps, the heuritic approach based on genetic manipulation, step is as follows:
(1) chromosome coding, every chromosome represent a sets of lines, and every circuit is represented by the digital number of website;Cause
This, algorithm uses integer coding, when there is 8 candidate's websites, is encoded to 1 to 8;
(2) initiating line collection meets the sets of lines of model constraints using random device generation or is generated by voluntarily selection
Sets of lines;Define NpopsizeFor the quantity of the population scale of genetic algorithm, i.e. sets of lines;The quantity of each sets of lines circuit can be with
It is defined as Nroutenum;
(3) fitness calculates, and the computational methods of fitness f are that the value of each object function is weighted:
<mrow>
<mi>f</mi>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mn>2</mn>
</munderover>
<msub>
<mi>&omega;</mi>
<mi>k</mi>
</msub>
<msub>
<mi>f</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>x</mi>
<mo>)</mo>
</mrow>
</mrow>
fk(x) and wkThe functional value and weight of respectively k-th target;
(4) selection operation, according to the fitness result of calculation of (3) step, using roulette method choice part individual into
Enter follow-on genetic manipulation.The selected probability P of i-th of chromosome in populationiIt is calculated by fitness:
<mrow>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<msub>
<mi>f</mi>
<mi>i</mi>
</msub>
<mo>-</mo>
<msub>
<mi>f</mi>
<mi>min</mi>
</msub>
</mrow>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>N</mi>
<mi>p</mi>
<mi>o</mi>
<mi>p</mi>
<mi>s</mi>
<mi>i</mi>
<mi>z</mi>
<mi>e</mi>
</mrow>
</munderover>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mi>j</mi>
</msub>
<mo>-</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>m</mi>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
</mrow>
fiAnd fminThe fitness value of all chromosome minimums in the fitness value of respectively i-th chromosome and population;J is expression
The variable of the population scale of genetic algorithm;
(5) crossover operation;The operation follows the steps below:First, the chromosome of selection or individual are matched two-by-two;
For each pair chromosome, according to given crossover probability, judge whether two individuals carry out crossover operation;Second, it randomly generates
One crossover frequency;3rd step, for each pair chromosome intersected, each chromosome is selected a gene position and is carried out at random
Crossover operation;4th step repeats second step, until reaching the crossover frequency specified;
(6) mutation operation;The operation follows the steps below:A circuit is randomly choosed firstly, for every chromosome;The
Two steps for each gene position for the circuit chosen, randomly generate the random number between one [0,1];3rd step, for every
One gene position if the random number that second step generates is less than given crossover probability, carries out mutation operation;Otherwise, base is kept
Because of invariant position;
(7) offspring is detected;This step is whether new individual of the detection after the operations such as select, intersect, make a variation meets model about
Beam;
(8) elitism strategy;The high individual of fitness in population or chromosome are directly introduced to next-generation progress heredity by the step
Operation;
(9) population scale is detected;Detect whether quantity individual in new population reaches preset value, if satisfied, going to
In next step;Otherwise, (4) step is returned.
(10) end condition;If algorithm reaches preset iterations, the algorithm is terminated, exports result;Otherwise, the is returned
(3) step.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711303923.4A CN108053062B (en) | 2017-12-11 | 2017-12-11 | Customized bus route generation method based on multi-source data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711303923.4A CN108053062B (en) | 2017-12-11 | 2017-12-11 | Customized bus route generation method based on multi-source data |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108053062A true CN108053062A (en) | 2018-05-18 |
CN108053062B CN108053062B (en) | 2022-04-29 |
Family
ID=62124044
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201711303923.4A Active CN108053062B (en) | 2017-12-11 | 2017-12-11 | Customized bus route generation method based on multi-source data |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108053062B (en) |
Cited By (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108961804A (en) * | 2018-06-20 | 2018-12-07 | 北京市交通运行监测调度中心 | Method is determined based on the alternative set of public bus network adjustment of multi objective classification intersection |
CN109344529A (en) * | 2018-10-22 | 2019-02-15 | 北京航空航天大学 | A kind of customization public bus network design method based on two-phase heuristic algorithm |
CN109409599A (en) * | 2018-10-24 | 2019-03-01 | 天津市市政工程设计研究院 | Customization public bus network based on real-time requirement opens optimization method |
CN109543895A (en) * | 2018-11-15 | 2019-03-29 | 北京航空航天大学 | A kind of transit network planning method out based on taxi passenger flow conversion |
CN109543882A (en) * | 2018-10-24 | 2019-03-29 | 上海市政工程设计研究总院(集团)有限公司 | It is a kind of to be averaged the density of public transport network calculation method of station spacing based on optimal public transport |
CN109583611A (en) * | 2018-11-19 | 2019-04-05 | 北京航空航天大学 | Customization bus station site selecting method based on net about car data |
CN109740882A (en) * | 2018-12-21 | 2019-05-10 | 宜宝科技(北京)有限公司 | Data processing method and device for Physical examination car |
CN109934401A (en) * | 2019-03-09 | 2019-06-25 | 吉林大学 | A kind of customization public transport method based on mobile interchange |
CN110084402A (en) * | 2019-03-25 | 2019-08-02 | 广东工业大学 | A kind of public transport self-adapting dispatching method preferably to be tracked with ant based on website |
CN110175656A (en) * | 2019-06-04 | 2019-08-27 | 北京交通大学 | The city Clustering Model of raising train marshalling list efficiency based on group of cities heroin flow |
CN110390421A (en) * | 2019-06-12 | 2019-10-29 | 北京交通大学 | Congestion subway line passenger flow control method for coordinating based on time-space network |
CN110415397A (en) * | 2019-06-28 | 2019-11-05 | 苏州浪潮智能科技有限公司 | A kind of intelligent card data information collecting method, equipment and medium based on cloud computing |
CN110555473A (en) * | 2019-08-28 | 2019-12-10 | 海南纽康信息***有限公司 | Driving route planning method, server and system |
WO2020057367A1 (en) * | 2018-09-20 | 2020-03-26 | 京东数字科技控股有限公司 | Method and device for generating bus route |
CN111144618A (en) * | 2019-12-04 | 2020-05-12 | 东南大学 | Demand response type customized bus network planning method based on two-stage optimization model |
CN111144669A (en) * | 2020-02-18 | 2020-05-12 | 郑州航空工业管理学院 | Urban bus station setting method |
CN111476033A (en) * | 2020-04-07 | 2020-07-31 | 武汉元光科技有限公司 | Bus stop name generation method and device |
CN111667114A (en) * | 2020-06-05 | 2020-09-15 | 鲁东大学 | Intelligent route planning recommendation method based on space-time big data fusion |
CN111815189A (en) * | 2020-07-15 | 2020-10-23 | 同济大学 | Modular bus dispatching system |
CN112329989A (en) * | 2020-10-19 | 2021-02-05 | 北京中恒云科技有限公司 | Bus route planning method and device based on cloud computing and storage medium |
CN112906221A (en) * | 2021-02-19 | 2021-06-04 | 同济大学 | Multi-vehicle type region customized bus scheduling method based on reservation data |
CN112949784A (en) * | 2021-05-13 | 2021-06-11 | 深圳市城市交通规划设计研究中心股份有限公司 | Resident trip chain model construction method and resident trip chain acquisition method |
CN113077162A (en) * | 2021-04-14 | 2021-07-06 | 同济大学 | Multi-vehicle type customized bus area scheduling method facing real-time requirements |
CN113469451A (en) * | 2021-07-19 | 2021-10-01 | 杭州数知梦科技有限公司 | Customized bus route generation method based on heuristic algorithm |
CN114566037A (en) * | 2022-01-19 | 2022-05-31 | 同济大学 | Flexible bus multi-vehicle fleet configuration method based on multi-source data |
CN117195484A (en) * | 2023-08-08 | 2023-12-08 | 广东贝能达交通设备有限公司 | Rail transit management method and system |
CN117391270A (en) * | 2023-10-12 | 2024-01-12 | 华中科技大学 | Bus network planning method based on BRT (bus lane transfer) special lane |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5948040A (en) * | 1994-06-24 | 1999-09-07 | Delorme Publishing Co. | Travel reservation information and planning system |
CN103730008A (en) * | 2014-01-15 | 2014-04-16 | 汪涛 | Bus congestion degree analysis method based on real-time data of bus GPS (Global Position System) and IC (Integrated Circuit) cards |
CN106779163A (en) * | 2016-11-18 | 2017-05-31 | 华南理工大学 | A kind of customization transit network planning method based on intelligent search |
CN107330559A (en) * | 2017-07-03 | 2017-11-07 | 华南理工大学 | A kind of hybrid customization public bus network planing method of many terminus multi-vehicle-types |
-
2017
- 2017-12-11 CN CN201711303923.4A patent/CN108053062B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5948040A (en) * | 1994-06-24 | 1999-09-07 | Delorme Publishing Co. | Travel reservation information and planning system |
CN103730008A (en) * | 2014-01-15 | 2014-04-16 | 汪涛 | Bus congestion degree analysis method based on real-time data of bus GPS (Global Position System) and IC (Integrated Circuit) cards |
CN106779163A (en) * | 2016-11-18 | 2017-05-31 | 华南理工大学 | A kind of customization transit network planning method based on intelligent search |
CN107330559A (en) * | 2017-07-03 | 2017-11-07 | 华南理工大学 | A kind of hybrid customization public bus network planing method of many terminus multi-vehicle-types |
Cited By (41)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108961804B (en) * | 2018-06-20 | 2020-07-31 | 北京市交通运行监测调度中心 | Bus route adjustment alternative set determination method based on multi-index classification intersection |
CN108961804A (en) * | 2018-06-20 | 2018-12-07 | 北京市交通运行监测调度中心 | Method is determined based on the alternative set of public bus network adjustment of multi objective classification intersection |
WO2020057367A1 (en) * | 2018-09-20 | 2020-03-26 | 京东数字科技控股有限公司 | Method and device for generating bus route |
CN109344529A (en) * | 2018-10-22 | 2019-02-15 | 北京航空航天大学 | A kind of customization public bus network design method based on two-phase heuristic algorithm |
CN109344529B (en) * | 2018-10-22 | 2023-11-03 | 北京航空航天大学 | Customized bus route design method based on two-stage heuristic algorithm |
CN109543882B (en) * | 2018-10-24 | 2024-03-08 | 上海市政工程设计研究总院(集团)有限公司 | Bus network density calculation method based on optimal bus average station spacing |
CN109409599A (en) * | 2018-10-24 | 2019-03-01 | 天津市市政工程设计研究院 | Customization public bus network based on real-time requirement opens optimization method |
CN109543882A (en) * | 2018-10-24 | 2019-03-29 | 上海市政工程设计研究总院(集团)有限公司 | It is a kind of to be averaged the density of public transport network calculation method of station spacing based on optimal public transport |
CN109409599B (en) * | 2018-10-24 | 2022-02-08 | 天津市市政工程设计研究院 | Customized bus line opening optimization method based on real-time requirements |
CN109543895A (en) * | 2018-11-15 | 2019-03-29 | 北京航空航天大学 | A kind of transit network planning method out based on taxi passenger flow conversion |
CN109583611B (en) * | 2018-11-19 | 2021-06-01 | 北京航空航天大学 | Customized bus stop site selection method based on network appointment data |
CN109583611A (en) * | 2018-11-19 | 2019-04-05 | 北京航空航天大学 | Customization bus station site selecting method based on net about car data |
CN109740882A (en) * | 2018-12-21 | 2019-05-10 | 宜宝科技(北京)有限公司 | Data processing method and device for Physical examination car |
CN109934401A (en) * | 2019-03-09 | 2019-06-25 | 吉林大学 | A kind of customization public transport method based on mobile interchange |
CN110084402B (en) * | 2019-03-25 | 2022-03-11 | 广东工业大学 | Bus self-adaptive scheduling method based on station optimization and ant tracing |
CN110084402A (en) * | 2019-03-25 | 2019-08-02 | 广东工业大学 | A kind of public transport self-adapting dispatching method preferably to be tracked with ant based on website |
CN110175656A (en) * | 2019-06-04 | 2019-08-27 | 北京交通大学 | The city Clustering Model of raising train marshalling list efficiency based on group of cities heroin flow |
CN110390421A (en) * | 2019-06-12 | 2019-10-29 | 北京交通大学 | Congestion subway line passenger flow control method for coordinating based on time-space network |
CN110390421B (en) * | 2019-06-12 | 2022-05-10 | 北京交通大学 | Space-time network-based method for coordinating and controlling passenger flow of congested subway line |
CN110415397A (en) * | 2019-06-28 | 2019-11-05 | 苏州浪潮智能科技有限公司 | A kind of intelligent card data information collecting method, equipment and medium based on cloud computing |
CN110415397B (en) * | 2019-06-28 | 2021-09-10 | 苏州浪潮智能科技有限公司 | Smart card data information acquisition method, device and medium based on cloud computing |
CN110555473A (en) * | 2019-08-28 | 2019-12-10 | 海南纽康信息***有限公司 | Driving route planning method, server and system |
CN111144618A (en) * | 2019-12-04 | 2020-05-12 | 东南大学 | Demand response type customized bus network planning method based on two-stage optimization model |
CN111144669A (en) * | 2020-02-18 | 2020-05-12 | 郑州航空工业管理学院 | Urban bus station setting method |
CN111476033B (en) * | 2020-04-07 | 2023-09-19 | 武汉元光科技有限公司 | Bus stop name generation method and device |
CN111476033A (en) * | 2020-04-07 | 2020-07-31 | 武汉元光科技有限公司 | Bus stop name generation method and device |
CN111667114A (en) * | 2020-06-05 | 2020-09-15 | 鲁东大学 | Intelligent route planning recommendation method based on space-time big data fusion |
CN111815189A (en) * | 2020-07-15 | 2020-10-23 | 同济大学 | Modular bus dispatching system |
CN111815189B (en) * | 2020-07-15 | 2024-03-29 | 同济大学 | Modularized bus dispatching system |
CN112329989A (en) * | 2020-10-19 | 2021-02-05 | 北京中恒云科技有限公司 | Bus route planning method and device based on cloud computing and storage medium |
CN112906221B (en) * | 2021-02-19 | 2022-06-07 | 同济大学 | Multi-vehicle type region customized bus scheduling method based on reservation data |
CN112906221A (en) * | 2021-02-19 | 2021-06-04 | 同济大学 | Multi-vehicle type region customized bus scheduling method based on reservation data |
CN113077162A (en) * | 2021-04-14 | 2021-07-06 | 同济大学 | Multi-vehicle type customized bus area scheduling method facing real-time requirements |
CN112949784A (en) * | 2021-05-13 | 2021-06-11 | 深圳市城市交通规划设计研究中心股份有限公司 | Resident trip chain model construction method and resident trip chain acquisition method |
CN113469451A (en) * | 2021-07-19 | 2021-10-01 | 杭州数知梦科技有限公司 | Customized bus route generation method based on heuristic algorithm |
CN113469451B (en) * | 2021-07-19 | 2024-01-05 | 杭州数知梦科技有限公司 | Customized bus route generation method based on heuristic algorithm |
CN114566037A (en) * | 2022-01-19 | 2022-05-31 | 同济大学 | Flexible bus multi-vehicle fleet configuration method based on multi-source data |
CN117195484A (en) * | 2023-08-08 | 2023-12-08 | 广东贝能达交通设备有限公司 | Rail transit management method and system |
CN117195484B (en) * | 2023-08-08 | 2024-05-03 | 广东贝能达交通设备有限公司 | Rail transit management method and system |
CN117391270A (en) * | 2023-10-12 | 2024-01-12 | 华中科技大学 | Bus network planning method based on BRT (bus lane transfer) special lane |
CN117391270B (en) * | 2023-10-12 | 2024-05-28 | 华中科技大学 | Bus network planning method based on BRT (bus lane transfer) special lane |
Also Published As
Publication number | Publication date |
---|---|
CN108053062B (en) | 2022-04-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108053062A (en) | A kind of customization public bus network generation method based on multi-source data | |
Bai et al. | A bi-objective model for location planning of electric vehicle charging stations with GPS trajectory data | |
CN105206048B (en) | A kind of city dweller colony transfer mode based on traffic OD data finds system and method | |
Straka et al. | Predicting popularity of electric vehicle charging infrastructure in urban context | |
CN106570595B (en) | Subway station site selection method and system based on spatial big data | |
Etienne et al. | Model-based count series clustering for bike sharing system usage mining: a case study with the Vélib’system of Paris | |
CN105825242B (en) | The real-time method for detecting abnormality in cluster communication terminal track and system based on hybrid grid hierarchical cluster | |
CN110009455A (en) | It is a kind of based on network representation study net about share out administrative staff's matching process | |
Huang et al. | A novel bus-dispatching model based on passenger flow and arrival time prediction | |
CN107103392A (en) | A kind of identification of bus passenger flow influence factor and Forecasting Methodology based on space-time Geographical Weighted Regression | |
CN107729938A (en) | Rail station classification method based on bus connection radiation zone characteristics | |
CN115062873B (en) | Traffic travel mode prediction method and device, storage medium and electronic device | |
CN104809112A (en) | Method for comprehensively evaluating urban public transportation development level based on multiple data | |
He et al. | Congestion avoidance routing based on large-scale social signals | |
CN107656987A (en) | A kind of subway station function method for digging based on LDA models | |
CN107832779A (en) | Track station classification system | |
CN107506433A (en) | Urban development space general layout Scene Simulation system | |
CN110909434A (en) | Urban public transport trunk line network design method under low-carbon guidance | |
Kamel et al. | A modelling platform for optimizing time-dependent transit fares in large-scale multimodal networks | |
CN110263783A (en) | Multiple features charging addressing analysis of Influential Factors method and system based on deep learning | |
Zhang et al. | The research on planning of taxi sharing route and sharing expenses | |
Chen et al. | Customized bus line design model based on multi-source data | |
Yao et al. | Trip segmentation and mode detection for human mobility data | |
CN102880881A (en) | Method for identifying car type on basis of binary support vector machines and genetic algorithm | |
Li et al. | An efficient matching method for dispatching autonomous vehicles |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |