CN105160429B - It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge - Google Patents
It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge Download PDFInfo
- Publication number
- CN105160429B CN105160429B CN201510526947.0A CN201510526947A CN105160429B CN 105160429 B CN105160429 B CN 105160429B CN 201510526947 A CN201510526947 A CN 201510526947A CN 105160429 B CN105160429 B CN 105160429B
- Authority
- CN
- China
- Prior art keywords
- network
- micro
- hinge
- bus
- node
- 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.)
- Active
Links
Abstract
It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge, include the following steps：Step 1：Build the oriented passenger transfer network Space-P of weighting of city bus；Step 2：Walking is built up to micro- hinge network C luster-W；Step 3：Public bicycles are built up to micro- hinge network C luster-B；Step 4：Three layers of coupling Public Traffic Network Model of structure；Step 5：Method is changed to using the multi-mode with virtual micro- hinge.The present invention combines the conceptual design for virtually the changing to micro- hinge Public Transport Transfer method of multi-mode, will provide selection scheme that is more novel and using for the public trip of user, while advocating user's Green Travel, reduces city carbon emission amount.
Description
Technical field
The present invention relates to Network Sciences and public transport field, particularly relate to a kind of multimode for having and virtually changing to micro- hinge
Formula Public Transport Transfer method.
Background technology
With the quickening of urbanization process and the acceleration expansion in city, more preferably faster more easily traffic system has become city
The basic need of city's life, therefore traffic system operational efficiency problem is more of interest by people.In many big of the current whole world
In city, although the network densities such as city underground, public transport have tended to be full, inevitably there are terminal and transportation network
Between gap.Meanwhile because motor vehicle excessively uses, automobile exhaust pollution is also increasingly severe, gives life of urban resident and health
Cause serious damage.National large area, high-frequency haze weather are to residents ' health since winter in 2013 to spring in 2014
Bring high risks, the PM2.5 of high concentration so that respiratory tract system disease is occurred frequently, these all with the close phase of motor vehicle exhaust emission
It closes.In order to mitigate these problems, people attempt to find it is a kind of it is flexible, accessibility is high, the clean trip mode of health, it is public voluntarily
Vehicle system is come into being.It belongs to the Slow transport system in urban transportation, has in the various aspects such as accessibility and energy conservation and environmental protection
Advantage.It using public bicycles, can complete to take over rail traffic goodly, alleviate congested in traffic problem, realize money
Source is shared, improves the operational efficiency of urban transportation, solves the practical problem of citizens' activities.
It is guiding that many cities in current National various regions, which start gradually to probe into implementation to lead urban development with public transport,
" public transport city " Urban strategy, Hangzhou on May 1st, 2008 operate public bicycles lending system (PBS) first in the whole nation, and
It is grouped into the field of public transport.The implementation of Hangzhou public bicycles so that the public trip of citizen is more diversified, convenient
Change.The lot of advantages that public bicycles can not be substituted in terms of the mode of the public trip of short distance with public transport, can be very well
Make up the requirement of city dweller's short circuit journey trip, while compensating for existing public transport mode in terms of short distance trip not
Foot, establish level it is rich it is stronger, system is more perfect from " door " to the urban public tranlport system of " door ".So public
Bicycle is combined into multilayer-multimodel traffic network to research public bicycles system with original bus system, subway system
The influence to multi-mode public transit system of uniting has extremely important meaning.
Public Transport Transfer is tradition, a representative instance using network theory research urban transportation.Traditionally people will be public
It hands over website to regard network node as, regards the contact generated by bus between website as even side, it is abstract to obtain a figure, then make
With ripe dijkstra's algorithm or Floyd algorithms can operation obtain the transfer plan of performance.However such methods exist very
More deficiencies.First, they do not account for being widely present in practical public transit system while Public Transport Transfer are played again important
The micro- hinge of transfer of effect, the so-called micro- hinge, that is, short distance walking of transfer is up to website group or bicycle up to website group.
During real Public Transport Transfer, people will walk from a certain station to a certain adjacent bus station sometimes, then change to again, and traditional
Transfer method then cannot achieve this process.Secondly, when carrying out transfer planning, often only consider the resources such as bus, subway,
Without other more environmentally-friendly city public resources such as public bicycles are fully utilized, and the reasonable employment of public bicycles can
With the effect being significantly improved to public trip.
Invention content
Current monotype Bus Transfer Algorithm trip mode is single, the congestion period goes out the problems such as line efficiency is low in order to overcome,
The multi-mode Public Transport Transfer of city function bicycle is considered simultaneously, and urban mass-transit system resource, the present invention is rationally utilized to propose
Virtually change to micro- hinge concept (virtually change to micro- hinge specifically and refer to distance between those in public transit system compared with
Closely, can be directly by walking or public bicycles without bus station's point group by the arrival that takes bus), and according to
This concept devises a kind of multi-mode Public Transport Transfer method using net model methodology.
Technology is as follows used by the present invention solves its technical problem：
It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge, include the following steps：
Step 1：The oriented passenger transfer network Space-P of weighting for building city bus, in public transport Space-P, in network
Node definition is bus station, if two bus stations are in the same public bus network, there is one between the two websites
Lian Bian, the length of public bus network is the weights for connecting side between two websites；
Step 2：Walking is built up to micro- hinge network C luster-W, Cluster-W network by weighting complete subgraph structure
At each subgraph is the micro- hinge WMHub of a walking, and for each WMHub, it is indicated between an any two node
Euclidean distance is less than threshold value ΓWBus station's point group, maximum Euclidean distance is defined as the WMHub's between any two points therein
Diameter WMD, in each WMHub, side indicates to reach by short distance walking between any two points, and weights are uniformly with corresponding
WMD is indicated；
Step 3：Public bicycles are built up to micro- hinge network C luster-B, Cluster-B network integration city public affairs
Bicycle geographical location information altogether, is made of, each subgraph is expressed as a micro- hinge of public bicycles weighting complete subgraph
BMHub, each BMHub indicate that the Euclidean distance between an any two node is less than threshold value ΓBBus station's point group, wherein
Any two points between maximum Euclidean distance be defined as the diameter BMD of the BMHub, in each BMHub, side table between any two points
Show that the public bicycles short distance by near nodal is ridden arrival, weights are unified to be indicated with corresponding BMD；
Step 4：Three layers of coupling Public Traffic Network Model of structure, by bus-route network Space-P, walking up to micro- hinge network
Cluster-W and public bicycles are up to micro- hinge network C luster-B as three network layers, this three-layer network is because of node
It is bus station, therefore there are apparent coupled relations at bus station, to constitute three layers of coupling network；
Step 5：Multi-mode with virtual micro- hinge changes to method, is based on three layers of coupling network model, calculate node i
To the trip cost C (i, j) of node j in a network, compare the size of trip cost value, takes optimal value to determine the road in the stage
Diameter scheme, process are as follows：
5.1 initialization：It enables o indicate that start node, N indicate the set of network node, node o is added in N, i.e. N=
{ o } has all node v not in N：
Have in directly reachable finger Space-P network nodes in formula (1) and connects side, is present in WMHub or is present in BMHub
In one of which or a variety of situations；Then by take bus, walking, cycling weights be recorded in three-dimensional array S
={ P1,P2,P3, go minimum value in array S to be determined as transfer strategy at this time；
5.2 find a node w not in N, and wherein D (w) is added to w in N, then to all sections not in N
Point v, [D(v),D(w)+C(w,v)]In smaller value update the value of original D (v), while the minimum cost in access group S
As transfer strategy at this time；
5.3 repeat step 5.2, it is known that until finding destination node.
Further, in the step 3, the method for structure BMHub networks is：When traversing the position data of bus stop,
Selected distance bus station distance is less than the bicycle website of short distance threshold value, that is, sets the threshold value of search range as short distance threshold
Value considers that bus stop reaches the distance range of Cycle Hire point by short distance walking.
Further, in the step 5, the cost of transfer strategy is calculated, the formula of trip cost C (i, j) is defined as：
C (i, j)=T (x)+P1(d1)+P2(d2)+P3(d3) (2)
Wherein, C (i, j) indicates that the total cost paid required for from node i to node j, T (x) indicate that user goes out in public transport
The cost of bus transfering number x, P are used in row1(d1) indicate to take d1The bus of physical distance needs the cost paid.
P2(d2) indicate to pass through the cost of the micro- hinge of walking, P3(d3) indicate to pass through the cost of the micro- hinge of bicycle, wherein d2、d3Generation respectively
Table walking is up to micro- hinge diameter and bicycle up to micro- hinge diameter.
The present invention technical concept be：The present invention proposes virtually to change to the concept of micro- hinge, by build Space-P,
Cluster-W, Cluster-B network design are a kind of to have the multi-mode Public Transport Transfer method for virtually changing to micro- hinge, for
The trip at family provides more diversified choice for traveling, enriches user's trip experience.
Beneficial effects of the present invention are：City can be constructed by this thinking based on the multi-mode net for virtually changing to micro- hinge
Network model.This will provide selection scheme that is more novel and using for the public trip of user, while advocate user's Green Travel, subtract
Few city carbon emission amount.
As described above, the specific implementation step implemented makes the present invention be more clear.In spirit and claims of the present invention
Protection domain in, to any modifications and changes for making of the present invention, both fall within protection scope of the present invention.
Description of the drawings
Fig. 1 is three layers of coupling public traffic network structure schematic diagram
Specific implementation mode
The present invention will be further described below in conjunction with the accompanying drawings.
Referring to Fig.1, a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge, include the following steps：
Step 1：The oriented passenger transfer network Space-P of weighting for building city bus, in public transport Space-P, in network
Node definition is bus station, if two bus stations are in the same public bus network, there is one between the two websites
Lian Bian, the length of public bus network is the weights for connecting side between two websites；
Step 2：It is complete by several weightings up to micro- hinge network C luster-W, Cluster-W network to build walking
Subgraph is constituted, and each subgraph is the micro- hinge WMHub of a walking, and for each WMHub, it indicates an any two node
Between Euclidean distance be less than threshold value ΓWBus station's point group of=500m, maximum Euclidean distance is fixed between any two points therein
Justice is the diameter WMD of the WMHub.In each WMHub, side indicates to reach by short distance walking between any two points,
Weights are unified to be indicated with corresponding WMD, and as shown in the Cluster-W in Fig. 1, a points and the actual range of b points are small in WMHub
In 500m, then 2 points of a, b is connected；
Step 3：Public bicycles are built up to micro- hinge network C luster-B, Cluster-B network integration city public affairs
Bicycle geographical location information altogether is made of several weighting complete subgraphs, and it is micro- that each subgraph is expressed as a public bicycles
Hinge BMHub.Each BMHub indicates that the Euclidean distance between an any two node is less than threshold value ΓBThe public transport of=2000m
Website group, maximum Euclidean distance is defined as the diameter BMD of the BMHub between any two points therein.In each BMHub, appoint
Meaning point-to-point transmission side indicates the arrival that can ride by the public bicycles short distance of near nodal, and weights are uniformly with corresponding
BMD is indicated, includes BMHub1 and BMHub2 two micro- pivots of bicycle as shown in the Cluster-B networks in Fig. 1, in network
Knob；
Step 4：Three layers of coupling Public Traffic Network Model of structure, by bus-route network Space-P, walking up to micro- hinge network
Cluster-W and public bicycles are up to micro- hinge network C luster-B as three network layers, this three-layer network is because of node
It is bus station, therefore there are apparent coupled relations at bus station, to constitute three layers of coupling network.Such as Fig. 1 institutes
Show, intercouple with a, b in Cluster-W in Space-P networks, in Space-P networks with a, b, f in Cluster-B
It intercouples with d, e；
Step 5：Multi-mode with virtual micro- hinge changes to method, is based on three layers of coupling network model, calculate node i
To the trip cost C (i, j) of node j in a network, compare the size of trip cost value, takes optimal value to determine the road in the stage
Diameter scheme, process are as follows：
5.1 initialization：O is enabled to indicate that start node, N indicate the set of network node.Node o is added in N, i.e. N=
{ o } has all node v not in N：
Have in directly reachable finger Space-P network nodes in formula (2) and connects side, is present in WMHub or is present in BMHub
In one of which or a variety of situations, then by take bus, walking, cycling weights be recorded in three-dimensional array S
={ P1,P2,P3, go minimum value in array S to be determined as transfer strategy at this time；
5.2 find a node w not in N, and wherein D (w) is added to w in N, then to all sections not in N
Point v, [D(v),D(w)+C(w,v)]In smaller value update the value of original D (v).Minimum cost in access group S simultaneously
As transfer strategy at this time；
5.3 repeat step 6.2, it is known that until finding destination node.
Further, in the step 3, the method for structure BMHub networks is：When traversing the position data of bus stop,
Selected distance bus station distance is less than the bicycle website of short distance threshold value, sets the threshold value of search range here as short distance
Threshold value (such as 300m) only considers that bus stop can reach the distance range of Cycle Hire point by short distance walking.
Further, in the step 5, the cost of transfer strategy is calculated, the formula of trip cost C (i, j) is defined as：
C (i, j)=T (x)+P1(d1)+P2(d2)+P3(d3) (4)
Wherein, C (i, j) indicates that the total cost paid required for from node i to node j, T (x) indicate that user goes out in public transport
The cost of bus transfering number x, P are used in row1(d1) indicate to take d1The bus of physical distance needs the cost paid,
P2(d2) indicate to pass through the cost of the micro- hinge of walking, P3(d3) indicate to pass through the cost of the micro- hinge of bicycle, wherein d2、d3Generation respectively
Table walking is up to micro- hinge diameter and bicycle up to micro- hinge diameter.
As described above, the specific implementation step that this patent is implemented makes the present invention be more clear, in conjunction with virtually changing to micro- hinge
Concept the structure principle of three-layer network is provided, while devising the Bus Transfer Algorithm of multi-mode.The present invention spirit and
In scope of the claims, to any modifications and changes that the present invention makes, protection scope of the present invention is both fallen within.
Claims (3)
1. a kind of having the multi-mode Public Transport Transfer method for virtually changing to micro- hinge, it is characterised in that：Include the following steps：
Step 1：The oriented passenger transfer network Space-P of weighting for building city bus, in public transport Space-P, the node in network
It is defined as bus station, if two bus stations are in the same public bus network, there is a company side between the two websites,
The length of public bus network is the weights for connecting side between two websites；
Step 2：Structure walking is made of up to micro- hinge network C luster-W, Cluster-W network weighting complete subgraph, often
A subgraph is the micro- hinge WMHub of a walking, and for each WMHub, it indicates the Euclidean between an any two node
Distance is less than threshold value ΓWBus station's point group, maximum Euclidean distance is defined as the diameter of the WMHub between any two points therein
WMD, in each WMHub, between any two points side indicate reached by short distance walking, weights uniformly with corresponding WMD come
It indicates；
Step 3：It is public certainly up to micro- hinge network C luster-B, Cluster-B network integration city to build public bicycles
Driving geographical location information, is made of weighting complete subgraph, and each subgraph is expressed as the micro- hinge BMHub of a public bicycles,
Each BMHub indicates that the Euclidean distance between an any two node is less than threshold value ΓBBus station's point group, it is therein arbitrary
The maximum Euclidean distance of point-to-point transmission is defined as the diameter BMD of the BMHub, and in each BMHub, side indicates to pass through between any two points
The public bicycles short distance of near nodal is ridden arrival, and weights are unified to be indicated with corresponding BMD；
Step 4：Three layers of coupling Public Traffic Network Model of structure, by bus-route network Space-P, walking up to micro- hinge network
Cluster-W and public bicycles are up to micro- hinge network C luster-B as three network layers, this three-layer network is because of node
It is bus station, therefore there are apparent coupled relations at bus station, to constitute three layers of coupling network；
Step 5：Multi-mode with virtual micro- hinge changes to method, is based on three layers of coupling network model, calculate node i to section
The trip cost C (i, j) of point j in a network compare the size of trip cost value, take optimal value to determine the path side in the stage
Case, process are as follows：
5.1 initialization：It enables o indicate that start node, N indicate the set of network node, node o is added in N, i.e. N={ o } is right
All node v not in N have：
Have in directly reachable finger Space-P network nodes in formula (1) and connects side, is present in WMHub or is present in BMHub
One of which or a variety of situations；Then by take bus, walking, cycling weights be recorded in three-dimensional array S=
{P1,P2,P3, minimum value is determined as transfer strategy at this time in access group S；
5.2 find a node w not in N, w are added in N, then the node v to all not in N, [D(v),D
(w)+C(w,v)]In smaller value update the value of original D (v), while the minimum cost in access group S is as transfer at this time
Strategy；
5.3 repeat step 5.2, until finding destination node.
2. as described in claim 1 a kind of with the multi-mode Public Transport Transfer method for virtually changing to micro- hinge, it is characterised in that：
In the step 3, the method for structure BMHub networks is：When traversing the position data of bus stop, selected distance bus station
Point distance is less than the bicycle website of short distance threshold value, that is, sets the threshold value of search range as short distance threshold value, consider bus
It stands and reaches the distance range of Cycle Hire point by short distance walking.
3. a kind of as claimed in claim 1 or 2 there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge, feature to exist
In：In the step 5, the cost of transfer strategy is calculated, the formula of trip cost C (i, j) is defined as：
C (i, j)=T (x)+P1(d1)+P2(d2)+P3(d3) (2)
Wherein, C (i, j) indicates that the total cost paid required for from node i to node j, T (x) indicate user in bus trip
Use the cost of bus transfering number x, P1(d1) indicate to take d1The bus of physical distance needs the cost paid, P2(d2)
Indicate the cost by the micro- hinge of walking, P3(d3) indicate to pass through the cost of the micro- hinge of bicycle, wherein d2、d3Respectively represent step
Row is up to micro- hinge diameter and bicycle up to micro- hinge diameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510526947.0A CN105160429B (en) | 2015-08-25 | 2015-08-25 | It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510526947.0A CN105160429B (en) | 2015-08-25 | 2015-08-25 | It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105160429A CN105160429A (en) | 2015-12-16 |
| CN105160429B true CN105160429B (en) | 2018-10-23 |
Family
ID=54801280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510526947.0A Active CN105160429B (en) | 2015-08-25 | 2015-08-25 | It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105160429B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106294869A (en) * | 2016-08-23 | 2017-01-04 | 浙江工业大学 | A kind of public traffic network modeling method with public bicycles subnet based on spatial network |
| CN107563028B (en) * | 2017-08-22 | 2020-09-08 | 南京邮电大学 | Public transport-subway coupling network construction method based on space network |
| CN109523064B (en) * | 2018-10-26 | 2022-02-18 | 上海城市交通设计院有限公司 | Intelligent micro-hub based on multi-network fusion |
| CN109615850A (en) * | 2018-12-27 | 2019-04-12 | 连尚（新昌）网络科技有限公司 | It is a kind of for determining the method and apparatus of the transit riding information of user |
| CN110017844A (en) * | 2019-04-08 | 2019-07-16 | 阿里巴巴集团控股有限公司 | Method, apparatus and calculating equipment for public transport path planning |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102880641A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Parametric bus transfer method in consideration of short-distance walking station pair |
| CN102880642A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Bus transfer method based on weighted directed network model |
| CN104200650A (en) * | 2014-08-27 | 2014-12-10 | 浙江工业大学 | Multimode public transportation transferring method in urban congestion period |
-
2015
- 2015-08-25 CN CN201510526947.0A patent/CN105160429B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102880641A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Parametric bus transfer method in consideration of short-distance walking station pair |
| CN102880642A (en) * | 2012-08-20 | 2013-01-16 | 浙江工业大学 | Bus transfer method based on weighted directed network model |
| CN104200650A (en) * | 2014-08-27 | 2014-12-10 | 浙江工业大学 | Multimode public transportation transferring method in urban congestion period |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105160429A (en) | 2015-12-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105160429B (en) | It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge | |
| CN104200650B (en) | Multimode public transportation transferring method in urban congestion period | |
| CN107563028B (en) | Public transport-subway coupling network construction method based on space network | |
| CN102538806B (en) | A kind of paths planning method and relevant device | |
| CN106403976A (en) | Dijkstra optimal traffic path planning method and system based on impedance matching | |
| CN105592138B (en) | A kind of city vehicle-mounted road of crossing ad hoc nodes auxiliary is by protocol method | |
| CN104391907B (en) | A kind of fast path method for searching of variable resolution degree | |
| CN104217579B (en) | Transportation network key road segment searching method based on section sub-network redundancy | |
| CN101149268A (en) | Road topology data model for navigation and calculation method | |
| CN101650191B (en) | Road network topology aggregation method and device | |
| CN102436466A (en) | Bus transfer inquiry method based on geographic information system (GIS) classification | |
| CN103389101B (en) | A kind of path connected inspection method based on hierarchical structure | |
| CN108827842A (en) | A kind of air quality optimum path planning method and system based on PM2.5 | |
| CN103473606B (en) | The public traffic network entirety transfer performance optimization method of the maximum shortest path length based on GIS | |
| CN107092986A (en) | The bus passenger travel route choice method based on website and collinearly run | |
| CN108280463A (en) | Optimization method and device for double-layer path of vehicle-mounted unmanned aerial vehicle | |
| CN106709591A (en) | Cooperative car-pooling route selection method with uncertain demand in Internet of Vehicles environment | |
| CN111337047B (en) | Unstructured road macroscopic path planning method based on multi-task point constraint | |
| CN106710296B (en) | A kind of vehicle-mounted parking induction method and device | |
| CN105228215A (en) | Based on many copies method for routing of decision tree mechanism in vehicular ad hoc network | |
| CN110095134A (en) | It is a kind of using the preference of user as the method and system of the path planning of core and navigation | |
| CN104794551A (en) | Automatic optimization system and method of itinerary with time window | |
| D'Andrea et al. | Path clustering based on a novel dissimilarity function for ride-sharing recommenders | |
| Meishan | Design of intelligent planning system for tourist scenic route based on ant colony algorithm | |
| Zou et al. | Hybrid traffic route visual recommendation based on multilayer complex networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |