CN111831906B - Route pushing method and system based on route ranking list - Google Patents
Route pushing method and system based on route ranking list Download PDFInfo
- Publication number
- CN111831906B CN111831906B CN202010566795.8A CN202010566795A CN111831906B CN 111831906 B CN111831906 B CN 111831906B CN 202010566795 A CN202010566795 A CN 202010566795A CN 111831906 B CN111831906 B CN 111831906B
- Authority
- CN
- China
- Prior art keywords
- route
- ranking list
- storage path
- value
- route ranking
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000011156 evaluation Methods 0.000 claims description 167
- 238000004891 communication Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000010006 flight Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G06Q50/40—
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Software Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses an air route pushing method and system based on an air route ranking list, and relates to the field of aviation informatization management. The method comprises the following steps: the server receives request information sent by the user terminal, and determines the type and the demand information of the user terminal according to the request information; the server determines a mother storage path of the route ranking list pre-stored in the database according to the type of the user side, and determines a child storage path of the route ranking list according to the requirement information of the user side; and the server reads the target route ranking list in the database according to the main storage path and the sub storage path and sends the target route ranking list to the user side. The application can quickly find and push the customized route ranking list aiming at the specific user side, can fully utilize the route data, improves the availability and the value of the route data, and is convenient for the user to acquire the route ranking list meeting the self requirements, thereby making more reliable decisions according to the route ranking list or selecting the route which best meets the specific requirements from alternative routes.
Description
Technical Field
The application relates to the field of aviation informatization management, in particular to an air route pushing method and system based on an air route ranking list.
Background
With the rapid development of passenger transport and aviation and the improvement of the living standard of people, an airplane gradually becomes an ideal transportation means for many people when going out, and the informatization application of aviation data also develops. Currently, for the pushing of airlines, subscription is usually adopted as the main, and after airlines or passengers subscribe for some airlines, the pushing information of the aviation data platform is received at regular time.
However, the current pushing mode is limited to the content subscribed by the user, the information using degree is limited, and pushing can not be performed according to different requirements of different users, so that the availability and the value of the route data are reduced.
Disclosure of Invention
Aiming at the defect that the prior art cannot efficiently customize and push route information, the application provides a route pushing method and a system based on a route ranking list.
The technical scheme for solving the technical problems is as follows:
a route pushing method based on a route ranking list comprises the following steps:
the server receives request information sent by a user terminal, and determines the type and the demand information of the user terminal according to the request information;
the server determines a mother storage path of the route ranking list pre-stored in a database according to the type of the user side, and determines a child storage path of the route ranking list according to the requirement information of the user side;
and the server reads the target route ranking list in the database according to the main storage path and the sub storage path and sends the target route ranking list to the user side.
The other technical scheme for solving the technical problems is as follows:
an airline push system based on an airline leaderboard, comprising: server, user side and database, wherein:
the server is used for receiving the request information sent by the user terminal and determining the type and the demand information of the user terminal according to the request information;
the server is further used for determining a mother storage path of the route ranking list pre-stored in the database according to the type of the user side, and determining a child storage path of the route ranking list according to the requirement information of the user side;
the server is further configured to read a target route ranking list in the database according to the parent storage path and the child storage path, and send the target route ranking list to the user terminal.
The beneficial effects of the application are as follows: the application generates the route ranking list with different types and different requirements according to the data of the route in advance and stores the route ranking list in the database, and can quickly find the customized route ranking list aiming at the specific user terminal to push by taking the type and the requirement information of the user terminal as the index information for determining the storage path, thereby fully utilizing the route data, improving the availability and the value of the route data, facilitating the user to acquire the route ranking list meeting the self requirements, and further making more reliable decision according to the route ranking list or selecting the route which best meets the specific requirements from alternative routes.
Additional aspects of the application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the application.
Drawings
FIG. 1 is a schematic flow chart of an embodiment of an airline pushing method of the present application;
FIG. 2 is a schematic diagram of a structural framework provided by an embodiment of the airline pushing system of the present application;
fig. 3 is a schematic diagram of network topology connection provided by an embodiment of the route pushing system of the present application.
Detailed Description
The principles and features of the present application are described below with reference to the drawings, the illustrated embodiments are provided for illustration only and are not intended to limit the scope of the present application.
As shown in fig. 3, an exemplary network topology connection schematic diagram of an airline pushing system based on an airline ranking list is provided, and a server 10 of the airline pushing system provided by the present application may be connected to a plurality of clients 20 through the internet, and an exemplary communication link establishment method is provided below.
The user terminal 20 sends an access internet request to the internet access gateway 30, the internet access gateway 30 sends the access request to the internet service gateway 40, and the internet service gateway 40 authenticates the access request. After the authentication is successful, a message of the authentication success is sent to the internet access gateway 30, and a network communication transmission channel is established with the internet access gateway 30. The internet access gateway 30 sends the message of successful authentication to the user terminal 20, and the user terminal 20 establishes a communication link with the server terminal 10 after receiving the message of successful authentication, so as to perform data transmission.
Some possible embodiments of the application are described below based on the above network structure.
As shown in fig. 1, a flow chart provided for an embodiment of an air route pushing method according to the present application, the air route pushing method is based on a pre-generated air route ranking list, and includes:
s1, a server receives request information sent by a user terminal, and the type and the demand information of the user terminal are determined according to the request information.
It should be noted that, the types of the clients may be divided and set according to actual requirements, for example, the clients may be divided into a voyage client, a passenger client and a travel agency client, and the users corresponding to the clients are airlines, ordinary passengers and travel agencies respectively, because the voyages, passengers and travel agencies have different requirements for different airlines, the types of the airline leaderboards returned by the server may be determined by the types of the clients, for example, the voyages may be more focused on the operation potential of the airlines, and the passengers may be more focused on the price, discount and aviation services of the airlines.
The user terminal can be electronic equipment such as a computer and a mobile phone, when the user terminal interacts with the server, the user terminal can package the information such as the equipment identification code, the time stamp, the data content and the like into a data frame and send the data frame to the server, so that the server can identify the equipment identification code of the user terminal and determine the specific user terminal.
Taking a mobile phone as an example, the server can identify an IMEI code of the mobile phone, determine what type of user terminal is specific, and can pre-correspond the IMEI code of the mobile phone to the type of the user terminal, then store the corresponding type of the user terminal as a data table, after receiving request information of the user terminal, analyze the request information to obtain the IMEI code, and search the type of the user terminal from the data table, for example:
359355041886388-avionics client;
504188638359355-passenger client;
......
886504138359355-passenger user side.
The data content part of the data frame can store the requirement information uploaded by the user side, the requirement information can be the specific requirement of the route ranking list returned by the server, and taking the passenger user side as an example, the passenger hopes to acquire the route with the largest discount strength, so that the requirement information can be the largest discount strength, and the requirement information is transmitted to the server after being converted into the corresponding data format.
S2, the server determines a mother storage path of the route ranking list pre-stored in the database according to the type of the user terminal, and determines a child storage path of the route ranking list according to the requirement information of the user terminal.
It should be understood that the correspondence between the user type and the mother storage path may be pre-stored in the data table, and after the user type is obtained, the mother storage path of the route ranking list may be determined by searching the data table.
For example, assume that the storage path corresponding to the passenger user side may be:
/PT/dataSheet001
the storage path corresponding to the navigation client may be:
/ACT/dataSheet002
PT and ACT are parent storage paths, dataSheet001 and dataSheet002 are child storage paths, association relationship exists between PT and passenger user terminals, and association relationship exists between ACT and avionics user terminals.
After the type of the user terminal is obtained, the mother storage path can be determined by looking up a table according to the corresponding association relation.
The following is a description of a method that may be implemented to determine the sub-storage path. For the demand information, the demands may be various, taking the airline client as an example, some of the airlines may pay more attention to the throughput increase rate of the departure airport, and some of the airlines may pay more attention to the GDP increase rate of the departure city, and then all the airlines may be ranked in advance according to the two evaluation indexes, for example, the airline ranking list of all the airlines after the ranking is stored in table 1 with the throughput increase rate of the departure airport as the evaluation index, and the airline ranking list of all the airlines after the ranking is stored in table 2 with the GDP increase rate of the departure city as the evaluation index.
The memory address of table 1 may be:
/ACT/dataSheet001
the memory address of table 2 may be:
/ACT/dataSheet002
then assuming that the user's demand information is to obtain an airline ranking list with the departure airport throughput increase rate as an evaluation index, then the child storage address may be determined to be "dataSheet001".
It should be understood that more evaluation indexes can be added, or different weights can be given to different evaluation indexes, so that a plurality of data tables with finer granularity and wider evaluation dimension can be generated.
For example, the weight of the throughput increase rate of the departure airport may be assigned to 0.7, the weight of the GDP increase rate of the departure city may be assigned to 0.3, and all airlines may be ranked according to the two evaluation indexes after assignment, thereby obtaining table 3. The weight of the throughput rate of the departure airport can be assigned to 0.3, the weight of the GDP rate of the departure city is assigned to 0.7, and all airlines are ranked according to the two evaluation indexes after assignment, so that the table 4 is obtained.
The manner of assigning the weights can be set according to actual requirements, so that the route ranking list meeting different ranking requirements is obtained, and other types of user terminals are the same and are not described in detail herein.
And S3, the server reads the target route ranking list in the database according to the mother storage path and the child storage path and sends the target route ranking list to the user side.
It should be appreciated that after the parent and child storage paths are obtained, the service also needs to complement the parent and child storage paths to make the path addresses valid.
For example, taking dataSheet002 as an example, an HTTP access address and a data table to be read may be added to the directory structure/ACT/dataSheet 002, and assuming that the access address of the file reading service is http:// file.rankinglist.com/H and the data table is dataSheet002.Html, an HTTP request may be obtained:
http://file.RankingList.com/H/ACT/dataSheet002/dataSheet002.HTML
and accessing the request through the webpage, obtaining a corresponding data table, and displaying at the user side.
According to the embodiment, the route ranking list with different types and different requirements is generated in advance according to the data of the route and is stored in the database, the type and the requirement information of the user side are used as index information for determining the storage path, the customized route ranking list aiming at the specific user side can be quickly searched for pushing, the route data can be fully utilized, the availability and the value of the route data are improved, a user can conveniently obtain the route ranking list meeting the requirements of the user, so that a more reliable decision is made according to the route ranking list, or the route which meets the specific requirements best is selected from alternative routes.
Optionally, in some possible implementations, before the server receives the request information sent by the user side, the method further includes:
the server obtains an evaluation index for ranking the airlines, determines a comprehensive evaluation value of each airline according to the evaluation index, ranks all airlines according to the comprehensive evaluation value, and obtains an airline ranking list.
And the server stores all obtained route ranking lists in corresponding mother storage paths according to evaluation indexes according to the route ranking lists by each route ranking list, and associates each mother storage path with different user terminal types.
Specifically, if the evaluation indexes according to the evaluation method are the same, the evaluation indexes can be stored in the same mother storage path, and if at least one of the evaluation indexes according to the evaluation method is different, the evaluation indexes can be stored in different mother storage paths.
For example, assume that the evaluation index on which the route ranking A is based on is a, b, c; the evaluation indexes according to which the route ranking list B is based on the route ranking are a, B and c; and the evaluation indexes according to which the route ranking list C is based on the route ranking are b and C. Then the route ranking list a and the route ranking list B may be stored under the same parent storage path and the route ranking list C may be stored under another parent storage path.
And the server stores the route ranking list in each mother storage path in the corresponding sub storage path according to the weight of each route ranking list on the evaluation index according to the route ranking list, and associates each sub storage path with different demand models.
It should be understood that, for the route leaderboards under the same parent storage path, the used evaluation indexes are necessarily the same, and the weight of the evaluation index of each route leaderboard is necessarily different, otherwise, the route leaderboard is the same, so each route leaderboard can be stored under different child storage paths.
For example, assuming that the evaluation indexes according to which the route ranking list D, E, F is based on are a, b, and c, wherein the weight of the evaluation index of the route ranking list D is 0.7,0.2,0.1 in turn, and the weight is obviously biased to the evaluation index a, the demand model corresponding to the route ranking list D may be an a model, and the a model may be associated; the weight of the evaluation indexes of the route ranking list E is 0.2,0.5,0.3 in sequence, the weight is obviously biased to the evaluation index b, and then the demand model corresponding to the route ranking list E can be a b model for association; the weights of the evaluation indexes of the route ranking list F are 0.5,0.4,0.2 in sequence and the weights are average, so that the demand model corresponding to the route ranking list F can be a balance model for association. The route leaderboards D, E, F can be stored under different sub-storage paths, respectively.
It should be noted that, the selection of the evaluation index is determined by the actual requirement, and the required airline flight list is different for different user end types and different requirements, so that the evaluation index for obtaining the airline ranking list may also be different.
For example, for an airline company, which may be more concerned about the potential and strength of the airline, the most potential airline ranking list and the airline value total list may be recommended to the airline client, and the evaluation index of the most potential airline ranking list may include: departure airport throughput rate, departure city GDP rate, arrival airport throughput rate, arrival city GDP rate, etc., the airline value total list may include: number of airlines, number of flights, discount rate, passenger rate, etc.
For an ordinary passenger, who may be more concerned about the price, delay rate, etc. of the flight, the most valuable airline ranking list and the most time airline ranking list may be recommended to the passenger user, and the evaluation index of the most valuable airline ranking list may include: seat kilometer income, discount rate, passenger seat rate, income per kilometer and the like; the evaluation index of the most time course ranking list may include: quasi-point rate, execution rate, month delay time length, etc.
For the travel group, the number of team positions of the flight, the group preferential price and the like are possibly more concerned, the favorite route ranking list of the travel agency can be recommended for the user side of the travel group, and the method can comprise the following steps: team digit number, group preference price, etc.
It should be understood that the above evaluation index selection of the route ranking list and the correspondence between the ranking list and the user side are only exemplary, and the same route ranking list may be actually pushed to different user sides, for example, the standard point rate and the execution rate may be used as the evaluation index of the most valuable route ranking list; the quasi-point rate and the execution rate can also be used as evaluation indexes of the most potential route ranking list. The most valuable route ranking list and the most punctual route ranking list can be stored in a corresponding mother storage path of the navigation user side and pushed to the navigation user side; and the most potential route ranking list and the route value ranking list can be stored under the corresponding mother storage path of the passenger user side and pushed to the passenger user side.
Since there may be multiple evaluation indexes used for a route ranking list, several exemplary methods for calculating the comprehensive evaluation value are given below:
for example, all the evaluation indexes for evaluating the route ranking list can be weighted according to preset weights and then summed to obtain the comprehensive evaluation value.
In the second example, all the evaluation indexes for evaluating one route ranking list may be subjected to standardization and normalization, and the obtained values may be averaged to obtain a comprehensive evaluation value.
It should be understood that those skilled in the art may also select other existing methods for calculating the integrated value, which are not described in detail herein.
Compared with the traditional method of temporarily screening data according to user demands, the route ranking list provided by the application can be generated in advance and directly called, and has no data ranking process, so that the calling speed is high, the route ranking list which is most suitable for the user demands can be searched and called according to the user end type and the demand information as the reading basis, and the route ranking list can also generate ranking with different granularity according to different weights of evaluation indexes, and can generate a large number of evaluation index combinations with different weight due to the fact that the ranking list is preformed in advance.
Optionally, in some possible implementations, the server determines the comprehensive evaluation value for each route according to the following formula:
wherein N is a comprehensive evaluation value, K i An evaluation value X of the ith evaluation index i The weight value K of the ith evaluation index imin Minimum evaluation value K of ith evaluation index of all airlines imax I=1, 2,3, n, n is the number of evaluation indices, which is the maximum evaluation value of the i-th evaluation index of all airlines.
It should be understood that X i The comprehensive evaluation value can be calculated through the formula according to actual requirements, the obtained comprehensive evaluation value is more representative, and the importance degree of each evaluation index can be reflected, so that the ranking of the route ranking list is more reliable and credible.
For example, an exemplary comprehensive evaluation value calculation method is given below, and table 1 is a route ranking list in units of months:
TABLE 1
Taking the most valuable route as an example, as shown in Table 1, the normalized N value may be first found:
the maximum and minimum values of the columns represent the maximum and minimum values of K1, K2 and K3 of all the airlines, the airlines are taken as statistical main bodies, and the airlines can be set according to requirements, for example, the airlines can comprise all the airlines in flight of the whole network, and can also be all the airlines in flight of a certain province or a certain area. Only single leg data is taken from the basic data of each route, only leg data between two points of the route is taken through a dead line, the value range can be two statistical dimensions of month and year, and the K value is obtained through statistics.
And multiplying the X values of the following weight tables to obtain a final comprehensive evaluation value N of the route:
N＝N1×X1+N2×X2+N3×X3
and after the comprehensive N values of all the airlines are calculated, carrying out the ranking list with the highest value according to the N values.
Preferably, the comprehensive evaluation value N can be converted into decimal, and one bit is reserved after the decimal point so as to be convenient for the display of the user side.
Optionally, in some possible implementations, associating each parent storage path with a different client type specifically includes:
associating the first parent storage path with a passenger user side, associating the second parent storage path with a navigation user side, and associating the first parent storage path with a travel agency user side;
the evaluation indexes of the route ranking list stored under the first, second and third mother storage paths for the route ranking are different from each other.
The types of the user side are set to be the passenger user side, the airline company user side and the travel agency user side, and the types of the user side, the airline company user side, the travel agency user side and the corresponding mother storage paths are associated, so that the requirements of most users on the market at present can be met, the evaluation indexes on which the airline charts stored under each mother storage path are based on the airline charts are different from each other, the charts with different characteristics can be generated from the angles of common passengers, airlines and travel agencies respectively, the charts under each mother storage path have unique characteristics, the specific user requirements are met, the stored airline charts have more pertinence, and the expertise is stronger.
Optionally, in some possible implementations, the evaluation index on which the route ranking table stored under the first parent storage path is based on includes: at least one of seat kilometer income, discount rate, passenger seat rate, punctual rate and execution rate;
the evaluation indexes of the route ranking list stored under the second mother storage path for the route ranking include: at least one of a departure airport throughput growth rate and a departure city GDP growth rate;
the evaluation indexes of the route ranking list stored under the third mother storage path for the route ranking include: team bit number.
The requirements of various types of user terminals can be met to the greatest extent through the evaluation indexes, and the obtained result is more reliable and accurate by using the evaluation indexes to rank the airlines.
Optionally, in some possible implementations, determining the sub-storage path of the route ranking list according to the requirement information of the user side specifically includes:
the server determines the weight of all evaluation indexes for ranking the airlines according to the demand information of the user side, the reference value of each evaluation index is called from a preset data table, the weight of each evaluation index is multiplied by the corresponding reference value and then summed to obtain a matched value;
the server calculates the difference between the matching value and the demand value of each demand model, and takes the sub-storage path corresponding to the demand model with the minimum difference as the final determined sub-storage path;
the demand value of each demand model is obtained by multiplying the preset weight of the corresponding route ranking list evaluation index by the reference value and summing the multiplied preset weight, and the preset weights of the different route ranking list evaluation indexes are different from each other.
It should be understood that the demand information includes the tendency of the user to each evaluation index, and specifically, the tendency of the user to each evaluation index in the demand information may be obtained by developing software or a program at the user side.
For example, an input box may be displayed on a display interface of the user side by developing a program, and the user's tendency to each evaluation index may be acquired through the input box. Taking the most potential route ranking list as an example, the evaluation index can be the throughput increase rate of the departure airport and the GDP increase rate of the departure city, so that the 'whether you are more willing to take the throughput of the departure airport' can be displayed on the display interface, the corresponding input box can input values between 1 and 10, the larger the values are more agreeable, the tendency of the user to each evaluation index can be obtained, the weight of the evaluation index, namely the throughput increase rate of the departure airport, can be determined according to the values input by the user, and if the values are larger, the index can be given larger weight.
The tendency of the user to each evaluation index can also be obtained in other manners, for example, by a questionnaire option, the problem is the same as that of the above example, the options can be yes, general and no, and each option corresponds to different weights respectively, so that the tendency of the user to each evaluation index is obtained, and the weights of all the evaluation indexes are obtained.
It should be understood that the reference value and the preset weight of each evaluation index may be set according to actual requirements, for example, it is assumed that for the passenger user side, there are 3 route charts stored in the same parent storage path, and the 3 route charts are respectively stored in different child storage paths, that is, the 3 route charts have the same evaluation index, but the weights of the evaluation indexes are different.
Assuming that the 3 route leaderboards are respectively a leaderboard a, a leaderboard B and a leaderboard C, and the evaluation indexes are a, B and C, the reference values of the three indexes can be 100, 10 and 1 in sequence.
The evaluation index of the ranking list A is assumed to be weighted as follows: 0.3,0.3,0.4, the corresponding demand model is model a;
the evaluation indexes of the ranking list B are weighted as follows: 0.1,0.1,0.8, the corresponding demand model is model B;
the evaluation indexes of the ranking list C are weighted as follows: 0.7,0.2,0.1, the corresponding demand model is model C.
Then the demand value of model a is 0.3×100+0.3×10+0.4×1=33.4;
the required value for model B is 0.1×100+0.1×10+0.8×1=11.8;
the required value for model C is 0.7x100+0.2x10+0.1x1=72.1;
assuming that after the demand information sent by the user side is analyzed, the weights of the evaluation indexes a, b and c are 0.5,0.3,0.2, the matching value of the user side can be obtained as follows: 0.5×100+0.3×10+0.2×1=52.2, then the matching value is differenced from the required values of model a, model B, model C, respectively, to obtain a difference, and it should be understood that to obtain an accurate result, the obtained difference should be an absolute value.
The obtained difference values are as follows: 18.8 40.4, 19.9, comparing to find that the difference between the matching value and the requirement value of the model a is minimum, then the sub-storage path corresponding to the model a can be used as the final determined sub-storage path, and the route ranking list corresponding to the model a can be read from the final determined sub-storage path.
It should be appreciated that as the weight combinations increase, the granularity of the airline leaderboard also increases, thereby enabling more accurate matching of the user's needs.
The person skilled in the art may also select other ways to determine the matched route ranking list, for example, directly compare the weights of each evaluation index, select the demand model with the closest evaluation index, or select the demand model with the closest evaluation index with the largest weight, as the final matching result.
However, other matching modes have the problem that the matching process is complex or the problem that the matching accuracy is low, and the matching method can be used for matching by the mode, so that more important evaluation indexes can be endowed with a larger reference value, the matching result is close to the evaluation index with the larger reference value, the evaluation index with the larger reference value has larger influence on the ranking result, the influence degree of different evaluation indexes on the route ranking list can be randomly controlled, the ranking controllability is improved, the route ranking list can be conveniently and timely regulated and controlled, and users can obtain different matching results only by adjusting the reference value, so that the flexibility is higher and the practicability is stronger.
It should be understood that the route ranking list has regionality, for example, as shown in table 2, the routes may be divided into nationwide regions with the start and the arrival as two-point geographic regions, and the regional ranking may be performed according to the comprehensive evaluation value N of each route calculated above. Wherein A is any starting point, B is any arrival point, and AB is the route.
TABLE 2
It should be understood that in some possible embodiments, a combination of any or all of the implementations of the above embodiments may be included.
As shown in fig. 2, a schematic structural frame provided for an embodiment of an airline pushing system of the present application, the airline pushing system pushing based on a pre-generated airline ranking list, includes: server 1, user side 2 and database 3, wherein:
the server 1 is used for receiving request information sent by the user side and determining the type and the demand information of the user side 2 according to the request information;
the server 1 is further configured to determine a mother storage path of the route ranking list pre-stored in the database 3 according to the type of the user terminal 2, and determine a child storage path of the route ranking list according to the requirement information of the user terminal 2;
the server 1 is further configured to read the target route ranking list in the database 3 according to the parent storage path and the child storage path, and send the target route ranking list to the client 2.
According to the embodiment, the route ranking list with different types and different requirements is generated in advance according to the data of the route and is stored in the database, the type and the requirement information of the user side are used as index information for determining the storage path, the customized route ranking list aiming at the specific user side can be quickly searched for pushing, the route data can be fully utilized, the availability and the value of the route data are improved, a user can conveniently obtain the route ranking list meeting the requirements of the user, so that a more reliable decision is made according to the route ranking list, or the route which meets the specific requirements best is selected from alternative routes.
Optionally, in some possible implementations, the server is further configured to obtain an evaluation index for ranking the routes, determine a comprehensive evaluation value of each route according to the evaluation index, rank all routes according to the comprehensive evaluation value, and obtain a route ranking list;
the server is further used for storing all obtained route ranking lists in corresponding mother storage paths according to evaluation indexes according to the route ranking lists, and associating each mother storage path with different user terminal types;
the server is further configured to store the route ranking list in each parent storage path in a corresponding child storage path according to the weight of each route ranking list on the evaluation index according to the route ranking list, and associate each child storage path with different demand models.
Optionally, in some possible implementations, the server is specifically configured to determine the comprehensive evaluation value for each route according to the following formula:
wherein N is a comprehensive evaluation value, K i An evaluation value X of the ith evaluation index i The weight value K of the ith evaluation index imin Minimum evaluation value K of ith evaluation index of all airlines imax I=1, 2,3, n, n is the number of evaluation indices, which is the maximum evaluation value of the i-th evaluation index of all airlines.
Optionally, in some possible implementations, the server is specifically configured to associate the first parent storage path with the passenger user side, associate the second parent storage path with the navigation user side, and associate the first parent storage path with the travel agency user side;
the evaluation indexes of the route ranking list stored under the first, second and third mother storage paths for the route ranking are different from each other.
Optionally, in some possible implementations, the server is specifically configured to determine weights of all the evaluation indexes for ranking the airlines according to the requirement information of the user side, call a reference value of each evaluation index from a preset data table, multiply the weights of each evaluation index with the corresponding reference value, and then sum the multiplied weights to obtain a matching value; calculating the difference between the matching value and the demand value of each demand model, and taking the sub-storage path corresponding to the demand model with the minimum difference as the final determined sub-storage path;
the demand value of each demand model is obtained by multiplying the preset weight of the corresponding route ranking list evaluation index by the reference value and summing the multiplied preset weight, and the preset weights of the different route ranking list evaluation indexes are different from each other.
It should be understood that in some possible embodiments, a combination of any or all of the implementations of the above embodiments may be included.
The foregoing embodiments are product embodiments corresponding to the previous method embodiments, so the description of each optional implementation manner of the product embodiments and the corresponding technical effects of each optional implementation manner of the product embodiments may refer to the previous method embodiments, and are not repeated herein.
The reader will appreciate that in the description of this specification, a description of terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
In the several embodiments provided by the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the method embodiments described above are merely illustrative, e.g., the division of steps is merely a logical function division, and there may be additional divisions of actual implementation, e.g., multiple steps may be combined or integrated into another step, or some features may be omitted or not performed.
The present application is not limited to the above embodiments, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the present application, and these modifications and substitutions are intended to be included in the scope of the present application. Therefore, the protection scope of the application is subject to the protection scope of the claims.
Claims (8)
1. The route pushing method based on the route ranking list is characterized by comprising the following steps of:
associating each parent storage path with a different user side type;
the server receives request information sent by a user terminal, and determines the type and the demand information of the user terminal according to the request information;
the server determines a mother storage path of the route ranking list pre-stored in a database according to the type of the user side, and determines a child storage path of the route ranking list according to the requirement information of the user side;
the server reads a target route ranking list in the database according to the main storage path and the sub storage path and sends the target route ranking list to the user side;
determining a sub-storage path of the route ranking list according to the requirement information of the user side, wherein the sub-storage path comprises the following specific steps:
the server determines the weight of all evaluation indexes for ranking the airlines according to the demand information of the user side, a reference value of each evaluation index is called from a preset data table, the weight of each evaluation index is multiplied by the corresponding reference value and then summed to obtain a matching value;
the server calculates the difference value between the matching value and the demand value of each demand model, and takes the sub-storage path corresponding to the demand model with the minimum difference value as the final determined sub-storage path;
the demand value of each demand model is obtained by multiplying the preset weight of the corresponding route ranking list evaluation index by the reference value and summing the multiplied preset weight, and the preset weights of the different route ranking list evaluation indexes are different from each other.
2. The route pushing method based on the route ranking list of claim 1, wherein before the server receives the request information sent by the user side, the method further comprises:
the server obtains an evaluation index for ranking the airlines, determines a comprehensive evaluation value of each airline according to the evaluation index, ranks all airlines according to the comprehensive evaluation value, and obtains an airline ranking list;
the server stores all obtained route ranking lists in corresponding mother storage paths according to evaluation indexes according to which each route ranking list is used for ranking the route, and associates each mother storage path with different user terminal types;
and the server stores the route ranking list in each mother storage path in the corresponding sub storage path according to the weight of each route ranking list on the evaluation index according to the route ranking list, and associates each sub storage path with different demand models.
3. The route pushing method based on the route ranking list of claim 2, wherein the server determines the comprehensive evaluation value of each route according to the following formula:
wherein N is a comprehensive evaluation value, K i An evaluation value X of the ith evaluation index i The weight value K of the ith evaluation index imin Minimum evaluation value K of ith evaluation index of all airlines imax I=1, 2,3, …, n, n is the number of evaluation indexes, which is the maximum evaluation value of the ith evaluation index of all the routes.
4. The route pushing method based on the route ranking list according to claim 2, wherein associating each of the mother storage paths with a different user side type specifically comprises:
associating the first parent storage path with a passenger user side, associating the second parent storage path with a navigation user side, and associating the first parent storage path with a travel agency user side;
the evaluation indexes of the route ranking list stored under the first, second and third mother storage paths for the route ranking are different from each other.
5. An airline push system based on an airline ranking list, comprising: server, user side and database, wherein:
the server is used for associating each mother storage path with different user side types;
the server is also used for receiving the request information sent by the user side, and determining the type and the demand information of the user side according to the request information;
the server is further used for determining a mother storage path of the route ranking list pre-stored in the database according to the type of the user side, and determining a child storage path of the route ranking list according to the requirement information of the user side;
the server is further used for reading a target route ranking list in the database according to the main storage path and the sub storage path and sending the target route ranking list to the user side;
the server is specifically configured to determine weights of all evaluation indexes for ranking the airlines according to the requirement information of the user side, call a reference value of each evaluation index from a preset data table, multiply the weights of each evaluation index with the corresponding reference value, and sum the multiplied weights to obtain a matching value; calculating the difference between the matching value and the demand value of each demand model, and taking the sub-storage path corresponding to the demand model with the minimum difference as the final determined sub-storage path;
the demand value of each demand model is obtained by multiplying the preset weight of the corresponding route ranking list evaluation index by the reference value and summing the multiplied preset weight, and the preset weights of the different route ranking list evaluation indexes are different from each other.
6. The route pushing system based on a route ranking list of claim 5, wherein the server is further configured to obtain an evaluation index for ranking routes, determine a comprehensive evaluation value of each route according to the evaluation index, rank all routes according to the comprehensive evaluation value, and obtain a route ranking list;
the server is further used for storing all obtained route ranking lists in corresponding mother storage paths according to evaluation indexes according to the route ranking list by each route ranking list, and associating each mother storage path with different user terminal types;
the server is further configured to store the route ranking list in each parent storage path in a corresponding child storage path according to the weight of each route ranking list on the evaluation index according to the route ranking list, and associate each child storage path with different demand models.
7. The route pushing system based on a route ranking list of claim 6, wherein the server is specifically configured to determine the comprehensive evaluation value of each route according to the following formula:
wherein N is a comprehensive evaluation value, K i An evaluation value X of the ith evaluation index i The weight value K of the ith evaluation index imin Minimum evaluation value K of ith evaluation index of all airlines imax I=1, 2,3, …, n, n is the number of evaluation indexes, which is the maximum evaluation value of the ith evaluation index of all the routes.
8. The route pushing system based on a route ranking list of claim 6, wherein the server is specifically configured to associate a first parent storage path with a passenger user, associate a second parent storage path with a flight user, and associate the first parent storage path with a travel agency user;
the evaluation indexes of the route ranking list stored under the first, second and third mother storage paths for the route ranking are different from each other.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010566795.8A CN111831906B (en) | 2020-06-19 | 2020-06-19 | Route pushing method and system based on route ranking list |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010566795.8A CN111831906B (en) | 2020-06-19 | 2020-06-19 | Route pushing method and system based on route ranking list |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111831906A CN111831906A (en) | 2020-10-27 |
| CN111831906B true CN111831906B (en) | 2023-12-01 |
Family
ID=72897849
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010566795.8A Active CN111831906B (en) | 2020-06-19 | 2020-06-19 | Route pushing method and system based on route ranking list |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111831906B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011142615A2 (en) * | 2010-05-14 | 2011-11-17 | Kim Ji Woong | Comment recommendation method using a virtual value index, system for the method, web server and system for providing a web service |
| CN105245924A (en) * | 2015-09-28 | 2016-01-13 | 北京奇艺世纪科技有限公司 | Video information push and display method and video player using the method |
| CN105868377A (en) * | 2016-03-31 | 2016-08-17 | 北京奇艺世纪科技有限公司 | Method and device for pushing information |
| CN108564338A (en) * | 2018-03-28 | 2018-09-21 | 施益斌 | Platform Server and architectural design bidding service system |
| CN110472141A (en) * | 2019-07-18 | 2019-11-19 | 海南太美航空股份有限公司 | For managing server, terminal, the system and method for route information |
| CN110659414A (en) * | 2019-09-02 | 2020-01-07 | 惠州学院 | User portrait based personalized information pushing method and user side |
| CN113850695A (en) * | 2021-09-07 | 2021-12-28 | 海南太美航空股份有限公司 | Big data-based aviation information management platform and method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8346624B2 (en) * | 2009-12-09 | 2013-01-01 | Allconnect, Inc. | Systems and methods for recommending third party products and services |
-
2020
- 2020-06-19 CN CN202010566795.8A patent/CN111831906B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011142615A2 (en) * | 2010-05-14 | 2011-11-17 | Kim Ji Woong | Comment recommendation method using a virtual value index, system for the method, web server and system for providing a web service |
| CN105245924A (en) * | 2015-09-28 | 2016-01-13 | 北京奇艺世纪科技有限公司 | Video information push and display method and video player using the method |
| CN105868377A (en) * | 2016-03-31 | 2016-08-17 | 北京奇艺世纪科技有限公司 | Method and device for pushing information |
| CN108564338A (en) * | 2018-03-28 | 2018-09-21 | 施益斌 | Platform Server and architectural design bidding service system |
| CN110472141A (en) * | 2019-07-18 | 2019-11-19 | 海南太美航空股份有限公司 | For managing server, terminal, the system and method for route information |
| CN110659414A (en) * | 2019-09-02 | 2020-01-07 | 惠州学院 | User portrait based personalized information pushing method and user side |
| CN113850695A (en) * | 2021-09-07 | 2021-12-28 | 海南太美航空股份有限公司 | Big data-based aviation information management platform and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111831906A (en) | 2020-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104169950A (en) | Database system using batch-oriented computation | |
| US20120102027A1 (en) | Compatibility Scoring of Users in a Social Network | |
| US20230060713A1 (en) | Methods for recommending parking lots in smart cities, internet of things systems, and storage medium thereof | |
| CN104169911A (en) | Categorizing and ranking travel-related search results | |
| CN110020022B (en) | Data processing method, device, equipment and readable storage medium | |
| US20160307281A1 (en) | Selecting search results for responding to search query | |
| CN111797320B (en) | Data processing method, device, equipment and storage medium | |
| US20210174266A1 (en) | Devices, systems and methods for providing ancillary objects from a cache and categorized provider objects | |
| CN108564338B (en) | Platform server and architectural design bidding service system | |
| CN111581506A (en) | Flight recommendation method and system based on collaborative filtering | |
| CN112819263A (en) | Method and device for dispatching customer service | |
| CN110378739B (en) | Data traffic matching method and device | |
| Peña et al. | A novel multi-objective optimization approach to guarantee quality of service and energy efficiency in a heterogeneous bus fleet system | |
| CN111831906B (en) | Route pushing method and system based on route ranking list | |
| US20160300288A1 (en) | Recommendation system | |
| CN107515954A (en) | Generation method, big data system and the storage medium of housed device report | |
| Pacheco Paneque | A general framework for the integration of complex choice models into mixed integer optimization | |
| EP1693768A2 (en) | Information posting system and information posting method | |
| CN111460301A (en) | Object pushing method and device, electronic equipment and storage medium | |
| Young et al. | Development of railway station choice models to improve the representation of station catchments in rail demand models | |
| CN111831892A (en) | Information recommendation method, information recommendation device, server and storage medium | |
| CN114399202A (en) | Big data visualization system for urban community | |
| CN111415075B (en) | Vehicle scheduling method and device | |
| CN114970990A (en) | Business travel recommendation method, device and medium | |
| Wang et al. | Itineraries evaluated and ranked using fuzzy logic |
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 |