CN110322058A - A kind of rail traffic trip mode shortest time path calculation method considering walking linking - Google Patents
A kind of rail traffic trip mode shortest time path calculation method considering walking linking Download PDFInfo
- Publication number
- CN110322058A CN110322058A CN201910540990.0A CN201910540990A CN110322058A CN 110322058 A CN110322058 A CN 110322058A CN 201910540990 A CN201910540990 A CN 201910540990A CN 110322058 A CN110322058 A CN 110322058A
- Authority
- CN
- China
- Prior art keywords
- walking
- rail traffic
- trip
- point
- 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.)
- Granted
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 9
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 12
- 238000000034 method Methods 0.000 claims description 20
- 238000012216 screening Methods 0.000 claims description 18
- 238000010276 construction Methods 0.000 abstract description 2
- 238000004088 simulation Methods 0.000 abstract description 2
- 230000006872 improvement Effects 0.000 description 8
- 238000011161 development Methods 0.000 description 3
- 230000002146 bilateral effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 210000001367 artery Anatomy 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000008569 process 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"
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The present invention provides a kind of rail traffic trip mode shortest time path calculation methods of consideration walking linking, belong to transportation network distribution field, comprising the following steps: (1) obtain cell centroid point, the rail traffic website, the impedance of road network walking time, road network rail traffic time impedance data for specifying survey region in city；(2) using dijkstra's algorithm calculate each cell centroid point to each rail traffic website walking time shortest path；(3) the rail traffic website within the scope of each reasonable walking of cell centroid point is screened；(4) shortest time path between each rail traffic website is calculated using dijkstra's algorithm；(5) the rail traffic trip mode shortest time path that walking linking is considered between each cell centroid point is calculated.Step of the present invention is concise, as a result accurately, is of great significance to the prediction of Urban Transportation Architecture simulation middle orbit traffic trip share rate, provides strong technical support for the construction of city virtual traffic system test platform.
Description
Technical field
The present invention relates to transportation networks to distribute field, more particularly to a kind of rail traffic trip side of consideration walking linking
Formula shortest time path calculation method.
Background technique
Traffic is the artery of urban economy development, all with the high speed development of economic society and the quickening of urbanization process
Such as traffic congestion urban transport problems is on the rise.It, should be in order to fundamentally alleviate the various problems in urban transportation
Planning stage just formulates reasonable programme.
During construction of high-tech traffic system and operation, carrying out rational prediction to each travel mode split rate is road network
The basis of network traffic assignation, and be to examine roading network by the resulting section of traffic assignation, Intersection Traffic Volume data
Whether reasonably one of main foundation.
Conventional rails travel modal shortest time path is mainly calculated based on classical dijkstra's algorithm,
But the rail traffic trip share rate for having ignored cell centroid point to the walking linking stages between rail traffic website, therefore predicting
Not accurate enough, the invention proposes a kind of rail traffic trip mode shortest time path calculating sides of consideration walking linking thus
Method.
Summary of the invention
In order to solve problem above, it is most short to provide a kind of rail traffic trip mode time that consideration walking is connected by the present invention
Road calculation method, the purpose of the present invention is on the basis of dijkstra's algorithm, consider cell centroid point to rail traffic website
Between walking linking stages, calculate rail traffic trip mode shortest time path.Method provided by the invention, to urban transportation
The prediction of transportation system emulation middle orbit traffic trip share rate is of great significance,
For this purpose, the present invention provides a kind of rail traffic trip mode shortest time path calculating side of consideration walking linking
Method, the specific steps are as follows:
(1) cell centroid point, rail traffic website, the impedance of road network walking time, the road network rail for specifying survey region in city are obtained
Road traffic time impedance data；
(2) using dijkstra's algorithm calculate each cell centroid point to each rail traffic website walking time shortest path；
(3) the rail traffic website within the scope of each reasonable walking of cell centroid point is screened；
(4) shortest time path between each rail traffic website is calculated using dijkstra's algorithm；
(5) when calculating the rail traffic trip mode for considering walking linking between each cell centroid point using method provided herein
Between shortest path, the specific steps are that:
(5.1) point or trip attraction point occur for screening trip OD pairs of rail-free traffic website within the scope of reasonable walking, determine
It considers the rail traffic trip mode shortest time path of walking linking；
(5.2) OD of point and trip attraction point only one equal rail traffic website within the scope of reasonable walking occurs for screening trip
It is right, determine that it considers the rail traffic trip mode shortest time path of walking linking；
(5.3) point or trip attraction point occur for screening trip has two or more rail traffic websites within the scope of reasonable walking
OD pairs, determine its consider walking linking rail traffic trip mode shortest time path.
As a further improvement of the present invention, in the step (1), cell centroid point data, rail traffic station data,
Road network walking time impedance data and road network rail traffic time impedance data should be or can be converted into structural data and deposited
Storage.Wherein, cell centroid point data and rail traffic station data should include the coordinate or volume that can uniquely determine the position
Number.
As a further improvement of the present invention, the step (3) includes the following steps:
(3.1) the reasonable walking range of cell centroid point is determined；
(3.2) reasonable walking speed is determined；
(3.3) critical walking time impedance is calculated according to the reasonable walking range radius of cell centroid point and reasonable walking speed；
(3.4) screening cell centroid point is lower than critical walking time impedance into the shortest path time impedance between rail traffic website
Rail traffic website；
(3.5) step (3.4) are repeated, until obtaining all rail traffic websites within the scope of each reasonable walking of cell centroid point.
As a further improvement of the present invention, in the step (5.1), if point or trip attraction point occur for trip reasonable
Rail-free traffic website within the scope of walking, then it is assumed that the trip between the OD will not select rail traffic trip mode, consider step
The rail traffic trip mode shortest time path impedance of row linking is infinity.
As a further improvement of the present invention, the step (5.2) includes the following steps:
Point and trip attraction point only one equal rail traffic website within the scope of reasonable walking occur for (5.2.1) screening trip
OD pairs；
(5.2.2) screens trip in (5.2.1) and point and rail traffic website of the trip attraction point within the scope of reasonable walking occurs
Identical OD pairs, determine that it considers the rail traffic trip mode shortest time path of walking linking；
(5.2.3), which screens trip generation point and trip attraction point in (5.2.1), within the scope of reasonable walking there are different tracks to hand over
OD pairs of logical website determines that it considers the rail traffic trip mode shortest time path of walking linking.
As a further improvement of the present invention, the step (5.3) includes the following steps:
Point or trip attraction point occur for (5.3.1) screening trip has two or more rail traffic stations within the scope of reasonable walking
OD pairs of point；
(5.3.2) determines the time impedance for considering all possible paths of rail traffic trip mode of walking linking；
It is to consider that the track of walking linking is handed over that (5.3.3), which chooses the corresponding path of minimum value in all possible path time impedances,
Pass-out line mode shortest time path.
As a further improvement of the present invention, in the step (5.2.2), if point occurs for trip and trip attraction point is closing
The rail traffic website managed within the scope of walking is identical, then it is assumed that and the trip between the OD will not select rail traffic trip mode,
The rail traffic trip mode shortest time path impedance for considering walking linking is infinity.
As a further improvement of the present invention, in the step (5.2.3), consider the rail traffic trip side of walking linking
When the time impedance of formula shortest time path is that the walking time shortest path of each cell centroid point to each rail traffic website is corresponding
Between the sum of the corresponding time impedance of shortest time path between impedance and each rail traffic website.
As a further improvement of the present invention, in the step (5.3.2), consider the rail traffic trip side of walking linking
The time impedance in each path of formula is that the walking time shortest path of cell centroid point to the corresponding rail traffic website in the path is corresponding
The corresponding rail traffic website of time impedance and the path between the sum of the corresponding time impedance of shortest time path.If trip hair
The rail traffic website that raw point or trip attraction point include within the scope of reasonable walking is identical, then it is assumed that the corresponding track in the path
Shortest path time impedance between traffic website is infinity.
The utility model has the advantages that
(1) under the background for nowadays building intelligent transportation emulation platform energetically, this method big, structure using emulation platform data volume
Change strong feature to improve the shortest time path calculation method of rail traffic trip mode, complies with wisdom traffic development
The tendency of the day.
(2) consider that cell centroid point to the walking bridging mode between rail traffic website, makes rail traffic trip mode
Shortest time path calculating is more reasonable, and share rate prediction is more accurate.
Detailed description of the invention
Fig. 1 is the overview flow chart of the method for the present invention.
Specific embodiment
Present invention is further described in detail with specific embodiment with reference to the accompanying drawing:
The present invention provides a kind of rail traffic trip mode shortest time path calculation method of consideration walking linking, mesh of the invention
Be on the basis of dijkstra's algorithm, consider cell centroid point arrive the walking linking stages between rail traffic website, calculating
The shortest time path of rail traffic trip mode.Method provided by the invention hands over Urban Transportation Architecture simulation middle orbit
The prediction of pass-out row share rate is of great significance.
Those skilled in the art can understand that unless otherwise defined, all terms used herein (including skill
Art term and scientific term) there is meaning identical with the general understanding of those of ordinary skill in fields of the present invention.Also
It should be understood that those terms such as defined in the general dictionary should be understood that have in the context of the prior art
The consistent meaning of meaning will not be explained in an idealized or overly formal meaning and unless defined as here.
As one embodiment, it is known that regional traffic cell information (table 1) is specified in city, region inner orbit traffic website
Information (table 2), required transportation network time impedance information (table 3,4) are calculated using method provided by the invention and consider that walking is held in the mouth
The shortest time path of the rail traffic trip mode connect.
1 traffic zone information table of table
| Cell number | Centroid point | Contained node |
| 1 | 7 | 1 2 3 6 7 8 |
| 2 | 9 | 4 5 9 10 |
| 3 | 12 | 11 12 13 16 17 18 |
| 4 | 14 | 14 15 19 20 |
2 traffic zone information table of table
| Rail traffic website number | Place node |
| 1 | 1 |
| 2 | 2 |
| 3 | 5 |
| 4 | 13 |
| 5 | 15 |
3 road network walking time of table impedance data table
4 road network rail traffic time impedance tables of data of table
| Rail traffic website point is to (p, s) | Rail traffic time impedance |
| (1, 15) | 280 |
| (2, 5) | 180 |
| (2, 13) | 160 |
| (5, 15) | 120 |
| (13, 15) | 220 |
As shown in Figure 1, the shortest time path method of the rail traffic trip mode with consideration walking linking proposed by the present invention,
The rail traffic trip mode shortest time path in the region is calculated, is included the following steps:
(1) cell centroid point, rail traffic website, the impedance of road network walking time, the road network rail for specifying survey region in city are obtained
Road traffic time impedance data；
As shown above, cell centroid point data, rail traffic station data, road network walking time impedance data and road network track
Traffic time impedance data can be converted into structural data and be stored.Wherein, cell centroid point data and rail traffic website
Data include that can uniquely determine the number data of the position.It in this embodiment, is concise expression, building transportation network is
Non-directed graph, point pair between bilateral impedance be same value.In practical application, oriented transportation network figure can be constructed, between indicating a little pair
The different situation of bilateral impedance.In this embodiment, time impedance data unit is the second (s), and impedance uses the form of tables of data
It is expressed, unlisted point is to thinking indirectly adjacent intercommunication.When the calculation method is applied to actual traffic network, can adopt
Impedance is expressed with weight matrix form.
(2) using dijkstra's algorithm calculate each cell centroid point to each rail traffic website walking time shortest path；
In the present embodiment, using the walking time of each cell centroid point of dijkstra's algorithm calculating to each rail traffic website
Shortest path the results are shown in Table 5.
5 cell centroid point of table-rail traffic website walking time shortest path impedance
(3) the rail traffic website within the scope of each reasonable walking of cell centroid point is screened, is included the following steps:
(3.1) the reasonable walking range of cell centroid point is determined；
In the present embodiment, reasonable walking range is determined within 3000 meters of (m) radiuses centered on cell centroid point.
(3.2) reasonable walking speed is determined；
In the present embodiment, reasonable walking speed is determined as 1.2 meter per seconds (m/s).
(3.3) critical walking time resistance is calculated according to the reasonable walking range radius of cell centroid point and reasonable walking speed
It is anti-；
In the present embodiment, critical walking time impedance is 3000(meters)/1.2(meter per second)=2500.
(3.4) screening cell centroid point is lower than the critical walking time into the shortest path time impedance between rail traffic website
The rail traffic website of impedance；
(3.5) step (3.4) are repeated, until obtaining all rail traffic websites within the scope of each reasonable walking of cell centroid point.
In the present embodiment, each cell centroid point is lower than critical walking into the shortest path time impedance between rail traffic website
The rail traffic website of time impedance is shown in Table 6.
Rail traffic website within the scope of each reasonable walking of cell centroid point of table 6
| Cell number | Cell centroid point | Rail traffic website within the scope of reasonable walking |
| 1 | 7 | 1 2 13 |
| 2 | 9 | 5 15 |
| 3 | 12 | 13 |
| 4 | 14 | 13 15 |
(4) shortest time path between each rail traffic website is calculated using dijkstra's algorithm；
In the present embodiment, the shortest time path between each rail traffic website is shown in Table 7.
7 road network rail traffic shortest time path impedance of table
| Rail traffic website point is to (p, s) | Rail traffic time impedance |
| (1, 2) | 580 |
| (1, 5) | 400 |
| (1, 13) | 500 |
| (1, 15) | 280 |
| (2, 5) | 180 |
| (2, 13) | 160 |
| (2, 15) | 300 |
| (5, 13) | 340 |
| (5, 15) | 120 |
| (13, 15) | 220 |
(5) when calculating the rail traffic trip mode for considering walking linking between each cell centroid point using method provided herein
Between shortest path, include the following steps:
(5.1) point or trip attraction point occur for screening trip OD pairs of rail-free traffic website within the scope of reasonable walking, determine
It considers the rail traffic trip mode shortest time path of walking linking；
In the present embodiment, point or trip attraction point occur for no trip OD pairs of rail-free traffic website within the scope of reasonable walking.
(5.2) point and trip attraction point only one equal rail traffic website within the scope of reasonable walking occur for screening trip
OD pairs, determine its consider walking linking rail traffic trip mode shortest time path.Include the following steps:
Point and trip attraction point only one equal rail traffic website within the scope of reasonable walking occur for (5.2.1) screening trip
OD pairs；
In the present embodiment, point and trip attraction point only one equal rail traffic website within the scope of reasonable walking occur for no trip
OD pairs.
(5.2.2) screens trip in (5.2.1) and point and rail traffic of the trip attraction point within the scope of reasonable walking occurs
Website is OD pairs identical, determines that it considers the rail traffic trip mode shortest time path of walking linking；
(5.2.3), which screens trip generation point and trip attraction point in (5.2.1), within the scope of reasonable walking there are different tracks to hand over
OD pairs of logical website determines that it considers the rail traffic trip mode shortest time path of walking linking.
(5.3) point or trip attraction point occur for screening trip has two or more rail traffics within the scope of reasonable walking
OD pairs of website determines that it considers the rail traffic trip mode shortest time path of walking linking.Include the following steps:
Point or trip attraction point occur for (5.3.1) screening trip has two or more rail traffic stations within the scope of reasonable walking
OD pairs of point；
In the present embodiment, point or trip attraction point occur for trip has two or more rail traffic stations within the scope of reasonable walking
The OD of point is to for (1,2) (1,3) (1,4) (2,3) (2,4) (3,4).OD is formed to by cell number, is not distinguished between same point pair
Trip point attraction.
(5.3.2) determines the time impedance for considering all possible paths of rail traffic trip mode of walking linking；
In the present embodiment, OD considers (1,2) time impedance of all possible paths of rail traffic trip mode of walking linking
It is shown in Table 8.
Table 8 considers the rail traffic trip mode path time impedance of walking linking
| Path | Time impedance |
| 7→1→15→9 | 4480 |
| 7→2→5→9 | 4080 |
| 7→2→15→9 | 4700 |
| 7→13→5→9 | 4140 |
| 7→13→15→9 | 4520 |
Remaining OD pairs processing step and OD are identical to (1,2), and this will not be detailed here.
It is the rail for considering walking linking that (5.3.3), which chooses the corresponding path of minimum value in all possible path time impedances,
Road travel modal shortest time path.
In the present embodiment, the minimum value in OD possible time impedances all to (1,2) is 4080, and corresponding path is 7
→2→5→9.Remaining OD pairs processing step and OD are identical to (1,2), and this will not be detailed here.Consider between each cell centroid point
The rail traffic trip mode shortest time path of walking linking is shown in Table 9.
Table 9 considers the rail traffic trip mode path time impedance of walking linking
| OD pairs | Shortest path path | Shortest path time impedance |
| (1,2) | 7→2→5→9 | 4080 |
| (1,3) | 7→2→13→12 | 4060 |
| (1,4) | 7→1→15→14 | 3280 |
| (2,3) | 9→5→13→12 | 3740 |
| (2,4) | 9→5→15→14 | 2820 |
| (3,4) | 12→13→15→14 | 2920 |
The above described is only a preferred embodiment of the present invention, be not intended to limit the invention in any other form, and
Any modification made by according to the technical essence of the invention or equivalent variations, still fall within scope of the present invention.
Claims (9)
1. a kind of rail traffic trip mode shortest time path calculation method for considering walking linking, which is characterized in that specific step
It is rapid as follows:
(1) cell centroid point, rail traffic website, the impedance of road network walking time, the road network rail for specifying survey region in city are obtained
Road traffic time impedance data；
(2) using dijkstra's algorithm calculate each cell centroid point to each rail traffic website walking time shortest path；
(3) the rail traffic website within the scope of each reasonable walking of cell centroid point is screened；
(4) shortest time path between each rail traffic website is calculated using dijkstra's algorithm；
(5) the rail traffic trip mode shortest time path for considering walking linking between each cell centroid point is calculated, is specifically included
Following steps:
(5.1) point or trip attraction point occur for screening trip OD pairs of rail-free traffic website within the scope of reasonable walking, determine
It considers the rail traffic trip mode shortest time path of walking linking；
(5.2) OD of point and trip attraction point only one equal rail traffic website within the scope of reasonable walking occurs for screening trip
It is right, determine that it considers the rail traffic trip mode shortest time path of walking linking；
(5.3) point or trip attraction point occur for screening trip has two or more rail traffic websites within the scope of reasonable walking
OD pairs, determine its consider walking linking rail traffic trip mode shortest time path.
2. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 1
Method, it is characterised in that: in the step (1), cell centroid point data, rail traffic station data, the impedance of road network walking time
Data and road network rail traffic time impedance data should be or can be converted into structural data and stored, wherein cell centroid
Point data and rail traffic station data include the coordinate or number data that can uniquely determine the position.
3. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 1
Method, it is characterised in that: the step (3) includes the following steps:
(3.1) the reasonable walking range of cell centroid point is determined；
(3.2) reasonable walking speed is determined；
(3.3) critical walking time impedance is calculated according to the reasonable walking range radius of cell centroid point and reasonable walking speed；
(3.4) screening cell centroid point is lower than critical walking time impedance into the shortest path time impedance between rail traffic website
Rail traffic website；
(3.5) step (3.4) are repeated, until obtaining all rail traffic websites within the scope of each reasonable walking of cell centroid point.
4. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 1
Method, it is characterised in that: in the step (5.1), if point or trip attraction point rail-free within the scope of reasonable walking occur for trip
Traffic website, then it is assumed that the trip between the OD will not select rail traffic trip mode, consider the rail traffic of walking linking
Trip mode shortest time path impedance is infinity.
5. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 1
Method, it is characterised in that: the step (5.2) includes the following steps:
Point and trip attraction point only one equal rail traffic website within the scope of reasonable walking occur for (5.2.1) screening trip
OD pairs；
(5.2.2) screens trip in (5.2.1) and point and rail traffic website of the trip attraction point within the scope of reasonable walking occurs
Identical OD pairs, determine that it considers the rail traffic trip mode shortest time path of walking linking；
(5.2.3), which screens trip generation point and trip attraction point in (5.2.1), within the scope of reasonable walking there are different tracks to hand over
OD pairs of logical website determines that it considers the rail traffic trip mode shortest time path of walking linking.
6. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 1
Method, it is characterised in that: the step (5.3) includes the following steps:
Point or trip attraction point occur for (5.3.1) screening trip has two or more rail traffic stations within the scope of reasonable walking
OD pairs of point；
(5.3.2) determines the time impedance for considering all possible paths of rail traffic trip mode of walking linking；
It is to consider that the track of walking linking is handed over that (5.3.3), which chooses the corresponding path of minimum value in all possible path time impedances,
Pass-out line mode shortest time path.
7. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 5
Method, it is characterised in that: in the step (5.2.2), if point and rail of the trip attraction point within the scope of reasonable walking occur for trip
Road traffic website is identical, then it is assumed that the trip between the OD will not select rail traffic trip mode, consider the rail of walking linking
Road travel modal shortest time path impedance is infinity.
8. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 5
Method, it is characterised in that: in the step (5.2.3), consider walking linking rail traffic trip mode shortest time path when
Between impedance be each cell centroid point to the corresponding time impedance of walking time shortest path of each rail traffic website and each track friendship
The sum of the corresponding time impedance of shortest time path between logical website.
9. a kind of rail traffic trip mode shortest time path calculating side for considering walking linking according to claim 6
Method, it is characterised in that: in the step (5.3.2), consider the time resistance in each path of rail traffic trip mode of walking linking
Resist the corresponding time impedance of walking time shortest path for cell centroid point to the corresponding rail traffic website in the path and the road
The sum of the corresponding time impedance of shortest time path between the corresponding rail traffic website of diameter, if point or trip attraction point occur for trip
The rail traffic website for including within the scope of reasonable walking is identical, then it is assumed that most short between the corresponding rail traffic website in the path
Road time impedance is infinity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910540990.0A CN110322058B (en) | 2019-06-21 | 2019-06-21 | Rail transit travel mode time shortest path calculation method considering walking connection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910540990.0A CN110322058B (en) | 2019-06-21 | 2019-06-21 | Rail transit travel mode time shortest path calculation method considering walking connection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110322058A true CN110322058A (en) | 2019-10-11 |
| CN110322058B CN110322058B (en) | 2022-04-15 |
Family
ID=68119954
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910540990.0A Active CN110322058B (en) | 2019-06-21 | 2019-06-21 | Rail transit travel mode time shortest path calculation method considering walking connection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110322058B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113096426A (en) * | 2021-03-29 | 2021-07-09 | 紫清智行科技(北京)有限公司 | Dispatching scheduling method for shared automatic driving vehicle |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103364002A (en) * | 2012-03-30 | 2013-10-23 | 北京掌城科技有限公司 | Route planning system and method combining real-time road conditions and public transport operation information |
| CN105335795A (en) * | 2015-10-23 | 2016-02-17 | 东南大学 | Metro-bus transfer problem automatic diagnosis method based on IC card data |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
| CN106779190A (en) * | 2016-12-02 | 2017-05-31 | 东南大学 | A kind of urban track traffic passenger trip route suggesting method and system |
| CN107194497A (en) * | 2017-04-27 | 2017-09-22 | 北京交通大学 | Urban track traffic passenger trip route planing method under a kind of accident |
| CN108827332A (en) * | 2018-06-29 | 2018-11-16 | 爱驰汽车有限公司 | Combination of paths planing method, system, equipment and the storage medium driven with subway |
-
2019
- 2019-06-21 CN CN201910540990.0A patent/CN110322058B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103364002A (en) * | 2012-03-30 | 2013-10-23 | 北京掌城科技有限公司 | Route planning system and method combining real-time road conditions and public transport operation information |
| CN105335795A (en) * | 2015-10-23 | 2016-02-17 | 东南大学 | Metro-bus transfer problem automatic diagnosis method based on IC card data |
| CN105844362A (en) * | 2016-03-30 | 2016-08-10 | 西南交通大学 | Urban traffic comprehensive travel decision-making model |
| CN106779190A (en) * | 2016-12-02 | 2017-05-31 | 东南大学 | A kind of urban track traffic passenger trip route suggesting method and system |
| CN107194497A (en) * | 2017-04-27 | 2017-09-22 | 北京交通大学 | Urban track traffic passenger trip route planing method under a kind of accident |
| CN108827332A (en) * | 2018-06-29 | 2018-11-16 | 爱驰汽车有限公司 | Combination of paths planing method, system, equipment and the storage medium driven with subway |
Non-Patent Citations (2)
| Title |
|---|
| 孟梦等: "考虑出发时间的组合出行动态路径选择模型", 《中南大学学报(自然科学版)》 * |
| 潘星: "基于多模式公共交通最优路径算法研究", 《中国优秀博硕士学位论文全文数据库(硕士)工程科技Ⅱ辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113096426A (en) * | 2021-03-29 | 2021-07-09 | 紫清智行科技(北京)有限公司 | Dispatching scheduling method for shared automatic driving vehicle |
| CN113096426B (en) * | 2021-03-29 | 2021-11-05 | 紫清智行科技(北京)有限公司 | Dispatching scheduling method for shared automatic driving vehicle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110322058B (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108470444B (en) | A kind of city area-traffic big data analysis System and method for based on genetic algorithm optimization | |
| CN106021832B (en) | Route plane optimizing design method before laying a railway track | |
| CN103208033B (en) | Access passenger flow forecasting method for urban rail transit new line under network condition | |
| CN106250615B (en) | Route vertical section design method before laying a railway track | |
| Laporte et al. | Maximizing trip coverage in the location of a single rapid transit alignment | |
| CN110111574B (en) | Urban traffic imbalance evaluation method based on flow tree analysis | |
| CN108694278A (en) | A kind of city discrete network design problem method based on road load equilibrium | |
| CN110843870B (en) | Method for maintaining fixed capacity of high-speed railway network graph under abnormal event | |
| CN104185242B (en) | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method | |
| CN105760960A (en) | Park and ride facility optimal siting and capacity determining method based on rail transit | |
| CN107517077A (en) | Space networking double layer minipellet model and the routing optimization method of topology control | |
| CN109612488B (en) | Big data micro-service-based mixed travel mode path planning system and method | |
| CN104616076A (en) | Method and system for optimizing multi-line collaborative operation scheme of urban rail transit | |
| CN109686091A (en) | A kind of magnitude of traffic flow based on multisource data fusion fills up algorithm | |
| US20140039849A1 (en) | Method for the construction of a water distribution model | |
| CN105528649A (en) | Route optimization recommendation method based on clustering and saving algorithms | |
| CN110414795B (en) | Newly-increased high-speed rail junction accessibility influence method based on improved two-step mobile search method | |
| CN111724076A (en) | Regional multi-type rail transit passenger flow dynamic distribution method under operation interruption condition | |
| CN105389640A (en) | Method for predicting suburban railway passenger flow | |
| CN108647475A (en) | City discrete network design problem R language implementation methods based on load balancing | |
| CN103473606B (en) | The public traffic network entirety transfer performance optimization method of the maximum shortest path length based on GIS | |
| CN110517491A (en) | A kind of consideration path redundancy and out the significance of highway segment sort method of line efficiency | |
| CN108345987A (en) | A kind of road infrastructure construction project influences evaluation DSS and method | |
| CN110322058A (en) | A kind of rail traffic trip mode shortest time path calculation method considering walking linking | |
| CN107300388A (en) | Tourism route planing method of riding based on Q learning algorithms and echo state network |
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 |