CN108763518A - 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
- CN108763518A CN108763518A CN201810544081.XA CN201810544081A CN108763518A CN 108763518 A CN108763518 A CN 108763518A CN 201810544081 A CN201810544081 A CN 201810544081A CN 108763518 A CN108763518 A CN 108763518A
- Authority
- CN
- China
- Prior art keywords
- riding
- riding scheme
- scheme
- minimum
- matrix
- 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
- 238000000034 method Methods 0.000 title claims abstract description 164
- 239000011159 matrix material Substances 0.000 claims abstract description 117
- 238000012546 transfer Methods 0.000 claims abstract description 74
- 230000004044 response Effects 0.000 claims description 8
- 238000010845 search algorithm Methods 0.000 claims description 4
- 238000002372 labelling Methods 0.000 claims description 3
- 230000001960 triggered effect Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 2
- 230000000977 initiatory effect Effects 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Engineering & Computer Science (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (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 search method, it is then based on enumerative technique and determines the second minimum riding scheme of total admission fee of riding in each first riding scheme, final need to be according to the recommended route data of user setting, one or more second riding schemes are chosen from obtained each second riding scheme and recommends user and can be reached for user and recommend both economic and time-saving riding scheme, 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
Take, since its is cumbersome, riding scheme recommend it is not smart enough, can not according to start site input by user and targeted sites,
Recommend both economic and time-saving riding scheme for user.
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 intelligent bus inquiry system can not be according to start site input by user and Target Station in the prior art for solution
Point is the technical issues of user recommends both economic and time-saving 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 searching algorithm, 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, the website go directly and are stored with the start site to institute in matrix
State all riding schemes that can be gone directly of targeted sites；
Based on enumerative technique, the second minimum riding scheme of total admission fee of riding in each first riding scheme is determined；
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 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 user before, the method further includes：
It determines the corresponding boarding station number of each second riding scheme, selects that boarding station number is minimum second to be multiplied based on enumerative technique
Vehicle 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 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 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 user before, the method further includes：
Determine each second riding scheme corresponding riding time, selecting riding time shortest second based on enumerative technique multiplies
Vehicle 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 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 user.
Preferably, described search algorithm is route matrix search method and recurrence enumerative technique；
Correspondingly, described to utilize searching algorithm, 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：
Using the route matrix search method and the recurrence enumerative technique, searched in going directly matrix from the website built in advance
Go out the first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites.
Preferably, described using the route matrix search method and the recurrence enumerative technique, it is straight from the website built in advance
Up to the first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites is found out in matrix, have
Body includes：
Using the route matrix search method, found out in going directly matrix from the website built in advance the start site to
The minimum a kind of riding scheme of number of transfer in the circuit of the targeted sites；
Using the riding scheme as search condition, it is based on the recurrence enumerative technique, to being deposited in the through matrix of the website
The start site of storage is traversed to all riding schemes that can be gone directly of the targeted sites, will meet described search item
The riding scheme of part first riding scheme minimum as number of transfer.
Preferably, described using the route matrix search method and the recurrence enumerative technique, it is straight from the website built in advance
Up to found out in matrix the first minimum riding scheme of number of transfer in the start site to the circuit of the targeted sites it
Before, 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 using the route matrix search method and the recurrence enumerative technique, it is straight from the website built in advance
Up to the first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites is found out in matrix, have
Body includes：
The physical memory space is accessed, using the route matrix search method and the recurrence enumerative technique, from the station
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
Case.
Preferably, it is described be based on enumerative technique, determine in each first riding scheme ride total admission fee it is minimum second by bus side
Case specifically includes：
Determine the corresponding total admission fee by bus of each first riding scheme；
Based on enumerative technique, the second minimum riding scheme of total admission fee by bus is selected from total admission fee of respectively riding.
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；
Searching module finds out the initiating station for utilizing searching algorithm in going directly matrix from the website built in advance
The first riding scheme at least is put to number of transfer in the circuit of the targeted sites, is stored in the through matrix of the website
Start site is stated to all riding schemes that can be gone directly of the targeted sites；
Determining module determines that total admission fee of riding in each first riding scheme is minimum and second rides for being based on enumerative technique
Scheme；
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 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 targeted sites in going directly matrix from the website built in advance using search method
The first minimum riding scheme of number of transfer in circuit is then based on enumerative technique and determines total admission fee of riding in each first riding scheme
The second minimum riding scheme, final need to be according to the recommended route data of user setting, from obtained each second riding scheme
It is middle choose one or more second riding schemes and recommend user and can be reached for user recommend both economic and time-saving side by bus
Case 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 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 searching algorithm, 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, the website go directly and are stored with the start site to institute in matrix
State all riding schemes that can be gone directly of targeted sites；
Based on enumerative technique, the second minimum riding scheme of total admission fee of riding in each first riding scheme is determined；
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 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, selects that boarding station number is minimum second to be multiplied based on enumerative technique
Vehicle 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 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 user.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
Determine each second riding scheme corresponding riding time, selecting riding time shortest second based on enumerative technique multiplies
Vehicle 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 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 user.
Further, described search algorithm is route matrix search method and recurrence enumerative technique, and processor 1001 can call
The recommended program of the riding scheme stored in memory 1005 also executes following operation：
Correspondingly, described to utilize searching algorithm, 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：
Using the route matrix search method and the recurrence enumerative technique, searched in going directly matrix from the website built in advance
Go out the first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
Using the route matrix search method, found out in going directly matrix from the website built in advance the start site to
The minimum a kind of riding scheme of number of transfer in the circuit of the targeted sites；
Using the riding scheme as search condition, it is based on the recurrence enumerative technique, to being deposited in the through matrix of the website
The start site of storage is traversed to all riding schemes that can be gone directly of the targeted sites, will meet described search item
The riding scheme of part first riding scheme minimum as number of transfer.
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 using the route matrix search method and the recurrence enumerative technique, it is straight from the website built in advance
Up to the first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites is found out in matrix, have
Body includes：
The physical memory space is accessed, using the route matrix search method and the recurrence enumerative technique, from the station
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
Case.
Further, processor 1001 can call the recommended program of the riding scheme stored in memory 1005, also hold
The following operation of row：
Determine the corresponding total admission fee by bus of each first riding scheme；
Based on enumerative technique, the second minimum riding scheme of total admission fee by bus is selected from total admission fee of respectively riding.
This implementation through the above scheme, start site is found out in going directly matrix from the website built in advance using search method
First riding scheme minimum to number of transfer in the circuit of targeted sites, is then based on enumerative technique and determines each first riding scheme
In minimum the second riding scheme of total admission fee by bus, it is final only need to be each from what is obtained according to the recommended route data of user setting
Chosen in second riding scheme one or more second riding schemes recommend user can be reached for user recommend not only economy but also
Timesaving riding scheme, 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 searching algorithm, 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.
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, in the concrete realization, described searching algorithm is specially route matrix search method and recurrence in the present embodiment
Enumerative technique.
That is, above-mentioned utilize searching algorithm, the start site is found out to institute in going directly matrix from the website built in advance
Stating the first riding scheme that number of transfer is minimum in the circuit of targeted sites is：Using the route matrix search method and described pass
Return enumerative technique, finds out in the start site to the circuit of the targeted sites and change in going directly matrix from the website built in advance
Multiply the first minimum riding scheme of number.
In order to make it easy to understand, below to utilizing the route matrix search method and the recurrence enumerative technique, from advance structure
Website go directly and find out that number of transfer in the start site to the circuit of the targeted sites is minimum first to be multiplied in matrix
The mode of vehicle scheme is specifically described：
First, using the route matrix search method, the starting is found out in going directly matrix from the website built in advance
The minimum a kind of riding scheme of number of transfer in website to the circuit of the targeted sites.
Then, using the riding scheme as search condition, it is based on the recurrence enumerative technique, to the through matrix of the website
The start site of middle storage is traversed to all riding schemes that can be gone directly of the targeted sites, will be searched described in satisfaction
The riding scheme of rope condition first riding scheme minimum as number of transfer.
It should be noted that recurrence enumerative technique described in the present embodiment, in particular to be provided simultaneously with recursive function and piece
The characteristic of act method needs to be related to recursive procedure and recursive condition that is, when scanning for, then according to the recurrence item of setting
Part carries out exhaustive search in website goes directly matrix.
It is straight from the website built in advance using searching algorithm in addition, it is noted that in order to improve search speed
Up to found out in matrix the first minimum riding scheme of number of transfer in the start site to the circuit of the targeted sites it
Before, matrix that the website that built in advance can go directly imports physical memory space from virtual memory space.
Correspondingly, described to utilize searching algorithm, 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 becomes in the physical memory space
It carries out, i.e., by accessing the physical memory space, using the route matrix search method and the recurrence enumerative technique, from described
Website, which goes directly, finds out that number of transfer in the start site to the circuit of the targeted sites is minimum first to ride in matrix
Scheme.
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 searching algorithm, from pre-
The website that first builds go directly find out in matrix the start site to all numbers of transfer of the targeted sites at least first
Before riding scheme, by the way that the through matrix of the website built in advance is imported physical memory space from virtual memory space,
Entire subsequent processing can be greatly speeded up, reduces period of reservation of number, and then promote user experience.
S30：Based on enumerative technique, the second minimum riding scheme of total admission fee of riding in each first riding scheme is determined.
It should be understood that utilizing route matrix search method and recurrence enumerative technique in step S20, filter out full
All first riding schemes of sufficient search condition, and the quantity of the first riding scheme be it is limited, therefore, in step s 30,
Enumerative technique is directly selected to determine the second minimum riding scheme of total admission fee of riding in each first riding scheme, so as to significantly
Calculation amount is reduced, processing speed is promoted.
In addition, in the concrete realization, be based on enumerative technique, determine total admission fee of riding in each first riding scheme it is minimum second
When riding scheme, needs first to determine the corresponding total admission fee by bus of each first riding scheme, be then based on enumerative technique, it is total from respectively riding
The second minimum riding scheme of total admission fee by bus is selected in admission fee.
S40：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 user.
The recommendation method of the riding scheme provided in order to better understand the present invention, is specifically described below：
In order to facilitate narration, first meets and arranged as follows to what needs were used：
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 initial station point viReach targeted sites vjThe minimum riding scheme of number of transfer,
That is the first riding scheme.
Meanwhile the first riding scheme for the ease of managing and safeguarding, can ride side according to first found out
Case builds a Transfer Matrix, i.e. matrix D, and n × n indicates that the matrix is the matrix of a n rows n row, and the value of n is more than 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) the first riding scheme further, is found out for convenience, it can be according to the Transfer Matrix D and the website
Through Matrix C, structure 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, start site viIt is targeted sites vjForerunner's website, then fji=1；It is no
Then fji=0.
5) route matrix R=(rij)n×n, rijIt indicates from start site viReach targeted sites vjThe website of transfer is needed,
Middle i, j=1,2 ..., n.
For ease of description, the recommendation method of the riding scheme provided in the present embodiment is greatly classified into below and utilizes road
One minimum riding scheme of number of transfer is found out by matrix search method, asks all numbers of transfer minimum using recurrence enumerative technique
Riding scheme asks three parts of all both economic and time-saving riding schemes, the realization of each section specific as follows based on enumerative technique：
1, in order to being asked in public transport figure G from start site v with recurrence enumerative techniqueiTo targeted sites viAll numbers of transfer
Minimum riding scheme, i.e. the first riding scheme, then it is minimum firstly the need of a number of transfer is found out with route matrix search method
Riding scheme, solution procedure is as follows：
Module inorder (r, i, j) function of route matrix search method is defined as follows：
If rij≠ 0, then need the process of recursive search circuit as follows：
(1) k=rij；
(2) recurrence executes inorder (r, i, k)；
(3) site k is exported；
(4) recurrence executes inorder (r, k, j)；
Above route matrix search method can only seek start site viTo targeted sites vjA number of transfer at least ride
Scheme, and the minimum riding scheme of all numbers of transfer cannot be found out.Therefore, it is necessary to further ask all with recurrence enumerative technique to change
Multiply the minimum riding scheme of number.
2, the riding scheme for asking all numbers of transfer minimum using recurrence enumerative technique
According to row vector DiA transfer identity matrix F=(f is constructed with website Matrix C of going directlyij)n×n, stored with the matrix
Acquired from start site viTo targeted sites vjAll numbers of transfer minimum riding schemes (i.e. the first riding scheme)
Targeted sites vjForerunner's website, if website vkIt is targeted sites vjForerunner's website, then fki=1, otherwise fki=0.
About transfer identity matrix F=(fij)n×nMake, it is specific as follows：
If k ≠ j and dij+cjk=dij, then fkj=1；Otherwise fkj=0.Wherein j, k=1,2 ..., n.
Start site v is sought with recurrence enumerative techniqueiTo targeted sites vjThe minimum riding scheme of all numbers of transfer, for convenience
Narration, might as well use recursive function find (F, Di, vj, vi) indicate, 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 stackjCarry out problem of implementation solution.
3, all both economic and time-saving riding schemes are asked based on enumerative technique
3.1, it under the premise of number of transfer is minimum, is asked from start site v with enumerative techniqueiTo targeted sites vjAll
The minimum riding scheme of total admission fee in one riding scheme, and the minimum riding scheme of total admission fee is named as the second riding scheme,
The process is specific as follows：
Step 1：Calculating finds out the corresponding total admission fee of each first riding scheme；
Step 2：Filter out total admission fee minimum in all first riding schemes；
Step 3：By the first riding scheme that the total admission fee filtered out is minimum, it is named as the second riding scheme.
3.2, it in the case where the minimum and total admission fee of number of transfer is minimum, is found out from start site v with enumerative techniqueiTo target
Website vjRiding time minimum riding scheme
Step 1：Calculate corresponding total boarding station number of each second riding scheme found out in 3.1, or duration by bus；
Step 2：It is most short to filter out minimum boarding station number or shortest riding time in all second riding schemes；
Step 3：By the boarding station number filtered out is minimum or riding time shortest second riding scheme, it is determined as most
The riding scheme option of user is recommended eventually.
In order to verify, the recommendation method based on above-mentioned riding scheme can be according to start site input by user and mesh
Labeling station point is recommended both economic and time-saving riding scheme for user, is specifically described below：
It is assumed that 3957 websites are shared in the public transit system in certain known city, and its public bus network is known.
The standard of pricing for segment (per being 1 section between adjacent two station) is：1.5 yuan of trigger price, can take 6 sections, 7-9
2 yuan of a section admission fee, 10-12 2.5 yuan of section admission fee, 13-15 3 yuan of section admission fee, 16-20 3.5 yuan of section admission fee,
21-25 4 yuan of section admission fee.
The standard of single fare is：No matter taking several stations, admission fee is 2 yuan.
When start site is v3359, and targeted sites are v31, according to the recommendation method of above-mentioned riding scheme, the meter of progress
Calculate approximately as：
Step 1：Calculate Transfer Matrix D=(dij)3957×3957。
Step 2：The through Matrix C=(c of website is counted by Transfer Matrix Dij)3957×3957。
Step 3：Riding scheme from start site v3359 to targeted sites v1141 is as shown in table 1 below.Wherein, first multiplies
Vehicle scheme is the riding scheme for changing to 2 times.
1 riding scheme 1 of table
By table 1 it can be found that the second minimum riding scheme of total admission fee by bus selected from the first riding scheme
For the riding scheme that number is 4 and number is 5, i.e., it is number 4 and number 5 that can recommend user in above-mentioned riding scheme 1
Two corresponding riding schemes.
It should be noted that these are only for example, not constituting any restriction to the technical solution of the application.
By foregoing description it is not difficult to find that the recommendation method of the riding scheme provided in the present embodiment, using search method 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 is then based on enumerative technique and determines the second minimum riding scheme of total admission fee of riding in each first riding scheme, finally only
The side by bus of one or more second need to be chosen from obtained each second riding scheme according to the recommended route data of user setting
Case, which recommends user and can be reached for user, recommends both economic and time-saving riding scheme, greatly improves 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, at least one second riding scheme is being chosen from obtained each second riding scheme, and will choose
At least one second riding scheme recommend user before, need first to determine the corresponding boarding station of each second riding scheme
Number is then based on enumerative technique and selects the second minimum riding scheme of boarding station number, refers to the step S00 in Fig. 3.
In order to make it easy to understand, being specifically described below in conjunction with Fig. 3：
In step S00：It determines the corresponding boarding station number of each second riding scheme, boarding station number is selected based on enumerative technique
The second minimum riding scheme.
Correspondingly, step S40 replaces with step S40'：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 user.
In order to make it easy to understand, being referred to table 2, it is start site v3359 multiplying to targeted sites v1141 that table 2, which provides,
Vehicle scheme table, specifically, table 2 are obtained on the basis of table 1, wherein it is 2 times that the second riding scheme, which is number of transfer, and it is total
The riding scheme that admission fee is 4 yuan.
2 riding scheme 2 of table
By table 2 it can be found that the second minimum riding scheme of total admission fee by bus selected from the second riding scheme
The riding scheme for being 1 for number, i.e., it is that two corresponding to number 1 ride that user can be recommended in above-mentioned riding scheme 2
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 user, can also determine each
Two riding schemes corresponding riding time selects riding time shortest second riding scheme based on enumerative technique.Then from
To shortest second riding scheme of each riding time in choose at least one second riding scheme, and by at least one of selection
Second riding scheme recommends user.
In order to make it easy to understand, being referred to table 3, it is start site v3359 multiplying to targeted sites v1141 that table 3, which provides,
Vehicle scheme table, specifically, table 2 are obtained on the basis of table 1, wherein it is 2 times that the second riding scheme, which is number of transfer, and it is total
The riding scheme that admission fee is 4 yuan.
3 riding scheme 3 of table
By table 2 it can be found that the second minimum riding scheme of total admission fee by bus selected from the second riding scheme
The riding scheme for being 1 for number, i.e., it is that two corresponding to number 1 ride that user can be recommended in above-mentioned riding scheme 2
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.
In addition, the embodiment of the present invention also proposes a kind of recommendation apparatus of riding scheme.As shown in figure 4, the riding scheme
Recommendation apparatus includes：Respond module 4001, acquisition module 4002, searching module 4003, determining module 4004 and recommending module
4005。
Wherein, respond module 4001, the circuit query for being triggered in response to user instruct.Acquisition module 4002, is used for
Obtain start site input by user and targeted sites.Searching module 4003, for utilizing searching algorithm, 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
Case.Determining module 4004, for be based on enumerative technique, determine in each first riding scheme ride total admission fee it is minimum second by bus side
Case.Recommending module 4005 for choosing at least one second riding scheme from obtained each second riding scheme, and will be chosen
At least one second riding scheme recommend user.
The matrix it should be noted that website described in the present embodiment goes directly, wherein the mainly initiating station stored
It puts to all riding schemes that can be gone directly of the targeted sites.
By foregoing description it is not difficult to find that the recommendation apparatus of the riding scheme provided in the present embodiment, using search method 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 is then based on enumerative technique and determines the second minimum riding scheme of total admission fee of riding in each first riding scheme, finally only
The side by bus of one or more second need to be chosen from obtained each second riding scheme according to the recommended route data of user setting
Case, which recommends user and can be reached for user, recommends both economic and time-saving riding scheme, 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 searching algorithm, 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, the website go directly and are stored with the start site to institute in matrix
State all riding schemes that can be gone directly of targeted sites；
Based on enumerative technique, the second minimum riding scheme of total admission fee of riding in each first riding scheme is determined；
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 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, selects that boarding station number is minimum second to be multiplied based on enumerative technique
Vehicle 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 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 user.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
Determine each second riding scheme corresponding riding time, selecting riding time shortest second based on enumerative technique multiplies
Vehicle 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 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 user.
Further, described search algorithm is route matrix search method and recurrence enumerative technique, the recommendation of the riding scheme
Following operation is also realized when program is executed by processor：
Correspondingly, described to utilize searching algorithm, 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：
Using the route matrix search method and the recurrence enumerative technique, searched in going directly matrix from the website built in advance
Go out the first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
Using the route matrix search method, found out in going directly matrix from the website built in advance the start site to
The minimum a kind of riding scheme of number of transfer in the circuit of the targeted sites；
Using the riding scheme as search condition, it is based on the recurrence enumerative technique, to being deposited in the through matrix of the website
The start site of storage is traversed to all riding schemes that can be gone directly of the targeted sites, will meet described search item
The riding scheme of part first riding scheme minimum as number of transfer.
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 using the route matrix search method and the recurrence enumerative technique, it is straight from the website built in advance
Up to the first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites is found out in matrix, have
Body includes：
The physical memory space is accessed, using the route matrix search method and the recurrence enumerative technique, from the station
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
Case.
Further, following operation is also realized when the recommended program of the riding scheme is executed by processor：
Determine the corresponding total admission fee by bus of each first riding scheme；
Based on enumerative technique, the second minimum riding scheme of total admission fee by bus is selected from total admission fee of respectively riding.
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 searching algorithm, the start site is found out to the targeted sites in going directly matrix from the website built in advance
The first minimum riding scheme of number of transfer in circuit, the website go directly and are stored with the start site to the mesh in matrix
All riding schemes that can be gone directly of labeling station point；
Based on enumerative technique, the second minimum riding scheme of total admission fee of riding in each first riding scheme is determined；
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 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 user, the method is also wrapped
It includes：
It determines the corresponding boarding station number of each second riding scheme, the second minimum side by bus of boarding station number is selected based on enumerative technique
Case；
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 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 user.
3. 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 user, the method is also wrapped
It includes：
Determine each second riding scheme corresponding riding time, it is square by bus to select riding time shortest second based on enumerative technique
Case；
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 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 user.
4. method as described in any one of claims 1 to 3, which is characterized in that described search algorithm is route matrix search method
With recurrence enumerative technique；
Correspondingly, described to utilize searching algorithm, 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, is specifically included：
Using the route matrix search method and the recurrence enumerative technique, institute is found out in going directly matrix from the website built in advance
State the first riding scheme that number of transfer is minimum in start site to the circuit of the targeted sites.
5. method as claimed in claim 4, which is characterized in that described to utilize the route matrix search method and the recurrence piece
Act method finds out transfer time in the start site to the circuit of the targeted sites in going directly matrix from the website built in advance
The first minimum riding scheme of number, specifically includes：
Using the route matrix search method, the start site is found out in going directly matrix from the website built in advance to described
The minimum a kind of riding scheme of number of transfer in the circuit of targeted sites；
Using the riding scheme as search condition, it is based on the recurrence enumerative technique, to what is stored in the through matrix of the website
The start site is traversed to all riding schemes that can be gone directly of the targeted sites, will meet described search condition
Riding scheme first riding scheme minimum as number of transfer.
6. method as claimed in claim 4, which is characterized in that described to utilize the route matrix search method and the recurrence piece
Act method finds out transfer time in the start site to the circuit of the targeted sites in going directly matrix from the website built in advance
Before the first minimum riding scheme of number, 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 the route matrix search method and the recurrence enumerative technique, from the through square of the website built in advance
The first riding scheme that number of transfer is minimum in the start site to the circuit of the targeted sites is found out in battle array, it is specific to wrap
It includes：
The physical memory space is accessed, it is straight from the website using the route matrix search method and the recurrence enumerative technique
Up to finding out the first minimum riding scheme of number of transfer in the start site to the circuit of the targeted sites in matrix.
7. method as described in any one of claims 1 to 3, which is characterized in that it is described to be based on enumerative technique, determine that each first rides
The second minimum riding scheme of total admission fee of riding in scheme, specifically includes：
Determine the corresponding total admission fee by bus of each first riding scheme；
Based on enumerative technique, the second minimum riding scheme of total admission fee by bus is selected from total admission fee of respectively riding.
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；
Searching module, for utilize searching algorithm, from the website built in advance go directly matrix in find out the start site to
The first minimum riding scheme of number of transfer in the circuit of the targeted sites, the website go directly and are stored with described rise in matrix
Initial station point is to all riding schemes that can be gone directly of the targeted sites；
Determining module determines the second minimum riding scheme of total admission fee of riding in each first riding scheme for being based on enumerative technique；
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 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 |
|---|---|---|---|
| CN201810544081.XA CN108763518B (en) | 2018-05-30 | 2018-05-30 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810544081.XA CN108763518B (en) | 2018-05-30 | 2018-05-30 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108763518A true CN108763518A (en) | 2018-11-06 |
| CN108763518B CN108763518B (en) | 2020-10-30 |
Family
ID=64000817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810544081.XA Expired - Fee Related CN108763518B (en) | 2018-05-30 | 2018-05-30 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108763518B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108509659A (en) * | 2018-05-22 | 2018-09-07 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
| CN113218411A (en) * | 2021-03-31 | 2021-08-06 | 华录智达科技股份有限公司 | Square partition matrix transfer method suitable for multiple buses |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1629839A (en) * | 2003-12-15 | 2005-06-22 | 郭杰 | Bus change search system |
| CN101242583A (en) * | 2008-03-05 | 2008-08-13 | 青岛海信移动通信技术股份有限公司 | Public bus transfer inquiry system, mobile communication terminal and public bus transfer inquiry method |
| CN105021185A (en) * | 2015-07-15 | 2015-11-04 | 上海市政工程设计研究总院（集团）有限公司 | Navigation method and system |
| CN105067000A (en) * | 2015-07-15 | 2015-11-18 | 上海市政工程设计研究总院（集团）有限公司 | Navigation method and system for accurate transfer of public transport |
| US9953539B1 (en) * | 2017-03-28 | 2018-04-24 | Nec Corporation | Method and system for providing demand-responsive dispatching of a fleet of transportation vehicles, and a mobility-activity processing module for providing a mobility trace database |
-
2018
- 2018-05-30 CN CN201810544081.XA patent/CN108763518B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1629839A (en) * | 2003-12-15 | 2005-06-22 | 郭杰 | Bus change search system |
| CN101242583A (en) * | 2008-03-05 | 2008-08-13 | 青岛海信移动通信技术股份有限公司 | Public bus transfer inquiry system, mobile communication terminal and public bus transfer inquiry method |
| CN105021185A (en) * | 2015-07-15 | 2015-11-04 | 上海市政工程设计研究总院（集团）有限公司 | Navigation method and system |
| CN105067000A (en) * | 2015-07-15 | 2015-11-18 | 上海市政工程设计研究总院（集团）有限公司 | Navigation method and system for accurate transfer of public transport |
| US9953539B1 (en) * | 2017-03-28 | 2018-04-24 | Nec Corporation | Method and system for providing demand-responsive dispatching of a fleet of transportation vehicles, and a mobility-activity processing module for providing a mobility trace database |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108509659A (en) * | 2018-05-22 | 2018-09-07 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
| CN108509659B (en) * | 2018-05-22 | 2020-10-23 | 武汉轻工大学 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
| CN113218411A (en) * | 2021-03-31 | 2021-08-06 | 华录智达科技股份有限公司 | Square partition matrix transfer method suitable for multiple buses |
| CN113218411B (en) * | 2021-03-31 | 2022-12-06 | 华录智达科技股份有限公司 | Square partition matrix transfer method suitable for multiple buses |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108763518B (en) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110413877A (en) | A kind of resource recommendation method, device and electronic equipment | |
| CN105335409B (en) | A kind of determination method, equipment and the network server of target user | |
| CN104615731B (en) | A kind of Quick Response Code exhibiting method and system | |
| CN109816206A (en) | A kind of vehicle recommended method and device | |
| CN108509659A (en) | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme | |
| CN110086877A (en) | Application program sharing, sharing information display methods, device, equipment and medium | |
| CN105074687A (en) | Re-ranking story content | |
| CN106302557A (en) | Page loading method and relevant device, system | |
| CN105283845A (en) | Display object pre-generation | |
| CN108492068A (en) | Method and apparatus for path planning | |
| CN110415054A (en) | Advertisement placement method, system, medium and server-side based on user behavior data | |
| CN107291962A (en) | searching method, device, storage medium and electronic equipment | |
| CN105867714A (en) | Application downloading method, apparatus and system | |
| CN107220854A (en) | A kind of method and device for sending electronic ticket | |
| CN111105251A (en) | Information pushing method and device | |
| CN103778116A (en) | Information recommendation method and system | |
| CN109815097A (en) | Function of application operation recommended method and system based on intelligent decision | |
| CN108809811A (en) | Object sharing method and device | |
| CN110191183A (en) | Accurate intelligent method for pushing, system, device and computer readable storage medium | |
| CN108763518A (en) | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme | |
| CN102314445A (en) | Control method for arranging user messages and corresponding information management system | |
| CN110457607A (en) | A kind of partial journey information recommendation method, device, medium and electronic equipment | |
| CN110490349A (en) | A kind of information recommendation method based on calendar, device, medium and electronic equipment | |
| CN108629456A (en) | Read method, device, terminal device and the readable storage medium storing program for executing of public transport data | |
| CN109446417A (en) | A kind of intellectualized retrieval method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201030 |