CN105468761A - Weighting public transportation transfer method - Google Patents
Weighting public transportation transfer method Download PDFInfo
- Publication number
- CN105468761A CN105468761A CN201510870218.7A CN201510870218A CN105468761A CN 105468761 A CN105468761 A CN 105468761A CN 201510870218 A CN201510870218 A CN 201510870218A CN 105468761 A CN105468761 A CN 105468761A
- Authority
- CN
- China
- Prior art keywords
- transfer
- network
- public transportation
- scheme
- weighting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
the invention relates to a weighting public transportation transfer method. Transfer times, a taking distance, a walking distance and the like are all transformed into a weight, and influence of factors is comprehensively considered. The weighting public transportation transfer method comprises the following steps of: S1, setting public transportation transfer related parameters; S2, combining a public transportation network with a pedestrian network to generate a new network G; and S3, in the network, applying an improved A* algorithm, and retaining first two optimal transfer plans from a certain station to other stations. The weighting public transportation transfer method considers influence of the comprehensive factors of the transfer times, the taking distance, the walking distance and the like on traveling of people, proposes a new public transportation transfer scheme generated by combining the factors and comprehensively considering, and is higher in speed and better in real-time performance in practical application.
Description
Technical field
The present invention relates to a kind of concrete Public Transport Transfer method, be specifically related to the transfer plan obtaining more conforming with between any two websites people's demand by setting parameter, have speed fast, real-time is good, the feature that result is excellent.
Background technology
Along with the raising of city bus densification degree, people's riding scheme also becomes more diversified thereupon.From this numerous scheme, how to choose the most suitable one or several schemes become the problem that and numerous citizen are personally correlated with.People generally pay close attention to number of transfer number, the by bus distance of distance, the distance of walking distance.Consider these factors, and provide the demand that recommendation paths can meet user more.
Existing Public Transport Transfer scheme be all find all transfer plans according to certain rule after analyze transfer plan again, provide the result of needs." the Public Transport Transfer querying method based on GIS classification " of such as patent No. CN102436466A is found by matrix multiplication once to change to, and the schemes such as twice transfer, then carry out analysis path in conjunction with GIS.The patent No. finds the excellent scheme of K before single website to every other website for " a kind of parametrization Public Transport Transfer method considering that closely walking website is right of CN102880641A " by BFS (Breadth First Search).But, this kind of method be find all schemes after, then the scheme of therefrom getting front K excellent is preserved, and also has the space of improving the time.Meanwhile, this patent be find scheme according to number of transfer after analyze according to the parameter of setting again, and the scheme that could not directly find user to expect.
The present invention has redesigned a kind of method solving transfer plan in public traffic network, have employed a kind of Astar algorithm of optimization.User sets number of transfer, walking distance, the parameter of running distance, directly can be obtained the circuit of user's expectation, thus avoid unnecessary search, be optimized in time by the present invention.
Summary of the invention
The present invention mainly proposes a kind of Public Transport Transfer method of cum rights, constructs Public Traffic Network Model being realized technically with in data.
For achieving the above object, technical scheme provided by the invention is as follows.
The Public Transport Transfer method of a cum rights, comprising:
Weighting parameter setting module, be used for setting number of transfer, by bus distance, walking distance is on the impact of scheme.
Public traffic network builds module, builds public traffic network and walking network, and by these two network integrations to together.
Computing module, by a kind of Kstar algorithm of improvement, calculates the excellent transfer plan of front K between single website to other websites.
Optimize module, in computation process, remove the scheme of redundancy, prioritization scheme result.
Database module, preserves the transfer plan between any two points in a database.
Benefit of the present invention is: propose a kind of transfer algorithm newly, and in conjunction with number of transfer, distance by bus, walking distance etc., solving speed is more excellent, and the scheme obtained also more conforms with user's request.
Accompanying drawing explanation
Accompanying drawing is used to provide a further understanding of the present invention, and forms a part for instructions, together with embodiments of the present invention for explaining the present invention, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is system flowchart of the present invention
Embodiment
The present invention mainly proposes a kind of Public Transport Transfer method of cum rights, constructs Public Traffic Network Model technically and realized with structure in data.
For achieving the above object, technical scheme provided by the invention is as follows.
The Public Transport Transfer method of a cum rights, comprising:
Weighting parameter setting module, be used for setting number of transfer, by bus distance, walking distance is on the impact of scheme.
Passenger transfer network builds module, builds public traffic network and walking network, and by these two network integrations to together.
Computing module, by a kind of Kstar algorithm of improvement, calculates the excellent transfer plan of front K between single website to other websites.
Optimize module, in computation process, remove the scheme of redundancy, prioritization scheme result.
Database module, preserves the transfer plan between any two points in a database.
Be below in conjunction with one preferably example describe the present invention.
As shown in Figure 1, in weighting parameter setting module, user inputs number of transfer, by bus distance, the parameter of walking distance.In this example, 1 transfer weights are that by bus distance weights are 1,500m walking distance weights to 1,5km is 1, and the weights of 5km, walking 500m and 1 transfer are suitable so by bus.Be used for the users satisfaction degree of expression scheme.User sets P to ensure that number of transfer is no more than P, necessarily decreases invalid scheme.User inputs walking distance threshold parameter W, sets up two-way walking limit between the website being less than W in distance.A public bus network sets up oriented garage limit between website.Website and limit constitute passenger transfer network, by computing module and optimize module and obtain transfer plan, are being kept at database by database module, and user only needs Query Database just passable to transfer plan between website.Idiographic flow is as follows:
Step one: user's input parameter, once to change to as 1, setting walking is equivalent to how much rice once change to, and garage's how much rice is equivalent to once change to.User sets the threshold value of walking, represents that the website within how much rice thinks that walking can reach.
Step 2: build passenger transfer network figure.Be summit in conjunction with public traffic network with website, be that limit builds passenger transfer network with circuit, this limit is recorded as garage limit.When the spacing of website is less than given walking threshold value, this limit is joined passenger transfer network, and is recorded as walking limit.
Step 3: for passenger transfer network obtained above, travels through each website.According to the weights of setting, apply a kind of Astar algorithm of improvement, and remove nonsensical redundancy scheme, thus obtain transfer plan between this website to other websites.
The Astar algorithm detailed process improved is as follows:
3.1) build a Priority Queues q, preserve website, be preferential with the scheme that the weights v from source point to this website is less, first source point is put in q, now the v of source point is 0;
3.2) build an array, preserve the number of times of website dequeue, wherein the number of times of source point dequeue is K-1, guarantees a source point dequeue once with this, other be initialized as 0, represent and also do not find source point to arrive the path of other websites.
3.3) when the time that queue is not empty, by website T dequeue minimum for weights, judge terminal dequeue number of times C in this scheme, if C is more than or equal to K time, represent and have found the little transfer plan of front K, a dequeue, does not deal with.If be less than K time, and scheme not redundancy, then retrospective search has arrived the C short circuit from source point to this website.Recorded.If redundancy, do not record the program.
3.4) above-mentioned website T dequeue number of times is added 1, its other websites T ' be connected is looked for by passenger transfer network from this website T, if T ' dequeue number of times is less than K time, and from T to T ' not redundancy, then T ' is joined queue, and record it be by source point to T point ground C short circuit after obtain so that backtracking.
3.5) 3.3 are got back to), when queue is empty, just obtains source point and be no more than at most the optimum road of K bar to other all websites.And quality is successively decreased successively according to the weights of setting.
Step 4: optimize module, in the process calculated, is optimized transfer plan, removes the scheme of redundancy two positions.
4.1) when dequeue, source point to some schemes of terminal and the transfer situation of scheme process before just the same because first dequeue is preferably, can be therefore redundancy by the judgement of rear dequeue.
4.2) when certain website t enters queue, arrive if the final step of dequeue website is before through garage road, and website t also can be arrived in this garage road, then this website is not as queue.
4.3), during dequeue, if the scheme of discovery number of transfer has exceeded given transfer limit p, then this circuit has been judged to be redundancy.
Step 4: database module, preserves the result obtained in a database, and user inquires about start site and stops website, and directly from database, inquiry obtains scheme.
In sum, the present invention
Above telling is only the present invention and preferably executes example, be not limited to the present invention, enter shop with reference to previous embodiment to invention has been detailed description, for a person skilled in the art, it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement for wherein technical characteristic.Within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (5)
1. weighting parameter setting module, be used for setting number of transfer, by bus distance, walking distance is on the impact of scheme.
2. passenger transfer network builds module, builds public traffic network and walking network, and by these two network integrations to together.
3. computing module, by a kind of Kstar algorithm of improvement, calculates the excellent transfer plan of front K between single website to other websites.
4. optimize module, in computation process, remove the scheme of redundancy, prioritization scheme result.
5. database module, preserves the transfer plan between any two points in a database.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510870218.7A CN105468761A (en) | 2015-12-02 | 2015-12-02 | Weighting public transportation transfer method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510870218.7A CN105468761A (en) | 2015-12-02 | 2015-12-02 | Weighting public transportation transfer method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105468761A true CN105468761A (en) | 2016-04-06 |
Family
ID=55606461
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510870218.7A Pending CN105468761A (en) | 2015-12-02 | 2015-12-02 | Weighting public transportation transfer method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105468761A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107092986A (en) * | 2017-04-13 | 2017-08-25 | 上海理工大学 | The bus passenger travel route choice method based on website and collinearly run |
| CN108537362A (en) * | 2018-03-06 | 2018-09-14 | 武汉蓝泰源信息技术有限公司 | Public Transport Transfer method based on bidirectional research and evaluation function prune approach |
-
2015
- 2015-12-02 CN CN201510870218.7A patent/CN105468761A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107092986A (en) * | 2017-04-13 | 2017-08-25 | 上海理工大学 | The bus passenger travel route choice method based on website and collinearly run |
| CN108537362A (en) * | 2018-03-06 | 2018-09-14 | 武汉蓝泰源信息技术有限公司 | Public Transport Transfer method based on bidirectional research and evaluation function prune approach |
| CN108537362B (en) * | 2018-03-06 | 2022-01-18 | 武汉蓝泰源信息技术有限公司 | Bus transfer method based on bidirectional search and estimation function pruning mode |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Schermer et al. | A b ranch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone | |
| Chen et al. | Optimal deployment of autonomous vehicle lanes with endogenous market penetration | |
| Fricker et al. | Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity | |
| CN113886605A (en) | Knowledge graph processing method and system | |
| CN109612488B (en) | Big data micro-service-based mixed travel mode path planning system and method | |
| CN107767322B (en) | Carpooling method and device | |
| CN107167151B (en) | Bus route setting method, route planning method and device | |
| CN111815946A (en) | Method and device for determining abnormal road section, storage medium and electronic equipment | |
| Zhang et al. | Distributed trip selection game for public bike system with crowdsourcing | |
| CN111862590A (en) | Road condition prediction method, road condition prediction device and storage medium | |
| Rahim et al. | An intelligent content caching protocol for connected vehicles | |
| Buinevich et al. | Combine method of forecasting VANET cybersecurity for application of high priority way | |
| CN105468761A (en) | Weighting public transportation transfer method | |
| CN106558159B (en) | Carpooling method and device | |
| Salamai | An Approach Based on Decision-Making Algorithms for Qos-Aware Iot Services Composition. | |
| Aminizadeh et al. | Cost minimization scheduling for deadline constrained applications on vehicular cloud infrastructure | |
| CN116698075B (en) | Road network data processing method and device, electronic equipment and storage medium | |
| Long et al. | Dynamic truck–uav collaboration and integrated route planning for resilient urban emergency response | |
| Barros et al. | Load balancing in D2D networks using reinforcement learning | |
| Celsi et al. | On the many-to-many carpooling problem in the context of multi-modal trip planning | |
| Horváth et al. | Route planning methodology with four-step model and dynamic assignments | |
| Rodrigues et al. | Hybrid context-aware multimodal routing | |
| Hasuike et al. | A route recommendation system for sightseeing with network optimization and conditional probability | |
| Zhang et al. | An augmented estimation of distribution algorithm for multi-carpooling problem with time window | |
| Despaux et al. | A study of the multi-trip vehicle routing problem with time windows and heterogeneous fleet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160406 |
|
| WD01 | Invention patent application deemed withdrawn after publication |