CN108509659A - Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme - Google Patents
Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme Download PDFInfo
- Publication number
- CN108509659A CN108509659A CN201810499404.8A CN201810499404A CN108509659A CN 108509659 A CN108509659 A CN 108509659A CN 201810499404 A CN201810499404 A CN 201810499404A CN 108509659 A CN108509659 A CN 108509659A
- Authority
- CN
- China
- Prior art keywords
- riding scheme
- riding
- scheme
- website
- transfer
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Navigation (AREA)
Abstract
The invention discloses recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of a kind of riding scheme.The present invention finds out the first riding scheme that number of transfer is minimum in start site to the circuit of targeted sites in going directly matrix from the website built in advance using shortest path first, and according to each first riding scheme found out, build Transfer Matrix, then according to Transfer Matrix and the through matrix of website, build the transfer identity matrix for storing forerunner's website of targeted sites in each first riding scheme, any two forerunner website between number of transfer minimum second riding scheme is then based in backtracking method determination transfer identity matrix in each first riding scheme, it is final need to only choose at least one second riding scheme from the second minimum riding scheme of obtained all numbers of transfer and recommend user the purpose for recommending optimal riding scheme can be realized, greatly improve user experience.
Description
Technical field
The present invention relates to recommendation method, apparatus, the terminals of technical field of information processing more particularly to a kind of riding scheme to set
Standby and readable storage medium storing program for executing.
Background technology
With the development of economy, the acceleration of urbanization, megapolis population is more and more, and city size is increasing,
So that citizen must rely on the vehicles that could facilitate trip.By taking a broad survey discovery to civic, by public transport and subway
Trip is the first choice of people.Therefore, public transport, subway line, intelligent bus inquiry system are inquired when outgoing in order to facilitate user
As the hot spot of research.
The various intelligent bus inquiry systems released at present, when recommending riding scheme for passenger, typically directly from existing
It is directly extracted in riding scheme between the different websites to prestore in some public bus network libraries, then successively by the data extracted
It is illustrated in the user terminal interface of passenger, user needs that browsing oneself is gone to check, selected from numerous riding routes of displaying
It takes, since its is cumbersome, riding scheme recommendation is not smart enough, thus cannot be satisfied the demand of passenger at all.
The above is only used to facilitate the understanding of the technical scheme, and is not represented and is recognized that the above is existing skill
Art.
Invention content
The main purpose of the present invention is to provide a kind of recommendation method, apparatus of riding scheme, terminal device and readable deposit
Storage media, it is intended to which it is that user directly recommends to solve the website that intelligent bus inquiry system can not be inputted according to passenger in the prior art
The technical issues of optimal riding scheme.
To achieve the above object, the present invention provides a kind of recommendation method of riding scheme, the method includes following steps
Suddenly：
User terminal is instructed in response to the circuit query that user triggers, and obtains start site input by user and Target Station
Point；
Using shortest path first, the start site is found out to the mesh in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer in the circuit of labeling station point, and according to the first riding scheme structure transfer square found out
Gust, the start site is stored with to all riding schemes that can be gone directly of the targeted sites in the through matrix of the website；
According to the Transfer Matrix and the through matrix of the website, structure transfer identity matrix, the transfer identity matrix
For storing forerunner's website in each first riding scheme, forerunner's website is positioned at the start site and the Target Station
Website between point；
Based on backtracking method, number of transfer is minimum between any two forerunner's website in each first riding scheme second is determined
Riding scheme；
Choose at least one second riding scheme from obtained each second riding scheme, and by least one institute of selection
It states the second riding scheme and recommends the user.
Preferably, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user before, the method further includes：
It determines the corresponding boarding station number of each second riding scheme, and selects the second minimum riding scheme of boarding station number；
Correspondingly, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user, specifically include：
At least one second riding scheme is chosen in the second riding scheme minimum from obtained each boarding station number, and will choosing
At least one second riding scheme taken recommends the user.
Preferably, at least one second is chosen in second riding scheme minimum from obtained each boarding station number to ride
Scheme, and before at least one second riding scheme of selection is recommended the user, the method further includes：
It determines the corresponding total admission fee by bus of the second minimum riding scheme of each boarding station number, and selects by bus that total admission fee is most
The second low riding scheme；
Correspondingly, at least one second is chosen in second riding scheme minimum from obtained each boarding station number to ride
Scheme, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will
At least one second riding scheme chosen recommends the user.
Preferably, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user before, the method further includes：
It determines each second riding scheme corresponding riding time, and selects riding time shortest second riding scheme；
Correspondingly, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user, specifically include：
At least one second riding scheme is chosen from obtained shortest second riding scheme of each riding time, and will choosing
At least one second riding scheme taken recommends the user.
Preferably, described to choose at least one second from obtained shortest second riding scheme of each riding time and ride
Scheme, and before at least one second riding scheme of selection is recommended the user, the method further includes：
It determines the corresponding total admission fee by bus of shortest second riding scheme of each riding time, and selects by bus that total admission fee is most
The second low riding scheme；
Correspondingly, described to choose at least one second from obtained shortest second riding scheme of each riding time and ride
Scheme, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will
At least one second riding scheme chosen recommends the user.
Preferably, described to utilize shortest path first, find out the starting in going directly matrix from the website built in advance
In website to the circuit of the targeted sites before the first minimum riding scheme of number of transfer, the method further includes：
The through matrix of the website built in advance is imported into physical memory space from virtual memory space；
Correspondingly, described to utilize shortest path first, find out the starting in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer, specifically includes in website to the circuit of the targeted sites：
The physical memory space is accessed, using shortest path first, is found out in going directly matrix from the website described
The first minimum riding scheme of number of transfer in start site to the circuit of the targeted sites.
Preferably, the shortest path first is Dijkstra algorithm；
Correspondingly, the profit utilizes shortest path first, from described in being found out during the website built in advance goes directly matrix
The first minimum riding scheme of number of transfer, specifically includes in initial station point to the circuit of the targeted sites：
Using Dijkstra algorithm, the start site is found out in going directly matrix from the website built in advance to described
The first minimum riding scheme of number of transfer in the circuit of targeted sites.
In addition, to achieve the above object, the present invention also provides a kind of recommendation apparatus of riding scheme, described device packets
It includes：
Respond module, the circuit query for being triggered in response to user instruct；
Acquisition module, for obtaining start site input by user and targeted sites；
First structure module finds out institute for utilizing shortest path first in going directly matrix from the website built in advance
The first riding scheme that number of transfer is minimum in start site to the circuit of the targeted sites is stated, and according to first found out
Riding scheme build Transfer Matrix, the website go directly matrix in be stored with the start site to the targeted sites are all can
With through riding scheme；
Second structure module, for according to the Transfer Matrix and the through matrix of the website, building transfer identity matrix,
The transfer identity matrix is used to store forerunner's website in each first riding scheme, and forerunner's website is positioned at the starting
Website between website and the targeted sites；
Determining module is determined in each first riding scheme and is changed between any two forerunner's website for being based on backtracking method
The second minimum riding scheme of number；
Recommending module, for choosing at least one second riding scheme from obtained each second riding scheme, and will choosing
At least one second riding scheme taken recommends the user.
In addition, to achieve the above object, the present invention also provides a kind of terminal device, the terminal device includes：Storage
Device, processor and the recommended program for being stored in the riding scheme that can be run on the memory and on the processor, institute
State the step of recommended program of riding scheme is arranged for carrying out the recommendation method of the riding scheme.
In addition, to achieve the above object, the present invention also provides a kind of readable storage medium storing program for executing, the readable storage medium storing program for executing is
Computer readable storage medium, is stored with the recommended program of riding scheme on the computer readable storage medium, it is described by bus
The step of recommendation method of the riding scheme is realized when the recommended program of scheme is executed by processor.
The present invention finds out start site to target in going directly matrix from the website built in advance using shortest path first
The first minimum riding scheme of number of transfer in the circuit of website, and according to the first riding scheme found out, structure transfer square
Battle array builds the forerunner for storing targeted sites in each first riding scheme then according to Transfer Matrix and the through matrix of website
The transfer identity matrix of website is then based in backtracking method determination transfer identity matrix in each first riding scheme before any two
The second minimum riding scheme of number of transfer between drive website, it is final only to multiply from obtained all numbers of transfer at least second
At least one second riding scheme is chosen in vehicle scheme recommends user.Arbitrary two can be obtained by above-mentioned processing mode
The minimum riding scheme of all numbers of transfer between a website, thus arbitrarily choose a riding scheme and recommend user and be all
Optimal riding scheme, greatly improves user experience.
Description of the drawings
Fig. 1 is the structural schematic diagram of the terminal device for the hardware running environment that the embodiment of the present invention is related to；
Fig. 2 is the flow diagram of the recommendation method first embodiment of riding scheme of the present invention；
Fig. 3 is the flow diagram of the recommendation method second embodiment of riding scheme of the present invention；
Fig. 4 is the flow diagram of the recommendation method 3rd embodiment of riding scheme of the present invention；
Fig. 5 is the high-level schematic functional block diagram of the recommendation apparatus of riding scheme of the present invention.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific implementation mode
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.
Referring to Fig.1, Fig. 1 is the structural representation of the terminal device for the hardware running environment that the embodiment of the present invention is related to
Figure, which can be the equipment such as mobile phone, tablet computer, personal computer.
As shown in Figure 1, the terminal device may include：Processor 1001, such as central processing unit (Central
Processing Unit, CPU), communication bus 1002, user interface 1003, network interface 1004, memory 1005.Wherein,
Communication bus 1002 is for realizing the connection communication between these components.User interface 1003 may include display screen
(Display), touch screen (touch screen), input unit such as keyboard (Keyboard), mouse (Mouse), optionally,
User interface 1003 can also include standard wireline interface and wireless interface.Network interface 1004 may include optionally standard
Wireline interface, wireless interface (such as Wireless Fidelity (WIreless-FIdelity, WI-FI) interface).Memory 1005 can be
High-speed RAM memory can also be stable memory (non-volatile memory), such as magnetic disk storage.Memory
The 1005 optional storage devices that can also be independently of aforementioned processor 1001.
It will be understood by those skilled in the art that structure shown in Fig. 1 does not constitute the restriction to terminal device, in reality
Terminal device may include either combining certain components or different components than illustrating more or fewer components in
Arrangement.
Therefore, as shown in Figure 1, as may include in a kind of memory 1005 of computer storage media operating system,
The recommended program of network communication module, Subscriber Interface Module SIM and riding scheme.
In terminal device shown in Fig. 1, network interface 1004 mainly with establish terminal device with storage intelligent bus look into
The communication connection of the server of all data needed for inquiry system；The input that user interface 1003 is mainly used for receiving user refers to
It enables；The terminal device calls the recommended program of the riding scheme stored in memory 1005 by processor 1001, and executes
It operates below：
User terminal is instructed in response to the circuit query that user triggers, and obtains start site input by user and Target Station
Point；
Using shortest path first, the start site is found out to the mesh in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer in the circuit of labeling station point, and according to the first riding scheme structure transfer square found out
Gust, the start site is stored with to all riding schemes that can be gone directly of the targeted sites in the through matrix of the website；
According to the Transfer Matrix and the through matrix of the website, structure transfer identity matrix, the transfer identity matrix
For storing forerunner's website in each first riding scheme, forerunner's website is positioned at the start site and the Target Station
Website between point；
Based on backtracking method, number of transfer is minimum between any two forerunner's website in each first riding scheme second is determined
Riding scheme；
Choose at least one second riding scheme from obtained each second riding scheme, and by least one institute of selection
It states the second riding scheme and recommends the user.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
It determines the corresponding boarding station number of each second riding scheme, and selects the second minimum riding scheme of boarding station number；
Correspondingly, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user, specifically include：
At least one second riding scheme is chosen in the second riding scheme minimum from obtained each boarding station number, and will choosing
At least one second riding scheme taken recommends the user.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
It determines the corresponding total admission fee by bus of the second minimum riding scheme of each boarding station number, and selects by bus that total admission fee is most
The second low riding scheme；
Correspondingly, at least one second is chosen in second riding scheme minimum from obtained each boarding station number to ride
Scheme, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will
At least one second riding scheme chosen recommends the user.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
It determines each second riding scheme corresponding riding time, and selects riding time shortest second riding scheme；
Correspondingly, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user, specifically include：
At least one second riding scheme is chosen from obtained shortest second riding scheme of each riding time, and will choosing
At least one second riding scheme taken recommends the user.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
It determines the corresponding total admission fee by bus of shortest second riding scheme of each riding time, and selects by bus that total admission fee is most
The second low riding scheme；
Correspondingly, described to choose at least one second from obtained shortest second riding scheme of each riding time and ride
Scheme, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will
At least one second riding scheme chosen recommends the user.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
The through matrix of the website built in advance is imported into physical memory space from virtual memory space；
Correspondingly, described to utilize shortest path first, find out the starting in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer, specifically includes in website to the circuit of the targeted sites：
The physical memory space is accessed, using shortest path first, is found out in going directly matrix from the website described
The first minimum riding scheme of number of transfer in start site to the circuit of the targeted sites.
Further, the shortest path first is Dijkstra algorithm, and processor 1001 can call memory
The recommended program of the riding scheme stored in 1005 also executes following operation：
Correspondingly, the profit utilizes shortest path first, from described in being found out during the website built in advance goes directly matrix
The first minimum riding scheme of number of transfer, specifically includes in initial station point to the circuit of the targeted sites：
Using Dijkstra algorithm, the start site is found out in going directly matrix from the website built in advance to described
The first minimum riding scheme of number of transfer in the circuit of targeted sites.
This implementation through the above scheme, using shortest path first from the website built in advance go directly matrix in find out
The first minimum riding scheme of number of transfer in initial station point to the circuit of targeted sites, and it is square by bus according to first found out
Case builds Transfer Matrix, then according to Transfer Matrix and the through matrix of website, builds for storing mesh in each first riding scheme
The transfer identity matrix of forerunner's website of labeling station point is then based on backtracking method and determines each first riding scheme in transfer identity matrix
The second minimum riding scheme of number of transfer between middle any two forerunner website, final need to be from obtained all numbers of transfer
At least one second riding scheme is chosen in the second minimum riding scheme recommends user.It can by above-mentioned processing mode
To obtain the minimum riding scheme of all numbers of transfer between any two website, thus arbitrarily chooses a riding scheme and push away
It is all optimal riding scheme to recommend to user, greatly improves user experience.
Based on above-mentioned hardware configuration, the recommendation embodiment of the method for riding scheme of the present invention is proposed.
It is the flow diagram of the recommendation method first embodiment of riding scheme of the present invention with reference to Fig. 2, Fig. 2.
In the first embodiment, the recommendation method of the riding scheme includes the following steps：
S10：User terminal is instructed in response to the circuit query that user triggers, and obtains start site input by user and target
Website.
S20：Using shortest path first, the start site is found out to institute in going directly matrix from the website built in advance
The first riding scheme that number of transfer is minimum in the circuit of targeted sites is stated, and is changed according to the first riding scheme structure found out
Multiply matrix.
It should be understood that in the concrete realization, any two website, such as website A and website B, if there is circuit L
Pass through the two websites, we just claim the two websites that can go directly mutually, otherwise can not go directly.By the study found that
Meet the often more than one of the circuit by website A and website B conditions simultaneously in a particular application, thus by by website A with
All matrixes that through circuit can be given built-up between website B are the through matrixes of website.
Correspondingly, website described in the present embodiment goes directly, and store in matrix is then the start site to the target
All riding schemes that can be gone directly of website.
In addition, it is noted that in order to improve search speed, using shortest path first, from the station built in advance
The side by bus of find out in the start site to the circuit of the targeted sites that number of transfer is minimum in the through matrix of point first
Before case, matrix that the website that built in advance can go directly imports physical memory space from virtual memory space.
Correspondingly, described to utilize shortest path first, find out the starting in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer in website to the circuit of the targeted sites specifically becomes in physical memory sky
Between middle progress using shortest path first, go directly matrix from the website built in advance that is, by accessing the physical memory space
In find out the first minimum riding scheme of number of transfer in the start site to the circuit of the targeted sites.
It should be noted that physical memory space described in the present embodiment specifically refers to the memory often said in practical application
(Memory), also referred to as built-in storage is typically made of the part such as memory chip, circuit board, golden finger, such as user's end
Memory bar in end, since its processing speed is significantly larger than the speed of external storage setting, using shortest path first,
It is minimum to all numbers of transfer of the targeted sites that the start site is found out in going directly matrix from the website built in advance
It is empty by the way that the through matrix of the website built in advance is imported physical memory from virtual memory space before first riding scheme
Between, entire subsequent processing can be greatly speeded up, reduces period of reservation of number, and then promote user experience.
In addition, in the concrete realization, described shortest path first can be specifically that Otto Dix spy draws calculation in the present embodiment
Method is (referred to as：Dijkstra's algorithm).
Find out that number of transfer in the start site to the circuit of the targeted sites is minimum first to ride that is, above-mentioned
Scheme is specially：Using Dijkstra algorithm, found out in going directly matrix from the website built in advance the start site to
The first minimum riding scheme of number of transfer in the circuit of the targeted sites.
Since dijkstra's algorithm has made a kind of shortest path first of maturation, not detailed description in the present embodiment
Content, those skilled in the art can realize according to the existing occupation mode to dijkstra's algorithm, herein no longer
It repeats.
However, it should be understood that being given above only a kind of specific shortest path first, do not constitute to this Shen
Please technical solution any restriction, in a particular application, those skilled in the art can choose suitable most short as needed
Routing algorithm finds out in the start site to the circuit of the targeted sites in going directly matrix from the website built in advance and changes
Multiply the first minimum riding scheme of number, is not limited herein.
S30：According to the Transfer Matrix and the through matrix of the website, structure transfer identity matrix.
It should be noted that the transfer identity matrix of above-mentioned structure is mainly used for before storing in each first riding scheme
Drive website.
It should be understood that forerunner's website described in the present embodiment is positioned at the start site and the targeted sites
Between website.
S40：Based on backtracking method, determine in each first riding scheme that number of transfer between any two forerunner's website is minimum
Second riding scheme.
It should be noted that since backtracking method is a kind of algorithm idea, recurrence method reality may be used in a particular application
It is existing, therefore in the concrete realization, determine in the transfer identity matrix any two forerunner's website in each first riding scheme
Between the mode of the second minimum riding scheme of number of transfer can also directly be realized using recurrence method.
S50：Choose at least one second riding scheme from obtained each second riding scheme, and by least the one of selection
A second riding scheme recommends the user.
In order to make it easy to understand, the structure of each matrix and each in the recommendation method of the riding scheme provided below to the present embodiment
The lookup of riding scheme, is specifically described.
In order to facilitate narration, first arranged as follows：
1)viIndicate that start site, S are indicated from start site viThe set of the arbitrary website that can be gone directly to set out；
2) matrix D=(dij)n×n, dijIt indicates from start site viReach targeted sites vjThe minimum side by bus of number of transfer
Case, i.e. the first riding scheme, matrix D are Transfer Matrixes, and n × n indicates that the matrix is the matrix of a n rows n row, and the value of n is big
In equal to 1；
3) 0-1 Matrix Cs=(c is usedij)n×nIndicate that the through matrix of website, n × n indicate that the matrix is the square of a n rows n row
The value of battle array, n is more than or equal to 1, cijIt indicates from start site viReach targeted sites vjThe riding scheme that can be gone directly.If from
Start site viIt being capable of v to targeted sitesjIt goes directly, then cij=1；Otherwise, cij=∞.
4) matrix Pre=(preij)n×n, preij∈ 1,2 ..., and n } indicate start site viReach targeted sites vjWhen, in
Between website information.If prjij=p, then it represents that vpIt is vjForerunner's website.
4) vector backiFor storing transfer information, wherein i=0,2 ..., n-1.
5) transfer identity matrix F=(fij)n×n, fijIndicate start site viWith targeted sites vjRelationship, wherein i, j=
1,2,…,n.If in some transfer vector, viThe forerunner's website v for beingj, then fji=1；Otherwise fji=0.
Then, if it is minimum to the targeted sites number of transfer to find out described start site with dijkstra's algorithm
The first riding scheme, solution procedure approximately as：
Step 1：Initialize set S={ vi, dij=cijAnd preij=0, j=1,2 ..., n.
Step 2：Select website vpSo that dip=min { dij|vj∈ V-S } and S=S ∪ { vp}。
Step 3：Change start site viSet out into set V-S either site vkThe least bus change number that can be reached (should
The final corresponding riding scheme minimum for number of transfer of circuit).If cij+djk<dik, then least transfer number d is changedik=
cij+djk, while preik=j.
Step 4：It repeats step 2 and step 3 is n-1 times total, you can find out from start site viTo targeted sites vjMinimum change
Multiply number, the i.e. minimum riding scheme of number of transfer, wherein j ∈ { 1 ..., i-1, i+1 ..., n }.
Step 5：It exports from start site viTo targeted sites vjThe minimum riding scheme of number of transfer, i.e., first rides
Scheme, wherein j ∈ { 1,2 ..., n } and j ≠ i.
Specifically, in the concrete realization, substantially mode is as follows for above-mentioned several steps：
1) initialization stack pointer (traditionally stack pointer is referred to as TOP, is indicated below with top)：Top=0 and backtop=j, k
=j；
If 2) preik≠ i, then executeK=preik, backtop=k；
3) it repeats 2), until preik=i；
4) output website vk, wherein k=backq, q=top, top-1,0, q indicates that stack pointer executes obtained by decrement operations
Value；
5) j=1 ..., i-1, i+1 ..., n repeat process 1), 2), 3) and, 4) it is n-1 times total.
By aforesaid operations, solve it is described rise start site to the targeted sites number of transfer first riding at least
Scheme obtains Transfer Matrix, carries out the structure of transfer identity matrix, and execute and be based on backtracking method, determines the transfer mark square
In battle array in each first riding scheme between any two forerunner's website the second minimum riding scheme of number of transfer operation.
Specifically, according to row vector DiA transfer identity matrix F=(f is built with website Matrix C of going directlyij)n×n, with this
Matrix storage acquired from start site viTo targeted sites vjAll first riding schemes in targeted sites vjPredecessor
Point, i.e., if website vkIt is targeted sites vjForerunner's website, then fki=1, otherwise fki=0.
In addition, about transfer identity matrix F=(fij)n×nStructure, it is specific as follows：If k ≠ j and dij+cjk=dij,
Then fkj=1；Otherwise fkj=0.Wherein j, k=1,2 ..., n.
After the structure for completing transfer identity matrix, targeted sites v is sought with backtracking methodjTo start site viAll transfers
The minimum riding scheme of number, i.e. the second riding scheme use recursive function find (F, D below for convenience of describingi,vj,vi) indicate,
Its recursive procedure is as follows：
If there is vj=vi, then start site v is first allowediThen stacking allows all websites in stack to be popped successively, then
To one from start site viTo targeted sites vjThe minimum riding scheme of number of transfer.Otherwise, targeted sites v is first allowedjEnter
Stack then looks for targeted sites vjForerunner's website：If fjk=1, then execute recursive function find (F, Di,vk,vj), wherein k
=1,2 ..., n.Finally by the pop-up targeted sites v from stackjTo realize backtracking.
It should be noted that these are only for example, any restriction is not constituted to the technical solution of the application, in reality
In the application of border, those skilled in the art can select suitable method to build various matrixes as needed, and carry out above-mentioned place
Reason, is not limited herein.
Compared with prior art, the recommendation method of the riding scheme provided in the present embodiment, using shortest path first from
The website that builds in advance find out in start site to the circuit of targeted sites that number of transfer is minimum in matrix first that go directly multiplies
Vehicle scheme, and according to the first riding scheme found out, Transfer Matrix is built, then according to Transfer Matrix and the through square of website
Battle array builds the transfer identity matrix for storing forerunner's website of targeted sites in each first riding scheme, is then based on backtracking
Number of transfer is minimum between any two forerunner's website in each first riding scheme in method determination transfer identity matrix second multiplies
It is square by bus finally need to only to choose at least one second from the second minimum riding scheme of obtained all numbers of transfer for vehicle scheme
Case recommends user.It is minimum that all numbers of transfer between any two website can be obtained by above-mentioned processing mode
Riding scheme, thus arbitrarily choose a riding scheme and recommend user all and be optimal riding scheme, greatly improve user
Experience.
Further, as shown in figure 3, proposing the second reality of the recommendation method of riding scheme of the present invention based on first embodiment
Example is applied, in the present embodiment, before step S50, step S00 is increased, refers to Fig. 3.
In order to make it easy to understand, being specifically described below in conjunction with Fig. 3：
In step S00：Determine the corresponding boarding station number of each second riding scheme, and select boarding station number it is minimum the
Two riding schemes.
Correspondingly, step S50 replaces with step S50'：It is selected in the second riding scheme minimum from obtained each boarding station number
At least one second riding scheme is taken, and at least one second riding scheme of selection is recommended into the user.
In order to make it easy to understand, being referred to table 1, it is start site v3951 secondary to targeted sites v31 transfers that table 1, which provides,
The minimum riding scheme table of number, wherein number of transfer is 3 times.
1 riding scheme 1 of table
By table 1 it can be found that two that user is number 5 and number 10 can be recommended in above-mentioned riding scheme 1
Riding scheme.
In addition, it is noted that in the concrete realization, it is at least one being chosen from obtained each second riding scheme
Second riding scheme, and before at least one second riding scheme of selection is recommended the user, can also determine
Each second riding scheme corresponding riding time, and select riding time shortest second riding scheme.Then from obtaining
Choose at least one second riding scheme in each riding time shortest second riding scheme, and by at least one described of selection
Second riding scheme recommends the user.
In order to make it easy to understand, being referred to table 2, it is start site v3951 secondary to targeted sites v31 transfers that table 2, which provides,
The minimum riding scheme table of number, wherein number of transfer is 3 times.
2 riding scheme 2 of table
Multiplied it can be found that two that user is number 1 and number 5 can be recommended in above-mentioned riding scheme 2 by table 2
Vehicle scheme.
It should be noted that these are only for example, the technical solution to the application does not constitute any restriction.
However, it should be understood that whether by the corresponding boarding station number of determining second riding scheme, or by true
It fixed second riding scheme corresponding riding time, is substantially for selecting cost from obtained all second riding schemes
Time shortest riding scheme is only to give two kinds of concrete implementation modes, in a particular application, the skill of this field above
Art personnel can not be limited herein according to practical rationally setting filter type.
By foregoing description it is not difficult to find that the recommendation method of riding scheme provided in this embodiment, owns from what is obtained
At least one second riding scheme is chosen in the second minimum riding scheme of number of transfer, and the second riding scheme of selection is pushed away
It recommends to before the user, by the corresponding boarding station number of each second riding scheme of determination or riding time, and most by boarding station
A small number of or riding time shortest second riding scheme recommends user so that the riding scheme for recommending user is more excellent, more
User is facilitated to go on a journey.
Further, as shown in figure 4, proposing that the third of the recommendation method of riding scheme of the present invention is real based on second embodiment
Example is applied, in the present embodiment, before step S50', step S00' is increased, refers to Fig. 4.
In order to make it easy to understand, being specifically described below in conjunction with Fig. 4：
In step S00'：It determines the corresponding total admission fee by bus of the second minimum riding scheme of each boarding station number, and chooses
Go out the second minimum riding scheme of total admission fee by bus.
Correspondingly, step S50' replaces with step S50 "：From obtained the second minimum riding scheme of total admission fee of respectively riding
It is middle to choose at least one second riding scheme, and at least one second riding scheme of selection is recommended into the user.
In order to make it easy to understand, being referred to table 3, it is start site v3951 secondary to targeted sites v31 transfers that table 3, which provides,
Number is minimum (wherein number of transfer is 3 times), and the riding scheme table of boarding station number minimum (wherein displaying is 31 stations by bus).
3 riding scheme 3 of table
By table 3 it can be found that the riding scheme that user is number 1 can be recommended in above-mentioned riding scheme 3.
In addition, it is noted that if being selected from obtained all second riding schemes the shortest
What riding scheme was taken then in the concrete realization, is selected total by bus according to the corresponding duration by bus of each second riding scheme
The second minimum riding scheme of admission fee then becomes accordingly：Determine that shortest second riding scheme of each riding time is corresponding by bus
Then total admission fee selects the second minimum riding scheme of total admission fee by bus.
In order to make it easy to understand, being referred to table 4, it is start site v3951 secondary to targeted sites v31 transfers that table 4, which provides,
Number is minimum (wherein number of transfer is 3 times), and the riding scheme table of boarding station number minimum (wherein displaying is 31 stations by bus).
4 riding scheme 4 of table
By table 4 it can be found that the riding scheme that user is number 2 can be recommended in above-mentioned riding scheme 4.
It should be noted that these are only for example, the technical solution to the application does not constitute any restriction.
However, it should be understood that whether multiplying by the way that the second minimum riding scheme of each boarding station number of determination is corresponding
The total admission fee of vehicle, be also to determine shortest second riding scheme of each riding time it is corresponding by bus total admission fee, be substantially for from
The second minimum riding scheme of total admission fee by bus is selected in obtained the shortest second riding scheme by bus, it is above
It is only to give two kinds of concrete implementation modes, in a particular application, those skilled in the art can be according to practical reasonable
Filter type is set, is not limited herein.
By foregoing description it is not difficult to find that the recommendation method of riding scheme provided in this embodiment, is meeting number of transfer
At least, in the case of time of occurrence is shortest, by further determining that the corresponding total ticket by bus of the riding scheme for meeting above-mentioned condition
The minimum riding scheme of total admission fee by bus is recommended user, user is being facilitated to occur by valence, while reducing time of occurrence, also
The appearance cost of user is taken into account, further the user experience is improved.
In addition, the embodiment of the present invention also proposes a kind of recommendation apparatus of riding scheme.As shown in figure 5, the riding scheme
Recommendation apparatus includes：Respond module 5001, acquisition module 5002, first build module 5003, second and build module 5004, determine
Module 5005 and recommending module 5006.
Wherein, respond module 5001, the circuit query for being triggered in response to user instruct.Acquisition module 5002, is used for
Obtain start site input by user and targeted sites.First structure module 5003, for utilizing shortest path first, from advance
The website of structure go directly find out in matrix number of transfer in the start site to the circuit of the targeted sites it is minimum the
One riding scheme, and Transfer Matrix is built according to the first riding scheme found out.Second structure module 5004, for according to institute
State Transfer Matrix and the through matrix of the website, structure transfer identity matrix.Determining module 5005, for being based on backtracking method, really
The second minimum riding scheme of number of transfer between any two forerunner's website in fixed each first riding scheme.Recommending module
5006, for choosing at least one second riding scheme from obtained each second riding scheme, and by at least one of selection
Second riding scheme recommends the user.
It should be understood that website described in the present embodiment goes directly in matrix, the start site is stored with described in
All riding schemes that can be gone directly of targeted sites.
In addition, it is noted that transfer identity matrix described in the present embodiment is mainly used for storing each first and multiply
Forerunner's website in vehicle scheme.
It should be understood that forerunner's website described in the present embodiment is positioned at the start site and the targeted sites
Between website.
By foregoing description it is not difficult to find that the recommendation apparatus of the riding scheme provided in the present embodiment, utilizes shortest path
Algorithm finds out number of transfer in start site to the circuit of targeted sites in going directly matrix from the website built in advance minimum
First riding scheme, and according to the first riding scheme found out, Transfer Matrix is built, it is then straight according to Transfer Matrix and website
Up to matrix, the transfer identity matrix for storing forerunner's website of targeted sites in each first riding scheme is built, is then based on
Backtracking method determines in transfer identity matrix in each first riding scheme minimum the of number of transfer between any two forerunner's website
Two riding schemes, final need to choose at least one second from the second minimum riding scheme of obtained all numbers of transfer and multiply
Vehicle scheme recommends user.All numbers of transfer between any two website can be obtained by above-mentioned processing mode most
Few riding scheme, thus arbitrarily choose a riding scheme and recommend user all and be optimal riding scheme, it greatly improves
User experience.
Furthermore, it is necessary to explanation, the apparatus embodiments described above are merely exemplary, not to the present invention's
Protection domain, which is constituted, to be limited, and in practical applications, those skilled in the art can select according to the actual needs portion therein
Point or whole module achieve the purpose of the solution of this embodiment, be not limited herein.
In addition, the not technical detail of detailed description in the present embodiment, reference can be made to what any embodiment of the present invention was provided
The recommendation method of riding scheme, details are not described herein again.
In addition, the embodiment of the present invention also proposes that a kind of readable storage medium storing program for executing, the readable storage medium storing program for executing are computer-readable
Storage medium is stored with the recommended program of riding scheme, the recommendation of the riding scheme on the computer readable storage medium
Following operation is realized when program is executed by processor：
User terminal is instructed in response to the circuit query that user triggers, and obtains start site input by user and Target Station
Point；
Using shortest path first, the start site is found out to the mesh in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer in the circuit of labeling station point, and according to the first riding scheme structure transfer square found out
Gust, the start site is stored with to all riding schemes that can be gone directly of the targeted sites in the through matrix of the website；
According to the Transfer Matrix and the through matrix of the website, structure transfer identity matrix, the transfer identity matrix
For storing forerunner's website in each first riding scheme, forerunner's website is positioned at the start site and the Target Station
Website between point；
Based on backtracking method, number of transfer is minimum between any two forerunner's website in each first riding scheme second is determined
Riding scheme；
Choose at least one second riding scheme from obtained each second riding scheme, and by least one institute of selection
It states the second riding scheme and recommends the user.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
It determines the corresponding boarding station number of each second riding scheme, and selects the second minimum riding scheme of boarding station number；
Correspondingly, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user, specifically include：
At least one second riding scheme is chosen in the second riding scheme minimum from obtained each boarding station number, and will choosing
At least one second riding scheme taken recommends the user.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
It determines the corresponding total admission fee by bus of the second minimum riding scheme of each boarding station number, and selects by bus that total admission fee is most
The second low riding scheme；
Correspondingly, at least one second is chosen in second riding scheme minimum from obtained each boarding station number to ride
Scheme, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will
At least one second riding scheme chosen recommends the user.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
It determines each second riding scheme corresponding riding time, and selects riding time shortest second riding scheme；
Correspondingly, described that at least one second riding scheme is chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend the user, specifically include：
At least one second riding scheme is chosen from obtained shortest second riding scheme of each riding time, and will choosing
At least one second riding scheme taken recommends the user.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
It determines the corresponding total admission fee by bus of shortest second riding scheme of each riding time, and selects by bus that total admission fee is most
The second low riding scheme；
Correspondingly, described to choose at least one second from obtained shortest second riding scheme of each riding time and ride
Scheme, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will
At least one second riding scheme chosen recommends the user.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
The through matrix of the website built in advance is imported into physical memory space from virtual memory space；
Correspondingly, described to utilize shortest path first, find out the starting in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer, specifically includes in website to the circuit of the targeted sites：
The physical memory space is accessed, using shortest path first, is found out in going directly matrix from the website described
The first minimum riding scheme of number of transfer in start site to the circuit of the targeted sites.
Further, the shortest path first is Dijkstra algorithm, and the recommended program of the riding scheme is located
It manages and also realizes following operation when device executes：
Correspondingly, the profit utilizes shortest path first, from described in being found out during the website built in advance goes directly matrix
The first minimum riding scheme of number of transfer, specifically includes in initial station point to the circuit of the targeted sites：
Using Dijkstra algorithm, the start site is found out in going directly matrix from the website built in advance to described
The first minimum riding scheme of number of transfer in the circuit of targeted sites.
It should be noted that herein, the terms "include", "comprise" or its any other variant are intended to non-row
His property includes, so that process, method, article or system including a series of elements include not only those elements, and
And further include other elements that are not explicitly listed, or further include for this process, method, article or system institute it is intrinsic
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including this
There is also other identical elements in the process of element, method, article or system.
The embodiments of the present invention are for illustration only, can not represent the quality of embodiment.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on this understanding, technical scheme of the present invention substantially in other words does the prior art
Going out the part of contribution can be expressed in the form of software products, which is stored in one as described above
In storage medium (such as ROM/RAM, magnetic disc, CD), including some instructions use so that a station terminal equipment (can be mobile phone,
Computer, server, air conditioner or network equipment etc.) execute method described in each embodiment of the present invention.
It these are only the preferred embodiment of the present invention, be not intended to limit the scope of the invention, it is every to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (10)
1. a kind of recommendation method of riding scheme, which is characterized in that the described method comprises the following steps：
User terminal is instructed in response to the circuit query that user triggers, and obtains start site input by user and targeted sites；
Using shortest path first, the start site is found out to the Target Station in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer in the circuit of point, and Transfer Matrix is built according to the first riding scheme found out,
The start site is stored with to all riding schemes that can be gone directly of the targeted sites in the through matrix of the website；
According to the Transfer Matrix and the through matrix of the website, structure transfer identity matrix, the transfer identity matrix is used for
Store forerunner's website in each first riding scheme, forerunner's website be positioned at the start site and the targeted sites it
Between website；
Based on backtracking method, determine in each first riding scheme between any two forerunner's website that number of transfer is minimum second rides
Scheme；
Choose at least one second riding scheme from obtained each second riding scheme, and by least one described the of selection
Two riding schemes recommend the user.
2. the method as described in claim 1, which is characterized in that described to choose at least one from obtained each second riding scheme
A second riding scheme, and before at least one second riding scheme of selection is recommended the user, the method
Further include：
It determines the corresponding boarding station number of each second riding scheme, and selects the second minimum riding scheme of boarding station number；
Correspondingly, described to choose at least one second riding scheme from obtained each second riding scheme, and extremely by selection
Few second riding scheme recommends the user, specifically includes：
Choose at least one second riding scheme in the second riding scheme minimum from obtained each boarding station number, and by selection
At least one second riding scheme recommends the user.
3. method as claimed in claim 2, which is characterized in that the second by bus side minimum from obtained each boarding station number
At least one second riding scheme is chosen in case, and at least one second riding scheme of selection is recommended into the user
Before, the method further includes：
Determine the corresponding total admission fee by bus of the second minimum riding scheme of each boarding station number, and it is minimum to select total admission fee by bus
Second riding scheme；
Correspondingly, at least one second is chosen by bus just in second riding scheme minimum from obtained each boarding station number
Case, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will be chosen
At least one second riding scheme recommend the user.
4. the method as described in claim 1, which is characterized in that described to choose at least one from obtained each second riding scheme
A second riding scheme, and before at least one second riding scheme of selection is recommended the user, the method
Further include：
It determines each second riding scheme corresponding riding time, and selects riding time shortest second riding scheme；
Correspondingly, described to choose at least one second riding scheme from obtained each second riding scheme, and extremely by selection
Few second riding scheme recommends the user, specifically includes：
Choose at least one second riding scheme from obtained shortest second riding scheme of each riding time, and by selection
At least one second riding scheme recommends the user.
5. method as claimed in claim 4, which is characterized in that described square by bus from obtained each riding time shortest second
At least one second riding scheme is chosen in case, and at least one second riding scheme of selection is recommended into the user
Before, the method further includes：
Determine the corresponding total admission fee by bus of shortest second riding scheme of each riding time, and it is minimum to select total admission fee by bus
Second riding scheme；
Correspondingly, described that at least one second is chosen from obtained shortest second riding scheme of each riding time by bus just
Case, and at least one second riding scheme of selection is recommended into the user, it specifically includes：
At least one second riding scheme is chosen from obtained the second minimum riding scheme of total admission fee of respectively riding, and will be chosen
At least one second riding scheme recommend the user.
6. such as method described in any one of claim 1 to 5, which is characterized in that it is described to utilize shortest path first, from advance structure
Number of transfer is minimum in the start site to the circuit of the targeted sites first is found out in the through matrix of website built
Before riding scheme, the method further includes：
The through matrix of the website built in advance is imported into physical memory space from virtual memory space；
Correspondingly, described to utilize shortest path first, find out the start site in going directly matrix from the website built in advance
First riding scheme minimum to number of transfer in the circuit of the targeted sites, specifically includes：
The physical memory space is accessed, using shortest path first, the starting is found out in going directly matrix from the website
The first minimum riding scheme of number of transfer in website to the circuit of the targeted sites.
7. such as method described in any one of claim 1 to 5, which is characterized in that the shortest path first draws for Otto Dix spy
Algorithm；
Correspondingly, the profit utilizes shortest path first, and the initiating station is found out in going directly matrix from the website built in advance
Point is specifically included to the first minimum riding scheme of number of transfer in the circuit of the targeted sites：
Using Dijkstra algorithm, the start site is found out to the target in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer in the circuit of website.
8. a kind of recommendation apparatus of riding scheme, which is characterized in that described device includes：
Respond module, the circuit query for being triggered in response to user instruct；
Acquisition module, for obtaining start site input by user and targeted sites；
First structure module, for utilizing shortest path first, from described in being found out during the website built in advance goes directly matrix
The first minimum riding scheme of number of transfer in initial station point to the circuit of the targeted sites, and ride according to find out first
Scheme constructs Transfer Matrix, the website go directly matrix in be stored with the start site to the targeted sites are all can be straight
The riding scheme reached；
Second structure module, for according to the Transfer Matrix and the through matrix of the website, structure transfer identity matrix to be described
Transfer identity matrix is used to store forerunner's website in each first riding scheme, and forerunner's website is positioned at the start site
Website between the targeted sites；
Determining module determines in each first riding scheme number of transfer between any two forerunner's website for being based on backtracking method
The second minimum riding scheme；
Recommending module, for choosing at least one second riding scheme from obtained each second riding scheme, and by selection
At least one second riding scheme recommends the user.
9. a kind of terminal device, which is characterized in that the terminal device includes：Memory, processor and it is stored in described deposit
On reservoir and the recommended program of riding scheme that can run on the processor, the recommended program of the riding scheme are configured to
The step of realizing the recommendation method of riding scheme as described in any one of claim 1 to 7.
10. a kind of readable storage medium storing program for executing, which is characterized in that the readable storage medium storing program for executing is computer readable storage medium, described
The recommended program of riding scheme is stored on computer readable storage medium, the recommended program of the riding scheme is held by processor
The step of recommendation method of riding scheme as described in any one of claim 1 to 7 is realized when row.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810499404.8A CN108509659B (en) | 2018-05-22 | 2018-05-22 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810499404.8A CN108509659B (en) | 2018-05-22 | 2018-05-22 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108509659A true CN108509659A (en) | 2018-09-07 |
| CN108509659B CN108509659B (en) | 2020-10-23 |
Family
ID=63401286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810499404.8A Expired - Fee Related CN108509659B (en) | 2018-05-22 | 2018-05-22 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108509659B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109726262A (en) * | 2019-01-10 | 2019-05-07 | 武汉轻工大学 | Querying method, device, terminal device and the readable storage medium storing program for executing of public bus network |
| CN110675120A (en) * | 2019-09-20 | 2020-01-10 | 浙江交通职业技术学院 | Comprehensive traffic trip reminding system and method |
| CN112053010A (en) * | 2020-10-09 | 2020-12-08 | 腾讯科技（深圳）有限公司 | Riding path determining method and device, computer equipment and storage medium |
| CN116433308A (en) * | 2023-06-13 | 2023-07-14 | 西南交通大学 | Multi-system track traffic dynamic pricing method based on arrival and arrival time |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101187996A (en) * | 2007-10-08 | 2008-05-28 | 常飞 | A quick bus line selection algorithm based on self-adapted backbone network |
| CN105678412A (en) * | 2015-12-31 | 2016-06-15 | 百度在线网络技术（北京）有限公司 | Path planning method and device facing multiple passengers |
| US20170059341A1 (en) * | 2015-08-31 | 2017-03-02 | Sap Se | Diversified route planning for public transportation network |
| CN106528720A (en) * | 2016-11-02 | 2017-03-22 | 中铁程科技有限责任公司 | Transfer station recommendation method and transfer station recommendation system |
| CN107092986A (en) * | 2017-04-13 | 2017-08-25 | 上海理工大学 | The bus passenger travel route choice method based on website and collinearly run |
| 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 |
| CN108629456A (en) * | 2018-05-08 | 2018-10-09 | 武汉轻工大学 | Read method, device, terminal device and the readable storage medium storing program for executing of public transport data |
| CN108763518A (en) * | 2018-05-30 | 2018-11-06 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
-
2018
- 2018-05-22 CN CN201810499404.8A patent/CN108509659B/en not_active Expired - Fee Related
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101187996A (en) * | 2007-10-08 | 2008-05-28 | 常飞 | A quick bus line selection algorithm based on self-adapted backbone network |
| US20170059341A1 (en) * | 2015-08-31 | 2017-03-02 | Sap Se | Diversified route planning for public transportation network |
| CN105678412A (en) * | 2015-12-31 | 2016-06-15 | 百度在线网络技术（北京）有限公司 | Path planning method and device facing multiple passengers |
| CN106528720A (en) * | 2016-11-02 | 2017-03-22 | 中铁程科技有限责任公司 | Transfer station recommendation method and transfer station recommendation system |
| CN107092986A (en) * | 2017-04-13 | 2017-08-25 | 上海理工大学 | The bus passenger travel route choice method based on website and collinearly run |
| 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 |
| CN108629456A (en) * | 2018-05-08 | 2018-10-09 | 武汉轻工大学 | Read method, device, terminal device and the readable storage medium storing program for executing of public transport data |
| CN108763518A (en) * | 2018-05-30 | 2018-11-06 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
Non-Patent Citations (1)
| Title |
|---|
| 龚萍: "城市公交网络最优路径求解算法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109726262A (en) * | 2019-01-10 | 2019-05-07 | 武汉轻工大学 | Querying method, device, terminal device and the readable storage medium storing program for executing of public bus network |
| CN110675120A (en) * | 2019-09-20 | 2020-01-10 | 浙江交通职业技术学院 | Comprehensive traffic trip reminding system and method |
| CN112053010A (en) * | 2020-10-09 | 2020-12-08 | 腾讯科技（深圳）有限公司 | Riding path determining method and device, computer equipment and storage medium |
| CN116433308A (en) * | 2023-06-13 | 2023-07-14 | 西南交通大学 | Multi-system track traffic dynamic pricing method based on arrival and arrival time |
| CN116433308B (en) * | 2023-06-13 | 2023-08-15 | 西南交通大学 | Multi-system track traffic dynamic pricing method based on arrival and arrival time |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108509659B (en) | 2020-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108509659A (en) | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme | |
| CN105074687A (en) | Re-ranking story content | |
| US10762273B2 (en) | Comment display method, a comment display system, an electronic device, and a readable storage medium | |
| CN104919444B (en) | Topic collections | |
| CN110796508B (en) | Travel journey processing method, device, storage medium and processor | |
| CN107315827A (en) | The method and its device of a kind of correlation recommendation in electronic reading | |
| CN105468275A (en) | Method and apparatus for performing operation on presented object | |
| CN101002195A (en) | Personal icon providing system and method thereof | |
| CN113010255B (en) | Interaction method and device based on binding session group and computer equipment | |
| CN112115381B (en) | Construction method, device, electronic equipment and medium of fusion relation network | |
| CN104796380A (en) | Safety verification method, safety verification system, terminal and verification server | |
| CN103778116A (en) | Information recommendation method and system | |
| CN104092596A (en) | Music user group management method, device and system | |
| CN108763518A (en) | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme | |
| CN103891245A (en) | Location-aware content detection | |
| CN107977863A (en) | Pushed information method, apparatus and computer-readable recording medium | |
| CN107852422A (en) | Connected from the server interface with different API to obtain ad data | |
| CN108629456A (en) | Read method, device, terminal device and the readable storage medium storing program for executing of public transport data | |
| CN105898734A (en) | Network operator switching method and system for virtual SIM card | |
| CN109886738B (en) | Intelligent exhibition user prediction method and equipment | |
| CN111767473A (en) | Object selection method and computer-readable storage medium | |
| CN106650970A (en) | Information processing method and device for order transfer | |
| CN116954779A (en) | Page display method, device, equipment and storage medium | |
| CN114064843B (en) | Method, device and equipment for querying interplanetary line position nodes in RDF data | |
| CN114429389A (en) | Digital commodity display method and device |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201023 Termination date: 20210522 |