CN109299813A - A kind of public traffic network shortest path length calculation method under least bus change - Google Patents
A kind of public traffic network shortest path length calculation method under least bus change Download PDFInfo
- Publication number
- CN109299813A CN109299813A CN201810998771.2A CN201810998771A CN109299813A CN 109299813 A CN109299813 A CN 109299813A CN 201810998771 A CN201810998771 A CN 201810998771A CN 109299813 A CN109299813 A CN 109299813A
- Authority
- CN
- China
- Prior art keywords
- website
- matrix
- adjacency matrix
- path length
- shortest 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
- 230000008859 change Effects 0.000 title claims abstract description 36
- 238000004364 calculation method Methods 0.000 title claims abstract description 11
- 239000011159 matrix material Substances 0.000 claims abstract description 61
- 238000012546 transfer Methods 0.000 claims abstract description 18
- 238000000034 method Methods 0.000 description 3
- 230000006872 improvement Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The public traffic network shortest path length calculation method that the invention discloses a kind of under least bus change, comprising: utilize the first adjacency matrix Tk×kWith the second adjacency matrix Hk×kThe minimum reachable number and corresponding shortest path length between website are recorded respectively, initialize the first adjacency matrix Tk×kWith the second adjacency matrix Hk×k, withWithIndicate the first adjacency matrix Tk×kWith the second adjacency matrix Hk×kOriginal state,WithIn matrix elementWithIt is set as+∞；It utilizesWithIn matrix elementWithUpdate matrixWithExtremelyWithIterative MatrixWithExtremelyWithm≥2；The second adjacency matrix H will not be changed again by further increasing number of transferk×k, enableAt this point, the second adjacency matrix Hk×kInclude shortest path length of any two website under least bus change number in public traffic network.The present invention is iterated adjacency matrix in the case where considering least bus change number, and then obtains the shortest path length under least bus change number.
Description
Technical field
The invention belongs to public transport fields, most more particularly, to a kind of public traffic network under least bus change
Short path length calculation method.
Background technique
Public transportation system is to provide the job facilities of transport services for resident trip and social Material Transportation, in country or
Vital effect is played in the economic development and people's lives in area.In the planning and scheduling process of public transportation system
In, the shortest path between website is one of the factor for needing emphasis to consider.And in public traffic network, it changes to path length
The measurement of degree has an important influence, and different transfer manners often corresponds to different path lengths, and people are generally more uncommon
Prestige arrives at the destination under less number of transfer, but current public traffic network shortest path length calculating ignores mostly
Influence of this transfer to path length.
Summary of the invention
Aiming at the above defects or improvement requirements of the prior art, the public friendship that the present invention provides a kind of under least bus change
Thus open network shortest path length calculation method solves the prior art does not consider that influence this skill of transfer to path length
Art problem.
To achieve the above object, the public traffic network shortest path length that the present invention provides a kind of under least bus change
Calculation method, comprising:
(1) the first adjacency matrix T is utilizedk×kWith the second adjacency matrix Hk×kMinimum reachable time between website is recorded respectively
Several and corresponding shortest path length, the first adjacency matrix Tk×kIn the first element tI, jIndicate website niAnd njBetween it is minimum
Up to number, (tI, j- 1) website n is indicatediAnd njBetween least bus change number, the second adjacency matrix Hk×kIn second element
hI, jIndicate website niAnd njBetween shortest path length under least bus change, k indicates the quantity of public traffic station, i ∈ [1,
K], j ∈ [1, k]；
(2) the first adjacency matrix T is initializedk×kWith the second adjacency matrix Hk×k, withWithIndicate that first is adjacent
Matrix Tk×kWith the second adjacency matrix Hk×kOriginal state,WithIn matrix elementWithIt is set as+∞；
(3) it utilizesWithIn matrix elementWithUpdate matrixWithExtremelyWith
(4) it is based onWithIterative MatrixWithExtremelyWithm≥2；
(5) repeat step (4) untilThe second adjoining will not be changed again by further increasing number of transfer
Matrix Hk×k, enableAt this point, the second adjacency matrix Hk×kComprising appointing in public traffic network
It anticipates shortest path length of two websites under least bus change number.
Further, step (3) includes:
If niAnd njIt is two websites of a public traffic line road, i ≠ j, thenIn elementFor
MatrixIf seeking the most short travel distance between website,In elementIf seeking website
Between most short hourage, thenWherein, v and Δ respectively indicate being averaged for public transport
Travel speed and average latency, Dis (ni, nj) indicate website niTo njOperating range, if niAnd njIt is not one public
Two websites on traffic route, thenIn element In element
Further, step (4) includes:
(4-1) is for website niAnd njIfIn elementThenIn element In element
(4-2) ifSelect website nxAs niAnd njBetween transfer website, wherein x ≠ i ≠ j calculatesValue；
(4-3) is to except niAnd njExcept all public traffic stations repeat step (4-2), for all transfer website nx,
Selection makesIt is worth the smallest nxAs transfer website, IfThenIf an only website nxMakeValue is minimum, then website nxMake
To change to website, and If there is multiple website nxMakeValue is minimum, thenAnd it selectsValue minimum when corresponding website nxAs
Change to website.
In general, through the invention it is contemplated above technical scheme is compared with the prior art, can obtain down and show
Beneficial effect:
(1) present invention introduces adjacency matrix, are iterated in the case where considering least bus change number to adjacency matrix, consider transfer
Influence to shortest path, and then obtain the shortest path length under least bus change number.The shortest path that the present invention obtains
Length is more acurrate, reliability is stronger.
(2) present invention may finally be obtained under least bus change number in public traffic network between any two website
Shortest path length, including most short travel distance and most short hourage.
Detailed description of the invention
Fig. 1 is that a kind of public traffic network shortest path length under least bus change provided in an embodiment of the present invention calculates
The flow chart of method；
Fig. 2 is public traffic network schematic diagram provided in an embodiment of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.As long as in addition, technical characteristic involved in the various embodiments of the present invention described below
Not constituting a conflict with each other can be combined with each other.
As shown in Figure 1, a kind of public traffic network shortest path length calculation method under least bus change, comprising:
(1) the first adjacency matrix T is utilizedk×kWith the second adjacency matrix Hk×kMinimum reachable time between website is recorded respectively
Several and corresponding shortest path length, the first adjacency matrix Tk×kIn the first element tI, jIndicate website niAnd njBetween it is minimum
Up to number, (tI, j- 1) website n is indicatediAnd njBetween least bus change number, the second adjacency matrix Hk×kIn second element
hI, jIndicate website niAnd njBetween shortest path length under least bus change, k indicates the quantity of public traffic station, i ∈ [1,
K], j ∈ [1, k]；
(2) the first adjacency matrix T is initializedk×kWith the second adjacency matrix Hk×k, withWithIndicate that first is adjacent
Matrix Tk×kWith the second adjacency matrix Hk×kOriginal state,WithIn matrix elementWithIt is set as+∞；
(3) it utilizesWithIn matrix elementWithUpdate matrixWithExtremelyWith
(4) it is based onWithIterative MatrixWithExtremelyWithm≥2；
(5) repeat step (4) untilThe second adjoining will not be changed again by further increasing number of transfer
Matrix Hk×k, enableAt this point, the second adjacency matrix Hk×kComprising appointing in public traffic network
It anticipates shortest path length of two websites under least bus change number.
Further, step (3) includes:
If niAnd njIt is two websites of a public traffic line road, i ≠ j, thenIn elementFor
MatrixIf seeking the most short travel distance between website,In elementIf seeking website
Between most short hourage, thenWherein, v and Δ respectively indicate being averaged for public transport
Travel speed and average latency, Dis (ni, nj) indicate website niTo njOperating range, if niAnd njIt is not one public
Two websites on traffic route, thenIn element In element
Further, step (4) includes:
(4-1) is for website niAnd njIfIn elementThenIn element In element
(4-2) ifSelect website nxAs niAnd njBetween transfer website, wherein x ≠ i ≠ j calculatesValue；
(4-3) is to except niAnd njExcept all public traffic stations repeat step (4-2), for all transfer website nx,
Selection makesIt is worth the smallest nxAs transfer website, IfThenIf an only website nxMakeValue is minimum, then website nxMake
To change to website, and If there is multiple website nxMakeValue is minimum, thenAnd it selectsValue minimum when corresponding website nxAs
Change to website.
As illustrated in fig. 2, it is assumed that public traffic network has 7 public traffic stations, there are three public transport lines: route
1 (1-2-3-4), route 2 (1-2-5-3) and route 3 (6-4-7), the distance between adjacent sites are as shown in Figure 2.Based on above-mentioned
The iterative process of matrix T and H, by iteration three times, the available public traffic network any two website is in least bus change
Shortest path length under number, by taking the most short travel distance under least bus change number as an example, specific calculated result is as follows:
Public traffic network shortest path length calculation method under least bus change number of the present invention, can examine
In the case of considering least bus change, the shortest path length in public traffic network between any two website is calculated, including
Most short travel distance and most short hourage.
As it will be easily appreciated by one skilled in the art that the foregoing is merely illustrative of the preferred embodiments of the present invention, not to
The limitation present invention, any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should all include
Within protection scope of the present invention.
Claims (3)
1. a kind of public traffic network shortest path length calculation method under least bus change characterized by comprising
(1) the first adjacency matrix T is utilizedk×kWith the second adjacency matrix Hk×kThe minimum reachable number and right between website is recorded respectively
The shortest path length answered, the first adjacency matrix Tk×kIn the first element tI, jIndicate website niAnd njBetween it is minimum up to time
Number, (tI, j- 1) website n is indicatediAnd njBetween least bus change number, the second adjacency matrix Hk×kIn second element hI, jIt indicates
Website niAnd njBetween shortest path length under least bus change, k indicates the quantity of public traffic station, i ∈ [1, k], j ∈
[1, k]；
(2) the first adjacency matrix T is initializedk×kWith the second adjacency matrix Hk×k, withWithIndicate the first adjacency matrix
Tk×kWith the second adjacency matrix Hk×kOriginal state,WithIn matrix elementWithIt is set as+∞；
(3) it utilizesWithIn matrix elementWithUpdate matrixWithExtremelyWith
(4) it is based onWithIterative MatrixWithExtremelyWithm≥2；
(5) repeat step (4) untilThe second adjacency matrix will not be changed again by further increasing number of transfer
Hk×k, enableAt this point, the second adjacency matrix Hk×kInclude in public traffic network any two
Shortest path length of a website under least bus change number.
2. a kind of public traffic network shortest path length calculation method under least bus change as described in claim 1,
It is characterized in that, the step (3) includes:
If niAnd njIt is two websites of a public traffic line road, i ≠ j, thenIn elementFor matrixIf seeking the most short travel distance between website,In elementIf ask website it
Between most short hourage, thenWherein, v and Δ respectively indicate the average row of public transport
Sail speed and average latency, Dis (ni, nj) indicate website niTo njOperating range, if niAnd njIt is not a public friendship
Two websites on logical route, thenIn element In element
3. a kind of public traffic network shortest path length calculation method under least bus change as claimed in claim 1 or 2,
It is characterized in that, the step (4) includes:
(4-1) is for website niAnd njIfIn elementThenIn element In element
(4-2) ifSelect website nxAs niAnd njBetween transfer website, wherein x ≠ i ≠ j calculatesValue；
(4-3) is to except niAnd njExcept all public traffic stations repeat step (4-2), for all transfer website nx, selection
MakeIt is worth the smallest nxAs transfer website, IfThenIf an only website nxMakeValue is minimum, then website nxMake
To change to website, and If there is multiple website nxMakeValue is minimum, thenAnd it selectsValue minimum when corresponding website nxAs
Change to website.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810998771.2A CN109299813B (en) | 2018-08-27 | 2018-08-27 | Method for calculating shortest path length of public transport network under minimum transfer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810998771.2A CN109299813B (en) | 2018-08-27 | 2018-08-27 | Method for calculating shortest path length of public transport network under minimum transfer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109299813A true CN109299813A (en) | 2019-02-01 |
| CN109299813B CN109299813B (en) | 2021-11-02 |
Family
ID=65165785
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810998771.2A Expired - Fee Related CN109299813B (en) | 2018-08-27 | 2018-08-27 | Method for calculating shortest path length of public transport network under minimum transfer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109299813B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080071849A1 (en) * | 2006-09-15 | 2008-03-20 | Krieger Cynthia A H | Polynomial method for detecting a Hamiltonian circuit |
| CN102880642A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Bus transfer method based on weighted directed network model |
| CN105206037A (en) * | 2014-05-30 | 2015-12-30 | 中国电信股份有限公司 | Bus route analysis method and system |
| CN106779225A (en) * | 2016-12-22 | 2017-05-31 | 福州大学 | A kind of optimal path method for solving comprising Dominator collection |
| CN107808217A (en) * | 2017-10-24 | 2018-03-16 | 山东大学 | A kind of Public Transport Transfer optimization method based on Big Dipper positioning with the volume of the flow of passengers |
-
2018
- 2018-08-27 CN CN201810998771.2A patent/CN109299813B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080071849A1 (en) * | 2006-09-15 | 2008-03-20 | Krieger Cynthia A H | Polynomial method for detecting a Hamiltonian circuit |
| CN102880642A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Bus transfer method based on weighted directed network model |
| CN105206037A (en) * | 2014-05-30 | 2015-12-30 | 中国电信股份有限公司 | Bus route analysis method and system |
| CN106779225A (en) * | 2016-12-22 | 2017-05-31 | 福州大学 | A kind of optimal path method for solving comprising Dominator collection |
| CN107808217A (en) * | 2017-10-24 | 2018-03-16 | 山东大学 | A kind of Public Transport Transfer optimization method based on Big Dipper positioning with the volume of the flow of passengers |
Non-Patent Citations (1)
| Title |
|---|
| LIU HONG等: "Vulnerability effects of passengers" intermodal transfer distance preference and subway expansion on complementary urban public transportation systems", 《RELIABILITY ENGINEERING AND SYSTEM SAFETY》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109299813B (en) | 2021-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111310077B (en) | Passenger intelligent journey recommendation system and method | |
| Dong et al. | Network Planning Method for Capacitated Metro‐Based Underground Logistics System | |
| CN105243128A (en) | Sign-in data based user behavior trajectory clustering method | |
| CN103530694A (en) | Urban subway dynamic passenger flow distribution method constructed on the basis of time-space network | |
| Lin et al. | Optimal demand-aware ride-sharing routing | |
| CN105678410A (en) | Public traffic system space-time reachability modeling method of considering network connectivity time varying characteristics | |
| CN109670240B (en) | Urban multi-mode public transport network initial line generation method | |
| CN103281708B (en) | Wireless sensor node dispositions method | |
| CN111191817B (en) | Bus network topology division method based on transfer passenger flow | |
| CN110109055A (en) | A kind of indoor orientation method based on RSSI ranging | |
| CN106202355B (en) | Search engine-based weather service recommendation method and device and search engine | |
| CN109855626B (en) | Indoor map road network generation method based on scanning lines | |
| CN110378557A (en) | A kind of staggered shifts policy evaluation method based on reverse traffic assignation | |
| CN109299813A (en) | A kind of public traffic network shortest path length calculation method under least bus change | |
| CN109344643A (en) | A kind of method for secret protection and system towards the publication of figure intermediate cam graphic data | |
| CN117114525A (en) | Internet of things-based cross-border logistics big data intelligent management system and method | |
| CN104253830A (en) | Service selection method based on position | |
| CN108413980A (en) | A kind of touring paths planning method of traffic reducing path branches | |
| Wang et al. | Reliable path selection problem in uncertain traffic network after natural disaster | |
| CN109168183B (en) | Opportunistic network multicast routing method based on mobile features and social relations | |
| CN108241903B (en) | Riding line generation method and device | |
| WO2016113308A1 (en) | System and method for route generation | |
| CN110098972B (en) | Heuristic method for measuring node placement and detection path planning | |
| CN108833466B (en) | System and method for publishing/subscribing traffic network space text | |
| CN105450530A (en) | Mobile random network multicast routing method based on minimum-overhead path |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20211102 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |