CN108763518B - Recommendation method and device for riding scheme, terminal equipment and readable storage medium - Google Patents
Recommendation method and device for riding scheme, terminal equipment and readable storage medium Download PDFInfo
- Publication number
- CN108763518B CN108763518B CN201810544081.XA CN201810544081A CN108763518B CN 108763518 B CN108763518 B CN 108763518B CN 201810544081 A CN201810544081 A CN 201810544081A CN 108763518 B CN108763518 B CN 108763518B
- Authority
- CN
- China
- Prior art keywords
- riding
- scheme
- station
- riding scheme
- user
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 174
- 239000011159 matrix material Substances 0.000 claims abstract description 117
- 238000012546 transfer Methods 0.000 claims abstract description 73
- 238000010845 search algorithm Methods 0.000 claims description 20
- 230000001960 triggered effect Effects 0.000 claims description 8
- 230000004044 response Effects 0.000 claims description 4
- 230000007704 transition Effects 0.000 claims 1
- 230000008569 process Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- XHEFDIBZLJXQHF-UHFFFAOYSA-N fisetin Chemical compound C=1C(O)=CC=C(C(C=2O)=O)C=1OC=2C1=CC=C(O)C(O)=C1 XHEFDIBZLJXQHF-UHFFFAOYSA-N 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
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 a recommendation method and device of a riding scheme, terminal equipment and a readable storage medium. According to the method, the first riding scheme with the least transfer times in the route from the starting station to the target station is found out from the pre-constructed station through matrix by utilizing a search method, then the second riding scheme with the lowest total riding ticket price in each first riding scheme is determined based on an enumeration method, and finally, one or more second riding schemes are selected from the obtained second riding schemes to recommend to the user according to the recommended route data set by the user, so that the economic and time-saving riding scheme can be recommended to the user, and the user experience is greatly improved.
Description
Technical Field
The invention relates to the technical field of information processing, in particular to a method and a device for recommending a riding scheme, terminal equipment and a readable storage medium.
Background
With the development of economy and the acceleration of urbanization, the population of super-huge cities is more and more, and the cities are larger and larger, so that citizens can conveniently go out by means of transportation. The extensive investigation on citizens finds that the public transport and subway trip are the first choice of people. Therefore, in order to facilitate the inquiry of the public transport and subway lines when the user goes out, the intelligent public transport inquiry system becomes a research hotspot.
When a bus scheme is recommended for a passenger, the various intelligent bus inquiry systems are usually directly extracted from bus schemes prestored among different stations in an existing bus route library, then the extracted data are sequentially displayed on user terminal interfaces of the passenger, the user needs to browse and check the data by himself or herself, and the data are selected from numerous displayed bus routes.
The above is only for the purpose of assisting understanding of the technical aspects of the present invention, and does not represent an admission that the above is prior art.
Disclosure of Invention
The invention mainly aims to provide a method and a device for recommending a riding scheme, a terminal device and a readable storage medium, and aims to solve the technical problem that an intelligent bus inquiry system in the prior art cannot recommend an economical and time-saving riding scheme for a user according to a starting station and a target station input by the user.
In order to achieve the above object, the present invention provides a method for recommending a riding scheme, comprising the steps of:
the method comprises the steps that a user terminal responds to a line inquiry instruction triggered by a user to obtain an initial site and a target site input by the user;
searching a first riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing a search algorithm, wherein all riding schemes which can be directly transmitted from the starting station to the target station are stored in the station direct matrix;
determining a second riding scheme with the lowest total riding ticket price in each first riding scheme based on an enumeration method;
and selecting at least one second riding scheme from the obtained second riding schemes, and recommending the selected at least one second riding scheme to the user.
Preferably, before the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user, the method further includes:
determining the number of the riding stations corresponding to each second riding scheme, and selecting the second riding scheme with the least number of the riding stations based on an enumeration method;
correspondingly, the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user specifically includes:
and selecting at least one second riding scheme from the obtained second riding schemes with the least riding stations, and recommending the selected at least one second riding scheme to the user.
Preferably, before the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user, the method further includes:
determining the riding time corresponding to each second riding scheme, and selecting the second riding scheme with the shortest riding time based on an enumeration method;
correspondingly, the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user specifically includes:
and selecting at least one second riding scheme from the obtained second riding schemes with the shortest riding time, and recommending the selected at least one second riding scheme to the user.
Preferably, the search algorithm is a routing matrix search method and a recursive enumeration method;
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the route from the starting station to the target station from the pre-constructed station direct matrix by using the search algorithm specifically includes:
and searching out a first riding scheme with the least number of times of transfer in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the route matrix search method and the recursive enumeration method.
Preferably, the finding out the first ride plan with the least number of transfers in the line from the starting station to the target station from the pre-constructed station through matrix by using the routing matrix search method and the recursive enumeration method specifically includes:
searching a riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the routing matrix search method;
and traversing all the ride schemes which can be directly transmitted from the starting station to the target station and are stored in the station direct matrix based on the recursive enumeration method by using the ride scheme as a search condition, and using the ride scheme meeting the search condition as a first ride scheme with the least transfer times.
Preferably, before the first ride plan with the least number of transfers in the route from the starting station to the target station is found from a pre-constructed station through matrix by using the routing matrix search method and the recursive enumeration method, the method further includes:
importing the pre-constructed site direct matrix into a physical memory space from a virtual memory space;
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the line from the starting station to the target station from the pre-constructed station through matrix search method and the recursive enumeration method specifically includes:
and accessing the physical memory space, and searching a first riding scheme with the least transfer times in a line from the starting station to the target station from the station direct matrix by using the routing matrix search method and the recursive enumeration method.
Preferably, the determining, based on an enumeration method, the second riding scheme with the lowest total riding ticket price in each first riding scheme specifically includes:
determining a total fare corresponding to each first riding scheme;
and selecting a second riding scheme with the lowest total riding ticket price from the total riding ticket prices of all the riding schemes based on an enumeration method.
In addition, to achieve the above object, the present invention provides a riding scheme recommendation apparatus, including:
the response module is used for responding to a line inquiry instruction triggered by a user;
the acquisition module is used for acquiring a starting site and a target site input by a user;
the searching module is used for searching a first riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing a searching algorithm, wherein all riding schemes which can be directly transferred from the starting station to the target station are stored in the station direct matrix;
the determining module is used for determining a second riding scheme with the lowest total riding ticket price in the first riding schemes based on an enumeration method;
and the recommending module is used for selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user.
In addition, to achieve the above object, the present invention also provides a terminal device, including: the system comprises a memory, a processor and a recommendation program of a riding scheme, wherein the recommendation program of the riding scheme is stored on the memory and can run on the processor, and is configured to realize the steps of the recommendation method of the riding scheme.
In addition, in order to achieve the above object, the present invention further provides a readable storage medium, which is a computer readable storage medium, wherein a recommendation program of a riding scheme is stored on the computer readable storage medium, and when executed by a processor, the steps of the recommendation method of the riding scheme are implemented.
According to the method, the first riding scheme with the least transfer times in the route from the starting station to the target station is found out from the pre-constructed station through matrix by utilizing a search method, then the second riding scheme with the lowest total riding ticket price in each first riding scheme is determined based on an enumeration method, and finally, one or more second riding schemes are selected from the obtained second riding schemes to recommend to the user according to the recommended route data set by the user, so that the economic and time-saving riding scheme can be recommended to the user, and the user experience is greatly improved.
Drawings
Fig. 1 is a schematic structural diagram of a terminal device in a hardware operating environment according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart illustrating a first embodiment of a method for recommending a ride plan according to the present invention;
FIG. 3 is a schematic flow chart illustrating a second embodiment of a method for recommending a ride plan according to the present invention;
fig. 4 is a functional module schematic diagram of a recommendation device of a riding scheme of the invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, fig. 1 is a schematic structural diagram of a terminal device in a hardware operating environment according to an embodiment of the present invention, where the terminal device may be a mobile phone, a tablet computer, a personal computer, or the like.
As shown in fig. 1, the terminal device may include: a processor 1001, such as a Central Processing Unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), a touch screen (touch screen), an input unit such as a Keyboard (Keyboard), a Mouse (Mouse), and optionally, the user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a WIreless interface (e.g., a WIreless-FIdelity (WI-FI) interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (e.g., a magnetic disk memory). The memory 1005 may alternatively be a storage device separate from the processor 1001.
Those skilled in the art will appreciate that the configuration shown in fig. 1 does not constitute a limitation of the terminal device, and that in actual implementations the terminal device may include more or less components than those shown, or some components may be combined, or a different arrangement of components.
Thus, as shown in fig. 1, the memory 1005, which is a kind of computer storage medium, may include therein an operating system, a network communication module, a user interface module, and a recommendation program of a riding scheme.
In the terminal device shown in fig. 1, the network interface 1004 is mainly used for establishing a communication connection between the terminal device and a server for storing all data required in the intelligent bus inquiry system; the user interface 1003 is mainly used for receiving input instructions of a user; the terminal device calls the recommendation program of the riding scheme stored in the memory 1005 through the processor 1001, and executes the following operations:
the method comprises the steps that a user terminal responds to a line inquiry instruction triggered by a user to obtain an initial site and a target site input by the user;
searching a first riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing a search algorithm, wherein all riding schemes which can be directly transmitted from the starting station to the target station are stored in the station direct matrix;
determining a second riding scheme with the lowest total riding ticket price in each first riding scheme based on an enumeration method;
and selecting at least one second riding scheme from the obtained second riding schemes, and recommending the selected at least one second riding scheme to the user.
Further, the processor 1001 may call the recommendation program of the riding scheme stored in the memory 1005, and further perform the following operations:
determining the number of the riding stations corresponding to each second riding scheme, and selecting the second riding scheme with the least number of the riding stations based on an enumeration method;
correspondingly, the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user specifically includes:
and selecting at least one second riding scheme from the obtained second riding schemes with the least riding stations, and recommending the selected at least one second riding scheme to the user.
Further, the processor 1001 may call the recommendation program of the riding scheme stored in the memory 1005, and further perform the following operations:
determining the riding time corresponding to each second riding scheme, and selecting the second riding scheme with the shortest riding time based on an enumeration method;
correspondingly, the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user specifically includes:
and selecting at least one second riding scheme from the obtained second riding schemes with the shortest riding time, and recommending the selected at least one second riding scheme to the user.
Further, the search algorithm is a routing matrix search method and a recursive enumeration method, and the processor 1001 may call a recommendation program of the riding scheme stored in the memory 1005, and further perform the following operations:
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the route from the starting station to the target station from the pre-constructed station direct matrix by using the search algorithm specifically includes:
and searching out a first riding scheme with the least number of times of transfer in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the route matrix search method and the recursive enumeration method.
Further, the processor 1001 may call the recommendation program of the riding scheme stored in the memory 1005, and further perform the following operations:
searching a riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the routing matrix search method;
and traversing all the ride schemes which can be directly transmitted from the starting station to the target station and are stored in the station direct matrix based on the recursive enumeration method by using the ride scheme as a search condition, and using the ride scheme meeting the search condition as a first ride scheme with the least transfer times.
Further, the processor 1001 may call the recommendation program of the riding scheme stored in the memory 1005, and further perform the following operations:
importing the pre-constructed site direct matrix into a physical memory space from a virtual memory space;
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the line from the starting station to the target station from the pre-constructed station through matrix search method and the recursive enumeration method specifically includes:
and accessing the physical memory space, and searching a first riding scheme with the least transfer times in a line from the starting station to the target station from the station direct matrix by using the routing matrix search method and the recursive enumeration method.
Further, the processor 1001 may call the recommendation program of the riding scheme stored in the memory 1005, and further perform the following operations:
determining a total fare corresponding to each first riding scheme;
and selecting a second riding scheme with the lowest total riding ticket price from the total riding ticket prices of all the riding schemes based on an enumeration method.
According to the scheme, the first riding scheme with the least transfer times in the route from the starting station to the target station is found out from the pre-constructed station through matrix by using a search method, then the second riding scheme with the lowest total riding ticket price in each first riding scheme is determined based on an enumeration method, and finally, one or more second riding schemes are selected from the obtained second riding schemes and recommended to the user according to the recommended route data set by the user, so that the economic and time-saving riding scheme can be recommended to the user, and the user experience is greatly improved.
Based on the hardware structure, the embodiment of the recommendation method of the riding scheme is provided.
Referring to fig. 2, fig. 2 is a schematic flow chart of a first embodiment of a recommendation method of a riding scheme according to the invention.
In a first embodiment, the method for recommending a riding scheme includes the following steps:
s10: and the user terminal responds to a line inquiry instruction triggered by a user to acquire the starting site and the target site input by the user.
S20: and searching for a first riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing a search algorithm.
It should be understood that in a particular implementation, any two sites, such as site a and site B, are said to be directly reachable from each other if there is a line L passing through both sites, and not directly reachable otherwise. Research shows that in specific application, more than one line passing through the conditions of the site A and the site B at the same time is often satisfied, so that the site direct matrix is formed by constructing all lines capable of being directly passed between the site A and the site B.
Accordingly, what is stored in the site direct matrix in this embodiment is all riding schemes that can be directly transmitted from the starting site to the target site.
In addition, in a specific implementation, the search algorithm in this embodiment is specifically a routing matrix search method and a recursive enumeration method.
That is, the first ride plan for finding out the least number of times of transfer in the route from the starting station to the target station from the pre-constructed station direct matrix by using the search algorithm is as follows: and searching out a first riding scheme with the least number of times of transfer in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the route matrix search method and the recursive enumeration method.
For convenience of understanding, a manner of finding out the first ride plan with the least number of times of transfer in the line from the starting station to the target station from the pre-constructed station through matrix search method and the recursive enumeration method is specifically described below:
firstly, a riding scheme with the least number of times of transfer in a line from the starting station to the target station is found out from a pre-constructed station direct matrix by utilizing the route matrix search method.
Then, the taking plan is used as a search condition, all the taking plans which can be directly reached from the starting station to the target station and are stored in the station direct matrix are traversed based on the recursive enumeration method, and the taking plan meeting the search condition is used as a first taking plan with the least transfer times.
It should be noted that the recursive enumeration method in this embodiment specifically refers to a method having both the characteristics of a recursive function and an enumeration method, that is, when performing a search, a recursive process and a recursive condition are required, and then an exhaustive search is performed in a site through matrix according to the set recursive condition.
In addition, it is worth mentioning that, in order to improve the search speed, before the first ride plan with the least number of times of transfer in the line from the starting station to the target station is searched from the pre-constructed station direct matrix by using a search algorithm, the pre-constructed station direct matrix may be imported into the physical memory space from the virtual memory space.
Correspondingly, the first riding scheme with the least number of times of transfer in the line from the starting station to the target station is found out from a pre-constructed station direct matrix by using a search algorithm, and the first riding scheme is specifically changed to be carried out in the physical memory space, namely, the first riding scheme with the least number of times of transfer in the line from the starting station to the target station is found out from the station direct matrix by accessing the physical memory space and using the route matrix search method and the recursive enumeration method.
It should be noted that the physical Memory space in this embodiment specifically refers to a Memory (Memory) commonly known in practical applications, also referred to as an internal Memory, and is generally composed of a Memory chip, a circuit board, a gold finger, and the like, for example, a Memory bank in a user terminal, because the processing speed of the Memory bank is much higher than the speed set by external storage, before a first riding scheme with the least number of transfers from the starting site to the target site is found from a pre-constructed site direct matrix by using a search algorithm, the pre-constructed site direct matrix is introduced into the physical Memory space from the virtual Memory space, so that the whole subsequent processing can be greatly accelerated, the user waiting time is reduced, and the user experience is further improved.
S30: and determining a second riding scheme with the lowest total riding ticket price in the first riding schemes based on an enumeration method.
It should be understood that, in step S20, all first ride plans satisfying the search condition have been screened out by using the routing matrix search method and the recursive enumeration method, and the number of the first ride plans is limited, so in step S30, the enumeration method is directly selected to determine the second ride plan with the lowest total ride ticket price in each first ride plan, thereby greatly reducing the amount of calculation and increasing the processing speed.
In addition, in a specific implementation, when determining the second riding scheme with the lowest total riding ticket price in each first riding scheme based on an enumeration method, it is necessary to determine the total riding ticket price corresponding to each first riding scheme first, and then select the second riding scheme with the lowest total riding ticket price from the total riding ticket prices based on the enumeration method.
S40: and selecting at least one second riding scheme from the obtained second riding schemes, and recommending the selected at least one second riding scheme to the user.
In order to better understand the recommendation method of the riding scheme provided by the invention, the following specific description is provided:
for convenience of description, the following convention is first applied to the required correspondence:
1)videnotes the originating site, S denotes the originating site viSet of any site that can go straight from.
2) The matrix D ═ Dij)n×n，dijIndicating the point v from the starting siteiTo the destination station vjAnd the riding scheme with the least transfer times is the first riding scheme.
Meanwhile, in order to facilitate management and maintenance of the obtained first riding scheme, a transfer matrix can be constructed according to the found first riding scheme, namely the matrix D, n x n represents that the matrix is a matrix with n rows and n columns, and the value of n is greater than 1.
3) With 0-1 matrix C ═ (C)ij)n×nExpressing a site direct matrix, n multiplied by n expresses that the matrix is a matrix with n rows and n columns, the value of n is more than or equal to 1, cijDenotes the start site viTo the destination station vjAnd (4) a direct riding scheme is achieved. If it is from the starting stationPoint viCan v to the target sitejThrough, c isij1 is ═ 1; otherwise, cij＝∞。
4) Further, in order to find out the first riding scheme conveniently, a transfer identifier matrix F ═ F (F) may be constructed according to the transfer matrix D and the station direct matrix Cij)n×n。fijDenotes the starting site viWith the target site vjWherein i, j is 1, 2, …, n. If in a certain transfer vector, the starting station viIs the target site vjThe predecessor station of (f)ji1 is ═ 1; otherwise fji＝0。
5) Routing matrix R ═ (R)ij)n×n，rijDenotes the start site viTo the destination station vjAnd (3) stations needing transfer, wherein i, j is 1, 2, …, n.
For convenience of description, the method for recommending a ride plan provided in this embodiment is roughly divided into three parts, namely, obtaining a ride plan with the least number of transfers by using a routing matrix search method, obtaining all ride plans with the least number of transfers by using a recursive enumeration method, and obtaining all economic and time-saving ride plans based on the enumeration method, and the implementation of each part is specifically as follows:
1. to solve the bus map G from the initial station v by using a recursive enumeration methodiTo target site viThe first ride plan, which is the least-transfer-times ride plan, first needs to find a ride plan with the least transfer times by using a routing matrix search method, and the solving process is as follows:
the module inorder (r, i, j) function of the routing matrix search method is defined as follows:
if r isijNot equal to 0, the process of recursively searching the line is as follows:
(1)k＝rij；
(2) performing inorder (r, i, k) recursively;
(3) outputting a station k;
(4) performing inorder (r, k, j) recursively;
routing moments aboveThe array search method can only find the initial site viTo target site vjThe one-car plan with the minimum transfer times cannot be obtained. Therefore, a further recursive enumeration method is needed to find all ride plans with the least number of transfers.
2. Scheme for obtaining all riding vehicle with least transfer times by using recursive enumeration method
According to the row vector DiAnd constructing a transfer identification matrix F (F) by the station through matrix Cij)n×nUsing the matrix to store the determined starting site viTo target site vjTarget station v of all the ride plans with the least number of transfers (i.e. first ride plan)jIf station v is a predecessor station ofkIs the target site vjThe predecessor station of (f)ki1, otherwise fki＝0。
For example, the transfer flag matrix F ═ (F)ij)n×nThe construction method of (1) is as follows:
if k ≠ j and dij+cjk＝dijThen f iskj1 is ═ 1; otherwise fkj0. Where j, k is 1, 2, …, n.
Method for solving starting site v by using recursive enumeration methodiTo target site vjFor convenience of description, the recursive function find (F, D) is not usedi，vj，vi) The recursive process is shown as follows:
if v is presentj＝viLet the initial station v firstiStacking, then sequentially popping all the sites in the stack to obtain a slave starting site viTo target site vjThe riding scheme with the least transfer times. Otherwise, let target station v firstjPut on stack and then find the target site vjIf f is a predecessor station ofjk1, a recursive function find (F, D) is performedi，vk，vj) Where k is 1, 2, …, n. Finally, target station v is popped out from the stackjTo implement problem solving.
3. Enumeration-based scheme for solving all economic and time-saving riding schemes
3.1, on the premise of minimum transfer times, obtaining the start site v by using an enumeration methodiTo target site vjThe riding scheme with the lowest total ticket price in all the first riding schemes is named as a second riding scheme, and the process specifically comprises the following steps:
step 1: calculating and solving a total ticket price corresponding to each first riding scheme;
step 2: screening out the lowest total fare in all the first riding schemes;
and step 3: and the first riding scheme with the lowest screened total ticket price is named as a second riding scheme.
3.2 obtaining the starting site v by enumeration method when the transfer times are minimum and the total ticket price is minimumiTo target site vjRiding scheme with least riding time
Step 1: calculating the corresponding total number of the riding stations or riding time of each second riding scheme obtained in the step 3.1;
step 2: screening out the minimum number of the riding stations in all the second riding schemes, or the shortest riding time;
and step 3: and determining the screened second riding scheme with the least number of riding stations or the shortest riding time as a riding scheme option finally recommended to the user.
For verification, the recommendation method based on the riding scheme can recommend an economical and time-saving riding scheme for the user according to the starting station and the target station input by the user, and the following specific description is provided:
suppose that 3957 stations are known in the public transportation system of a certain city, and the public transportation routes are known.
The criterion for the fractional pricing (1 interval between each two adjacent stations) is: the price is 1.5 yuan, 6 intervals can be taken, the fare is 2 yuan in 7-9 intervals, the fare is 2.5 yuan in 10-12 intervals, the fare is 3 yuan in 13-15 intervals, the fare is 3.5 yuan in 16-20 intervals, and the fare is 4 yuan in 21-25 intervals.
The criteria for a single fare are: the fare is 2 yuan no matter how many stations are taken.
When the starting site is v3359 and the target site is v31, the calculation according to the recommendation method of the riding plan is roughly as follows:
step 1: calculating a transfer matrix D ═ Dij)3957×3957。
Step 2: counting a station through matrix C ═ C (C) from the transfer matrix Dij)3957×3957。
And step 3: the ride plan from the origination site v3359 to the destination site v1141 is shown in table 1 below. Wherein, the first riding scheme is a riding scheme for transferring for 2 times.
Table 1 ride plan 1
As can be seen from table 1, the second ride plan selected from the first ride plans and having the lowest total ride ticket price is the ride plans numbered 4 and 5, that is, the two ride plans corresponding to the riding plans numbered 4 and 5, which can be recommended to the user in the ride plan 1.
The above description is only for illustrative purposes and does not limit the technical solutions of the present application in any way.
Through the above description, it is not difficult to find that the method for recommending the riding scheme provided in this embodiment finds out, by using a search method, the first riding scheme with the minimum number of transfer times in a line from the starting station to the target station from the pre-constructed station through matrix, then determines, based on an enumeration method, the second riding scheme with the lowest total riding ticket price in each first riding scheme, and finally selects one or more second riding schemes from the obtained second riding schemes to recommend to the user according to the recommended route data set by the user, so that the economic and time-saving riding scheme can be recommended to the user, and the user experience is greatly improved.
Further, as shown in fig. 3, a second embodiment of the method for recommending a riding scheme according to the present invention is provided based on the first embodiment, and in this embodiment, before at least one second riding scheme is selected from the obtained second riding schemes and the selected at least one second riding scheme is recommended to the user, the number of riding stations corresponding to each second riding scheme needs to be determined, and then the second riding scheme with the smallest number of riding stations needs to be selected based on an enumeration method, which is detailed in step S00 in fig. 3.
For ease of understanding, the following detailed description is made in conjunction with fig. 3:
in step S00: and determining the number of the riding stations corresponding to each second riding scheme, and selecting the second riding scheme with the least number of the riding stations based on an enumeration method.
Accordingly, step S40 is replaced with step S40': and selecting at least one second riding scheme from the obtained second riding schemes with the least riding stations, and recommending the selected at least one second riding scheme to the user.
For the convenience of understanding, table 2 may be referred to table 2, which shows a ride plan table from the starting station v3359 to the target station v1141, specifically, table 2 is derived based on table 1, wherein the second ride plan is a ride plan with a transfer number of 2 and a total fare of 4 yuan.
Table 2 ride plan 2
As can be seen from table 2, the second ride plan selected from the second ride plans and having the lowest total ride ticket price is the ride plan numbered 1, that is, the two ride plans corresponding to the ride plan numbered 1 and recommended to the user in the ride plan 2.
In addition, it is worth mentioning that in a specific implementation, before at least one second riding scheme is selected from the obtained second riding schemes and the selected at least one second riding scheme is recommended to the user, the riding time corresponding to each second riding scheme can be determined, and the second riding scheme with the shortest riding time is selected based on an enumeration method. And then selecting at least one second riding scheme from the obtained second riding schemes with the shortest riding time, and recommending the selected at least one second riding scheme to the user.
For the convenience of understanding, table 3 gives a ride plan table from the starting station v3359 to the target station v1141, and specifically, table 2 is derived on the basis of table 1, wherein the second ride plan is a ride plan with a transfer number of 2 and a total fare of 4 yuan.
Table 3 ride plan 3
As can be seen from table 2, the second ride plan selected from the second ride plans and having the lowest total ride ticket price is the ride plan numbered 1, that is, the two ride plans corresponding to the ride plan numbered 1 and recommended to the user in the ride plan 2.
The above description is only an example, and the technical solution of the present application is not limited at all.
In addition, it should be understood that, whether the number of the riding stations corresponding to the second riding scheme is determined or the riding time corresponding to the second riding scheme is determined, the fact is that the riding scheme which takes the shortest time is selected from all the obtained second riding schemes, the above only provides two specific implementation manners, and in a specific application, a person skilled in the art can reasonably set a filtering manner according to the actual situation, and is not limited herein.
It is not easy to find out through the above description that the method for recommending a riding scheme provided in this embodiment selects at least one second riding scheme from all the obtained second riding schemes with the least number of transfers, and recommends the selected second riding scheme to the user, by determining the number of riding stations or riding time corresponding to each second riding scheme, and recommending the second riding scheme with the least number of riding stations or the shortest riding time to the user, the riding scheme recommended to the user is better, and the user can travel more conveniently.
In addition, the embodiment of the invention also provides a recommendation device for the riding scheme. As shown in fig. 4, the riding scheme recommendation apparatus includes: the system comprises a response module 4001, an acquisition module 4002, a search module 4003, a determination module 4004 and a recommendation module 4005.
The response module 4001 is configured to respond to a line query instruction triggered by a user. An obtaining module 4002 is configured to obtain a starting site and a target site input by a user. The searching module 4003 is configured to search, by using a search algorithm, a first ride plan with the smallest number of transfers in a line from the starting station to the target station from a pre-established station direct matrix. The determining module 4004 is configured to determine, based on an enumeration method, a second ride plan with a lowest total ride ticket price in the first ride plans. The recommending module 4005 is configured to select at least one second riding scheme from the obtained second riding schemes, and recommend the selected at least one second riding scheme to the user.
It should be noted that, in the station-through matrix in this embodiment, all ride plans that can be directly reached from the starting station to the target station are mainly stored.
Through the above description, it is not difficult to find that the recommendation device for a riding scheme provided in this embodiment finds out, by using a search method, a first riding scheme with the minimum number of transfer times in a route from an initial station to a target station from a pre-constructed station through matrix, then determines, based on an enumeration method, a second riding scheme with the minimum total riding ticket price in each first riding scheme, and finally selects one or more second riding schemes from the obtained second riding schemes to recommend to a user according to recommended route data set by the user, so that the purpose of recommending the riding scheme to the user, which is economical and time-saving, can be achieved, and user experience is greatly improved.
In addition, it should be noted that the above-described embodiments of the apparatus are merely illustrative, and do not limit the scope of the present invention, and in practical applications, a person skilled in the art may select some or all of the modules to implement the purpose of the embodiments according to actual needs, and the present invention is not limited herein.
In addition, the technical details that are not described in detail in this embodiment may refer to a recommendation method of a riding scheme provided in any embodiment of the present invention, and are not described herein again.
In addition, an embodiment of the present invention further provides a readable storage medium, where the readable storage medium is a computer-readable storage medium, and a recommendation program of a riding scheme is stored on the computer-readable storage medium, where the recommendation program of the riding scheme, when executed by a processor, implements the following operations:
the method comprises the steps that a user terminal responds to a line inquiry instruction triggered by a user to obtain an initial site and a target site input by the user;
searching a first riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing a search algorithm, wherein all riding schemes which can be directly transmitted from the starting station to the target station are stored in the station direct matrix;
determining a second riding scheme with the lowest total riding ticket price in each first riding scheme based on an enumeration method;
and selecting at least one second riding scheme from the obtained second riding schemes, and recommending the selected at least one second riding scheme to the user.
Further, the recommendation program of the riding scheme is further implemented to perform the following operations when executed by the processor:
determining the number of the riding stations corresponding to each second riding scheme, and selecting the second riding scheme with the least number of the riding stations based on an enumeration method;
correspondingly, the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user specifically includes:
and selecting at least one second riding scheme from the obtained second riding schemes with the least riding stations, and recommending the selected at least one second riding scheme to the user.
Further, the recommendation program of the riding scheme is further implemented to perform the following operations when executed by the processor:
determining the riding time corresponding to each second riding scheme, and selecting the second riding scheme with the shortest riding time based on an enumeration method;
correspondingly, the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user specifically includes:
and selecting at least one second riding scheme from the obtained second riding schemes with the shortest riding time, and recommending the selected at least one second riding scheme to the user.
Further, the search algorithm is a routing matrix search method and a recursive enumeration method, and when executed by the processor, the recommendation program of the riding scheme further implements the following operations:
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the route from the starting station to the target station from the pre-constructed station direct matrix by using the search algorithm specifically includes:
and searching out a first riding scheme with the least number of times of transfer in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the route matrix search method and the recursive enumeration method.
Further, the recommendation program of the riding scheme is further implemented to perform the following operations when executed by the processor:
searching a riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the routing matrix search method;
and traversing all the ride schemes which can be directly transmitted from the starting station to the target station and are stored in the station direct matrix based on the recursive enumeration method by using the ride scheme as a search condition, and using the ride scheme meeting the search condition as a first ride scheme with the least transfer times.
Further, the recommendation program of the riding scheme is further implemented to perform the following operations when executed by the processor:
importing the pre-constructed site direct matrix into a physical memory space from a virtual memory space;
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the line from the starting station to the target station from the pre-constructed station through matrix search method and the recursive enumeration method specifically includes:
and accessing the physical memory space, and searching a first riding scheme with the least transfer times in a line from the starting station to the target station from the station direct matrix by using the routing matrix search method and the recursive enumeration method.
Further, the recommendation program of the riding scheme is further implemented to perform the following operations when executed by the processor:
determining a total fare corresponding to each first riding scheme;
and selecting a second riding scheme with the lowest total riding ticket price from the total riding ticket prices of all the riding schemes based on an enumeration method.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) as described above and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (7)
1. A method for recommending a ride plan, the method comprising the steps of:
the method comprises the steps that a user terminal responds to a line inquiry instruction triggered by a user to obtain an initial site and a target site input by the user;
searching a first riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing a search algorithm, wherein all riding schemes which can be directly transmitted from the starting station to the target station are stored in the station direct matrix;
determining a second riding scheme with the lowest total riding ticket price in each first riding scheme based on an enumeration method;
selecting at least one second riding scheme from the obtained second riding schemes, and recommending the selected at least one second riding scheme to the user;
after the step of selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user, the method further comprises the following steps:
determining the riding time corresponding to each second riding scheme, and selecting a third riding scheme with the shortest riding time based on an enumeration method;
selecting at least one third riding scheme from the obtained third riding schemes with the shortest riding time, and recommending the selected at least one third riding scheme to the user;
before selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user, the method further comprises:
determining the number of the riding stations corresponding to each second riding scheme, and selecting the second riding scheme with the least number of the riding stations based on an enumeration method;
correspondingly, the selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user specifically includes:
selecting at least one second riding scheme from the obtained second riding schemes with the least riding stations, and recommending the selected at least one second riding scheme to the user;
the search algorithm is a routing matrix search method and a recursive enumeration method;
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the route from the starting station to the target station from the pre-constructed station direct matrix by using the search algorithm specifically includes:
and searching out a first riding scheme with the least number of times of transfer in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the route matrix search method and the recursive enumeration method.
2. The method according to claim 1, wherein the finding out the first ride plan with the least number of transfers in the route from the starting station to the target station from the pre-constructed station-to-station matrix by using the routing matrix search method and the recursive enumeration method specifically includes:
searching a riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing the routing matrix search method;
and traversing all the ride schemes which can be directly transmitted from the starting station to the target station and are stored in the station direct matrix based on the recursive enumeration method by using the ride scheme as a search condition, and using the ride scheme meeting the search condition as a first ride scheme with the least transfer times.
3. The method of claim 1, wherein prior to finding a first ride plan with a minimum number of transitions in a line from the starting station to the target station from a pre-constructed station-through matrix using the routing matrix search method and the recursive enumeration method, the method further comprises:
importing the pre-constructed site direct matrix into a physical memory space from a virtual memory space;
correspondingly, the finding out the first riding scheme with the least number of times of transfer in the line from the starting station to the target station from the pre-constructed station through matrix search method and the recursive enumeration method specifically includes:
and accessing the physical memory space, and searching a first riding scheme with the least transfer times in a line from the starting station to the target station from the station direct matrix by using the routing matrix search method and the recursive enumeration method.
4. The method according to claim 1, wherein the determining the second ride plan with the lowest total ride ticket price in each first ride plan based on an enumeration method specifically comprises:
determining a total fare corresponding to each first riding scheme;
and selecting a second riding scheme with the lowest total riding ticket price from the total riding ticket prices of all the riding schemes based on an enumeration method.
5. A recommendation device for a ride plan, the device comprising:
the response module is used for responding to a line inquiry instruction triggered by a user;
the acquisition module is used for acquiring a starting site and a target site input by a user;
the searching module is used for searching a first riding scheme with the least transfer times in a line from the starting station to the target station from a pre-constructed station direct matrix by utilizing a searching algorithm, wherein all riding schemes which can be directly transferred from the starting station to the target station are stored in the station direct matrix;
the determining module is used for determining a second riding scheme with the lowest total riding ticket price in the first riding schemes based on an enumeration method;
the recommendation module is used for selecting at least one second riding scheme from the obtained second riding schemes and recommending the selected at least one second riding scheme to the user;
the determining module is further configured to determine the riding time corresponding to each second riding scheme, and select a third riding scheme with the shortest riding time based on an enumeration method;
the recommending module is further used for selecting at least one third riding scheme from the obtained third riding schemes with the shortest riding time and recommending the selected at least one third riding scheme to the user;
the recommendation module is further configured to determine the number of the riding stations corresponding to each second riding scheme, and select the second riding scheme with the least number of the riding stations based on an enumeration method;
the recommending module is further used for selecting at least one second riding scheme from the obtained second riding schemes with the least riding stations and recommending the selected at least one second riding scheme to the user;
the search module is also used for the search algorithm to be a routing matrix search method and a recursive enumeration method;
the searching module is further configured to search, by using the routing matrix search method and the recursive enumeration method, a first riding scheme with the least number of transfers in a line from the starting station to the target station from a pre-constructed station through matrix.
6. A terminal device, characterized in that the terminal device comprises: a memory, a processor and a program recommendation of a ride plan stored on the memory and executable on the processor, the program recommendation of a ride plan configured to implement the steps of the method of recommendation of a ride plan as claimed in any one of claims 1 to 4.
7. A readable storage medium, characterized in that the readable storage medium is a computer readable storage medium, the computer readable storage medium stores a recommendation program of a riding scheme, and the recommendation program of the riding scheme is executed by a processor to realize the steps of the recommendation method of the riding scheme according to any one of claims 1 to 4.
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 CN108763518A (en) | 2018-11-06 |
| CN108763518B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108509659B (en) * | 2018-05-22 | 2020-10-23 | 武汉轻工大学 | Recommendation method and device for riding scheme, terminal equipment and readable storage medium |
| CN113218411B (en) * | 2021-03-31 | 2022-12-06 | 华录智达科技股份有限公司 | Square partition matrix transfer method suitable for multiple buses |
| CN113536128B (en) * | 2021-07-22 | 2024-07-23 | 青岛海信网络科技股份有限公司 | Recommendation method of transportation hub transfer mode and electronic equipment |
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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108763518A (en) | 2018-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108509659B (en) | Recommendation method and device for riding scheme, terminal equipment and readable storage medium | |
| CN108763518B (en) | Recommendation method and device for riding scheme, terminal equipment and readable storage medium | |
| Ahmad et al. | Characterizing the role of vehicular cloud computing in road traffic management | |
| CN104714961B (en) | Recommend method, apparatus and system in a kind of lodging place | |
| KR101565957B1 (en) | Discovering spam merchants using product feed similarity | |
| JP6422583B2 (en) | Method, apparatus, system, storage medium, program, and computer apparatus for providing authentication information on a web page | |
| US20190095536A1 (en) | Method and device for content recommendation and computer readable storage medium | |
| CN111105251A (en) | Information pushing method and device | |
| CN104320848B (en) | The system and method for indoor positioning is realized based on cloud computing | |
| CN105300398A (en) | Method, device and system for acquiring site information | |
| CN110400201A (en) | Information displaying method, device, electronic equipment and medium | |
| CN114127705B (en) | Method, system and medium for parsing graphic database query | |
| TWI611306B (en) | Transportation services providing method and user device and server using the same | |
| EP3396566A1 (en) | Method, information processing apparatus and program | |
| CN108629456B (en) | Bus data reading method and device, terminal device and readable storage medium | |
| CN113515717B (en) | Navigation page updating method and device, electronic equipment and storage medium | |
| CN106682146A (en) | Method and system for retrieving evaluation of scenic spot according to keyword | |
| CN108616562A (en) | A kind of geographical location information recommendation process method and device | |
| CN112652189B (en) | Traffic distribution method, device and equipment based on policy flow and readable storage medium | |
| CN109727056B (en) | Financial institution recommendation method, device, storage medium and device | |
| CN110321454A (en) | Processing method, device, electronic equipment and the computer readable storage medium of video | |
| CN113175940B (en) | Data processing method, device, equipment and storage medium | |
| US20130254172A1 (en) | Information provision server, information provision system, information provision method and program | |
| CN109726262A (en) | Querying method, device, terminal device and the readable storage medium storing program for executing of public bus network | |
| CN113256253A (en) | Data processing method, device, equipment, computer readable storage medium and product |
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 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |