Civil aviation air ticket searching method, device and equipment and medium

Abstract

The invention relates to the technical field of aviation management, in particular to a civil aviation air ticket searching method and device, equipment and a medium. According to the multi-stage filtering device provided by the invention, the search space is reduced layer by layer from coarse to fine in each link of air ticket search in combination with gradually improved information, so that a high-quality air ticket search result is obtained at an acceptable performance level, and good balance between the search depth and the search performance is realized; according to the invention, rationality, diversity, boundary (minimum / maximum) and convenience (by introducing a punishment mechanism) are considered in design of each stage of filtering device; the related configuration parameters of the multi-stage filter device and equipment provided by the invention allow a user to set and adjust according to own needs, so that the target of continuously calibrating and optimizing the search effect in the operation process is achieved.

Description

Technical Field

[0001] The present disclosure relates to the field of aviation management technology, and in particular to a method, device, equipment and medium for searching civil aviation tickets. Background Art

[0002] Civil aviation ticket search refers to the use of business, algorithm and technology optimization to integrate the airline's flight capacity data, fare and rule data, and additional services based on the itinerary information, passenger information, itinerary preference information entered by the passenger and the identity information of the ticket seller, so as to provide passengers with corresponding ticket products and prices. The ticket search problem is an NP-complete problem and one of the most difficult problems to solve in the aviation tourism industry. Ticket search products need to handle hundreds of thousands of direct flights and hundreds of millions of direct fares from hundreds of airlines around the world every day, as well as the larger scale of connecting flights, combined fares and rule fares built on this basis, and also include real-time changing flight capacity data. The ticket search system needs to search for results that meet the needs of passengers and the intentions of sellers in a massive data space within a limited time (usually only a few seconds). Take a round trip with one transfer on both the outbound and return trips as an example. The round trip contains four segments. Assuming that the number of flights in each segment is N, then the number of flight combinations for a round trip with 4 segments is N. 4 ; Assuming that each flight has N available seats, the number of available seat combinations is also N 4 ; Assume that there are N fares for the outbound and return trips, then the number of fare combinations is N 2 , so the entire search space is N 10 The flight search system needs to find N 10 The complexity of finding several possible solutions in the search space can be imagined. Even with super computing power, it is impossible to calculate all possible combinations or explore all feasible solutions.

[0003] In summary, there is an urgent need to design and optimize from the business, algorithm and technology perspectives, while setting reasonable constraints on the air ticket search problem and gradually reducing the search space, so as to obtain several possible solutions that meet the passengers' search conditions within a limited time. Summary of the invention

[0004] In view of the above problems, the present invention provides a method, device, equipment and medium for searching civil aviation tickets.

[0005] In a first aspect, a civil aviation ticket search method includes:

[0006] Receive and parse the search request from the user, and determine whether the user request is legal, and obtain the legal search request;

[0007] Build all itinerary plans based on legitimate search requests and historical databases, and obtain candidate route combination plans through multi-level screening;

[0008] Based on the candidate path combination scheme, the corresponding direct and transfer flight routes are obtained, and all flight sequence sets are generated in combination with the flight database, and the candidate flight combination set is screened;

[0009] Verify the fare rules corresponding to the candidate flight combinations, and obtain the flight combinations that pass the rule verification;

[0010] The flight combinations that have passed the rule verification are sorted and screened according to the user's specified or system default method, and the final search results are generated and output to the user in the form of a message.

[0011] Furthermore, receiving and parsing the search request from the user and determining whether the user request is legal include:

[0012] When receiving a ticket search request from a user, the request receiving unit parses the ticket search request from the user;

[0013] The search request includes the following itinerary information: origin, destination, itinerary type, departure date, return date, passenger type, and number of passengers;

[0014] When the itinerary information exists at the same time, the user request is judged to be a legitimate request.

[0015] Furthermore, all itinerary plans are constructed based on legitimate search requests and historical databases, including:

[0016] Based on the origin, destination, itinerary type, departure date, return date, passenger type and number of passengers in the user's search request and combined with the historical database, all possible itineraries are constructed, and the legality of the itinerary is checked.

[0017] Furthermore, check whether the itinerary is legal and use the International Air Transport Association (IATA) rules to verify the legality of each itinerary.

[0018] Furthermore, candidate path combination solutions are obtained through multi-level screening, including:

[0019] The itinerary plan is screened through the first-level filter filter1; the filtered itinerary plan is combined with the information of the fare database to generate a path combination plan, the path combination plan is pre-checked, and the path combination that passes the pre-check is screened through the second-level filter filter2 to obtain a candidate path combination plan.

[0020] Furthermore, the first-level filter filter1 indicates that the following parameter requirements are met at the same time:

[0021] Reasonable parameters include: each itinerary contains at most X fare units PU; each itinerary contains at most Y fare calculation groups FC; each FC contains at most M stopover points; all locations included in the itinerary can be found in the active airport list, where active airports refer to airports where flights take off or land, and X, Y, and M are positive integers;

[0022] Comprehensive score threshold, when the comprehensive score of the trip exceeds the threshold, it is filtered out; where comprehensive score threshold = H*min{comprehensive score of the trip}; H is a set constant, and the comprehensive score of the trip is determined in the following way: the comprehensive score includes price score + penalty value, with NUC as the calculation unit, and the price score is retrieved from the pre-processed experience database according to the origin, destination, and trip type; the penalty value is calculated as follows: for each non-user-specified split point introduced into the trip, the corresponding number of penalty values ​​b NUC is added;

[0023] Minimum and maximum number of strokes settings: Set the number of strokes retained after filtering by filter1 according to different stroke types:

[0024] One-way: [X1; X2], that is, a minimum of X1 journeys and a maximum of X2 journeys are reserved for a one-way trip

[0025] Round trip: [M1; M2], that is, a minimum of M1 journeys and a maximum of M2 journeys are reserved for a round trip

[0026] Multi-journey: [Y1; Y2]; that is, a multi-journey reserves at least Y1 journeys and at most Y2 journeys. X1, X2, M1, M2, Y1, and Y2 are all constants and are adjusted according to system operation conditions and user needs.

[0027] Diversity parameters, the following itineraries are retained: All itineraries with a single airline are retained.

[0028] Furthermore, the secondary filter fliter2 indicates that the following parameter requirements are met at the same time:

[0029] Reasonable parameters include: the maximum number of transfers between any city pair in the itinerary does not exceed the minimum number of transfers between the city pairs + n; the airlines on each path in the path combination meet the interline agreement; all airlines involved in the path combination are authorized to access in this environment;

[0030] Comprehensive score threshold. When the comprehensive score of a path combination exceeds the comprehensive score threshold, the path combination is filtered out. Wherein, comprehensive score threshold = L*min{comprehensive score of path combination}; L is a set constant. The comprehensive score of the path combination is determined in the following way: the comprehensive score is the price score + the path convenience penalty value; the price score is retrieved from the pre-processed fare database according to the origin, destination, ow / rt, cabin class and price validity period with NUC as the calculation unit; the penalty value includes the penalty value generated by increasing the split point and the penalty value generated by increasing the number of transfers. The specific calculation method is: for each path in the path combination, each additional non-user-specified split point increases the penalty value of b NUC; for each increase in the number of transfers of the path from the origin to the destination corresponding to the path, the penalty value of c NUC is increased. The number of transfers is also constrained by the rationality parameter;

[0031] The minimum and maximum number parameters of path combinations include: minimum / maximum value settings: [N1; N2], at least N1 path combinations are retained, and at most N2 path combinations are retained. N1 and N2 are set constants and are adjusted according to system operation conditions and user needs;

[0032] Diversity parameter, the following combinations are retained: Path combinations with at least one single airline are retained.

[0033] Furthermore, the corresponding direct and transfer flight routes are obtained based on the candidate path combination solutions, all flight sequence sets are generated in combination with the flight database, and the candidate flight sequence sets are screened to obtain the following:

[0034] For a single path in the candidate path combination scheme, the bidirectional A* algorithm is used to expand the path route map according to its corresponding departure and arrival points to obtain the corresponding direct and transfer flight routes; then, a possible flight sequence set is generated in combination with the flight database, and the generated flight sequence set is filtered using the three-level filter filter3 to obtain a candidate flight sequence set.

[0035] Furthermore, the third-level filter filter3 means that the following parameter requirements are met at the same time:

[0036] Reasonable parameters include: the travel time of any flight specified by the customer in the search request shall not exceed A days; the flight transfer time shall not exceed B hours; the airlines in the flight sequence must meet the interline agreement; the flight sequence's detour rate shall not exceed C%; the flight's departure time shall not exceed D days from the current time; the main carrier of the flight sequence is consistent with the airline of the route; among them, A, B, C, and D are all constants set by the system;

[0037] Flight sequence scoring threshold: When the score of a flight sequence exceeds the threshold, the flight sequence is filtered; Flight sequence scoring threshold = F*min{flight sequence score}, where F is a set constant. The flight sequence score is determined by the total flight time and the number of transfers of the flight sequence, that is, the flight sequence score = the total flight time score of the flight sequence + the flight sequence transfer score; where the total flight time score of the flight sequence = the shortest flight time of the itinerary interval / the flight time of the flight sequence, and its score is (0; 1]; the flight sequence transfer score interval is (0; 1], if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval, the score is 1, if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval + 1, the score is 0.8, if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval + 2, the score is 0.6; Flight sequences whose transfer times exceed the minimum number of transfers of the itinerary interval + 2 will be directly filtered out;

[0038] The minimum and maximum number parameters of flight sequences include: minimum / maximum value settings: [MIN; MAX], each path generates at least MIN flight sequences and at most MAX flight sequences; MIN and MAX are set constants, which are adjusted according to system operation conditions and user needs;

[0039] Diversity parameters, the following flights are all retained:

[0040] All direct flights are maintained;

[0041] Keep the flight sequence with the least number of transfers;

[0042] Keep the flight sequence with the shortest flight time;

[0043] The flight sequence with the best score is retained.

[0044] Further, the fare rules corresponding to the candidate flight sequence or flight sequence combination are verified to obtain the flight sequence or flight sequence combination that passes the rule verification, including:

[0045] Rule verification includes: FC level verification and PU level verification; FC level verification is performed first and then PU level verification;

[0046] When performing FC-level verification, the four-level filter filter4 is used to screen the flight sequence that has passed the FC verification. When performing PU-level verification, the five-level filter filter5 is used to screen the flight sequence combination that has passed the PU verification.

[0047] Furthermore, the four-stage filter filter4 means that the following parameter requirements are met at the same time:

[0048] When the comprehensive score of the flight sequence under the path exceeds the threshold, it will be filtered out; where the comprehensive score threshold = K*min{comprehensive score of the flight sequence in the path}, K is a set constant; the comprehensive score of the flight sequence = flight sequence price score / flight sequence score; the flight sequence price score is the NUC value corresponding to the fare of the flight sequence after the FC check; the flight sequence score is determined by the total flight time and the number of transfers of the flight sequence, that is, the flight sequence score = the total flight time score of the flight sequence + the number of transfers of the flight sequence; where the total flight time score of the flight sequence Flight duration score = shortest flight duration of the itinerary interval / flight duration of the flight sequence, with a score of (0; 1]; flight sequence transfer number score interval is (0; 1], if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval, the score is 1, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 1, the score is 0.8, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 2, the score is 0.6; flight sequences whose transfer number exceeds the minimum transfer number of the itinerary interval + 2 will be directly filtered out;

[0049] The minimum and maximum number parameters of the flight sequence include: the minimum / maximum value setting of the flight sequence under each path: [F1; F2], the minimum value F1, the maximum value F2, F1 and F2 are set constants, which are adjusted according to the system operation status and user needs;

[0050] Diversity parameter, retaining the following flight sequence for each path:

[0051] Keep all direct flight sequences;

[0052] Keep the flight sequence with the least number of transfers;

[0053] Keep the flight sequence with the shortest flight time;

[0054] The flight sequence with the best comprehensive score is retained.

[0055] Furthermore, the five-level filter filter5 means that the following parameter requirements are met at the same time:

[0056] If the comprehensive score of the flight sequence combination corresponding to the itinerary exceeds the threshold, it will be filtered out; where the comprehensive score threshold of the flight sequence combination = G*min{comprehensive score of the flight sequence combination corresponding to the entire itinerary}, G is a set constant; the comprehensive score of the flight sequence combination = flight sequence combination price score / flight sequence combination score, flight sequence combination score = the sum of the scores of each flight sequence in the combination; the flight sequence combination price score is the NUC value corresponding to the fare combination of the flight sequence combination after the PU check; the flight sequence price score is the NUC value corresponding to the fare of the flight sequence after the FC check; the flight sequence score is determined by the total flight time and number of transfers of the flight sequence , that is, the flight sequence score = the total flight time score of the flight sequence + the flight sequence transfer score; the flight sequence total flight time score = the shortest flight time of the itinerary interval / the flight time of the flight sequence, and its score is (0; 1]; the flight sequence transfer score interval is (0; 1], if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval, the score is 1, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 1, the score is 0.8, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 2, the score is 0.6; the flight sequence whose transfer number exceeds the minimum transfer number of the itinerary interval + 2 will be directly filtered out;

[0057] The minimum and maximum number of flight sequence combinations parameters include:

[0058] The minimum / maximum value of the flight sequence combination returned by the itinerary is set as [P1; P2], with the minimum value being P1 and the maximum value being P2, i.e., the itinerary returns a maximum of P2 results and a minimum of P1 result. P1 and P2 are set constants and are configured according to the system operation status and user needs.

[0059] Diversity parameters, the following flights are all retained:

[0060] Keep all direct results;

[0061] For each airline, keep the results with the least number of transfers, the shortest flight time, the lowest price, and the best overall score.

[0062] In a second aspect, a civil aviation ticket search system includes: a request receiving unit, a path selection and filtering unit, a flight selection and filtering unit, a rule checking and filtering unit, and a result generating unit connected in sequence;

[0063] A request receiving unit, used to receive and analyze a search request from a user, and determine whether the user request is legal;

[0064] The route selection and filtering unit is used to construct all itinerary plans based on the user's search request and historical database, and obtain candidate route combination plans through multi-level screening;

[0065] The flight selection and filtering unit is used to obtain the corresponding direct and transfer flight routes based on the candidate path combination scheme, generate all flight sequence sets in combination with the flight database, and filter to obtain the candidate flight combination set;

[0066] A rule checking and filtering unit is used to check the fare rules corresponding to the candidate flight combinations and obtain the flight combinations that pass the rule checking;

[0067] The result generation unit is used to sort and filter the flight combinations that have passed the rule verification according to the method specified by the user or the system default, generate the final search results and output them to the user in the form of a message.

[0068] In a third aspect, an electronic device includes a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other via the communication bus;

[0069] a memory storing a computer program;

[0070] The processor is used to implement the above-mentioned civil aviation ticket search method when executing the computer program stored in the memory.

[0071] In a fourth aspect, a computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the above-mentioned civil aviation ticket search method is implemented.

[0072] The present disclosure includes at least the following beneficial effects:

[0073] The multi-level filtering device proposed in the present disclosure combines gradually improved information in each link of the air ticket search to reduce the search space from coarse to fine level to ensure that high-quality air ticket search results are obtained at an acceptable performance level, achieving a good balance between search depth and search performance;

[0074] Each level of filtering device disclosed in the present invention is designed with consideration given to rationality, diversity, boundary (minimum / maximum) and convenience (by introducing a penalty mechanism);

[0075] The multi-stage filter device and the related configuration parameters of the equipment proposed in the present disclosure allow users to set and adjust according to their own needs, so as to achieve the goal of continuously calibrating and optimizing the search effect during operation.

[0076] Other features and advantages of the present disclosure will be described in the following description, and partly become apparent from the description, or be understood by implementing the present disclosure. The purpose and other advantages of the present disclosure can be realized and obtained by the structures indicated in the description and the drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0077] In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0078] Figure 1 A flowchart of a search method according to an embodiment of the present disclosure;

[0079] Figure 2 This is a schematic diagram of the multi-stage filtering principle of an embodiment of the present disclosure;

[0080] Figure 3 A schematic diagram of the path selection and filtering process of the embodiment of the present disclosure;

[0081] Figure 4 This is a schematic diagram of the flight selection and filtering process according to an embodiment of the present disclosure;

[0082] Figure 5 This is a schematic diagram of the rule verification and filtering process of the embodiment of the present disclosure;

[0083] Figure 6 This is a schematic diagram of the structure of a search device according to an embodiment of the present disclosure;

[0084] Figure 7 This is a schematic diagram of the structure of an electronic device according to an embodiment of the present disclosure;

[0085] Figure 8 The present invention is a schematic diagram of a structure request according to an embodiment of the present invention. DETAILED DESCRIPTION

[0086] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present disclosure.

[0087] The explanation of terms in this disclosure is shown in Table 1:

[0088] Table 1

[0089]

[0090]

[0091] like Figure 1 As shown, a civil aviation ticket search method includes:

[0092] S101, receiving and parsing a search request from a user, and determining whether the user request is legal, thereby obtaining a legal search request;

[0093] S102, constructing all itinerary plans according to the legal search request and the historical database, and obtaining candidate path combination plans through multi-level screening;

[0094] S103, obtaining corresponding direct and transfer flight routes based on the candidate path combination solutions, generating all flight sequence sets in combination with the flight database, and screening to obtain candidate flight combination sets;

[0095] S104, verifying the fare rules corresponding to the candidate flight combinations, and obtaining the flight combinations that pass the rule verification;

[0096] S105, sorting and screening the flight combinations that have passed the rule verification according to the method specified by the user or the system default, generating the final search result and outputting it to the user in the form of a message.

[0097] The specific implementation is as follows:

[0098] The present disclosure proposes a multi-level filtering method and device for civil aviation ticket search. The filter device is used in the path selection, flight combination and rule verification links of the ticket search. It is essentially a trade-off between the "completeness" or "depth" of the search and the time required to complete the search. The device filters the intermediate results from coarse to fine level in the ticket search process, thereby achieving the purpose of reducing the search space layer by layer. At the same time, in order to ensure the quality and diversity of the ticket search results obtained at an acceptable performance level, the relevant configuration parameters in the multi-level filter device in the present disclosure allow users to set and adjust.

[0099] In order to reasonably reduce the air ticket search space and ensure that several possible solutions for the air ticket search are returned within a limited time range, the present disclosure proposes a multi-level filtering device, which reduces the search space layer by layer through step-by-step filtering in the path selection, flight combination and rule verification links of the air ticket search processing flow to obtain high-quality search results at a performance level acceptable to users. The multi-level filtering device proposed in the present disclosure includes the following design principles:

[0100] Strong rationality constraints - filter based on strong rationality constraints, without considering other results;

[0101] Relative reasonableness constraint - judging whether the current result is reasonable based on other results obtained;

[0102] Comfort penalty mechanism - introduce a price penalty mechanism for results with poor comfort, and comprehensively consider price and comfort during screening;

[0103] Scoring / ranking metrics - When a search produces too many reasonable results, filter the results by scoring and ranking them to reduce the search space;

[0104] Minimum and maximum number protection - Use minimum and maximum number protection principles to handle edge cases of scoring indicators;

[0105] Diversity protection - Use the diversity protection principle to ensure that there is sufficient diversity in the final search results.

[0106] like Figure 2 As shown, all filtering units and filtering parameters of the filtering device described in the present disclosure can also be opened to users as search configurations or search input parameters to flexibly meet the search needs of different users.

[0107] S101, a request receiving unit receives and analyzes a flight ticket search request from a user, determines whether the user request is a legitimate request, and transfers the legitimate request to a path selection and filtering unit.

[0108] like Figure 3 As shown, S102, the path selection and filtering unit constructs all possible itineraries based on the origin, destination, departure date, itinerary type and other information of the user's search request and in combination with the historical experience database, checks whether the itinerary is legal, and then filters the legal itineraries through filter1, and generates a corresponding path combination plan for each filtered itinerary in combination with the information of the fare database, pre-checks the path combination plan, and uses filter2 to filter and filter the path combination plan that has passed the pre-check, to obtain a set of candidate path combination plans.

[0109] like Figure 4 As shown, S103, the flight selection and filtering unit uses the bidirectional A* algorithm to expand the route map of a single path in the candidate route combination scheme according to its corresponding departure and arrival points, and obtains the corresponding direct and transfer flight routes. Then, a possible flight sequence set is generated in combination with the flight database, and the generated flight sequence set is filtered using filter3 to obtain a candidate flight sequence set.

[0110] like Figure 5As shown, S104, the rule verification and filtering unit verifies the fare rules corresponding to the candidate flight sequence / flight sequence combination. In order to improve the efficiency of rule verification, the fare rules are divided into FC level and PU level for verification respectively, and the FC level verification is performed first and then the PU level verification. When performing the FC level verification, filter4 is used to filter the flight sequence that passes the FC verification to obtain the candidate flight sequence of each path under FC; when performing the PU level verification, filter5 is used to filter the flight sequence combination that passes the PU verification to obtain the search result solution that finally passes the rule verification.

[0111] S105, the result generation unit sorts and screens the search result solutions that pass the rule verification according to the method specified by the user or the system default, generates the final search result and outputs it to the user according to the agreed interface format.

[0112] like Figure 6 As shown, a civil aviation ticket search system includes: a request receiving unit 601, a path selection and filtering unit 602, a flight selection and filtering unit 603, a rule checking and filtering unit 604, and a result generating unit 605 connected in sequence;

[0113] The request receiving unit 601 is used to receive and analyze the search request from the user and determine whether the user request is legal;

[0114] The route selection and filtering unit 602 is used to construct all itinerary plans according to the user's search request and the historical database, and obtain candidate route combination plans through multi-level screening;

[0115] The flight selection and filtering unit 603 is used to obtain corresponding direct and transfer flight routes based on the candidate path combination solutions, generate all flight sequence sets in combination with the flight database, and filter to obtain candidate flight combination sets;

[0116] A rule checking and filtering unit 604 is used to check the fare rules corresponding to the candidate flight combinations and obtain the flight combinations that pass the rule checking;

[0117] The result generation unit 605 is used to sort and filter the flight combinations that have passed the rule verification according to the method specified by the user or the system default, generate the final search result and output it to the user in the form of a message.

[0118] The specific implementation is as follows:

[0119] The units involved in the system include: a request receiving unit 601, a path selection and filtering unit 602, a flight selection and filtering unit 603, a rule checking and filtering unit 604, and a result generating unit 605.

[0120] Request receiving unit 601: receiving and parsing a flight ticket search request from a user, and determining whether the user request is legitimate;

[0121] Path selection and filtering unit 602: constructs possible itinerary solutions according to the user's search request and the experience database, and filters the itinerary solutions through the first-level filter filter1; combines the filtered itinerary solutions with the information of the fare database to generate a path combination solution, pre-checks the path combination solution, and filters the pre-checked path combination through the second-level filter filter2 to obtain a candidate path combination solution;

[0122] Flight selection and filtering unit 603: for each path combination in the candidate path combination scheme, all flight combinations are generated according to the corresponding route map and the flight combinations are filtered through the three-level filter filter3 to obtain the candidate flight combination set.

[0123] Rule verification and filtering unit 604: The rule verification and filtering unit verifies the fare rules corresponding to the candidate flight sequence or flight sequence combination. Rule verification can be divided into FC level verification and PU level verification. The FC level verification is performed first and then the PU level verification. When performing the FC level verification, the four-level filter filter4 is used to filter the flight sequence that passes the FC verification. When performing the PU level verification, the five-level filter filter5 is used to filter the flight sequence combination that passes the PU verification.

[0124] Result generation unit 605: Sort and filter the flight sequence combinations that pass the rule verification according to the method specified by the user or the system default, generate the final search result and output it to the user in the form of a message.

[0125] like Figure 7 As shown, the present disclosure provides an electronic device, including a processor 701, a communication interface 702, a memory 703 and a communication bus 704, wherein the processor 701, the communication interface 702 and the memory 703 communicate with each other through the communication bus 704;

[0126] Memory 703, storing computer programs;

[0127] The processor 701 is configured to implement the above method when executing the computer program stored in the memory 703 .

[0128] The present disclosure provides a computer-readable storage medium storing a computer program, wherein the computer program implements the above method when executed by a processor.

[0129] The computer-readable storage medium may be included in the device / apparatus described in the above embodiment; or it may exist independently without being assembled into the device / apparatus. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.

[0130] According to an embodiment of the present disclosure, a computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, apparatus, or device.

[0131] In order to enable those skilled in the art to better understand the present disclosure, the principles of the present disclosure are described as follows in conjunction with the accompanying drawings:

[0132] The request receiving component receives and parses the flight search request from the user

[0133] Assume that a user searches for round-trip air tickets from Beijing to New York. The search request contains some information as shown in Table 2:

[0134] Table 2

[0135]

[0136]

[0137] The path selection and filtering component performs path selection and filtering based on user search requests:

[0138] Construct possible itineraries based on search request information and experience database. Assume that a total of n itineraries J1-Jn can be constructed based on the above user request. The structure of the itinerary is as follows: Figure 8 shown.

[0139] Verify the legality of each itinerary according to IATA rules and eliminate unreasonable itineraries. The International Air Transport Association (IATA) restricts unreasonable travel:

[0140] There cannot be repeated cities in one FC; there cannot be more than one international departure / arrival in one country in one FC; there cannot be more than four international departures / arrivals in one country in one itinerary.

[0141] Use filter1 to filter the itinerary:

[0142] Reasonable parameters include: each itinerary contains at most X fare units PU; each itinerary contains at most Y fare calculation groups FC; each FC contains at most M stopover points; all locations included in the itinerary can be found in the active airport list, where active airports refer to airports where flights take off or land, and X, Y, and M are positive integers;

[0143] Comprehensive score threshold: when the comprehensive score of a trip exceeds the threshold, it will be filtered out; where comprehensive score threshold = H*min{comprehensive score of the trip}; H is a set constant, and the comprehensive score of the trip is determined in the following way: the comprehensive score includes price score + penalty value, with NUC (Neutral Unit of Construction) as the calculation unit, and the price score is retrieved from the pre-processed experience database according to the origin, destination, and trip type; the penalty value is calculated as follows: for each non-user-specified split point introduced into the trip, the corresponding number of penalty values ​​b NUC is added.

[0144] Minimum and maximum number of strokes settings: Set the number of strokes retained after filtering by filter1 according to different stroke types:

[0145] One-way: [X1; X2], that is, a minimum of X1 journeys and a maximum of X2 journeys are reserved for a one-way trip

[0146] Round trip: [M1; M2], that is, a minimum of M1 journeys and a maximum of M2 journeys are reserved for a round trip

[0147] Multi-journey: [Y1; Y2]; that is, a multi-journey retains at least Y1 journeys and at most Y2 journeys. X1, X2, M1, M2, Y1, and Y2 are all constants and can be adjusted according to system operation conditions and user needs.

[0148] Diversity parameters, the following itineraries are retained: All itineraries with a single airline are retained.

[0149] For each FC in the itinerary, take out the fare information grouped by path from the fare database, sort each path in the FC according to the lowest price it contains, take out one path from each FC in turn and combine them to get a path combination of the itinerary, repeat the above process to get the path combination set corresponding to the itinerary, assuming that the path combination set of itinerary J1 {RTGX1|RTGY1,.....,RTGX|RTGY} has a total of N elements.

[0150] Use filter2 to filter the path combination set of the itinerary:

[0151] Reasonable parameters include: the maximum number of transfers between any city pair in the itinerary does not exceed the minimum number of transfers for the city pair + n; the airlines on each path in the path combination meet the interline agreement; all airlines involved in the path combination are authorized to access in this environment;

[0152] Comprehensive score threshold, when the comprehensive score of a path combination exceeds the comprehensive score threshold, the path combination is filtered out; where comprehensive score threshold = L*min{comprehensive score of path combination}; L is a set constant, and the comprehensive score of the path combination is determined in the following way: the comprehensive score is the price score + the path convenience penalty value; NUC (Neutral Unit of Construction) is used as the calculation unit, and the price score is retrieved from the pre-processed fare database according to the origin, destination, ow / rt, cabin class, and price validity period; the penalty value includes the penalty value generated by increasing the split point and the penalty value generated by increasing the number of transfers, and the specific calculation method is: for each path in the path combination, each additional non-user-specified split point increases the penalty value of b NUC; for each increase in the number of transfers of the path compared to the minimum number of transfers from the origin to the destination corresponding to the path, the penalty value of c NUC is increased, and the number of transfers is also subject to the above rationality parameters;

[0153] The minimum and maximum number parameters of path combinations include: minimum / maximum value settings: [N1; N2], at least N1 path combinations are retained, and at most N2 path combinations are retained. N1 and N2 are set constants and can be adjusted according to system operation conditions and user needs;

[0154] Diversity parameter, the following combinations are retained: at least one path combination with a single airline throughout the journey is retained.

[0155] The flight selection and filtering component generates a flight sequence based on the paths in the path combination and performs screening and filtering.

[0156] Generate a flight sequence based on the paths in the path combination:

[0157] For each single path in each path combination, the bidirectional A* algorithm is used to expand the route map of the path according to the starting point and end point corresponding to the path, and the flight sequence set corresponding to the path is generated in combination with the flight database. The above process can be repeated to generate the flight sequence sets corresponding to all paths.

[0158] Use filter3 to filter the generated flight sequence:

[0159] Reasonable parameters include: the travel time of any flight specified by the customer in the search request shall not exceed A days; the flight transfer time shall not exceed B hours; the airlines in the flight sequence must meet the interline agreement; the detour rate of the flight sequence shall not exceed C%; the flight departure time shall not exceed D days from the current time; the main carrier of the flight sequence is consistent with the airline of the path; among them, A, B, C, and D are all constants set by the system.

[0160] Flight sequence score threshold: When the score of a flight sequence exceeds the threshold, the flight sequence is filtered. Flight sequence score threshold = F*min{flight sequence score}, where F is a set constant. The flight sequence score is determined by the total flight time and the number of transfers of the flight sequence, that is, the flight sequence score = the total flight time score of the flight sequence + the flight sequence transfer score; the flight sequence total flight time score = the shortest flight time of the itinerary interval / the flight time of the flight sequence, and its score is (0; 1]; the flight sequence transfer score interval is (0; 1], if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval, the score is 1, if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval + 1, the score is 0.8, if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval + 2, the score is 0.6. Flight sequences whose transfer times exceed the minimum number of transfers of the itinerary interval + 2 will be directly filtered out.

[0161] The minimum and maximum number parameters of flight sequences include: minimum / maximum value setting: [MIN; MAX], each path generates at least MIN flight sequences and at most MAX flight sequences; MIN and MAX are set constants and can be adjusted according to system operation conditions and user needs.

[0162] Diversity parameters, the following flights are all retained:

[0163] All direct flights are maintained;

[0164] Keep the flight sequence with the least number of transfers;

[0165] Keep the flight sequence with the shortest flight time;

[0166] The flight sequence with the best score is retained.

[0167] The rule verification and filtering component verifies and filters the flight sequence / flight sequence combination;

[0168] This unit verifies the fare rules corresponding to the flight sequence and combination to obtain the final fare of the flight combination. The fare rule verification includes FC-level verification and PU-level verification. The FC-level verification is mainly for the flight sequence, and the PU-level verification is mainly for the flight sequence combination. The rule verification follows the international standards and does not belong to the problem to be solved by the present disclosure, so it will not be described in detail here.

[0169] Use filter4 to filter the flight sequences that pass the FC level check:

[0170] When the comprehensive score of the flight sequence under this path exceeds the threshold, it will be filtered out; where the comprehensive score threshold = K*min{comprehensive score of the flight sequence in the path}; the comprehensive score of the flight sequence = flight sequence price score / flight sequence score. The flight sequence score has been described in filter3, and the flight sequence price score is the NUC value corresponding to the fare of the flight sequence after the FC check.

[0171] The minimum and maximum number parameters of the flight sequence include: the minimum / maximum value setting of the flight sequence under each path: [F1; F2], the minimum value F1, the maximum value F2, F1 and F2 are set constants and can be adjusted according to the system operation status and user needs.

[0172] Diversity parameter, retaining the following flight sequence for each path:

[0173] Keep all direct flight sequences;

[0174] Keep the flight sequence with the least number of transfers;

[0175] Keep the flight sequence with the shortest flight time;

[0176] The flight sequence with the best comprehensive score is retained.

[0177] Use filter5 to filter the flight sequence combinations that pass the PU level check:

[0178] If the comprehensive score of the flight sequence combination corresponding to the itinerary exceeds the threshold, it will be filtered out; among which, the comprehensive score threshold of the flight sequence combination = G*min{comprehensive score of the flight sequence combination corresponding to the entire itinerary}; the comprehensive score of the flight sequence combination = flight sequence combination price score / flight sequence combination score, flight sequence combination score = the sum of the flight sequence scores in the combination, and the flight sequence score has been explained in filter3; the flight sequence combination price score is the NUC value corresponding to the fare combination of the flight sequence combination after the PU check.

[0179] The minimum and maximum number of flight sequence combinations parameters include:

[0180] The minimum / maximum value of the flight sequence combination returned by the itinerary is set as: [P1; P2], the minimum value is P1, the maximum value is P2, that is, the itinerary returns a maximum of P2 results and a minimum of P1 result. P1 and P2 are set constants and can be configured according to system operation conditions and user needs.

[0181] Diversity parameters, the following flights are all retained:

[0182] Keep all direct results;

[0183] For each airline, keep the result with the least number of transfers, the shortest flight time, the lowest price, and the best overall score.

[0184] The result generation component generates the final search results and outputs them to the user:

[0185] The result generation component sorts and filters the search results that pass the rule verification in a user-specified or system-default manner, produces the final search results and outputs them to the user in the agreed interface format.

[0186] Compared with the prior art, the multi-level filtering device and apparatus for civil aviation air ticket search described in this proposal does not filter the final flight results, but filters the intermediate results of the search step by step in each real-time processing link of the air ticket search, and gradually reduces the search space to balance the search performance and search quality. The above-mentioned public technology filters the final flight results from multiple dimensions to facilitate user selection. The problems solved by this proposal and the technical solutions adopted by the above-mentioned public technology are different.

[0187] Although the present disclosure has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A method for searching civil aviation tickets, characterized in that: include: Receive and parse the search request from the user, and determine whether the user request is legal, and obtain the legal search request; Build all itinerary plans based on legitimate search requests and historical databases, and obtain candidate route combination plans through multi-level screening; Based on the candidate path combination scheme, the corresponding direct and transfer flight routes are obtained, and all flight sequence sets are generated in combination with the flight database, and the candidate flight combination set is screened; Verify the fare rules corresponding to the candidate flight combinations, and obtain the flight combinations that pass the rule verification; The flight combinations that have passed the rule verification are sorted and screened according to the user's specified or system default method, and the final search results are generated and output to the user in the form of a message.

2. A civil aviation ticket search method according to claim 1, characterized in that: Receive and parse search requests from users and determine whether the user requests are legitimate, including: When receiving a ticket search request from a user, the request receiving unit parses the ticket search request from the user; The search request includes the following itinerary information: origin, destination, itinerary type, departure date, return date, passenger type, and number of passengers; When the itinerary information exists at the same time, the user request is judged to be a legitimate request.

3. A civil aviation ticket search method according to claim 1, characterized in that: Build all itineraries based on legitimate search requests and historical databases, including: Based on the origin, destination, itinerary type, departure date, return date, passenger type and number of passengers in the user's search request and combined with the historical database, all possible itineraries are constructed, and the legality of the itinerary is checked.

4. A civil aviation ticket search method according to claim 3, characterized in that: Check whether the itinerary is legal and use the International Air Transport Association (IATA) rules to verify the legality of each itinerary.

5. A civil aviation ticket search method according to claim 1, characterized in that: The candidate path combination solutions are obtained through multi-level screening, including: The itinerary plan is screened through the first-level filter filter1; the filtered itinerary plan is combined with the information of the fare database to generate a path combination plan, the path combination plan is pre-checked and the path combination that passes the pre-check is screened through the second-level filter filter2 to obtain a candidate path combination plan.

6. A civil aviation ticket search method according to claim 5, characterized in that: The first-level filter filter1 means that the following parameter requirements are met at the same time: Reasonableness parameters, including: Each itinerary contains at most X fare units PU; each itinerary contains at most Y fare calculation groups FC; each FC contains at most M stopover points; all the places included in the itinerary can be found in the active airport list, where active airports refer to airports where flights take off or land, and X, Y, and M are positive integers; Comprehensive score threshold, when the comprehensive score of the trip exceeds the threshold, it is filtered out; where comprehensive score threshold = H*min{comprehensive score of the trip}; H is a set constant, and the comprehensive score of the trip is determined in the following way: the comprehensive score includes price score + penalty value, with NUC as the calculation unit, and the price score is retrieved from the pre-processed experience database according to the origin, destination, and trip type; the penalty value is calculated as follows: for each non-user-specified split point introduced into the trip, the corresponding number of penalty values ​​b NUC is added; Minimum and maximum number of strokes settings: Set the number of strokes retained after filtering by filter1 according to different stroke types: One-way: [X1; X2], i.e. a minimum of X1 journeys and a maximum of X2 journeys are reserved for a one-way trip. Round trip: [M1; M2], i.e. a minimum of M1 journeys and a maximum of M2 journeys are reserved for a round trip. Multi-trip: [Y1; Y2], i.e. a minimum of Y1 journeys and a maximum of Y2 journeys are reserved for a multi-trip trip. X1, X2, M1, M2, Y1, and Y2 are all constants and are adjusted according to the system operation status and user needs. Diversity parameters, the following itineraries are retained: All itineraries with a single airline are retained.

7. A civil aviation ticket search method according to claim 5, characterized in that: Secondary filter fliter2 means that the following parameter requirements are met at the same time: Reasonableness parameters, including: The maximum number of transfers between any city pair in the itinerary does not exceed the minimum number of transfers for the city pair + n; the airlines on each path in the path combination meet the interline agreement; all airlines involved in the path combination are authorized to access in this environment; Comprehensive score threshold. When the comprehensive score of a path combination exceeds the comprehensive score threshold, the path combination is filtered out. Wherein, comprehensive score threshold = L*min{comprehensive score of path combination}; L is a set constant. The comprehensive score of the path combination is determined in the following way: the comprehensive score is the price score + the path convenience penalty value; the price score is retrieved from the pre-processed fare database according to the origin, destination, ow / rt, cabin class and price validity period with NUC as the calculation unit; the penalty value includes the penalty value generated by increasing the split point and the penalty value generated by increasing the number of transfers. The specific calculation method is: for each path in the path combination, each additional non-user-specified split point increases the penalty value of b NUC; for each increase in the number of transfers of the path from the origin to the destination corresponding to the path, the penalty value of c NUC is increased. The number of transfers is also constrained by the rationality parameter; The minimum and maximum number parameters of path combinations include: minimum / maximum value settings: [N1; N2], at least N1 path combinations are retained, and at most N2 path combinations are retained. N1 and N2 are set constants and are adjusted according to system operation conditions and user needs; Diversity parameter, the following combinations are retained: Path combinations with at least one single airline are retained.

8. A civil aviation ticket search method according to claim 1, characterized in that: Based on the candidate path combination scheme, the corresponding direct and transfer flight routes are obtained, and all flight sequence sets are generated in combination with the flight database, and the candidate flight combination sets are screened, including: For a single path in the candidate path combination scheme, the bidirectional A* algorithm is used to expand the path route map according to its corresponding departure and arrival points to obtain the corresponding direct and transfer flight routes; then, a possible flight sequence set is generated in combination with the flight database, and the generated flight sequence set is filtered using the three-level filter filter3 to obtain a candidate flight sequence set.

9. A civil aviation ticket search method according to claim 8, characterized in that: The third-level filter filter3 means that the following parameter requirements are met at the same time: Reasonable parameters include: the travel time of any flight specified by the customer in the search request shall not exceed A days; the transfer time of the flight sequence shall not exceed B hours; the airlines in the flight sequence must meet the interline agreement; the detour rate of the flight sequence shall not exceed C%; the departure time of the flight sequence shall not exceed D days from the current time; the main carrier of the flight sequence is consistent with the airline of the route; among them, A, B, C, and D are all constants set by the system; Flight sequence scoring threshold: When the score of a flight sequence exceeds the threshold, the flight sequence is filtered; Flight sequence scoring threshold = F*min{flight sequence score}, where F is a set constant. The flight sequence score is determined by the total flight time and the number of transfers of the flight sequence, that is, the flight sequence score = the total flight time score of the flight sequence + the flight sequence transfer score; where the total flight time score of the flight sequence = the shortest flight time of the itinerary interval / the flight time of the flight sequence, and its score is (0; 1]; the flight sequence transfer score interval is (0; 1], if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval, the score is 1, if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval + 1, the score is 0.8, if the number of transfers of the flight sequence is equal to the minimum number of transfers of the itinerary interval + 2, the score is 0.6; Flight sequences whose transfer times exceed the minimum number of transfers of the itinerary interval + 2 will be directly filtered out; The minimum and maximum number parameters of flight sequences include: minimum / maximum value settings: [MIN; MAX], each path generates at least MIN flight sequences and at most MAX flight sequences; MIN and MAX are set constants, which are adjusted according to system operation conditions and user needs; Diversity parameters, the following flights are all retained: All direct flights are maintained; Keep the flight sequence with the least number of transfers; Keep the flight sequence with the shortest flight time; The flight sequence with the best score is retained.

10. A civil aviation ticket search method according to claim 1, characterized in that: The fare rules corresponding to the candidate flight sequence or flight sequence combination are verified to obtain the flight sequence or flight sequence combination that passes the verification. Rule verification includes: FC level verification and PU level verification; FC level verification is performed first and then PU level verification; When performing FC-level verification, the four-level filter filter4 is used to screen the flight sequence that has passed the FC verification. When performing PU-level verification, the five-level filter filter5 is used to screen the flight sequence or flight sequence combination that has passed the PU verification.

11. A civil aviation ticket search method according to claim 10, characterized in that: The four-stage filter filter4 means that the following parameter requirements are met at the same time: When the comprehensive score of the flight sequence under the path exceeds the threshold, it will be filtered out; where the comprehensive score threshold = K*min{comprehensive score of the flight sequence in the path}, K is a set constant; the comprehensive score of the flight sequence = flight sequence price score / flight sequence score; the flight sequence price score is the NUC value corresponding to the fare of the flight sequence after the FC check; the flight sequence score is determined by the total flight time and the number of transfers of the flight sequence, that is, the flight sequence score = the total flight time score of the flight sequence + the number of transfers of the flight sequence; where the total flight time score of the flight sequence Flight duration score = shortest flight duration of the itinerary interval / flight duration of the flight sequence, with a score of (0; 1]; flight sequence transfer number score interval is (0; 1], if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval, the score is 1, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 1, the score is 0.8, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 2, the score is 0.6; flight sequences whose transfer number exceeds the minimum transfer number of the itinerary interval + 2 will be directly filtered out; The minimum and maximum number parameters of the flight sequence include: the minimum / maximum value setting of the flight sequence under each path: [F1; F2], the minimum value F1, the maximum value F2, F1 and F2 are set constants, which are adjusted according to the system operation status and user needs; Diversity parameter, retaining the following flight sequence for each path: Keep all direct flight sequences; Keep the flight sequence with the least number of transfers; Keep the flight sequence with the shortest flight time; The flight sequence with the best comprehensive score is retained.

12. A civil aviation ticket search method according to claim 10, characterized in that: The five-level filter filter5 means that the following parameter requirements are met at the same time: If the comprehensive score of the flight sequence combination corresponding to the itinerary exceeds the threshold, it will be filtered out; where the comprehensive score threshold of the flight sequence combination = G*min{comprehensive score of the flight sequence combination corresponding to the entire itinerary}, G is a set constant; the comprehensive score of the flight sequence combination = flight sequence combination price score / flight sequence combination score, flight sequence combination score = the sum of the scores of each flight sequence in the combination; the flight sequence combination price score is the NUC value corresponding to the fare combination of the flight sequence combination after the PU check; the flight sequence price score is the NUC value corresponding to the fare of the flight sequence after the FC check; the flight sequence score is determined by the total flight time and number of transfers of the flight sequence , that is, the flight sequence score = the total flight time score of the flight sequence + the flight sequence transfer score; the flight sequence total flight time score = the shortest flight time of the itinerary interval / the flight time of the flight sequence, and its score is (0; 1]; the flight sequence transfer score interval is (0; 1], if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval, the score is 1, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 1, the score is 0.8, if the flight sequence transfer number is equal to the minimum transfer number of the itinerary interval + 2, the score is 0.6; the flight sequence whose transfer number exceeds the minimum transfer number of the itinerary interval + 2 will be directly filtered out; The minimum and maximum number of flight sequence combinations parameters include: The minimum / maximum value of the flight sequence combination returned by the itinerary is set as [P1; P2], with the minimum value being P1 and the maximum value being P2, i.e., the itinerary returns a maximum of P2 results and a minimum of P1 result. P1 and P2 are set constants and are configured according to the system operation status and user needs. Diversity parameters, the following flights are all retained: Keep all direct results; For each airline, keep the results with the least number of transfers, the shortest flight time, the lowest price, and the best overall score.

13. A civil aviation ticket search system, characterized in that: include: A request receiving unit, a path selection and filtering unit, a flight selection and filtering unit, a rule checking and filtering unit, and a result generating unit connected in sequence; A request receiving unit, used to receive and analyze a search request from a user, and determine whether the user request is legal; The route selection and filtering unit is used to construct all itinerary plans based on the user's search request and historical database, and obtain candidate route combination plans through multi-level screening; The flight selection and filtering unit is used to obtain the corresponding direct and transfer flight routes based on the candidate path combination scheme, generate all flight sequence sets in combination with the flight database, and filter to obtain the candidate flight combination set; A rule checking and filtering unit is used to check the fare rules corresponding to the candidate flight combinations and obtain the flight combinations that pass the rule checking; The result generation unit is used to sort and filter the flight combinations that have passed the rule verification according to the method specified by the user or the system default, generate the final search results and output them to the user in the form of a message.

14. An electronic device, characterized in that: It includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus; a memory storing a computer program; A processor is used to implement a civil aviation ticket search method according to any one of claims 1 to 12 when executing a computer program stored in a memory.

15. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, a civil aviation ticket search method according to any one of claims 1 to 12 is implemented.

Images