CN108764516A - A kind of generation method and system of rail traffic dynamic reachable path - Google Patents
A kind of generation method and system of rail traffic dynamic reachable path Download PDFInfo
- Publication number
- CN108764516A CN108764516A CN201810300419.7A CN201810300419A CN108764516A CN 108764516 A CN108764516 A CN 108764516A CN 201810300419 A CN201810300419 A CN 201810300419A CN 108764516 A CN108764516 A CN 108764516A
- Authority
- CN
- China
- Prior art keywords
- passenger
- train
- time
- moment
- path
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 49
- 238000010586 diagram Methods 0.000 claims abstract description 49
- 230000002441 reversible effect Effects 0.000 claims abstract description 30
- 238000012546 transfer Methods 0.000 claims description 88
- 238000012545 processing Methods 0.000 claims description 9
- 238000002360 preparation method Methods 0.000 claims description 4
- 230000000977 initiatory effect Effects 0.000 abstract description 6
- 238000004458 analytical method Methods 0.000 description 6
- 238000010845 search algorithm Methods 0.000 description 5
- 230000003068 static effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000009795 derivation Methods 0.000 description 2
- 238000012800 visualization Methods 0.000 description 2
- 235000006629 Prosopis spicigera Nutrition 0.000 description 1
- 240000000037 Prosopis spicigera Species 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000002123 temporal effect Effects 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"
-
- 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)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention discloses a kind of generation method of rail traffic dynamic reachable path, this method includes：The Rail traffic network topology diagram and route map of train generated according to the basic physics information and train schedule of urban mass transit network builds constraint prism, the space-time running orbit of passenger is recorded in the constraint prism, it searches for route map of train and calls TSA algorithms, search for the range coverage that the passenger in the constraint prism meets first condition from initiating station, and reverse search route map of train calls anti-TSA algorithms, search for passenger in the constraint prism from point of destination it is counter push away meet second condition by region, finally take range coverage and the space intersection by region, path is the dynamic reachable path collection of passenger in the intersection.Wherein, the problem of first condition and second condition be under time-constrain, and this method has fully considered time-constrain, geographic paths are combined with time-constrain, realize that the space-time dynamic in rail traffic path considers.
Description
Technical field
The present invention relates to path search algorithm field more particularly to a kind of generation methods of rail traffic dynamic reachable path
And system.
Background technology
Accessibility this feature of trip route in Rail traffic network dynamic accessibility in time aspect is to passenger
Significance is all had with rail transportation operation manager, first, for passenger, does not consider that the routing information of travel time can
The divergence that can lead to trip route causes passenger that can not be arrived in planned time, is especially connected in last bus
On, it is also easy to produce passenger and smoothly gets on the bus in initiating station, but the awkward situation at purpose station can not be arrived in transfer, secondly,
For network operator, current bus traveler assignment does not account for passenger's trip route change with the time with Trip distribution method,
It can be by part bus traveler assignment to train delays or the path-segments of stoppage in transit in bus traveler assignment, it is also possible to ignore certain practicable
Specific path, to cause network passenger flow allocation result misalignment, such case to be more often happened at delay, peak time or operation
When closing to an end.Therefore judge the dynamic accessibility of rail traffic passenger's trip route or generate grinding for dynamic reachable path
It is extremely important to study carefully middle consideration time-constrain this condition.
Traditional urban track traffic trip route generating algorithm is mostly to be based on shortest path algorithm, deep search algorithm and K
Short-circuit algorithm, such routing algorithm only account for " nature static " feature of track, and ignore temporal " dynamic ".Then knot
Rail transportation operation characteristic is closed, considers that the coordinates measurement algorithm of " dynamic " based on train operation plan model is suggested, the calculation
Method is widely used distributes in traffic flow.But the thinking of above-mentioned a few class algorithms is all feasible paths on first Enumerate network,
Carry out path impedance sequence according to route map of train again, there is no truly by " nature static " of Rail traffic network and
" dynamic " binding analysis；Above-mentioned path set generating algorithm is limited to the complexity of Rail traffic network structure, algorithm simultaneously
In enumerate number of path and can excessively influence efficiency of algorithm, and enumerate that number of path is excessively few may then to miss feasible trip route.
Invention content
The main purpose of the present invention is to provide a kind of generation methods and system of rail traffic dynamic reachable path, are used for
The technical issues of solving not fully considering dynamic time in the analysis method and system of existing rail traffic path accessibility.
To achieve the above object, first aspect present invention provides a kind of generation side in rail traffic dynamic accessibility path
Method, the method includes：
Urban mass transit network basic information and train schedule are obtained, Rail traffic network topological structure is generated
Figure and route map of train obtain the basic information of passenger's input, and the basic information includes point of destination, inception point, and plan is set out
Moment and arrival time；
Constraint prism, the space-time rib are built based on the Rail traffic network topology diagram and the route map of train
The space-time running orbit of the passenger is recorded in column；
Call train operation track search TSA algorithms, search full in the constraint prism according to the route map of train
The range coverage of sufficient first condition, the first condition are：Passenger is plan moment, terminus constantly from starting station
For the purpose of stand or search process at the time of arrive passenger's plan arrival time；
According to the route map of train and anti-TSA algorithms are called, search meets second condition in the constraint prism
By region, the second condition is：Passenger reaches point of destination in plan arrival time, and the setting out to be no earlier than constantly of inception point multiplies
Set out moment or the inception point of visitor's plan are passenger's starting station；
The range coverage and the intersection by region are obtained, the path in the intersection is that the dynamic of passenger is reachable
Path set.
Second aspect of the present invention provides a kind of generation system of rail traffic dynamic reachable path, the system comprises：
Information module is obtained, for obtaining urban mass transit network basic information and train schedule, generates rail
Road transportation network topology diagram and route map of train obtain the basic information of passenger's input, and the basic information includes purpose
It stands, inception point, plan is set out moment and arrival time；
Preparation module, for building space-time rib based on the Rail traffic network topology diagram and the route map of train
Column records the space-time running orbit of the passenger in the constraint prism；
Forward lookup module, for calling train operation track search TSA algorithms, search to exist according to the route map of train
Meet the range coverage of first condition in the constraint prism, the first condition is：Passenger is meter constantly from starting station
The hair moment is marked, stands for the purpose of terminus or search process at the time of arrive passenger's plan arrival time；
Reverse search module is searched for for according to the route map of train and calling anti-TSA algorithms in the constraint prism
Inside meet second condition by region, the second condition is：Passenger reaches point of destination in plan arrival time, inception point
It is passenger's starting station to set out and be no earlier than set out moment or the inception point of passenger's plan constantly；
Processing module, for obtaining the range coverage and the intersection by region, the path in the intersection is
The dynamic reachable path collection of passenger.
From the technical solution of above-mentioned offer it is found that the analysis method by obtain urban mass transit network basic information and
Train schedule generates Rail traffic network topology diagram and route map of train, in conjunction with network topology structure figure and
Route map of train builds constraint prism, and the space-time running orbit of passenger, the information inputted according to passenger are recorded in the constraint prism
In conjunction with route map of train and TSA algorithms in constraint prism the forward lookup region that passenger can reach in time-constrain, together
When also according to passenger input information combination route map of train and anti-TSA algorithms in constraint prism reverse search in time-constrain
The region that interior passenger passes through, takes the intersection in two kinds of regions, which is the friendship of passenger's space-time running orbit under two directions of search
The problem of collecting, having fully considered time-constrain, and geographic paths are combined with time-constrain, the dynamic route for obtaining passenger is reachable
Path set realizes that the space-time dynamic in rail traffic path considers.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those skilled in the art without creative efforts, can also basis
These attached drawings obtain other attached drawings.
Fig. 1 is that a kind of flow of the generation method for rail traffic dynamic reachable path that first embodiment of the invention provides is shown
It is intended to；
Fig. 2 is the flow diagram of the refinement step of step 103；
Fig. 3 is that the constraint prism under urban track traffic background generates reachable path schematic diagram；
Fig. 4 is train operation graph search algorithm schematic diagram；
Fig. 5 is the flow diagram of the refinement step of step 104；
Fig. 6 is the flow diagram of the refinement step of step 105；
Fig. 7 is that a kind of structure of the generation system for rail traffic dynamic reachable path that second embodiment of the invention provides is shown
It is intended to；
Fig. 8 is the structural schematic diagram of the refinement module for the acquisition information module that second embodiment of the invention provides；
Fig. 9 is the structural schematic diagram of the refinement module for the forward lookup module that second embodiment of the invention provides；
Figure 10 is the structural schematic diagram of the refinement module for the reverse search module that second embodiment of the invention provides；
Figure 11 is the structural schematic diagram of the refinement module for the processing module that second embodiment of the invention provides.
Specific implementation mode
In order to make the invention's purpose, features and advantages of the invention more obvious and easy to understand, below in conjunction with the present invention
Attached drawing in embodiment, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described reality
It is only a part of the embodiment of the present invention to apply example, and not all embodiments.Based on the embodiments of the present invention, people in the art
The every other embodiment that member is obtained without making creative work, shall fall within the protection scope of the present invention.
Due to not fully considered in the analysis method and system of existing rail traffic path accessibility in the prior art
The technical issues of dynamic time.In order to solve the above-mentioned technical problem, the present invention proposes a kind of rail traffic dynamic reachable path
Generation method and system.
Referring to Fig. 1, a kind of generation method of the rail traffic dynamic reachable path provided for first embodiment of the invention
Flow diagram, this method includes：
Step 101 obtains urban mass transit network basic information and train schedule, generates Rail traffic network
Topology diagram and route map of train, obtain the basic information of passenger's input, which includes point of destination, inception point, meter
Mark hair moment and arrival time.
Wherein, urban mass transit network basic information includes：Information, the initialization such as station, transfer stop and first and last station obtain
The urban mass transit network basic information and train schedule taken generates urban mass transit network topological structure respectively
Figure and route map of train, each train operation of the urban track traffic can be obtained according to urban mass transit network topology diagram
The information such as route and transfer stop, route map of train is the diagram of the time and space relationship of train operation, according to route map of train
Can obtain arrival and frequency of the train at each station, train section run time and train AT STATION when stopping
Between etc..In addition, the basic information of passenger's input includes：Starting station, point of destination, plan are set out moment and arrival time.
Step 102 builds constraint prism, the constraint prism based on Rail traffic network topology diagram and route map of train
The space-time running orbit of middle record passenger.
Wherein, the two dimensional surface in rail network topological structure figure representation station geographical location, from rail network topology
Structure chart can obtain the geographical relationship of each track circuit, and time structure is added in the two dimensional surface of urban mass transit network topological structure
At three-dimensional system of coordinate, wherein the time of addition is train at the time of being moved on rail network.Wherein, which is to multiply
The motion track in urban mass transit network of visitor within a certain period of time.Passenger is recorded in the constraint prism to hand in city rail
Space-time running orbit in open network, increases time-constrain, is the fixed basis of generation pad of rail traffic dynamic reachable path.
Step 103 calls train operation track search (Train Trajectory Searching according to route map of train
Algorithm, TSA) algorithm, the range coverage for meeting first condition in the constraint prism is searched for, which is：Passenger
It is the plan moment constantly from starting station, terminus arrival time planned for passenger for the purpose of arrival time or terminus
It stands.
Specifically, arrival and frequency of the train at each station are obtained according to route map of train, train is in section
Run time, passenger set out the moment from starting station in plan, and in conjunction with route map of train, forward lookup passenger sets out in plan
Moment from the arrival region after starting station, the arrival region meet forward lookup terminus be passenger point of destination or
Passenger plan set out the moment after starting station the forward lookup moment earlier than the arrival time one of both that passenger plans,
It reaches region and is that passenger sets out the moment from the space-time track after starting station in plan, including the station that reaches of passenger and multiply
Time in objective moving process.
Step 104 according to route map of train and calls anti-TSA algorithms, and search meets second condition in the constraint prism
By region, which is：Passenger reaches point of destination in plan arrival time, and the setting out to be no earlier than constantly of inception point multiplies
Set out moment or the inception point of visitor's plan are passenger's starting station.
Specifically, arrival and frequency of the train at each station are obtained according to route map of train, train is in section
Run time, passenger reach point of destination in plan arrival time, and in conjunction with route map of train, reverse search passenger is when planning to reach
It is carved into up to by region, which is starting station or the passenger of passenger before point of destination
Passenger is no earlier than at the time of reverse search before planning arrival time arrival point of destination and plans moment one of both of setting out, pass through
The space-time track before arrival time arrival point of destination is planned in region for passenger, including the station of passenger's process and passenger are moved through
Time in journey.
It should be noted that in the constraint prism forward lookup and the running orbit of reverse search passenger, search considers
The moving direction of passenger is inconsistent.The former is from starting station forward lookup, and the latter retracts from point of destination.
Step 105 obtains the range coverage and the intersection by region, and the path in the intersection is that the dynamic of passenger is reachable
Path set.
Wherein, the range coverage of acquisition and the intersection by region are to obtain range coverage and by region when passenger
The intersection of dry running track, the intersection include the intersection of same paths and the superior objective run time of circuit.
From the analysis method of the rail traffic path accessibility of above-mentioned offer it is found that the analysis method is by obtaining city rail
Road transportation network basic information and train schedule generate Rail traffic network topology diagram and route map of train, then
Constraint prism is built in conjunction with network topology structure figure and route map of train, the when dry running rail of passenger is recorded in the constraint prism
Mark, according to passenger input information combination route map of train and TSA algorithms in constraint prism forward lookup in time-constrain
The region that passenger can reach, while also according to the information combination route map of train and anti-TSA algorithms of passenger's input in space-time rib
The reverse search region that passenger passes through in time-constrain, takes the intersection in two kinds of regions in column, which is two directions of search
The intersection of lower passenger's space-time running orbit, the problem of having fully considered time-constrain, and geographic paths are combined with the time, it obtains
The dynamic route reachable path collection of passenger realizes that the space-time dynamic in rail traffic path considers.
This method introduces space-time geography concept, is third dimension by two dimensional surface, time of station geographical location, indicates
Space-time running orbit of the passenger on Rail traffic network solves the dynamic trip route of passenger from constraint prism concept
Collection, structure have both the constraint prism of rail traffic " nature static " network physical and " dynamic " route map of train feature, use
With the trip region of visualization description passenger.
Further, include the step of the basic information of acquisition passenger input in step 101：Obtain setting out for passenger's input
The moment t that sets out that the stations the O that stands, point of destination D stand, plansWith arrival time te。
Specifically, obtain passenger input starting station, point of destination, plan the information such as moment and arrival time of setting out, wherein
The starting station of passenger's input is stood for O, and point of destination is stood for D, and it is t constantly that plan, which is set out,s, plan arrival time is te。
Further, as shown in Fig. 2, Fig. 2 is the flow diagram of the refinement step of step 103, the refinement step of step 103
Suddenly it specifically includes：
Step 201, consult route map of train, call TSA algorithms, in constraint prism from starting station be the stations the O moment
To plan the moment t that sets outsTracing point forward lookup.
Step 202, obtained from time-table circuit where the train all transfer stops arrival time, acquisition changes
The transfer time T for multiplying station, newly set out moment t.
The transfer stop is added in the track of range coverage by step 203, according to the train line and row where transfer stop
Vehicle service chart obtains new transfer stop, when t has arrived plan arrival time teOr passenger arrived the stations D, stop search.
Specifically, as shown in figure 3, Fig. 3 is the constraint prism generation reachable path schematic diagram under urban track traffic background,
The two dimensional surface of X-axis and Y-axis can indicate the two dimensional surface of city rail circuit in the constraint prism, and T axis indicates time shaft, this when
Had recorded in empty prism passenger urban mass transit network space-time running orbit, in Fig. 3, the point that is shown in constraint prism
For tracing point, which includes the location of passenger and time point, and the tracing point is corresponding in X-axis and Y-axis plane projection
Point only show stop location information, wherein upper left in Fig. 3 is that the figure of lower section mark (a) be that the stations O are set out possible arrival
Station schematic diagram, O points indicate passenger in moment tsFrom the stations O, as the upper left in Fig. 3 is lower section mark (a)
Shown in figure, all tracks of record are from O points, wherein passenger's arrival time and to get to the station be basis in the track
What route map of train and TSA algorithms obtained.
Wherein, TSA algorithms include：The mobile moment that passenger is arranged is t, and when t meets following condition, which sets out by bus
Moment is
Wherein, j indicates that train number, l indicate track circuit, and i indicates the station that train is stopped, when D indicates train departure
It carves,J trains are indicated on circuit l in the stations i frequency,Indicate that j-1 trains are when the stations i are dispatched a car on circuit l
It carves.
Specifically, as shown in figure 4, Fig. 4 is train operation graph search algorithm schematic diagram, horizontal axis indicates time, vertical pivot in Fig. 4
It indicates train line, 4 circuits is shown in figure, in the TSA algorithms, the time that passenger enters the stations i is t, and t moment is online
After the frequency of the stations i, passenger may be selected j-1 trains j trains before the frequency of the stations i and on circuit l on the l of road
Train number train sets out after taking into j trains or j, sets out when passenger takes into j trains, and next transfer stop of j trains can be the stations i',
The transfer time is T during this period, and newly set out moment t, and the moment t that newly sets out is：Wherein, A indicates train
Arrival time,Indicate the j trains of l circuits in the arrival time of transfer stop i', Tl,i'Indicate what passenger stood in the i' of l circuits
Transfer time records all tracks.
Wherein, when t meets t≤teOr passenger arrived the stations D, stop search, i.e., in Fig. 4, passenger has arrived t at the movement momente
Moment or passenger have arrived point of destination in moving process, stop at the record of track in constraint prism, range coverage record
Arrival time t of the passenger in planeTrack before or passenger are in moment tsIt is all before standing to point of destination D behind the stations O
Track,.
It should be noted that need in the method consider time-constrain, in constraint prism in recording track path number
Mesh has uncertainty.
It should be noted that Rail traffic network service chart can be indicated with following formula：
Wherein, the line set of urban track traffic is L={ 1,2 ..., l ..., N }, Sl,iIndicate the i vehicles on circuit l
It stands,For station Sl,iThe arrival time of upper train jAnd frequency
For the train path of train j.
Further, further include in the refinement step of step 103：T is not arrived when passenger moves moment teBefore moment, search
There are circuits or the train to reach the circuit terminus to path for rope, then terminates the search in the path in range coverage.
Specifically, be the stations O from starting station in constraint prism it is plan moment t constantlysTrack point forward
Passenger's moving process running orbit is searched in search, which includes passenger's operating path and time, is deposited when in the path
The circuit terminus is reached in circuit or train, the path in range coverage is terminated in next transfer stop in the path that stops search
Search.
Further, as shown in figure 5, Fig. 5 is the flow diagram of the refinement step of step 104, the refinement step of step 104
Suddenly it specifically includes：
Step 301 consults route map of train, calls anti-TSA algorithms, when being reached from terminus for the stations D in constraint prism
It carves as plan arrival time teTracing point reverse search.
Step 302, from time-table obtain train where circuit all transfer stops frequency, obtain transfer
The transfer time T to stand obtains new arrival time t.
The transfer stop is added in the track by region, the circuit where the transfer stop and row by step 303
Vehicle service chart obtains new transfer stop, sets out moment t when t retracts to plansOr passenger's starting station is stood for O, is stopped search.
Specifically, if the upper right portion in Fig. 3 is the upper right portion i.e. lower section mark in Fig. 3 shown in the figure of lower section mark (b)
(b) figure is the schematic diagram from the station that the stations D rollback may pass through, and D points indicate passenger in teMoment reaches the stations D, the institute of record
The terminal of tracing point is D points, wherein in the track passenger's arrival time and get to the station be according to route map of train and
What anti-TSA algorithms obtained.
Wherein, which includes：The mobile moment that passenger is arranged is t, and when t meets following condition, which rides
Arrival time is
Wherein, j indicates that train number, l indicate track circuit, and i' indicates the station that train is stopped, when A indicates that train reaches
It carves,J trains are indicated on circuit l in the stations i' arrival time,Indicate that j+1 trains are when the stations i' reach on circuit l
It carves.
Specifically, in the anti-TSA algorithms, the time that passenger reaches the stations i' is t, t moment j+1 trains on circuit l
J trains are after the arrival time of the stations i' before the arrival time of the stations i' and on circuit l, it is clear that passenger is to take j trains
Or train number train reaches the stations i' before j, when passenger, which takes j trains, to be reached, a upper transfer stop for j trains can be the stations i,
The stations the i transfer time is Tl,i, obtain passenger and reach the i station moment as t, t is the new arrival time of search, new arrival time t
For：Wherein, D indicates the train departure moment,Indicate frequency of the j trains in transfer stop i of l circuits,
Tl,iIt indicates the transfer time that passenger stands in the i of l circuits, to record all tracks.
Wherein, when t meets ts≤ t or passenger's starting station are stood for O, are stopped search, as passenger is in teMoment reaches D and stands it
Preceding track, in the track setting out for passenger be no earlier than plan constantly and set out moment tsOr passenger's initiating station is the stations O, this is searched
Rope is passenger in teMoment reaches the process of the track of reverse-direction derivation passenger under the premise of D stands, this return back to by regional record
Plan the moment t that sets outsThe track set out later or passenger are from the stations O in teMoment reaches the track at the stations D.
Further, the refinement step of step 104 further includes：Passenger moves moment t to tsAfter moment, road is searched
There are circuits for diameter, then terminate the search by the path in region.
Specifically, it is plan arrival time t D station arrival times to be from terminus in constraint prismeTracing point it is reversed
The running orbit of passenger's moving process is searched in search, which includes passenger's operating path and time, when in the path
There are circuits or train to reach the circuit terminus, and the roads range coverage Zhong Gai are terminated in next transfer stop in the path that stops search
The search of diameter.
Further, as shown in fig. 6, Fig. 6 is the flow diagram of the refinement step of step 105, the refinement step of step 105
Suddenly step 401 is specifically included to step 404：
Step 401 obtains passenger's space-time running orbit and by passenger's space-time running orbit in region in range coverage
Intersection, the track include path and time, obtain the path in the intersection；
Step 402 judges whether the path meets condition：The arrival time in region is reached earlier than process in same transfer stop
The setting out of region subtract constantly passenger the transfer stop transfer time；
If step 403 is unsatisfactory for above-mentioned condition, the path is rejected in intersection；
If step 404 meets above-mentioned condition, it is determined that the path is the dynamic reachable path of passenger.
Specifically, if the bottom left section in Fig. 3 is the figure of lower section mark (c), the bottom left section in Fig. 3 is lower section mark (c)
Figure is the schematic diagram to cross in path, obtains range coverage and the intersection by track in region, track, which is shown, in the intersection multiplies
From starting station to point of destination feasible path, which meets visitor：In same transfer stop, arrival time of range coverage earlier than
By region set out subtract constantly passenger the transfer stop transfer time.Wherein, if the lower right-most portion in Fig. 3 is lower section mark
(d) shown in figure, the lower right-most portion in Fig. 3 is that the figure of lower section mark (d) is the plan view in path, and the starting station of feasible path is O
It stands, point of destination is stood for D, and passenger can take train according to the route of the display in feasible path.
Further, this method further includes：One time threshold is set, and in the reachable path, passenger stands from starting station O
During standing to point of destination D, the time needed is more than the time threshold, then deletes the path.
The reachable path that this method obtains, it is contemplated that the routing information of time makes passenger reach purpose in planned time
Ground avoids last bus such as and is not connected, and passenger can not arrive at the awkward situation etc. at purpose station in initiating station.
Referring to Fig. 7, a kind of generation system of the rail traffic dynamic reachable path provided for second embodiment of the invention
Structural schematic diagram, which specifically includes：
It obtains information module 501, for obtaining urban mass transit network basic information and train schedule, generates
Rail traffic network topology diagram and route map of train obtain the basic information of passenger's input, which includes purpose
It stands, inception point, plan is set out moment and arrival time.
Wherein, urban mass transit network basic information includes：The information such as station, transfer stop and first and last station obtain information
The urban mass transit network basic information and train schedule that the initialization of module 501 obtains, generate city rail respectively
Transportation network topology diagram and route map of train can obtain the city rail according to urban mass transit network topology diagram
The information such as each train operation route of traffic and transfer stop, route map of train are the figures of the time and space relationship of train operation
Solution can obtain arrival and frequency of the train at each station according to route map of train, train section run time and
The dwell time etc. of train AT STATION.In addition, the basic information of passenger's input includes：Starting station, point of destination, plan set out the moment and
Arrival time.
Preparation module 502 builds constraint prism for being based on Rail traffic network topology diagram and route map of train, should
The space-time running orbit of passenger is recorded in constraint prism.
Wherein, the two dimensional surface in rail network topological structure figure representation station geographical location, from rail network topology
Structure chart can obtain the geographical relationship of each track circuit, and time structure is added in the two dimensional surface of urban mass transit network topological structure
At three-dimensional system of coordinate, wherein the time of addition is train at the time of being moved on rail network.Wherein, which is to multiply
The motion track in urban mass transit network of visitor within a certain period of time.Passenger is recorded in the constraint prism to hand in city rail
Space-time running orbit in open network, increases time-constrain, is the fixed basis of generation pad of rail traffic dynamic reachable path.
Forward lookup module 503, for according to route map of train and calling TSA algorithms, search meets in constraint prism
The range coverage of first condition, the first condition are：Passenger is constantly the plan moment from starting station, and terminus is mesh
Station or search process at the time of arrived passenger and planned arrival time.
Specifically, forward lookup module 503 obtains train in the arrival at each station and when dispatching a car according to route map of train
It carves, for train in the run time in section, passenger sets out the moment from starting station in plan, and in conjunction with route map of train, forward direction is searched
Rope passenger sets out the moment from the arrival region after starting station in plan, which meets the terminus of forward lookup
Set out what forward lookup moment after starting station at moment planned earlier than passenger in plan for the point of destination or passenger of passenger
Arrival time one of both reaches region and sets out the moment from the space-time track after starting station in plan for passenger, including
Time in station and passenger's moving process that passenger reaches.
Reverse search module 504, for according to route map of train and calling anti-TSA algorithms, search is full in constraint prism
Sufficient second condition by region, which is：Passenger reaches point of destination, when setting out of inception point in plan arrival time
It is passenger's starting station to carve and be no earlier than set out moment or the inception point of passenger's plan.
Specifically, reverse search module 504 obtains train in the arrival at each station and when dispatching a car according to route map of train
It carves, train is in the run time in section, and passenger reaches point of destination in plan arrival time, in conjunction with route map of train, reverse search
Passenger before plan arrival time reaches point of destination by region, which is to multiply
The starting station of visitor or passenger are no earlier than passenger's plan at the time of reverse search before planning arrival time arrival point of destination and set out
Moment one of both is the space-time track before passenger plans arrival time arrival point of destination, including passenger's process by region
Station and passenger's moving process in time.
It should be noted that in the constraint prism forward lookup and the running orbit of reverse search passenger, search considers
The moving direction of passenger is consistent.It is from starting station to point of destination.
Processing module 505, for obtaining range coverage and by the intersection in region, the path in the intersection is the dynamic of passenger
State reachable path collection.
Wherein, the range coverage and be to obtain range coverage and process by the intersection in region that processing module 505 obtains
The intersection of passenger's space-time running orbit in region, the intersection include the intersection of same paths and the superior objective run time of circuit.
From the generation system of the rail traffic dynamic reachable path of above-mentioned offer it is found that the acquisition information module of the system
501, by obtaining urban mass transit network basic information and train schedule, generate Rail traffic network topological structure
Figure and route map of train, preparation module 502 build constraint prism, the space-time in conjunction with network topology structure figure and route map of train
The space-time running orbit of passenger, the information combination route map of train that forward lookup module 503 is inputted according to passenger are recorded in prism
With TSA algorithms in constraint prism the forward lookup region that passenger can reach in time-constrain, reverse search module 504
Information combination route map of train and anti-TSA algorithms the reverse search passenger in time-constrain in constraint prism inputted according to passenger
The region of process, it is that passenger's space-time is run under two directions of search that the second acquisition module 505, which takes the intersection in two kinds of regions, the intersection,
The intersection of track.The problem of system has fully considered time-constrain, and geographic paths are combined with the time, obtain the dynamic of passenger
State reachable path collection realizes that the space-time dynamic in rail traffic path considers.
The system introduces space-time geography concept, is third dimension by two dimensional surface, time of station geographical location, indicates
Space-time running orbit of the passenger on Rail traffic network solves the dynamic trip route of passenger from constraint prism concept
Collection, structure have both the constraint prism of rail traffic " nature static " network physical and " dynamic " route map of train feature, use
With the trip region of visualization description passenger.
Further, as shown in figure 8, the refinement module for the acquisition information module that Fig. 8, which is second embodiment of the invention, to be provided
Structural schematic diagram, obtain information module 501 specifically include：
First acquisition module 601 is generated for obtaining urban mass transit network basic information and train schedule
Rail traffic network topology diagram and route map of train；
Second acquisition module 602, for obtaining the station starting station O of passenger's input, the stations point of destination D, plan are set out the moment
tsWith arrival time te。
Specifically, the first acquisition module 601 obtains urban mass transit network basic information and train schedule, raw
At Rail traffic network topology diagram and route map of train, so as to later use Rail traffic network topology diagram and train
Service chart.Meanwhile second obtain multiply module 602 obtain passenger input starting station, point of destination, plan set out the moment and reach when
The information such as quarter, wherein the starting station of passenger's input is that O stands, and point of destination is that D stands, and plan is set out constantly as ts, plan arrival time
For te。
Further, as shown in figure 9, Fig. 9 is the refinement module for the forward lookup module that second embodiment of the invention provides
Structural schematic diagram, forward lookup module 503 specifically includes：
Positive first search module 701 calls TSA algorithms, the follow in constraint prism for consulting route map of train
Stand be that the stations O set out is that plan is set out moment t constantlysTracing point forward lookup.
Positive second search module 702, all transfer stops for circuit where obtaining the train from time-table
Arrival time, obtain the transfer time T of transfer stop, newly set out moment t.
Forward lookup third module 703, for the transfer stop to be added in the track of range coverage, according to transfer stop institute
Train line and route map of train, obtain new transfer stop, when t arrived plan arrival time teOr passenger arrived the stations D,
It stops search.
Specifically, as shown in figure 3, Fig. 3 is the constraint prism generation reachable path schematic diagram under urban track traffic background,
The two dimensional surface of X-axis and Y-axis can indicate that the two dimensional surface of city rail circuit, T axis indicate time, the space-time in the constraint prism
Passenger is had recorded in prism in the space-time running orbit of urban mass transit network, in Fig. 3, the point shown in constraint prism is
Tracing point, the tracing point include the location of passenger and time point, and the tracing point is corresponding in X-axis and Y-axis plane projection
Point only shows stop location information, wherein if the upper left in Fig. 3 is institute's rail of record shown in the figure of lower section mark (a)
Mark is from O points, wherein passenger's arrival time and to get to the station be positive first search module, 701 basis in the track
What route map of train and TSA algorithms obtained.
Wherein, TSA algorithms include：The mobile moment that passenger is arranged is t, and when t meets following condition, which sets out by bus
Moment is
Wherein, j indicates that train number, l indicate track circuit, and i indicates the station that train is stopped, when D indicates train departure
It carves,J trains are indicated on circuit l in the stations i frequency,Indicate that j-1 trains are when the stations i are dispatched a car on circuit l
It carves.
Specifically, as shown in figure 4, Fig. 4 is train operation graph search algorithm schematic diagram, horizontal axis indicates time, vertical pivot in Fig. 4
It indicates train line, 4 circuits is shown in figure, in the TSA algorithms, the time that passenger enters the stations i is t, and t moment is online
After the frequency of the stations i, passenger may be selected j-1 trains j trains before the frequency of the stations i and on circuit l on the l of road
Train number train sets out after taking into j trains or j, sets out when passenger takes into j trains, and next transfer stop of j trains can be the stations i',
The transfer time is T during this period.Wherein, positive second search module 702 obtains circuit where the j trains from time-table
All transfer stops arrival time, obtain the transfer time T of transfer stop, the moment t that newly set out newly is set out moment t,
The new moment t that sets out is：Wherein, A indicates train arrival time,Indicate the j trains of l circuits in transfer stop
The arrival time of i', Tl,i'It indicates the transfer time that passenger stands in the i' of l circuits, to record all tracks.
Wherein, which is added in the track of range coverage by forward lookup third module 703, according to transfer stop institute
Train line and route map of train, new transfer stop is obtained, when t meets t≤teOr passenger arrived the stations D, stop search,
I.e. in Fig. 4, passenger has arrived t at the movement momenteMoment or passenger have arrived point of destination in moving process, stop at space-time rib
The record of track in column, arrival time t of the range coverage record passenger in planeTrack before or passenger are in moment tsFrom O
Station set out after to point of destination D stand before all tracks.
It should be noted that need to consider time-constrain within the system, the path of the track recorded in constraint prism
Number has uncertainty.
Further, the specific module of forward lookup module further includes：Forward lookup condition module, when for passenger's movement
T is carved to tsAfter moment, path is searched there are when circuit, terminates the search by the path in region.
Specifically, be the stations O from starting station in constraint prism it is plan moment t constantlysTrack point forward
Passenger's moving process running orbit is searched in search, which includes passenger's operating path and time, is deposited when in the path
The circuit terminus is reached in circuit or train, and forward lookup condition module stops search next transfer stop in the path, terminates
The search in the path in range coverage.
Further, as shown in Figure 10, Figure 10 is the refinement mould for the reverse search module that second embodiment of the invention provides
The refinement module of the structural schematic diagram of block, reverse search module 503 specifically includes：
The first module of reverse search 801 calls anti-TSA algorithms, from end in constraint prism for consulting route map of train
It is to plan arrival time t that point station, which is D station arrival times,eTracing point reverse search.
The second module of reverse search 802, for all transfer stops of circuit where the acquisition train from time-table
Frequency obtains the transfer time T of transfer stop, obtains new arrival time t.
Reverse search third module 803, for the transfer stop to be added in the track by region, according to the transfer
Circuit and route map of train where standing, obtain new transfer stop, set out moment t when t retracts to plansOr passenger's starting station is
O stands, and stops search.
Specifically, if the upper right portion in Fig. 3 is the upper right portion i.e. lower section mark in Fig. 3 shown in the figure of lower section mark (b)
(b) figure is the schematic diagram from the station that the stations D rollback may pass through, and D points indicate passenger in teMoment reaches the stations D, the institute of record
The terminal of tracing point is D points, wherein passenger's arrival time and to get to the station be the first module of reverse search in the track
801 obtain according to route map of train and anti-TSA algorithms.
Wherein, which includes：The mobile moment that passenger is arranged is t, and when t meets following condition, which rides
Arrival time is
Wherein, j indicates that train number, l indicate track circuit, and i' indicates the station that train is stopped, when A indicates that train reaches
It carves,J trains are indicated on circuit l in the stations i' arrival time,Indicate that j+1 trains are when the stations i' reach on circuit l
It carves.
Specifically, in the anti-TSA algorithms, the time that passenger reaches the stations i' is t, t moment j+1 trains on circuit l
J trains are after the arrival time of the stations i' before the arrival time of the stations i' and on circuit l, it is clear that passenger is to take j trains
Or train number train reaches the stations i' before j, when passenger, which takes j trains, to be reached, a upper transfer stop for j trains can be the stations i,
The stations the i transfer time is Tl,i, wherein circuit where the second module of reverse search 802 obtains j trains from time-table
The frequency of all transfer stops obtains the transfer time T of transfer stop, obtains new arrival time t, and passenger reaches the i station moment
For the new arrival time that t, t are search, new arrival time t is：Wherein, D indicates the train departure moment,
Indicate the j trains of l circuits in the frequency of transfer stop i, Tl,iIt indicates the transfer time that passenger stands in the i of l circuits, to record institute
There is track.
Wherein, which is added in the track by region by reverse search third module 803, according to the transfer
Circuit and route map of train where standing, obtain new transfer stop, when t meets ts≤ t or passenger's starting station are stood for O, stop searching
Rope, i.e., in passenger in teMoment reaches the track before the stations D, and passenger sets out when being no earlier than plan constantly and setting out in the track
Carve tsOr passenger's initiating station is the stations O, which is passenger in teMoment reaches the rail of reverse-direction derivation passenger under the premise of the stations D
The process of mark, this return back to by regional record and sets out moment t in plansThe track set out later or passenger are from the stations O in te
Moment reaches the track at the stations D.
Further, 504 specific module of reverse search module further includes：Reverse search condition module, for being moved in passenger
Dynamic moment t is to tsAfter moment, path is searched there are when circuit, terminates the search by the path in region.
Specifically, it is plan arrival time t D station arrival times to be from terminus in constraint prismeTracing point it is reversed
The running orbit of passenger's moving process is searched in search, which includes passenger's operating path and time, when in the path
The circuit terminus is reached there are circuit or train, and reverse search condition module stops search next transfer stop in the path, knot
The search in the path in beam range coverage.
Further, as shown in figure 11, Figure 11 is the refinement module for the processing module 505 that second embodiment of the invention provides
Structural schematic diagram, the refinement module of processing module 505 specifically includes：
Intersection module 901 is obtained, for obtaining in range coverage passenger's space-time running orbit and by region when passenger
The intersection of dry running track, the track include path and time, obtain the path in the intersection.
Judgment module 902, for judging whether the path meets condition：The arrival time in region is reached in same transfer stop
Earlier than by region set out subtract constantly passenger the transfer stop transfer time.
Module 903 is rejected, in the case where being unsatisfactory for above-mentioned condition, the path to be rejected in intersection；
Determining module 904, in the case where meeting above-mentioned condition, it is determined that the path is the dynamic reachable path of passenger.
Specifically, if the bottom left section in Fig. 3 is the figure of lower section mark (c), the bottom left section in Fig. 3 is lower section mark (c)
Figure is the schematic diagram to cross in path, obtains intersection module 901 and obtains range coverage and the intersection by track in region, the friendship
Track is concentrated to show passenger from starting station to point of destination feasible path, which meets：In same transfer stop, range coverage
Arrival time earlier than by region set out subtract constantly passenger the transfer stop transfer time.
Wherein, as shown in the i.e. figure of lower section mark (d) of the lower right-most portion in Fig. 3, the lower right-most portion in Fig. 3 is lower section mark (d)
Figure be path plan view, the starting station of feasible path is the stations O, and point of destination is that D stands, and passenger can be according to showing in feasible path
The route shown takes train.
Further, which further includes：Subsequent processing module, for a time threshold to be arranged, when the reachable path
In, passenger is stood from starting station O during the stations point of destination D, and the time needed is more than the time threshold, then deletes the path.
The reachable path that the system obtains, it is contemplated that the routing information of time makes passenger reach purpose in planned time
Ground avoids last bus such as and is not connected, and passenger can not arrive at the awkward situation etc. at purpose station in initiating station.
Be above to a kind of description of the generation method and system of rail traffic dynamic reachable path provided by the present invention,
For those skilled in the art, the thought of embodiment, has in specific embodiments and applications according to the present invention
Change place, to sum up, the content of the present specification should not be construed as limiting the invention.
Claims (10)
1. a kind of generation method of rail traffic dynamic reachable path, which is characterized in that the method includes：
Obtain urban mass transit network basic information and train schedule, generate Rail traffic network topology diagram and
Route map of train obtains the basic information of passenger's input, and the basic information includes point of destination, inception point, and plan is set out the moment
And arrival time；
Constraint prism is built based on the Rail traffic network topology diagram and the route map of train, in the constraint prism
Record the space-time running orbit of the passenger；
Train operation track search TSA algorithms, search is called to meet the in the constraint prism according to the route map of train
The range coverage of one condition, the first condition are：Passenger is constantly the plan moment from starting station, and terminus is mesh
Station or search process at the time of arrived passenger and planned arrival time；
According to the route map of train and anti-TSA algorithms are called, search meets the process of second condition in the constraint prism
Region, the second condition are：Passenger reaches point of destination in plan arrival time, and setting out for inception point is no earlier than passenger's meter constantly
Set out moment or the inception point drawn are passenger's starting station；
The range coverage and the intersection by region are obtained, the path in the intersection is the dynamic reachable path of passenger
Collection.
2. according to the method described in claim 1, it is characterized in that, it is described obtain passenger input basic information the step of wrap
It includes：
Obtain the stations starting station O of passenger's input, point of destination D stands, the moment t that sets out of plansWith arrival time te。
3. according to the method described in claim 2, it is characterized in that, described according to the route map of train and call train operation
Track search TSA algorithms, search meet the range coverage of first condition in the constraint prism, and the first condition is：Multiply
Visitor is constantly the plan moment from starting station, stands for the purpose of terminus or search process at the time of has arrived passenger and planned to arrive
It is specifically included up to the step of moment：
Route map of train is consulted, TSA algorithms are called, from starting station is the stations O constantly to be planned out in the constraint prism
Send out moment tsTracing point forward lookup, the TSA algorithms include：The mobile moment that passenger is arranged is t, when t meets following item
Part, the passenger sets out by bus is constantly
Wherein, j indicates that train number, l indicate that track circuit, i indicate that the station that train is stopped, D indicate the train departure moment,J trains are indicated on circuit l in the stations i frequency,Indicate that j-1 trains are in the stations i frequency on circuit l；
The arrival time of all transfer stops of circuit, obtains the transfer where obtaining the train from the time-table
The transfer time T to stand, newly set out moment t, and the new moment t that sets out is：Wherein, A indicates that train arrives
Up to the moment,Indicate the j trains of l circuits in the arrival time of transfer stop i', Tl,i'Indicate that passenger changes what the i' of l circuits stood
Between taking the opportunity；
The transfer stop is added in the track of the range coverage, the circuit where the transfer stop and train operation
Figure, obtains new transfer stop, when t has arrived plan arrival time teOr passenger arrived the stations D, stop search.
4. according to the method described in claim 2, it is characterized in that, described according to the route map of train and call anti-TSA to calculate
Method, search meet in the constraint prism second condition by region, the second condition is：Passenger is when planning to reach
It is carved into and reaches point of destination, the setting out of inception point is no earlier than set out moment or the step that inception point is passenger's starting station of passenger's plan constantly
Suddenly it specifically includes：
Consult route map of train, call anti-TSA algorithms, in the constraint prism from terminus be D station arrival time be plan
Arrival time teTracing point reverse search, the anti-TSA algorithms include：The mobile moment that passenger is arranged is t, when under t satisfactions
Row condition, the passenger are at arrival time of riding
Wherein, j indicates that train number, l indicate that track circuit, i' indicate that the station that train is stopped, A indicate train arrival time,J trains are indicated on circuit l in the stations i' arrival time,Indicate that j+1 trains are in the stations i' arrival time on circuit l；
The frequency of all transfer stops of circuit, obtains the transfer where obtaining the train from the time-table
The transfer time T to stand, obtains new arrival time t, and the new arrival time t is：Wherein, D indicates train hair
The vehicle moment,Indicate the j trains of l circuits in the frequency of transfer stop i', Tl,i'Indicate passenger at the stations i' of l circuits
Transfer time；
The transfer stop is added in the track by region, the circuit where the transfer stop and train operation
Figure, obtains new transfer stop, sets out moment t when t retracts to plansOr passenger's starting station is stood for O, is stopped search.
5. according to the method described in claim 3, it is characterized in that, the method further includes：
The passenger moves moment t and does not arrive teBefore moment, searching path, there are circuits or train to reach the circuit terminal
It stands, then terminates the search in path described in the range coverage.
6. according to the method described in claim 4, it is characterized in that, the method further includes：
The passenger moves moment t in tsAfter moment, searching path, there are circuits, then terminate described by described in region
The search in path.
7. according to the method described in claim 2, it is characterized in that, described obtain the range coverage and described by region
Intersection, in the intersection path be passenger dynamic reachable path collection the step of include：
Obtain passenger's space-time running orbit and the space-time running orbit by passenger described in region in the range coverage
Intersection, the track includes time and path, obtains path in the intersection；
Judge whether the path meets condition：The arrival time in region is reached described in same transfer stop earlier than the process
The setting out of region subtract constantly passenger the transfer stop transfer time；
If being unsatisfactory for the condition, the path is rejected；
If meeting the condition, it is determined that the path is the dynamic reachable path of passenger.
8. in the method according to claim 11, which is characterized in that the method further includes：One time threshold is set, when
In the reachable path, passenger is stood from starting station O during the stations point of destination D, and the time needed is more than the time threshold,
Then delete the path.
9. a kind of generation system of rail traffic dynamic reachable path, which is characterized in that the system comprises：
Information module is obtained, for obtaining urban mass transit network basic information and train schedule, track is generated and hands over
Open network topology diagram and route map of train, obtain the basic information of passenger's input, and the basic information includes point of destination, rises
Point station, plan are set out moment and arrival time；
Preparation module, for building constraint prism based on the Rail traffic network topology diagram and the route map of train,
The space-time running orbit of the passenger is recorded in the constraint prism；
Forward lookup module is searched for for calling train operation track search TSA algorithms according to the route map of train described
Meet the range coverage of first condition in constraint prism, the first condition is：Passenger is to be planned out constantly from starting station
The moment is sent out, stands for the purpose of terminus or search process at the time of arrive passenger's plan arrival time；
Reverse search module, for according to the route map of train and calling anti-TSA algorithms, search is full in the constraint prism
Sufficient second condition by region, the second condition is：Passenger reaches point of destination in plan arrival time, and inception point is set out
Set out moment or the inception point that moment is no earlier than passenger's plan are passenger's starting station；
Processing module, for obtaining the range coverage and the intersection by region, the path in the intersection is passenger
Dynamic reachable path collection.
10. system according to claim 9, which is characterized in that the processing module specifically includes：
First acquisition module generates track and hands over for obtaining urban mass transit network basic information and train schedule
Open network topology diagram and route map of train；
Second acquisition multiplies module, and for obtaining the stations starting station O of passenger's input, point of destination D stands, the moment t that sets out of plansWith to
Up to moment te。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810300419.7A CN108764516A (en) | 2018-04-04 | 2018-04-04 | A kind of generation method and system of rail traffic dynamic reachable path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810300419.7A CN108764516A (en) | 2018-04-04 | 2018-04-04 | A kind of generation method and system of rail traffic dynamic reachable path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108764516A true CN108764516A (en) | 2018-11-06 |
Family
ID=63980882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810300419.7A Pending CN108764516A (en) | 2018-04-04 | 2018-04-04 | A kind of generation method and system of rail traffic dynamic reachable path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108764516A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112268563A (en) * | 2020-10-23 | 2021-01-26 | 重庆越致科技有限公司 | Method and device for detecting traffic state and track of pedestrian on track |
| CN114724375A (en) * | 2022-05-05 | 2022-07-08 | 厦门理工学院 | Reverse passenger identification system based on Internet of things |
| CN115169764A (en) * | 2022-09-08 | 2022-10-11 | 深圳市城市交通规划设计研究中心股份有限公司 | Reachability calculation method, electronic device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002169915A (en) * | 2000-11-30 | 2002-06-14 | Toshiba Corp | Guiding system for changing train and its guiding method |
| JP2002308099A (en) * | 2001-04-09 | 2002-10-23 | Kyosan Electric Mfg Co Ltd | Train information providing device and train information providing method |
| CN102169512A (en) * | 2010-02-26 | 2011-08-31 | 同济大学 | Urban mass transit network dynamic accessibility computing method based on time window constraints |
| CN103020435A (en) * | 2012-12-03 | 2013-04-03 | 高新现代智能系统股份有限公司 | Rail transit trip path estimation method and system |
| CN106779190A (en) * | 2016-12-02 | 2017-05-31 | 东南大学 | A kind of urban track traffic passenger trip route suggesting method and system |
| CN107562798A (en) * | 2017-08-02 | 2018-01-09 | 北京大学（天津滨海）新代信息技术研究院 | A kind of real-time information recommendation method of the time geodata based on user |
-
2018
- 2018-04-04 CN CN201810300419.7A patent/CN108764516A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002169915A (en) * | 2000-11-30 | 2002-06-14 | Toshiba Corp | Guiding system for changing train and its guiding method |
| JP2002308099A (en) * | 2001-04-09 | 2002-10-23 | Kyosan Electric Mfg Co Ltd | Train information providing device and train information providing method |
| CN102169512A (en) * | 2010-02-26 | 2011-08-31 | 同济大学 | Urban mass transit network dynamic accessibility computing method based on time window constraints |
| CN103020435A (en) * | 2012-12-03 | 2013-04-03 | 高新现代智能系统股份有限公司 | Rail transit trip path estimation method and system |
| CN106779190A (en) * | 2016-12-02 | 2017-05-31 | 东南大学 | A kind of urban track traffic passenger trip route suggesting method and system |
| CN107562798A (en) * | 2017-08-02 | 2018-01-09 | 北京大学（天津滨海）新代信息技术研究院 | A kind of real-time information recommendation method of the time geodata based on user |
Non-Patent Citations (1)
| Title |
|---|
| 徐瑞华等: "考虑时空约束的地铁乘客出行路径集生成算法", 《同济大学学报（自然科学版）》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112268563A (en) * | 2020-10-23 | 2021-01-26 | 重庆越致科技有限公司 | Method and device for detecting traffic state and track of pedestrian on track |
| CN112268563B (en) * | 2020-10-23 | 2022-03-04 | 重庆越致科技有限公司 | Method and device for detecting traffic state and track of pedestrian on track |
| CN114724375A (en) * | 2022-05-05 | 2022-07-08 | 厦门理工学院 | Reverse passenger identification system based on Internet of things |
| CN114724375B (en) * | 2022-05-05 | 2023-03-14 | 厦门理工学院 | Reverse passenger identification system based on Internet of things |
| CN115169764A (en) * | 2022-09-08 | 2022-10-11 | 深圳市城市交通规划设计研究中心股份有限公司 | Reachability calculation method, electronic device and storage medium |
| CN115169764B (en) * | 2022-09-08 | 2023-01-31 | 深圳市城市交通规划设计研究中心股份有限公司 | Reachability calculation method, electronic device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109376952B (en) | Crowdsourcing logistics distribution path planning method and system based on track big data | |
| CN110070218B (en) | Dynamic service network optimization design method for multi-standard regional rail transit | |
| CN103985247B (en) | Taxi Transport capacity dispatching system based on city chauffeur demand distribution density | |
| CN107036617A (en) | The traffic path method and system for planning that a kind of taxi is combined with subway | |
| CN109859459A (en) | A kind of automatic Pilot bus dispatching optimization method | |
| CN108764516A (en) | A kind of generation method and system of rail traffic dynamic reachable path | |
| CN108681796B (en) | Urban outside road passenger transport hub site selection method based on POI data and Dijkstra algorithm | |
| CN108320501A (en) | Public bus network recognition methods based on user mobile phone signaling | |
| CN104156826B (en) | A kind of dynamic charge path planning service system of center service formula electric automobile | |
| CN107958302A (en) | Empirical path planing method based on virtual topology transportation network | |
| CN109543882B (en) | Bus network density calculation method based on optimal bus average station spacing | |
| CN106530695B (en) | Arterial street vehicle travel time real-time predicting method based on car networking | |
| CN108592928B (en) | Construction method and device for double-layer path of vehicle-mounted unmanned aerial vehicle | |
| CN106203725A (en) | Door-to-door trip route scheme personalized recommendation method based on heuristic search | |
| CN105973252A (en) | Method for route planning and terminal | |
| CN112131437B (en) | Multi-mode traffic network construction method and device based on graph database | |
| CN110414795B (en) | Newly-increased high-speed rail junction accessibility influence method based on improved two-step mobile search method | |
| CN107085620A (en) | A kind of taxi and subway are plugged into the querying method and system of travel route | |
| CN107403550A (en) | Transit network collecting method, device and terminal device | |
| CN110414113A (en) | The method for automatically generating rail yard plane general arrangement | |
| CN111098897A (en) | Train operation route selection method for railway junction station | |
| CN106971578B (en) | Time of vehicle operation real-time estimation system based on vehicular ad hoc network | |
| JPWO2015107856A1 (en) | Route search device | |
| CN106096828A (en) | Start determining method of path based on the overline train of non-linear coefficient | |
| Merchant et al. | Towards a European hyperloop network: An alternative to air and rail passenger travel |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181106 |