Interconnection flight plan generation method and system, storage medium and electronic equipment

Abstract

The invention belongs to the technical field of data processing, and provides a linked flight plan generation method and system, a storage medium and electronic equipment, and the method comprises the steps: generating an initial flight plan according to a user query request and an airline partnership tree; filtering the initial flight plan to obtain a filtered flight plan; creating interlinked flights according to the filtered flight plan to obtain an initial interlinked flight plan; and performing score calculation and filtering on the interlink flights in the initial interlink flight plan to obtain a final interlink flight plan. According to the method, the concept of the partner airline is introduced, the network of the interlinked flights is expanded, the success rate of generating the interlinked flight plan is improved, the interlinked flights corresponding to the partner airline are preferentially displayed to the user on the premise that the partner airline does not pay operation cost, the market competitiveness of the airline is improved, and the selection range of the user is expanded.

Description

Technical Field

[0001] The present invention belongs to the technical field of data processing, and in particular relates to a method, system, storage medium and electronic device for generating a connecting flight plan. Background Art

[0002] With the development of economy and the improvement of living standards, passengers have higher and higher requirements for travel experience and service quality. Connecting air tickets can meet passengers' needs for convenient, efficient and comfortable travel, and are therefore widely welcomed. Passengers can inquire and book connecting flights on the official website of the airline or the OTA website.

[0003] Airlines (hereinafter referred to as "airlines") often start from one region. Incomplete route networks, insufficient brand awareness, and limited sales channels are the main factors restricting the development of airlines. Without adding additional route schedules or expanding the fleet size, airlines usually adopt methods such as "grouping together" and "strong alliances". In order to expand routes, airlines generally share each other's routes through code sharing, airline alliances, etc., expand route networks without increasing operating costs, and increase the market competitiveness of airlines themselves.

[0004] With the development of business and changes in market layout, some airlines hope to achieve the effect of full route sharing when setting up connecting flights. The current method of achieving full route sharing through codes is somewhat complicated and will increase the operating costs of the airlines themselves. Summary of the invention

[0005] The present invention provides a connecting flight plan generation method, system, storage medium and electronic device.

[0006] A method for generating a connecting flight plan of the present invention comprises:

[0007] Generate an initial flight plan based on user query requests and airline partnership trees;

[0008] Filtering the initial flight plan to obtain a filtered flight plan;

[0009] Creating a connecting flight according to the filtered flight plan to obtain an initial connecting flight plan;

[0010] The connecting flights in the initial connecting flight plan are scored and filtered to obtain a final connecting flight plan.

[0011] Further,

[0012] The generating of the initial flight plan according to the user query request and the airline partnership tree includes:

[0013] Obtaining the user query request and the airline partnership tree, wherein the user query request includes a first departure place, a first destination, and a designated airline;

[0014] Building an airline set according to the designated airline and the airline partnership tree;

[0015] constructing a travel path according to the first departure place and the first destination, the travel path including a second departure place, a transfer place, and a second destination;

[0016] Dividing the travel path into a plurality of flight segments;

[0017] An initial flight plan corresponding to each of the flight segments is generated according to the first departure place, the first destination, the designated airline and the airline set.

[0018] Further,

[0019] The initial flight plan includes: flights of one or more designated airlines, flights of one or more partner airlines of the designated airlines, and flights of one or more non-designated airlines.

[0020] Further,

[0021] The step of creating a connecting flight according to the filtered flight plan to obtain an initial connecting flight plan includes:

[0022] The minimum connecting time and SPA are obtained, and flights that can be created as connecting flights are obtained from the filtered flight plan corresponding to each flight segment according to the minimum connecting time and the SPA, and the flights that can be created as connecting flights in each flight segment of each itinerary path are combined to obtain a Cartesian product, that is, one or more groups of connecting flights corresponding to each itinerary path are obtained, and the one or more groups of connecting flights constitute the initial connecting flight plan.

[0023] Further,

[0024] The scoring calculation and filtering of the connecting flights in the initial connecting flight plan to obtain the final connecting flight plan includes:

[0025] The score of each group of connecting flights in the initial connecting flight plan is calculated to obtain a score of each group of connecting flights.

[0026] Further,

[0027] The score of each group of connecting flights in the initial connecting flight plan is calculated based on the following dimensions:

[0028] The number of flights in each group of connecting flights, whether the specified airline is not included in the user query information, whether the flights in each group of connecting flights do not belong to the same airline, the number of airlines in each group of connecting flights, the departure time of the first flight segment in each group of connecting flights, the arrival time of the last flight segment in each group of connecting flights, and the total flight time of each group of connecting flights.

[0029] Further,

[0030] After obtaining the score of each set of connecting flights, it also includes:

[0031] The user query request also includes the query quantity of connecting flights;

[0032] Sorting all the connecting flights based on the scores of each group of connecting flights to obtain a sorted connecting flight plan;

[0033] All the connecting flights in the sorted connecting flight plan are filtered according to the query quantity of connecting flights to obtain a final connecting flight plan.

[0034] A connecting flight plan generation system of the present invention is used to implement the above connecting flight plan generation method, and the system includes:

[0035] The initial flight plan generation module is used to generate the initial flight plan based on the user query request and the airline partnership tree;

[0036] A filtered flight plan generating module, used for filtering the initial flight plan to obtain a filtered flight plan;

[0037] An initial connecting flight plan generating module, used for creating connecting flights according to the filtered flight plan to obtain an initial connecting flight plan;

[0038] The final connecting flight plan generating module is used to score and filter the connecting flights in the initial connecting flight plan to obtain the final connecting flight plan.

[0039] A computer-readable storage medium of the present invention stores a program or instruction. When the program or instruction is executed on a computer, the computer executes the aforementioned connecting flight plan generation method.

[0040] An electronic device of the present invention comprises a processor, wherein the processor is coupled to a memory; the processor is used to read and execute a computer program stored in the memory to implement the aforementioned connecting flight plan generation method.

[0041] Compared with the prior art, the present invention has the following beneficial effects:

[0042] Select some flights to display to users, reduce system response time, and avoid wasting network resources.

[0043] The introduction of the concept of partner airlines has expanded the network of connecting flights and improved the success rate of generating connecting flight plans. The more optional flights there are, the greater the chance of generating connecting flight plans.

[0044] On the premise that the partner airlines do not incur any operating costs, the corresponding connecting flights of the partner airlines will be displayed to users on a priority basis, which increases the exposure rate of the corresponding connecting flights of the partner airlines, improves the airline's popularity, and thus improves the airline's market competitiveness.

[0045] Increased user choices. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0047] Figure 1 A schematic diagram of the airline partnership tree of the present invention;

[0048] Figure 2 A flowchart of a method for generating a connecting flight plan according to the present invention;

[0049] Figure 3 It is a structural schematic diagram of the connecting flight plan generation system of the present invention;

[0050] Figure 4 It is a schematic structural diagram of the electronic device of the present invention.

[0051] Description of reference numerals:

[0052] 201 - initial flight plan generation module, 202 - filtered flight plan generation module, 203 - initial connecting flight plan generation module, 204 - final connecting flight plan generation module, 301 - processor, 302 - memory. DETAILED DESCRIPTION

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

[0054] In addition, in order to have a deeper understanding of the present invention, some of the terms are explained as follows:

[0055] SPA, the full name of which is "Special Pro-rate Agreement", refers to a special transportation agreement. In actual application, when an airline (Airline A) does not have sufficient capacity on a specific route, it will request cooperation from another airline (Airline B) with the same route to supplement the capacity. After using the route under the SPA agreement, Airline A must pay the agreed price to Airline B.

[0056] Before executing the connecting flight plan generation method of the present invention, an airline partnership tree is first constructed (the "airline partnership tree" is referred to as the "airline partnership tree" for short). The construction process of the airline partnership tree is as follows:

[0057] Airlines that intend to establish partnerships submit applications to become partner airlines through the flight query system. The flight query system obtains the flight plans and SPAs of the two airlines that submitted the applications. Relevant personnel conduct qualification review based on the flight plans and SPAs. If both airlines have released flight plans and both airlines meet the SPA requirements, the relevant personnel will manually confirm that the application is approved, and the flight query system will submit a request to establish an airline partnership to the partner airline management system. Otherwise, if one condition is not met, the relevant personnel will manually reject the application.

[0058] After receiving the request to establish an airline partnership, the partner airline management system establishes and stores an airline partnership tree and sets the airline partnership to an effective state.

[0059] For example:

[0060] Figure 1 This is a schematic diagram of the airline partnership tree. Figure 1 MU airlines and FM airlines in the application form apply to become interline airlines. Relevant personnel will conduct qualification review based on flight plans and SPA. If the review finds that the application conditions described in the above construction process are met, the relevant personnel will manually confirm that the application is passed. The interline query system will establish an airline partnership tree for MU airlines and FM airlines, such as Figure 1 As shown in the right picture, MU Airlines and FM Airlines are partner connecting airlines.

[0061] After the airline partnership tree is constructed, the connecting flight plan generation method is executed based on the airline partnership tree. Figure 2 : is a flow chart of a method for generating a connecting flight plan provided by an embodiment of the present invention. In one embodiment, the method specifically includes the following steps:

[0062] S101: Generate an initial flight plan based on the user query request and the airline partnership tree.

[0063] S101-1: Obtain a user query request and an airline partnership tree, and construct an airline set according to the user query request and the airline partnership tree.

[0064] Obtain a user query request, which includes the first departure point, the first destination, the designated airline, and the number of connecting flights; and obtain an airline partnership tree from a partner airline management system.

[0065] An airline set is constructed based on the designated airline and the airline partnership tree. When constructing the airline set, if the partner airlines of the designated airline are not found through the airline partnership tree, the airline set only includes the designated airline; if the partner airlines of the designated airline are found through the airline partnership tree, the airline set includes the designated airline and all its partner airlines.

[0066] S101-2: Constructing a travel route according to the user query request.

[0067] According to the first departure, the airports reachable from the first departure are searched in the aviation network. Based on the aviation network, it is determined whether the airports reachable from the first departure can reach the first destination. If yes, the location of the airports reachable from the first departure is defined as a transit point, and a trip path is constructed. The trip path includes the second departure, the transit point, and the second destination. If no, the airports reachable from the first departure are discarded, and the next airports reachable from the first departure are traversed, and the above process is repeated. Finally, one or more trip paths are constructed, and each trip path includes the second departure, the transit point, and the second destination.

[0068] S101-3: Divide the itinerary into multiple flight segments, and generate an initial flight plan corresponding to each flight segment based on the user query request and the airline set.

[0069] Each itinerary path is divided into multiple flight segments in the order from the second departure point to the second destination. Each itinerary path includes multiple flight segments, and the number of flight segments is one more than the number of transit points. The flight segment consisting of the second departure point and the transit point adjacent to the second departure point is defined as the first flight segment, and the flight segment consisting of the second destination and the transit point adjacent to the second destination is defined as the last flight segment. The first flight segment of the two adjacent flight segments of each itinerary is defined as the preceding flight segment, and the second flight segment of the two adjacent flight segments is defined as the succeeding flight segment.

[0070] An initial flight plan corresponding to each flight segment is generated according to the airline set, the first departure place, the first destination, and the designated airline. The initial flight plan corresponding to each flight segment includes: flights of one or more designated airlines, flights of one or more partner airlines of the designated airlines, and flights of one or more non-designated airlines.

[0071] S102: Filter the initial flight plan to obtain a filtered flight plan.

[0072] Get the path rule requirements. The number of path rule requirements is equal to the number of flight segments.

[0073] The flights in the initial flight plan corresponding to each flight segment are filtered according to the path rule requirements to obtain a filtered flight plan.

[0074] S103: Creating a connecting flight according to the filtered flight plan to obtain an initial connecting flight plan.

[0075] Get the minimum transfer time and SPA, and determine whether the flight in the filtered flight plan corresponding to each flight segment can be created as a connecting flight based on the minimum transfer time and SPA. Specifically:

[0076] 1. Compare the arrival time of the flight corresponding to the preceding flight segment with the departure time of the flight corresponding to the succeeding flight segment in each itinerary path to obtain the time difference. If the time difference is greater than or equal to the minimum transfer time, a connecting flight can be created.

[0077] 2. Determine whether the flight corresponding to the preceding flight segment and the flight corresponding to the succeeding flight segment in the two adjacent segments of each itinerary path have SPA. If so, they can be created as connecting flights.

[0078] When the above two judgment conditions are met at the same time, it is finally considered that a connecting flight can be created.

[0079] Through the above judgment, multiple flights that meet the conditions are obtained, and the flights that meet the conditions in each flight segment of each itinerary path are combined to obtain a Cartesian product, that is, one or more groups of connecting flights corresponding to each itinerary path are obtained. One or more groups of connecting flights constitute an initial connecting flight plan. Finally, each itinerary path has a unique initial connecting flight plan corresponding thereto.

[0080] S104: Calculate and filter the scores of the connecting flights in the initial connecting flight plan to obtain a final connecting flight plan.

[0081] S104-1: Calculate the score of each group of connecting flights in the initial connecting flight plan to obtain a score for each group of connecting flights.

[0082] The value of each set of connecting flights in each initial connecting flight plan is evaluated based on the airline partnership tree and the designated airline. Specifically, the score is calculated based on the following 7 dimensions:

[0083] 1. The number of flights in each set of connecting flights.

[0084] A weight value corresponding to the number of flights in each group of connecting flights is defined as a first weight value, and a variable corresponding to the number of flights in each group of connecting flights is defined as a first variable.

[0085] The number of flights in each set of connecting flights corresponds to the value of the first variable. For example, if the number of flights in each set of connecting flights is 2, then the first variable is also 2.

[0086] 2. Whether the user's query information does not include the designated airline.

[0087] A weight value corresponding to whether the user query information contains a specified airline is defined as a second weight value, and a variable corresponding to whether the user query information contains a specified airline is defined as a second variable.

[0088] Whether the user query information contains the specified airline corresponds to the value corresponding to the second variable. If the user query information does not contain the specified airline, the value corresponding to the second variable is 1; if the user query information contains the specified airline, the value corresponding to the second variable is 0.

[0089] 3. Whether the flights in each group of connecting flights do not belong to the same airline.

[0090] The weight value corresponding to whether the flights in each group of connecting flights do not belong to the same airline is defined as the third weight value, and the variable corresponding to whether the flights in each group of connecting flights do not belong to the same airline is defined as the third variable.

[0091] Whether the flights in each group of connecting flights do not belong to the same airline corresponds to the value corresponding to the third variable. If the flights in each group of connecting flights do not belong to the same airline and are not partner airlines, the value corresponding to the third variable is 2; if the flights in each group of connecting flights do not belong to the same airline and are partner airlines, the value corresponding to the third variable is 1; if the flights in each group of connecting flights belong to the same airline, the value corresponding to the second variable is 0.

[0092] 4. The number of airlines in each set of connecting flights.

[0093] The weight value corresponding to the number of airlines in each group of connecting flights is defined as a fourth weight value, and the variable corresponding to the number of airlines in each group of connecting flights is defined as a fourth variable.

[0094] The number of airlines in each set of connecting flights corresponds to the value of the fourth variable. For example, if the number of airlines in each set of connecting flights is 2, the fourth variable is also 2.

[0095] 5. The departure time of the first flight segment of each connecting flight.

[0096] The weight value corresponding to the departure time of the first flight segment in each set of connecting flights is defined as the fifth weight value, and the variable corresponding to the departure time of the first flight segment in each set of connecting flights is defined as the fifth variable.

[0097] The departure time of the first flight segment in each set of connecting flights corresponds to the value of the fifth variable. For example, if the departure time of the first flight segment in each set of connecting flights is 1210, the fifth variable is also 1210.

[0098] 6. The arrival time of the last flight segment of each connecting flight.

[0099] A weight value corresponding to the arrival time of the last flight segment in each set of connecting flights is defined as a sixth weight value, and a variable corresponding to the arrival time of the last flight segment in each set of connecting flights is defined as a sixth variable.

[0100] The arrival time of the last flight segment in each set of connecting flights corresponds to the value of the sixth variable. For example, if the arrival time of the last flight segment in each set of connecting flights is 1210, the sixth variable is also 1210.

[0101] 7. The total flight time of each set of connecting flights.

[0102] The weight value corresponding to the total flight time of each set of connecting flights is defined as the seventh weight value, and the variable corresponding to the total flight time of each set of connecting flights is defined as the seventh variable.

[0103] The total flight time of each set of connecting flights corresponds to the value of the seventh variable. For example, if the total flight time of each set of connecting flights is 1210, then the seventh variable is also 1210.

[0104] The first weight value>the second weight value>the third weight value>the fourth weight value>the fifth weight value>the sixth weight value>the seventh weight value.

[0105] The score of each set of connecting flights is calculated using the following formula:

[0106] Score = first variable * first weight + second variable * second weight + third variable * third weight + fourth variable * fourth weight + fifth variable * fifth weight + sixth variable * sixth weight + seventh variable

[0107] *Seventh weight value

[0108] S104-2: Sort the connecting flights based on the score of each group of connecting flights to obtain a sorted connecting flight plan.

[0109] Based on the score of each group of connecting flights, all connecting flights are sorted in order from low to high scores to obtain a sorted connecting flight plan. The connecting flights included in the sorted connecting flight plan are consistent with the connecting flights included in the initial connecting flight plan in terms of scope and quantity.

[0110] S104-3: Filter the connecting flights in the sorted connecting flight plan to obtain a final connecting flight plan.

[0111] All connecting flights in the sorted connecting flight plan are filtered according to the connecting flight query quantity, that is, connecting flights that are consistent with the connecting flight query quantity are selected from all connecting flights in the sorted connecting flight plan, and are selected in order of scores from low to high. The final connecting flight plan is obtained. When the connecting flight query quantity is greater than or equal to the connecting flight quantity included in the sorted connecting flight plan, the connecting flights included in the final connecting flight plan are consistent with the connecting flights included in the sorted connecting flight plan in terms of scope and quantity; when the connecting flight query quantity is less than the connecting flight quantity included in the sorted connecting flight plan, the number of connecting flights included in the final connecting flight plan is equal to the connecting flight query quantity.

[0112] The embodiment of the present invention also provides a connecting flight plan generation system, such as Figure 3 As shown, including:

[0113] The initial flight plan generating module 201 is used to generate an initial flight plan according to a user query request and an airline partnership tree.

[0114] The filtered flight plan generating module 202 is used to filter the initial flight plan to obtain a filtered flight plan.

[0115] The initial connecting flight plan generating module 203 is used to create connecting flights according to the filtered flight plan to obtain an initial connecting flight plan.

[0116] The final connecting flight plan generating module 204 is used to perform score calculation and filtering on the connecting flights in the initial connecting flight plan to obtain the final connecting flight plan.

[0117] It should be noted here that the above-mentioned initial flight plan generation module 201, the filtered flight plan generation module 202, the initial connecting flight plan generation module 203 and the final connecting flight plan generation module 204 correspond to steps S101 to S104 in the embodiment of the connecting flight plan generation method, and the examples and application scenarios implemented by the above-mentioned modules and corresponding steps are the same, but are not limited to the contents disclosed in the above-mentioned embodiments.

[0118] An embodiment of the present invention further provides a computer-readable storage medium storing a program or instruction. When the program or instruction is executed on a computer, the computer executes the method for generating a connecting flight plan as described in the above method embodiment.

[0119] like Figure 4 As shown, an embodiment of the present invention further provides an electronic device, including: a processor 301, the processor 301 is coupled to a memory 302, and the processor 301 is used to read and execute a computer program stored in the memory 302 to implement the connecting flight plan generation method as described in the above method embodiment.

[0120] Although the present invention 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 substitutions for some of the technical features therein; and these modifications or substitutions 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 invention.

Claims

1. A method for generating a connecting flight plan, characterized in that: include: Generate an initial flight plan based on user query requests and airline partnership trees; Filtering the initial flight plan to obtain a filtered flight plan; Creating a connecting flight according to the filtered flight plan to obtain an initial connecting flight plan; The connecting flights in the initial connecting flight plan are scored and filtered to obtain a final connecting flight plan.

2. The method according to claim 1, characterized in that The generating of the initial flight plan according to the user query request and the airline partnership tree includes: Obtaining the user query request and the airline partnership tree, wherein the user query request includes a first departure place, a first destination, and a designated airline; Building an airline set according to the designated airline and the airline partnership tree; constructing a travel path according to the first departure place and the first destination, the travel path including a second departure place, a transfer place, and a second destination; Dividing the travel path into a plurality of flight segments; An initial flight plan corresponding to each of the flight segments is generated according to the first departure place, the first destination, the designated airline and the airline set.

3. The method according to claim 2, characterized in that The initial flight plan includes: flights of one or more designated airlines, flights of one or more partner airlines of the designated airlines, and flights of one or more non-designated airlines.

4. The method according to claim 2, characterized in that: The step of creating a connecting flight according to the filtered flight plan to obtain an initial connecting flight plan includes: The minimum connecting time and SPA are obtained, and flights that can be created as connecting flights are obtained from the filtered flight plan corresponding to each flight segment according to the minimum connecting time and the SPA, and the flights that can be created as connecting flights in each flight segment of each itinerary path are combined to obtain a Cartesian product, that is, one or more groups of connecting flights corresponding to each itinerary path are obtained, and the one or more groups of connecting flights constitute the initial connecting flight plan.

5. The method according to claim 1, characterized in that The scoring calculation and filtering of the connecting flights in the initial connecting flight plan to obtain the final connecting flight plan includes: The score of each group of connecting flights in the initial connecting flight plan is calculated to obtain a score of each group of connecting flights.

6. The method according to claim 5, characterized in that The score of each group of connecting flights in the initial connecting flight plan is calculated based on the following dimensions: The number of flights in each group of connecting flights, whether the specified airline is not included in the user query information, whether the flights in each group of connecting flights do not belong to the same airline, the number of airlines in each group of connecting flights, the departure time of the first flight segment in each group of connecting flights, the arrival time of the last flight segment in each group of connecting flights, and the total flight time of each group of connecting flights.

7. The method according to claim 5, characterized in that After obtaining the score of each set of connecting flights, it also includes: The user query request also includes the query quantity of connecting flights; Sorting all the connecting flights based on the scores of each group of connecting flights to obtain a sorted connecting flight plan; All the connecting flights in the sorted connecting flight plan are filtered according to the query quantity of connecting flights to obtain a final connecting flight plan.

8. A connecting flight plan generation system, characterized in that: include: The initial flight plan generation module is used to generate the initial flight plan based on the user query request and the airline partnership tree; A filtered flight plan generating module, used for filtering the initial flight plan to obtain a filtered flight plan; An initial connecting flight plan generating module, used for creating connecting flights according to the filtered flight plan to obtain an initial connecting flight plan; The final connecting flight plan generating module is used to score and filter the connecting flights in the initial connecting flight plan to obtain the final connecting flight plan.

9. A computer-readable storage medium, characterized in that: A program or instruction is stored, and when the program or instruction is executed on a computer, the computer is caused to execute the connecting flight plan generation method according to any one of claims 1 to 7.

10. An electronic device, characterized in that: comprising a processor coupled to a memory; The processor is used to read and execute the computer program stored in the memory to implement the connecting flight plan generation method according to any one of claims 1 to 7.

Images