CN108537362A - Public Transport Transfer method based on bidirectional research and evaluation function prune approach - Google Patents
Public Transport Transfer method based on bidirectional research and evaluation function prune approach Download PDFInfo
- Publication number
- CN108537362A CN108537362A CN201810182963.6A CN201810182963A CN108537362A CN 108537362 A CN108537362 A CN 108537362A CN 201810182963 A CN201810182963 A CN 201810182963A CN 108537362 A CN108537362 A CN 108537362A
- Authority
- CN
- China
- Prior art keywords
- transfer
- bus
- circuit
- time
- site
- 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
- 238000012546 transfer Methods 0.000 title claims abstract description 161
- 238000000034 method Methods 0.000 title claims abstract description 16
- 238000011156 evaluation Methods 0.000 title claims abstract description 13
- 238000013459 approach Methods 0.000 title claims abstract description 12
- 230000002457 bidirectional effect Effects 0.000 title claims abstract description 12
- 238000011160 research Methods 0.000 title claims abstract description 12
- 238000004364 calculation method Methods 0.000 claims abstract description 48
- 240000007594 Oryza sativa Species 0.000 claims description 2
- 235000007164 Oryza sativa Nutrition 0.000 claims description 2
- 235000009566 rice Nutrition 0.000 claims description 2
- 230000000977 initiatory effect Effects 0.000 claims 1
- 230000000694 effects Effects 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000013138 pruning Methods 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
-
- G06Q50/40—
Abstract
The Public Transport Transfer method based on bidirectional research and evaluation function prune approach that the invention discloses a kind of, this method comprises the following steps：Step 1：The start site and terminus point that server is conveyed according to client, carry out straightforward line and special train routine calculation as follows respectively, once change to routine calculation, transfer before have the primary transfer routine calculation of walking, change to routine calculation, transfer for the first time twice before have walking change to routine calculation, second of transfer twice before have the transfer routine calculation twice for changing to routine calculation twice and have walking before transfer twice of walking：Step 2：The start site and terminus point that server is conveyed according to client calculate separately out the required time of available transit riding scheme in step 1, and time-consuming minimum transit riding scheme is recommended client.The present invention can effectively improve civic and go out line efficiency.
Description
Technical field
The present invention relates to public transit systems to change to technical field, and bidirectional research and evaluation function beta pruning are based in particular to one kind
The Public Transport Transfer method of mode.
Background technology
With urbanization, the development of modernization, public transport must face great as each developing city
Livelihood issues.For the increasingly complicated of public bus network, cause citizen to be easy to get on the wrong bus, wait for a long time excessively；With good
Transfer method, can reduce civic walking distance, shorten waiting time, reduce riding time etc., greatly brought for citizen
It is convenient, save the citizens' activities time.Current Public Transport Transfer scheme generally goes out the knot of a pile using breadth first search (BFS)
Fruit, then find K item short circuits successively with dijkstra's algorithm, then result is ranked up；The method calculating interchange efficiency is low, property
Can be poor, the independence requirement of inquiry is not fully considered, cannot be satisfied the various needs by bus of user；In addition, the situation is limited by meter
There is excessive transfer plan in calculation mode, lacks vehicle scheduling operating condition, can not capture Vehicular behavior in time, can not
Reasonably provide preferably transfer plan.
Invention content
It is a kind of based on bidirectional research and evaluation function prune approach to provide proposition aiming at above-mentioned technical problem by the present invention
Public Transport Transfer method, this method can find relatively excellent, more full public transport in complicated traffic and map datum and change
Multiply scheme.
To achieve the above object, a kind of public transport based on bidirectional research and evaluation function prune approach designed by the present invention
Transfer method, it includes the following steps：
Step 1：The start site and terminus point that server is conveyed according to client, go directly as follows respectively
Circuit and special train routine calculation are once changed to before routine calculation, transfer and have the primary transfer routine calculation of walking, change to line twice
Road calculates, transfer for the first time has the transfer twice for having walking before the routine calculation of transfer twice of walking, second of transfer before
Routine calculation and the transfer routine calculation twice for having walking before transfer twice：
Wherein, straightforward line and special train routine calculation method are：
Calculate X (p)=Y (q) (1)
X (p) indicates that the circuit number for the public bus network gathered by start site, Y (q) indicate to pass through terminus point set
Public bus network circuit number；
If result is nonempty set, then it represents that have through riding scheme, obtain corresponding of intersection element in formula 1
Beginning site number I, by bus circuit number p and terminus point number J；
Once transfer routine calculation method is：
Website Hosting A1 (I, p, U) is denoted as all websites for including of each circuit number p in set X (I, p), it is right
All websites that circuit number q is included by bus before terminal in set Y (J, q) are denoted as Website Hosting B (J, q, V),
The set X (I, p) indicates that the public bus network gathered by start site, I indicate that the number of starting point website, p indicate line of riding
Road is numbered, and indicates that circuit number of riding for the first time, U indicate to change to site number, set Y (J, q) in the set of start site herein
Indicate that the public bus network Jing Guo terminus point set, J indicate that terminus point number, q indicate the circuit number by bus before terminal,
V indicates the transfer site number in terminus point set,
Calculate A1 (U)=B (V) (2)
If result is nonempty set, then it represents that have and change to primary riding scheme, it is corresponding to obtain intersection element in formula 2
Start site number I, by bus circuit number p indicate circuit number of riding for the first time herein, change to site number U, before terminal
By bus circuit number q and terminus point number J；
There is the primary transfer routine calculation of walking to be before transfer：
For changing to website U in each start site set in Website Hosting A1 (I, p, U), half is preset around search
Other bus stations within diameter range, other bus stations are denoted as Website Hosting A2 (I, p, U, M), and M indicates that transfer is got on the bus
Site number；
Calculate A2 (M)=B (V) (3)
If result is nonempty set, then it represents that having has the primary transfer Decision Making of Line Schemes of walking, V to indicate terminus point before changing to
Transfer site number in set obtains the corresponding start site number I of intersection element in formula 3, by bus circuit number p, this
Place indicates circuit number by bus for the first time, changes to site number U, indicates transfer get-off stop number herein, changes to website of getting on the bus
Number M, the circuit number q and terminus point number J by bus before terminal；
Transfer routine calculation is twice：
It is denoted as line by the public bus network of each transfer website U in the start site set in Website Hosting A1 (I, p, U)
Road set A3 (I, p, U, k), k represent second of circuit number by bus, for each circuit in line set A3 (I, p, U, k)
All websites passed through are denoted as Website Hosting A4 (I, p, U, k, S), and S represents second of transfer get-off stop number；
Calculate A4 (S)=B (V) (4)
If result is nonempty set, then it represents that have the riding scheme of transfer twice, it is corresponding to obtain intersection element in formula 4
Start site number I, circuit number p, indicates circuit number of riding for the first time herein by bus, changes to site number U, indicates herein
Get-off stop number is changed to for the first time, and ride circuit number k for the second time, second of transfer get-off stop number S, before terminal
Circuit number q and terminus point number J by bus；
There is the routine calculation of transfer twice of walking to be before transfer for the first time：
The public bus network that the site number M that gets on the bus is changed to by each station in Website Hosting A2 (I, p, U, M) is denoted as line
Road set A5 (I, p, U, M, k), all websites passed through for each circuit in line set A5 (I, p, U, M, k) are denoted as station
Point set A6 (I, p, U, M, k, S), S are second of transfer get-off stop number；
Calculate A6 (S)=B (V) (5)
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before transfer for the first time, obtain
The corresponding start site number I of intersection element in formula 5, circuit number p, indicates circuit number of riding for the first time herein by bus,
Transfer site number U is indicated to change to get-off stop number for the first time, is changed to the site number M that gets on the bus and indicate to change for the first time herein herein
It is multiplied by vehicle site number, second of circuit number k that rides changes to get-off stop number S for the second time, the circuit by bus before terminal
Number q and terminus point number J；
There is the routine calculation of transfer twice of walking to be before second transfer：
Get-off stop number S is changed to second for each of Website Hosting A4 (I, p, U, k, S), is preset around search
Other bus stations within radius, are denoted as Website Hosting A7 (I, p, U, k, S, G), and G indicates the line by bus before terminal
The site number of getting on the bus on road；
Calculate A7 (G)=B (V) (6)
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before second of transfer, obtain
The corresponding start site number I of intersection element in formula 6, circuit number p, indicates circuit number of riding for the first time herein by bus,
It changes to site number U to indicate to change to get-off stop number for the first time herein, second of circuit number k that rides, under second is changed to
Vehicle site number S, the site number G that gets on the bus of the circuit by bus before terminal, circuit number q and terminal by bus before terminal
Site number J；
There is the routine calculation of transfer twice of walking to be before transfer twice：
Get-off stop number S is changed to second for each of Website Hosting A6 (I, p, U, M, k, S), search surrounding is pre-
If other bus stations within radius, it is denoted as Website Hosting A8 (I, p, U, M, k, S, G), multiplying before G expression terminals
The site number of getting on the bus on fare road；
Calculate A8 (G)=B (V) (7)
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before transfer twice, obtain
The corresponding start site number I of intersection element in formula 7, circuit number p, indicates circuit number of riding for the first time herein by bus,
Transfer site number U is indicated to change to get-off stop number for the first time, is changed to the site number M that gets on the bus and indicate to change for the first time herein herein
It is multiplied by vehicle site number, second of circuit number k that rides changes to get-off stop number S for the second time, the circuit by bus before terminal
The site number G that gets on the bus, before terminal by bus circuit number q and terminus point number J；
Step 2：The start site and terminus point that server is conveyed according to client calculate separately out available in step 1
The required time of transit riding scheme, and time-consuming minimum transit riding scheme is recommended into client.
The present invention utilizes a large amount of circuit and website coordinate in virtual map, and city is predicted by above-mentioned transfer plan
People's riding scheme.Compared with the conventional method introduced in background technology, this method has that algorithm is simple, and calculation amount is few, efficient,
The advantages that prediction transfer circuit is complete；The invention utilizes the public bus network drawn in map and site information, double by using for reference
To search and evaluation function prune approach, some websites too far are filtered, avoid the calculating of excessive disabling the line, while according to tune
Degree system can obtain the operating condition of corresponding line vehicle, and in conjunction with transfer circuit, weight calculation and travel condition of vehicle calculate
Go out the transfer plan of citizens' activities.
Description of the drawings
Fig. 1 is straightforward line or special line；
Fig. 2 is primary transfer circuit；
Fig. 3 is secondary transfer circuit.
In figure, point indicates that each website, line indicate that circuit of riding, circle of dotted line indicate the radius for needing to search for.
Specific implementation mode
The following further describes the present invention in detail with reference to the accompanying drawings and specific embodiments.
A kind of Public Transport Transfer method based on bidirectional research and evaluation function prune approach of the present invention, it includes following step
Suddenly：
Step 1：The start site and terminus point that server is conveyed according to client, the data being utilized respectively in server
Library information (being plotted in the public bus network and site information in numerical map) carries out straightforward line and special train circuit as follows
It calculates, once change to routine calculation, the primary transfer routine calculation that has walking before transfer, twice transfer routine calculation, first time
Have before transfer walking change to routine calculation, second transfer twice before have the routine calculation of transfer twice and twice of walking
There is the transfer routine calculation twice of walking before transfer：
Wherein, straightforward line and special train routine calculation method are：
Such as Fig. 1, X (p)=Y (q) (1) is calculated
X (p) indicates that the circuit number for the public bus network gathered by start site, Y (q) indicate to pass through terminus point set
Public bus network circuit number；
If result is nonempty set, then it represents that have through riding scheme, obtain corresponding of intersection element in formula 1
Beginning site number I, by bus circuit number p and terminus point number J ignore the calculating if result is null set；
Once transfer routine calculation method is：
Website Hosting A1 (I, p, U) is denoted as all websites for including of each circuit number p in set X (I, p), it is right
All websites that circuit number q is included by bus before terminal in set Y (J, q) are denoted as Website Hosting B (J, q, V),
The set X (I, p) indicates that the public bus network gathered by start site, I indicate that the number of starting point website, p indicate line of riding
Road is numbered, and indicates that circuit number of riding for the first time, U indicate to change to site number, set Y (J, q) in the set of start site herein
Indicate that the public bus network Jing Guo terminus point set, J indicate that terminus point number, q indicate the circuit number by bus before terminal,
V indicates the transfer site number in terminus point set,
Such as Fig. 2, A1 (U)=B (V) (2) is calculated
If result is nonempty set, then it represents that have and change to primary riding scheme, it is corresponding to obtain intersection element in formula 2
Start site number I, by bus circuit number p indicate circuit number of riding for the first time herein, change to site number U, before terminal
Circuit number q and terminus point number J by bus, if result to ignore the calculating if null set；
There is the primary transfer routine calculation of walking to be before transfer：
For changing to website U, 350 meters of search surrounding in each start site set in Website Hosting A1 (I, p, U)
Other bus stations within radius, other bus stations are denoted as Website Hosting A2 (I, p, U, M), and M is indicated in transfer
Vehicle site number；
Such as Fig. 2, A2 (M)=B (V) (3) is calculated
If result is nonempty set, then it represents that having has the primary transfer Decision Making of Line Schemes of walking, V to indicate terminus point before changing to
Transfer site number in set obtains the corresponding start site number I of intersection element in formula 3, by bus circuit number p, this
Place indicates circuit number by bus for the first time, changes to site number U, indicates transfer get-off stop number herein, changes to website of getting on the bus
Number M, the circuit number q and terminus point number J by bus before terminal, ignores the calculating if result is null set；
Transfer routine calculation is twice：
It is denoted as line by the public bus network of each transfer website U in the start site set in Website Hosting A1 (I, p, U)
Road set A3 (I, p, U, k), k represent second of circuit number by bus, for each circuit in line set A3 (I, p, U, k)
All websites passed through are denoted as Website Hosting A4 (I, p, U, k, S), and S represents second of transfer get-off stop number；
Such as Fig. 3, A4 (S)=B (V) (4) is calculated
If result is nonempty set, then it represents that have the riding scheme of transfer twice, it is corresponding to obtain intersection element in formula 4
Start site number I, circuit number p, indicates circuit number of riding for the first time herein by bus, changes to site number U, indicates herein
Get-off stop number is changed to for the first time, and ride circuit number k for the second time, second of transfer get-off stop number S, before terminal
Circuit number q and terminus point number J by bus ignores the calculating if result is null set；
There is the routine calculation of transfer twice of walking to be before transfer for the first time：
The public bus network that the site number M that gets on the bus is changed to by each station in Website Hosting A2 (I, p, U, M) is denoted as line
Road set A5 (I, p, U, M, k), all websites passed through for each circuit in line set A5 (I, p, U, M, k) are denoted as station
Point set A6 (I, p, U, M, k, S), S are second of transfer get-off stop number；
Such as Fig. 3, A6 (S)=B (V) (5) is calculated
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before transfer for the first time, obtain
The corresponding start site number I of intersection element in formula 5, circuit number p, indicates circuit number of riding for the first time herein by bus,
Transfer site number U is indicated to change to get-off stop number for the first time, is changed to the site number M that gets on the bus and indicate to change for the first time herein herein
It is multiplied by vehicle site number, second of circuit number k that rides changes to get-off stop number S for the second time, the circuit by bus before terminal
Number q and terminus point number J ignores the calculating if result is null set；
There is the routine calculation of transfer twice of walking to be before second transfer：
Get-off stop number S, search surrounding 350 are changed to second for each of Website Hosting A4 (I, p, U, k, S)
Other bus stations within rice radius are denoted as Website Hosting A7 (I, p, U, k, S, G), ride before G expression terminals
The site number of getting on the bus of circuit；
Such as Fig. 3, A7 (G)=B (V) (6) is calculated
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before second of transfer, obtain
The corresponding start site number I of intersection element in formula 6, circuit number p, indicates circuit number of riding for the first time herein by bus,
It changes to site number U to indicate to change to get-off stop number for the first time herein, second of circuit number k that rides, under second is changed to
Vehicle site number S, the site number G that gets on the bus of the circuit by bus before terminal, circuit number q and terminal by bus before terminal
Site number J ignores the calculating if result is null set；
There is the routine calculation of transfer twice of walking to be before transfer twice：
Get-off stop number S, search surrounding are changed to second for each of Website Hosting A6 (I, p, U, M, k, S)
Other bus stations within 350 meters of radius, are denoted as Website Hosting A8 (I, p, U, M, k, S, G), and G is indicated before terminal
The site number of getting on the bus of circuit by bus；
Such as Fig. 3, A8 (G)=B (V) (7) is calculated
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before transfer twice, obtain
The corresponding start site number I of intersection element in formula 7, circuit number p, indicates circuit number of riding for the first time herein by bus,
Transfer site number U is indicated to change to get-off stop number for the first time, is changed to the site number M that gets on the bus and indicate to change for the first time herein herein
It is multiplied by vehicle site number, second of circuit number k that rides changes to get-off stop number S for the second time, the circuit by bus before terminal
The site number G that gets on the bus, the circuit number q and terminus point number J by bus before terminal, if result to ignore if null set
The calculating；
Step 2：The start site and terminus point that server is conveyed according to client calculate separately out available in step 1
The required time of transit riding scheme, and time-consuming minimum transit riding scheme is recommended into client.
In the step 2 of above-mentioned technical proposal, the sequence of server temporally from less to more multiplies available public transport in step 2
Vehicle scheme, which is listed, recommends client.
In above-mentioned technical proposal, when calculating the required time calculating of available transit riding scheme in step 1, vehicle traveling is every
It is determined as needing 1.5 minutes the time required to kilometer, is determined as 1.5 minutes the time required to every hundred meters of walking, one station institute of public transport driving
It takes time and is determined as 2 minutes, be determined as 1.5 minutes the time required to every hundred meters of walking, be determined as 5 the time required to transfer waiting time
Minute.
For circuit and website that above scheme is previously mentioned, a large amount of data acquisition is carried out in advance, builds corresponding data knot
Structure, the information such as storage site, circuit and website relationship, line information, while corresponding website and circuit are drawn in map；On
7 kinds of transfer plans are stated, bidirectional research and evaluation function prune approach are used for reference, obtain transfer plan；Through and special line scheme：Starting point
It is carried out at the same time effective website in seeking scope with terminal, secondly by the corresponding circuit of website, circuit and end that starting point is found
The circuit that point is found overlaps, as through or special line scheme；Transfer plan：Beginning and end is carried out at the same time in seeking scope
Effective website, secondly by the corresponding circuit of website, circuit obtains respective website, and the website of two circuit of starting point carries out
Match, an as transfer plan of two websites in search plan；Secondary transfer plan：It is similar with a transfer plan, starting point
After matching first time terminated line, the website of the circuit needs to match Article 2 circuit and the website of corresponding line, then with terminal
Website website is matched, and meet search range is secondary transfer plan；The transfer plan obtained according to appeal scheme is deposited
In a large amount of iteration scheme, the required time for calculating each scheme is needed at this time；
For special train, go directly, one or two transfer plan duplicate removals：
1, the through scheme duplicate removal of special train：Using the circuit in the first scheme (through riding scheme) as unique mark, choosing
Minimum a kind of scheme the time required to selecting.
2, a transfer plan duplicate removal：(there is walking before the primary riding scheme of transfer, transfer with second and third two schemes
Primary transfer Decision Making of Line Schemes) in two kinds of circuits (p-q), minimum a kind of scheme the time required to selection.
3, secondary transfer plan duplicate removal：With the 4th, 5,6, (transfer riding scheme twice is changed to for the first time for 7 four kind of scheme
There are the Decision Making of Line Schemes of transfer twice of walking, second of transfer have the Decision Making of Line Schemes of transfer twice of walking before, change to twice before
Have the transfer Decision Making of Line Schemes twice of walking before) in three kinds of circuits (p-k-q), minimum a kind of side the time required to selection
Case.
Again by dispatching system, the operating status of vehicle is obtained, all optimal riding schemes are finally obtained, according to correspondence
Scheme can calculate minimum walking, minimum time, least bus change and minimum stroke expense and nearest vehicle, go out convenient for civic
Row.
The content that this specification is not described in detail belongs to the prior art well known to professional and technical personnel in the field.
Claims (4)
1. a kind of Public Transport Transfer method based on bidirectional research and evaluation function prune approach, which is characterized in that it includes as follows
Step：
Step 1：The start site and terminus point that server is conveyed according to client, carry out straightforward line as follows respectively
And special train routine calculation, the primary transfer routine calculation once changed to routine calculation, have walking before transfer, transfer circuit meter twice
It calculates, transfer for the first time has the transfer circuit twice for having walking before the routine calculation of transfer twice of walking, second of transfer before
Calculate and have before transfer twice the transfer routine calculation twice of walking：
Wherein, straightforward line and special train routine calculation method are：
Calculate X (p)=Y (q) (1)
X (p) indicates that the circuit number for the public bus network gathered by start site, Y (q) indicate the public affairs Jing Guo terminus point set
The circuit number on intersection road；
If result is nonempty set, then it represents that have through riding scheme, obtain the corresponding initiating station of intersection element in formula 1
Point number I, by bus circuit number p and terminus point number J；
Once transfer routine calculation method is：
Website Hosting A1 (I, p, U) is denoted as all websites for including of each circuit number p in set X (I, p), for collection
All websites that circuit number q is included by bus before closing the terminal in Y (J, q) are denoted as Website Hosting B (J, q, V), described
Set X (I, p) indicates that the public bus network gathered by start site, I indicate that the number of starting point website, p indicate circuit volume of riding
Number, indicate that circuit number of riding for the first time, U indicate to change to site number in the set of start site herein, set Y (J, q) is indicated
By the public bus network of terminus point set, J indicates that terminus point number, q indicate the circuit number by bus before terminal, V tables
Show the transfer site number in terminus point set,
Calculate A1 (U)=B (V) (2)
If result is nonempty set, then it represents that have and change to primary riding scheme, obtain the corresponding starting of intersection element in formula 2
Site number I, circuit number p, indicates circuit number of riding for the first time herein by bus, changes to site number U, multiplying before terminal
Vehicle circuit number q and terminus point number J；
There is the primary transfer routine calculation of walking to be before transfer：
For changing to website U in each start site set in Website Hosting A1 (I, p, U), surrounding pre-set radius model is searched for
Other bus stations within enclosing, other bus stations are denoted as Website Hosting A2 (I, p, U, M), and M indicates to change to website of getting on the bus
Number；
Calculate A2 (M)=B (V) (3)
If result is nonempty set, then it represents that having has the primary transfer Decision Making of Line Schemes of walking, V to indicate terminus point set before changing to
In transfer site number, obtain the corresponding start site number I of intersection element in formula 3, by bus circuit number p, herein table
Show circuit number by bus for the first time, change to site number U, indicates transfer get-off stop number herein, change to site number of getting on the bus
M, the circuit number q and terminus point number J by bus before terminal；
Transfer routine calculation is twice：
It is denoted as sets of lines by the public bus network of each transfer website U in the start site set in Website Hosting A1 (I, p, U)
A3 (I, p, U, k) is closed, k represents second of circuit number by bus, each circuit in line set A3 (I, p, U, k) is passed through
All websites be denoted as Website Hosting A4 (I, p, U, k, S), S represents second of transfer get-off stop number；
Calculate A4 (S)=B (V) (4)
If result is nonempty set, then it represents that have the riding scheme of transfer twice, obtain the corresponding starting of intersection element in formula 4
Site number I, circuit number p, indicates circuit number of riding for the first time herein by bus, changes to site number U, indicates first herein
Secondary transfer get-off stop is numbered, second of circuit number k that rides, second of transfer get-off stop number S, is ridden before terminal
Circuit number q and terminus point number J；
There is the routine calculation of transfer twice of walking to be before transfer for the first time：
The public bus network that the site number M that gets on the bus is changed to by each station in Website Hosting A2 (I, p, U, M) is denoted as sets of lines
A5 (I, p, U, M, k) is closed, all websites passed through for each circuit in line set A5 (I, p, U, M, k) are denoted as set of sites
A6 (I, p, U, M, k, S) is closed, S is second of transfer get-off stop number；
Calculate A6 (S)=B (V) (5)
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before transfer for the first time, obtain formula 5
The corresponding start site number I of middle intersection element, circuit number p, indicates circuit number of riding for the first time, transfer stop herein by bus
Point number U indicates that first time changes to get-off stop number herein, changes to the site number M that gets on the bus and indicates that transfer is got on the bus for the first time herein
Site number, second of circuit number k that rides, changes to get-off stop number S for the second time, the circuit number q by bus before terminal
And terminus point number J；
There is the routine calculation of transfer twice of walking to be before second transfer：
Get-off stop number S is changed to second for each of Website Hosting A4 (I, p, U, k, S), searches for surrounding pre-set radius
Other bus stations within range, are denoted as Website Hosting A7 (I, p, U, k, S, G), and G indicates the circuit by bus before terminal
It gets on the bus site number；
Calculate A7 (G)=B (V) (6)
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before second of transfer, obtain formula 6
The corresponding start site number I of middle intersection element, circuit number p, indicates circuit number of riding for the first time, transfer stop herein by bus
Point number U indicates to change to get-off stop number for the first time herein, second circuit number k by bus, for the second time transfer get-off stop
Number S, the site number G that gets on the bus of the circuit by bus before terminal, circuit number q by bus and terminus point before terminal are compiled
Number J；
There is the routine calculation of transfer twice of walking to be before transfer twice：
Get-off stop number S is changed to second for each of Website Hosting A6 (I, p, U, M, k, S), half is preset around search
Other bus stations within diameter range, are denoted as Website Hosting A8 (I, p, U, M, k, S, G), and G indicates the line by bus before terminal
The site number of getting on the bus on road；
Calculate A8 (G)=B (V) (7)
If result is nonempty set, then it represents that having has the transfer Decision Making of Line Schemes twice of walking before transfer twice, obtain formula 7
The corresponding start site number I of middle intersection element, circuit number p, indicates circuit number of riding for the first time, transfer stop herein by bus
Point number U indicates that first time changes to get-off stop number herein, changes to the site number M that gets on the bus and indicates that transfer is got on the bus for the first time herein
Site number, second of circuit number k that rides, changes to get-off stop number S for the second time, and the circuit by bus before terminal is got on the bus
Site number G, the circuit number q and terminus point number J by bus before terminal；
Step 2：The start site and terminus point that server is conveyed according to client calculate separately out available public transport in step 1
The required time of riding scheme, and time-consuming minimum transit riding scheme is recommended into client.
2. the Public Transport Transfer method according to claim 1 based on bidirectional research and evaluation function prune approach, feature
It is：Available transit riding scheme in step 2 is listed recommendation by the sequence of server temporally from less to more in the step 2
To client.
3. the Public Transport Transfer method according to claim 1 based on bidirectional research and evaluation function prune approach, feature
It is：When calculating the required time of available transit riding scheme in step 1, the time required to vehicle travels every kilometer, walking every hundred
The time required to rice, public transport is driven a vehicle the time required to a station, is pre- the time required to transfer waiting time the time required to every hundred meters of walking
Setting value.
4. the Public Transport Transfer method according to claim 1 based on bidirectional research and evaluation function prune approach, feature
It is：In step 1, the search range of other bus stations is within 350 meters of radius around search.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810182963.6A CN108537362B (en) | 2018-03-06 | 2018-03-06 | Bus transfer method based on bidirectional search and estimation function pruning mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810182963.6A CN108537362B (en) | 2018-03-06 | 2018-03-06 | Bus transfer method based on bidirectional search and estimation function pruning mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108537362A true CN108537362A (en) | 2018-09-14 |
| CN108537362B CN108537362B (en) | 2022-01-18 |
Family
ID=63485619
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810182963.6A Active CN108537362B (en) | 2018-03-06 | 2018-03-06 | Bus transfer method based on bidirectional search and estimation function pruning mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108537362B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109816979A (en) * | 2019-02-19 | 2019-05-28 | 辽宁师范大学 | Consider bus arrival frequency and by bus the public bus network recommended method of comfort level |
| CN110956315A (en) * | 2019-11-20 | 2020-04-03 | 深圳市活力天汇科技股份有限公司 | Method for determining air-rail transport transfer scheme |
| CN113888953A (en) * | 2020-07-01 | 2022-01-04 | 腾讯科技（深圳）有限公司 | Subway line drawing method and device and computer readable storage medium |
| CN114936711A (en) * | 2022-06-15 | 2022-08-23 | 广东工业大学 | Order form kneading optimization method for large-scale plate-type customized furniture |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010055019A1 (en) * | 1998-02-17 | 2001-12-27 | Sowizral Henry A. | Multiple processor visibility search system and method |
| US20030122815A1 (en) * | 1998-02-17 | 2003-07-03 | Michael Deering | Graphics system configured to determine triangle orientation by octant identification and slope comparison |
| CN103092843A (en) * | 2011-10-29 | 2013-05-08 | 上海遥薇(集团)有限公司 | WebGIS (geographic information system) based bus taking guide line information processing method |
| CN103294708A (en) * | 2012-02-28 | 2013-09-11 | 北京四维图新科技股份有限公司 | Route planning method and device based on public traffic system |
| US8972185B1 (en) * | 2012-10-01 | 2015-03-03 | Google Inc. | Constructing a transit transfer network from transit data |
| CN105468761A (en) * | 2015-12-02 | 2016-04-06 | 常州普适信息科技有限公司 | Weighting public transportation transfer method |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
-
2018
- 2018-03-06 CN CN201810182963.6A patent/CN108537362B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010055019A1 (en) * | 1998-02-17 | 2001-12-27 | Sowizral Henry A. | Multiple processor visibility search system and method |
| US20030122815A1 (en) * | 1998-02-17 | 2003-07-03 | Michael Deering | Graphics system configured to determine triangle orientation by octant identification and slope comparison |
| CN103092843A (en) * | 2011-10-29 | 2013-05-08 | 上海遥薇(集团)有限公司 | WebGIS (geographic information system) based bus taking guide line information processing method |
| CN103294708A (en) * | 2012-02-28 | 2013-09-11 | 北京四维图新科技股份有限公司 | Route planning method and device based on public traffic system |
| US8972185B1 (en) * | 2012-10-01 | 2015-03-03 | Google Inc. | Constructing a transit transfer network from transit data |
| CN105468761A (en) * | 2015-12-02 | 2016-04-06 | 常州普适信息科技有限公司 | Weighting public transportation transfer method |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
Non-Patent Citations (5)
| Title |
|---|
| AN XINLEI等: "Rearch on urban public traffic network with multi-weights based on single bus transfer junction", 《PHYSICA A：STATISTICAL MECHANICS AND ITS APPLICATION》 * |
| 付仲良等: "基于GIS的公交数据模型研究及换乘算法实现", 《测绘通报》 * |
| 姚春龙等: "公交出行最优路径搜索的有向赋权图模型", 《计算机应用研究》 * |
| 孙庆军: "基于公交需求变化的柔性公交线网设计", 《中国优秀硕士学位论文全文数据库 工程科技II辑》 * |
| 陆悠等: "基于二维有向集合扩散的公交网路径搜索算法研究", 《计算机与现代化》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109816979A (en) * | 2019-02-19 | 2019-05-28 | 辽宁师范大学 | Consider bus arrival frequency and by bus the public bus network recommended method of comfort level |
| CN109816979B (en) * | 2019-02-19 | 2021-07-27 | 辽宁师范大学 | Bus route recommendation method considering bus arrival frequency and riding comfort |
| CN110956315A (en) * | 2019-11-20 | 2020-04-03 | 深圳市活力天汇科技股份有限公司 | Method for determining air-rail transport transfer scheme |
| CN113888953A (en) * | 2020-07-01 | 2022-01-04 | 腾讯科技（深圳）有限公司 | Subway line drawing method and device and computer readable storage medium |
| CN113888953B (en) * | 2020-07-01 | 2023-08-22 | 腾讯科技（深圳）有限公司 | Subway line drawing method and equipment and computer readable storage medium |
| CN114936711A (en) * | 2022-06-15 | 2022-08-23 | 广东工业大学 | Order form kneading optimization method for large-scale plate-type customized furniture |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108537362B (en) | 2022-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108537362A (en) | Public Transport Transfer method based on bidirectional research and evaluation function prune approach | |
| CN105865472B (en) | A kind of navigation method based on optimum oil consumption | |
| CN100463009C (en) | Traffic information fusion processing method and system | |
| CN106504577B (en) | A kind of park and shift traffic path method and device for planning | |
| CN103198104B (en) | A kind of public transport station OD acquisition methods based on city intelligent public transit system | |
| CN102102992B (en) | Multistage network division-based preliminary screening method for matched roads and map matching system | |
| CN103134505B (en) | Path planning system and method thereof | |
| CN107024217A (en) | The method of the route planning of Intercity Transportation, apparatus and system | |
| CN109190813B (en) | Shared bicycle region putting planning method based on double-layer planning | |
| CN107330547A (en) | A kind of city bus dynamic dispatching optimization method and system | |
| CN105674995A (en) | Method for acquiring commuting route based on user's travel locus, and apparatus thereof | |
| CN106548242A (en) | Vehicle order distribution method and device | |
| CN106813666A (en) | The double-deck path construction method and system of vehicle boarded unmanned plane | |
| CN101325004A (en) | Method for compensating real time traffic information data | |
| CN107818412A (en) | A kind of extensive bus passenger OD parallel calculating methods based on MapReduce | |
| CN102436466A (en) | Bus transfer inquiry method based on geographic information system (GIS) classification | |
| CN109764884A (en) | A kind of school bus paths planning method and device for planning | |
| CN103308062A (en) | Route planning and matching system and method as well as device and terminal of system | |
| CN108444486A (en) | A kind of navigation routine sort method and device | |
| CN106097060A (en) | A kind of university students is left unused Cycle Hire software screening method system and its implementation | |
| CN104951848A (en) | Real-time car-pooling matching method | |
| CN107134137A (en) | A kind of Dynamic User-Optimal Route Choice method for considering real time information | |
| CN107092986A (en) | The bus passenger travel route choice method based on website and collinearly run | |
| CN107403550A (en) | Transit network collecting method, device and terminal device | |
| CN103942312A (en) | Public transportation transfer line planning method and device |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220811 Address after: 518000 a2901-2902, building 10, Shenzhen Bay science and technology ecological park, No. 10, Gaoxin South ninth Road, high tech Zone community, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Patentee after: SHENZHEN EMPEROR TECHNOLOGY Co.,Ltd. Address before: No.3-6, 3 / F, building A3, phase 4.1, optical valley software park, 1 Guanshan Avenue, Donghu New Technology Development Zone, Wuhan City, Hubei Province, 430000 Patentee before: WUHAN LANTAIYUAN INFORMATION TECHNOLOGY Co.,Ltd. |