CN105160429A - Multi-mode public transportation transfer method with virtual transfer micro-hubs - Google Patents

Multi-mode public transportation transfer method with virtual transfer micro-hubs Download PDF

Info

Publication number
CN105160429A
CN105160429A CN201510526947.0A CN201510526947A CN105160429A CN 105160429 A CN105160429 A CN 105160429A CN 201510526947 A CN201510526947 A CN 201510526947A CN 105160429 A CN105160429 A CN 105160429A
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.)
Granted
Application number
CN201510526947.0A
Other languages
Chinese (zh)
Other versions
CN105160429B (en
Inventor
杨旭华
程之
陈果
陈�光
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201510526947.0A priority Critical patent/CN105160429B/en
Publication of CN105160429A publication Critical patent/CN105160429A/en
Application granted granted Critical
Publication of CN105160429B publication Critical patent/CN105160429B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

A multi-mode public transportation transfer method with virtual transfer micro-hubs comprises the following steps of: step 1: constructing a weighted directed transfer network Space-P of urban public transportation; step 2: constructing a pedestrian reachable micro-hub network Cluster-W; step 3: constructing a public bicycle reachable micro-hub network Cluster-B; step 4: constructing a three-layer coupling public transportation network model; and step 5: adopting a multi-mode transfer method with virtual micro-hubs. According to the multi-mode public transportation transfer method with the virtual transfer micro-hubs, in combination with a concept of virtual transfer micro-hubs, the multi-mode public transportation transfer method is designed, so that more novel and useful selection schemes are provided for public travel of users; and at the same time, green travel of the users is advocated, so that urban carbon emission is reduced.

Description

A kind of multi-mode Public Transport Transfer method with the micro-hinge of virtual transfer
Technical field
The present invention relates to Network Science and public transport field, refer to a kind of multi-mode Public Transport Transfer method with the micro-hinge of virtual transfer especially.
Background technology
Along with the acceleration expansion in the quickening of urbanization process and city, better faster traffic system has more easily become townie basic need, therefore traffic system operational efficiency problem more pay close attention to by people.In many big cities global at present, although the network density such as city underground, public transport has been tending towards full, but still inevitably there is the gap between terminal and transportation network.Meanwhile, because motor vehicle excessively uses, automobile exhaust pollution is also more and more serious, causes grievous injury to life of urban resident and health.Since year spring winter to 2014 in 2013, national large area, high-frequency haze weather bring high risks to residents ' health, and the PM2.5 of high concentration makes respiratory tract system disease occurred frequently, and these are all closely related with motor vehicle exhaust emission.In order to relax these problems, people attempt finding a kind of accommodation, high, the healthy clean trip mode of accessibility, and public bicycles system is arisen at the historic moment.It belongs to the Slow transport system in urban transportation, has advantage in the many-side such as accessibility and energy-conserving and environment-protective.Utilize public bicycles, can complete and the taking over of track traffic goodly, alleviate congested in traffic problem, realize resource sharing, improve the operational efficiency of urban transportation, solve the practical problems of citizens' activities.
A lot of city, current National various places starts to probe into gradually to carry out and leads urban development " public transport city " Urban strategy for guiding with public transport, first Hangzhou operates public bicycles lending system (PBS) on May 1st, 2008 in the whole nation, and is grouped into the field of public transport.The enforcement of Hangzhou public bicycles, such that the public trip of citizen is more diversified, facilitation.Public bicycles has the lot of advantages that public transport can not be substituted in the mode of the public trip of short distance, well can make up the requirement of city dweller's short circuit journey trip, compensate for the deficiency of existing public transport mode in short distance trip simultaneously, establish that levels are rich is stronger, system is more perfect from " door " to the urban public tranlport system of " door ".So public bicycles and original bus system, subway system are combined into multilayer-multimodel traffic network have extremely important meaning to studying the impact of public bicycles system on multi-mode public transit system.
Public Transport Transfer is tradition, a representative instance using network theory research urban transportation.People regard bus station as network node traditionally, the contact produced are regarded as and connect limit, abstractly obtain a figure between website by bus, then use ripe dijkstra's algorithm or Floyd algorithm to get final product the transfer plan that computing obtains performance.But there is a lot of deficiencies in these class methods.First, they do not consider extensively to be present in simultaneously again for the micro-hinge of transfer that Public Transport Transfer plays an important role in actual public transit system, and the micro-hinge of so-called transfer and short distance walking can reach website group or bicycle can reach website group.In the process of real Public Transport Transfer, people from the walking of a certain station to a certain adjacent bus station, and then will change to sometimes, and traditional transfer method then cannot realize this process.Secondly, when carrying out transfer and planning, often only consider the resource such as bus, subway, and do not utilize the city public resource of other environmental protection more such as public bicycles completely, and the effect that the reasonable employment of public bicycles can be significantly improved to public trip.
Summary of the invention
Single in order to overcome current monotype Bus Transfer Algorithm trip mode, period of blocking up goes out the problems such as line efficiency is low, consider the multi-mode Public Transport Transfer of city function bicycle simultaneously, Appropriate application urban mass-transit system resource, (the micro-hinge of virtual transfer to refer in public transit system those close together each other specifically to the present invention proposes the concept of the micro-hinge of virtual transfer, can directly do not needed by walking or public bicycles through the bus station's point group arrived that takes bus), and use net model methodology to devise a kind of multi-mode Public Transport Transfer method according to this concept.
It is as follows that the present invention solves the technology concrete steps that its technical matters adopts:
There is a multi-mode Public Transport Transfer method for the micro-hinge of virtual transfer, comprise the steps:
Step one: the oriented passenger transfer network Space-P of weighting building city bus, in public transport Space-P, node definition in network is bus station, if two bus stations are in same public bus network, then have an even limit between these two websites, between two websites, the length of public bus network is that this connects the weights on limit;
Step 2: build walking and can reach micro-hinge network C luster-W, Cluster-W network is made up of weighting complete subgraph, each subgraph is a micro-hinge WMHub of walking, and for each WMHub, it represents that the Euclidean distance between any two nodes is less than threshold value Γ wbus station's point group, Euclidean distance maximum between any two points is wherein defined as the diameter WMD of this WMHub, and in each WMHub, between any two points, limit is represented and to be arrived by short distance walking, and the unified WMD by correspondence of its weights represents;
Step 3: build public bicycles and can reach micro-hinge network C luster-B, Cluster-B network integration city public bicycle geographical location information, be made up of weighting complete subgraph, each subgraph is expressed as a micro-hinge BMHub of public bicycles, and each BMHub represents that the Euclidean distance between any two nodes is less than threshold value Γ bbus station's point group, Euclidean distance maximum between any two points is wherein defined as the diameter BMD of this BMHub, in each BMHub, between any two points, limit is represented and to be ridden arrival by the public bicycles short distance of near nodal, and the unified BMD by correspondence of its weights represents;
Step 4: build three layers of coupling Public Traffic Network Model, by bus-route network Space-P, walking can reach micro-hinge network C luster-W and public bicycles can reach micro-hinge network C luster-B as three network layers, this three-layer network is because node is bus station, therefore there is obvious coupled relation at bus station place, thus form three layers of coupling network;
Step 5: the multi-mode transfer method with virtual micro-hinge, based on three layers of coupling network model, computing node i to node j trip cost C (i in a network, j), the relatively size of trip cost value, get optimal value to determine the route scheme in this stage, process is as follows:
5.1 initialization: make o represent start node, N represents the set of network node, adds in N, i.e. N={o} by node o, to all node v not in N, has:
Directly can reach in formula (1) and refer to there is company limit in Space-P network node, is present in WMHub or is present in wherein one or more situations in BMHub; Then by taking bus, walking, weights are by bike recorded in three-dimensional array S={P 1, P 2, P 3, remove the transfer strategy that minimum value in array S is defined as now;
5.2 find a node w not in N, wherein D (w), w is joined in N, then to all node v not in N, with [D (v), D (w)+C (w, v)] in less value upgrade the value of original D (v), the minimum cost in the S of peek group is simultaneously as transfer strategy now;
5.3 repeat step 5.2, know till finding destination node.
Further, in described step 3, the method building BMHub network is: when traveling through the position data of bus stop, selected distance bus station distance is less than the bicycle website of short distance threshold value, namely the threshold value of setting search scope is short distance threshold value, considers that bus stop arrives the distance range of Cycle Hire point by short distance walking.
Further, in described step 5, calculate the cost of transfer strategy, the formula of trip cost C (i, j) is defined as:
C(i,j)=T(x)+P 1(d 1)+P 2(d 2)+P 3(d 3)(2)
Wherein, C (i, j) represents the total cost paid required for from node i to node j, and T (x) represents that user uses the cost of bus transfering number of times x in bus trip, P 1(d 1) represent and take d 1the bus of physical distance needs the cost paid.P 2(d 2) represent by the cost of the micro-hinge of walking, P 3(d 3) represent by the cost of the micro-hinge of bicycle, wherein d 2, d 3represent walking respectively and can reach micro-hinge diameter and bicycle can reach micro-hinge diameter.
Technical conceive of the present invention is: the present invention proposes the concept of the micro-hinge of virtual transfer, by building a kind of multi-mode Public Transport Transfer method with the micro-hinge of virtual transfer of Space-P, Cluster-W, Cluster-B network design, trip for user provides more diversified choice for traveling, has enriched user and to have gone on a journey experience.
Beneficial effect of the present invention is: can by the multimode network model of this thinking structure city based on the micro-hinge of virtual transfer.This, by providing the selection scheme of more novelties and use for the public trip of user, advocates user's Green Travel simultaneously, reduces city carbon emission amount.
As mentioned above, the specific implementation step of enforcement makes the present invention more clear.In the protection domain of spirit of the present invention and claim, any amendment make the present invention and change, all fall into protection scope of the present invention.
Accompanying drawing explanation
Fig. 1 is that three layers of coupling public traffic network build schematic diagram
Embodiment
Below in conjunction with accompanying drawing, the present invention will be further described.
With reference to Fig. 1, a kind of multi-mode Public Transport Transfer method with the micro-hinge of virtual transfer, comprises the following steps:
Step one: the oriented passenger transfer network Space-P of weighting building city bus, in public transport Space-P, node definition in network is bus station, if two bus stations are in same public bus network, then have an even limit between these two websites, between two websites, the length of public bus network is that this connects the weights on limit;
Step 2: build walking and can reach micro-hinge network C luster-W, Cluster-W network is made up of several weighting complete subgraphs, each subgraph is a micro-hinge WMHub of walking, and for each WMHub, it represents that the Euclidean distance between any two nodes is less than threshold value Γ wbus station's point group of=500m, Euclidean distance maximum between any two points is wherein defined as the diameter WMD of this WMHub.In each WMHub, between any two points, limit is represented and can be arrived by short distance walking, and its weights are unified to be represented with corresponding WMD, and as shown in the Cluster-W in Fig. 1, in WMHub, the actual range of a point and b point is less than 500m, then a, b 2 is connected;
Step 3: build public bicycles and can reach micro-hinge network C luster-B, Cluster-B network integration city public bicycle geographical location information, be made up of several weighting complete subgraphs, each subgraph is expressed as a micro-hinge BMHub of public bicycles.Each BMHub represents that the Euclidean distance between any two nodes is less than threshold value Γ bbus station's point group of=2000m, Euclidean distance maximum between any two points is wherein defined as the diameter BMD of this BMHub.In each BMHub, between any two points, limit is represented and can be ridden arrival by the public bicycles short distance of near nodal, its weights are unified to be represented with corresponding BMD, as shown in the Cluster-B network in Fig. 1, comprises BMHub1 and BMHub2 two micro-hinges of bicycle in network;
Step 4: build three layers of coupling Public Traffic Network Model, by bus-route network Space-P, walking can reach micro-hinge network C luster-W and public bicycles can reach micro-hinge network C luster-B as three network layers, this three-layer network is because node is bus station, therefore there is obvious coupled relation at bus station place, thus form three layers of coupling network.As shown in Figure 1, intercouple with a, the b in Cluster-W in Space-P network, intercouple with a, b, f and the d in Cluster-B, e in Space-P network;
Step 5: the multi-mode transfer method with virtual micro-hinge, based on three layers of coupling network model, computing node i to node j trip cost C (i in a network, j), the relatively size of trip cost value, get optimal value to determine the route scheme in this stage, process is as follows:
5.1 initialization: make o represent start node, N represents the set of network node.Node o is added in N, i.e. N={o}, to all node v not in N, has:
Directly can reach in formula (2) to refer to have in Space-P network node and connect limit, be present in WMHub or be present in wherein one or more situations in BMHub, then by taking bus, walking, weights are by bike recorded in three-dimensional array S={P 1, P 2, P 3, remove the transfer strategy that minimum value in array S is defined as now;
5.2 find a node w not in N, and wherein D (w), joins w in N, then to all node v not in N, the value of original D (v) is upgraded by less value in [D (v), D (w)+C (w, v)].Minimum cost in the S of peek group is simultaneously as transfer strategy now;
5.3 repeat step 6.2, know till finding destination node.
Further, in described step 3, the method building BMHub network is: when traveling through the position data of bus stop, selected distance bus station distance is less than the bicycle website of short distance threshold value, here the threshold value of setting search scope is short distance threshold value (such as 300m), namely only considers that bus stop can arrive the distance range of Cycle Hire point by short distance walking.
Further, in described step 5, calculate the cost of transfer strategy, the formula of trip cost C (i, j) is defined as:
C(i,j)=T(x)+P 1(d 1)+P 2(d 2)+P 3(d 3)(4)
Wherein, C (i, j) represents the total cost paid required for from node i to node j, and T (x) represents that user uses the cost of bus transfering number of times x in bus trip, P 1(d 1) represent and take d 1the bus of physical distance needs the cost paid, P 2(d 2) represent by the cost of the micro-hinge of walking, P 3(d 3) represent by the cost of the micro-hinge of bicycle, wherein d 2, d 3represent walking respectively and can reach micro-hinge diameter and bicycle can reach micro-hinge diameter.
As mentioned above, the specific implementation step that this patent is implemented makes the present invention more clear, and the concept that combined with virtual changes to micro-hinge provides the structure principle of three-layer network, devises multimodal Bus Transfer Algorithm simultaneously.In the protection domain of spirit of the present invention and claim, any amendment make the present invention and change, all fall into protection scope of the present invention.

Claims (3)

1. there is a multi-mode Public Transport Transfer method for the micro-hinge of virtual transfer, it is characterized in that: comprise the steps:
Step one: the oriented passenger transfer network Space-P of weighting building city bus, in public transport Space-P, node definition in network is bus station, if two bus stations are in same public bus network, then have an even limit between these two websites, between two websites, the length of public bus network is that this connects the weights on limit;
Step 2: build walking and can reach micro-hinge network C luster-W, Cluster-W network is made up of weighting complete subgraph, each subgraph is a micro-hinge WMHub of walking, and for each WMHub, it represents that the Euclidean distance between any two nodes is less than threshold value Γ wbus station's point group, Euclidean distance maximum between any two points is wherein defined as the diameter WMD of this WMHub, and in each WMHub, between any two points, limit is represented and to be arrived by short distance walking, and the unified WMD by correspondence of its weights represents;
Step 3: build public bicycles and can reach micro-hinge network C luster-B, Cluster-B network integration city public bicycle geographical location information, be made up of weighting complete subgraph, each subgraph is expressed as a micro-hinge BMHub of public bicycles, and each BMHub represents that the Euclidean distance between any two nodes is less than threshold value Γ bbus station's point group, Euclidean distance maximum between any two points is wherein defined as the diameter BMD of this BMHub, in each BMHub, between any two points, limit is represented and to be ridden arrival by the public bicycles short distance of near nodal, and the unified BMD by correspondence of its weights represents;
Step 4: build three layers of coupling Public Traffic Network Model, by bus-route network Space-P, walking can reach micro-hinge network C luster-W and public bicycles can reach micro-hinge network C luster-B as three network layers, this three-layer network is because node is bus station, therefore there is obvious coupled relation at bus station place, thus form three layers of coupling network;
Step 5: the multi-mode transfer method with virtual micro-hinge, based on three layers of coupling network model, computing node i to node j trip cost C (i in a network, j), the relatively size of trip cost value, get optimal value to determine the route scheme in this stage, process is as follows:
5.1 initialization: make o represent start node, N represents the set of network node, adds in N, i.e. N={o} by node o, to all node v not in N, has:
Directly can reach in formula (1) and refer to there is company limit in Space-P network node, is present in WMHub or is present in wherein one or more situations in BMHub; Then by taking bus, walking, weights are by bike recorded in three-dimensional array S={P 1, P 2, P 3, remove the transfer strategy that minimum value in array S is defined as now;
5.2 find a node w not in N, wherein D (w), w is joined in N, then to all node v not in N, with [D (v), D (w)+C (w, v)] in less value upgrade the value of original D (v), the minimum cost in the S of peek group is simultaneously as transfer strategy now;
5.3 repeat step 5.2, know till finding destination node.
2. a kind of multi-mode Public Transport Transfer method with the micro-hinge of virtual transfer as claimed in claim 1, it is characterized in that: in described step 3, the method building BMHub network is: when traveling through the position data of bus stop, selected distance bus station distance is less than the bicycle website of short distance threshold value, namely the threshold value of setting search scope is short distance threshold value, considers that bus stop arrives the distance range of Cycle Hire point by short distance walking.
3. a kind of multi-mode Public Transport Transfer method with the micro-hinge of virtual transfer as claimed in claim 1 or 2, is characterized in that: in described step 5, calculates the cost of transfer strategy, and the formula of trip cost C (i, j) is defined as:
C(i,j)=T(x)+P 1(d 1)+P 2(d 2)+P 3(d 3)(2)
Wherein, C (i, j) represents the total cost paid required for from node i to node j, and T (x) represents that user uses the cost of bus transfering number of times x in bus trip, P 1(d 1) represent and take d 1the bus of physical distance needs the cost paid, P 2(d 2) represent by the cost of the micro-hinge of walking, P 3(d 3) represent by the cost of the micro-hinge of bicycle, wherein d 2, d 3represent walking respectively and can reach micro-hinge diameter and bicycle can reach micro-hinge diameter.
CN201510526947.0A 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 Active CN105160429B (en)

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 true CN105160429A (en) 2015-12-16
CN105160429B 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)

Cited By (5)

* Cited by examiner, † Cited by third party
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
CN107563028A (en) * 2017-08-22 2018-01-09 南京邮电大学 A kind of public transport subway coupling network construction method based on spatial network
CN109523064A (en) * 2018-10-26 2019-03-26 上海城市交通设计院有限公司 A kind of micro- hinge of intelligence based on multi-internet integration
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)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102880642A (en) * 2012-08-20 2013-01-16 浙江工业大学 Bus transfer method based on weighted directed network model
CN102880641A (en) * 2012-08-20 2013-01-16 浙江工业大学 Parametric bus transfer method in consideration of short-distance walking station pair
CN104200650A (en) * 2014-08-27 2014-12-10 浙江工业大学 Multimode public transportation transferring method in urban congestion period

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102880642A (en) * 2012-08-20 2013-01-16 浙江工业大学 Bus transfer method based on weighted directed network model
CN102880641A (en) * 2012-08-20 2013-01-16 浙江工业大学 Parametric bus transfer method in consideration of short-distance walking station pair
CN104200650A (en) * 2014-08-27 2014-12-10 浙江工业大学 Multimode public transportation transferring method in urban congestion period

Cited By (7)

* Cited by examiner, † Cited by third party
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
CN107563028A (en) * 2017-08-22 2018-01-09 南京邮电大学 A kind of public transport subway coupling network construction method based on spatial network
CN107563028B (en) * 2017-08-22 2020-09-08 南京邮电大学 Public transport-subway coupling network construction method based on space network
CN109523064A (en) * 2018-10-26 2019-03-26 上海城市交通设计院有限公司 A kind of micro- hinge of intelligence based on multi-internet integration
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

Also Published As

Publication number Publication date
CN105160429B (en) 2018-10-23

Similar Documents

Publication Publication Date Title
CN104200650B (en) Multimode public transportation transferring method in urban congestion period
Sun et al. Discovering time-dependent shortest path on traffic graph for drivers towards green driving
CN103337189B (en) A kind of vehicle route guidance method dynamically divided based on section
CN103278168B (en) A kind of paths planning method evaded towards traffic hot spot
CN102176283B (en) Traffic network simplifying model and navigating method based on same
CN105160429A (en) Multi-mode public transportation transfer method with virtual transfer micro-hubs
Brands et al. Modelling public transport route choice, with multiple access and egress modes
CN107563028B (en) Public transport-subway coupling network construction method based on space network
CN101149268A (en) Road topology data model for navigation and calculation method
CN107490384B (en) Optimal static path selection method based on urban road network
CN108681795B (en) Electric automobile charging load space-time prediction method under constraint of urban traffic network and user travel chain
CN102436466A (en) Bus transfer inquiry method based on geographic information system (GIS) classification
CN103413433B (en) A kind of Public Transport Transfer method during traffic congestion based on flow information
CN107133700A (en) Mobile phone signaling data road network method based on R* tree indexes
CN104200649A (en) System and method for dispatching and distributing peak traffic hour route resources based on application in advance
CN101650705A (en) Method and device for constructing bus transfer network
CN107092986B (en) Bus passenger travel path selection method based on stations and collinear operation
CN106225800A (en) Environmentally friendly automobile navigation path construction method based on real-time road condition information
CN106897791B (en) Method for constructing public transport subway composite network model
CN102567389B (en) Combined traffic network forming method and equipment as well as path searching method and equipment
CN106294869A (en) A kind of public traffic network modeling method with public bicycles subnet based on spatial network
CN107063279A (en) A kind of Traffic Net combined type introduction route generating means and route generation method
Harsha et al. Sustainable urban transport policies to improve public transportation system: a case study of Bengaluru, India
CN101807348A (en) Dynamic network navigation system and method
Li et al. Cycling in Toronto, Ontario, Canada: Route choice behavior and implications for infrastructure planning

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