Airline ticket change information processing method and device, electronic device, and storage medium

Abstract

This application discloses a method and device, electronic device, and storage medium for processing airline ticket change information, which includes the steps of: obtaining change dates for at least one itinerary of a current target stroke selected by a current user; dividing each date within a preset range based on each change date to obtain target dates corresponding to each change date; constructing each date unit using the target dates corresponding to each change date; generating multiple candidate flight combinations corresponding to each date unit based on flight information for each target date; calculating price differences for each candidate flight combination corresponding to each date unit; selecting the candidate flight combination with the lowest price difference from the candidate flight combinations corresponding to each date unit as a final selected flight combination corresponding to each date unit; and feeding back the price differences and flight information for each date unit and the corresponding final selected flight combination to the current user.

Description

[Technical Field]

[0001] [CROSS-REFERENCE TO RELATED APPLICATIONS] This application claims priority to a Chinese patent application bearing application number 202310035688.6 and entitled "Method and device for processing airline ticket change information, electronic device, and storage medium device," filed with the China Patent Office on January 10, 2023, the entire contents of which are incorporated herein by reference.

[0002] The present application relates to the technical field of airline ticket information processing, and in particular to a method and device for processing airline ticket change information, an electronic device, and a storage medium. [Background technology]

[0003] With the development of airlines' e-commerce direct sales operations, self-service ticket sales via self-service machines and electronic devices such as mobile phones are also becoming increasingly improved. However, ticket change operations, which are closely related to ticket sales, also need to be constantly improved to become more self-service and should not rely too much on manual processing.

[0004] Currently, when passengers change their air tickets themselves, the main way is for the passenger to search for a fixed date based on the original ticket to be changed, the system will recalculate the original ticket, obtain the change rules for the original ticket, calculate the change fees for each flight on that date based on the fixed date searched by the passenger, and provide feedback to the passenger to select and change the air ticket.

[0005] However, in the conventional method, the information searched for with each operation is information related to ticket changes on a fixed date, which means that the information provided to the user is limited, the user has to perform multiple operations, and round-trip changes also require separate searches, which is not only inconvenient to operate, but also disadvantageous for passengers to quickly and accurately select the most split flight changes. Summary of the Invention [Problem to be solved by the invention]

[0006] Based on the above-mentioned shortcomings of the prior art, the present application provides a method and device for processing ticket change information, an electronic device, and a storage medium to solve the problems that the prior art is insufficient in convenience and it is not easy to select the most divided flight. [Means for solving the problem]

[0007] To achieve the above objectives, the present application provides the following technical solutions:

[0008] The first aspect of the present application is obtaining a change date for at least one itinerary of a current target stroke selected by a current user; Dividing each date within a predetermined range based on each of the change dates to obtain a target date corresponding to each of the change dates; constructing each date unit using the target dates corresponding to each of the change dates, wherein one date unit includes one target date corresponding to each of the change dates, and the order of each target date matches the itinerary order of the corresponding change dates; generating a plurality of candidate flight combinations corresponding to each of the date units based on flight information for each of the target dates, wherein one of the candidate flight combinations corresponding to the date units includes one target flight for each of the target dates in the date units, and the target flight for the target date means a flight whose itinerary, on the target date, is identical to the itinerary for the change date corresponding to the target date; calculating a price difference for each of the candidate flight combinations corresponding to each of the date units; selecting the candidate flight combination with the lowest price difference from each of the candidate flight combinations corresponding to each of the date units as a final selected flight combination corresponding to each of the date units; and feeding back the price difference and flight information of each of the date units and the corresponding final selected flight combination to the current user.

[0009] Optionally, in the above-mentioned method for processing airline ticket change information, the step of dividing each date within a predetermined range based on the change date for each of the change dates and obtaining a target date corresponding to the change date may include: For each of the change dates, the method includes dividing each date in the seven days with the change date as an intermediate date, and obtaining a target date corresponding to the change date.

[0010] Optionally, in the above-mentioned method for processing airline ticket change information, the step of constructing each date unit using the target date corresponding to each of the change dates may include: When there is only one change date, determining each of the target dates corresponding to the change date as one of the date units; When there are a plurality of change dates, combining the target dates corresponding to the respective change dates to obtain a plurality of date combinations, each of the date combinations including one of the target dates corresponding to each of the change dates; and a step of screening the order of the target dates included in each of the date combinations, and determining the date combination that matches the itinerary order of the corresponding change date as the date unit.

[0011] Optionally, in the above-mentioned method for processing ticket change information, the step of generating a plurality of candidate flight combinations corresponding to each of the date units based on the flight information of each of the target dates may further include: When there is only one change date, for each of the date units, based on flight information of the target date in the date unit, determine each of the target flights on the target date in the date unit as a flight combination corresponding to the date unit; When there are a plurality of change dates, for each of the date units, based on flight information of each of the target dates in the date unit, combine each of the target flights on each of the target dates in the date unit to obtain a flight combination corresponding to the date unit, wherein one of the flight combinations includes one of the target flights on each of the target dates in the date unit; Screening flight combinations corresponding to each of the date units based on the information of the current user for flight combinations that meet the desires of the current user; For each of the date units, determining whether the number of flight combinations corresponding to the screened date units is greater than a preset number; When it is determined that the number of flight combinations corresponding to the screened date units is equal to or less than a predetermined number, determining each flight combination corresponding to the screened date units as the candidate flight combination corresponding to the date unit; When it is determined that the number of flight combinations corresponding to the screened date units is greater than a predetermined number, calculating a score for the flight combinations corresponding to the screened date units based on flight information of each of the target flights; The method includes a step of selecting the predetermined number of flight combinations from each flight combination corresponding to the screened date unit based on the scores of the flight combinations corresponding to the screened date unit, and determining them as the candidate flight combinations corresponding to the date unit.

[0012] Optionally, in the above-mentioned method for processing ticket change information, before the step of calculating the price difference of each of the candidate flight combinations corresponding to each of the date units, generating a calculation request message for each of the candidate flight combinations corresponding to each of the date units; The method further includes a step of storing each of the date units, each of the candidate flight combinations corresponding to each of the date units, and the calculation request message thereof according to a two-stage storage structure.

[0013] Optionally, in the above-mentioned method for processing ticket change information, the step of feeding back the price difference and flight information of each of the date units and the corresponding final selected flight combination to the current user can be: The method includes converting and integrating the price difference and flight information of each of the date units and the corresponding final selected flight combinations to obtain a calendar mode change search result, and feeding back the calendar mode change search result to the current user.

[0014] A second aspect of the present application is an acquisition unit for acquiring a change date of at least one itinerary of a current target stroke selected by a current user; a dividing unit for dividing each date within a predetermined range based on each of the change dates to obtain a target date corresponding to each of the change dates; a construction unit for constructing each date unit using the target date corresponding to each of the change dates, wherein one date unit includes one target date corresponding to each of the change dates, and the order of each target date matches the itinerary order of the corresponding change dates; a combination generation unit for generating a plurality of candidate flight combinations corresponding to each of the date units based on flight information for each of the target dates, wherein one of the candidate flight combinations corresponding to each of the date units includes one target flight for each of the target dates in the date unit, and the target flight for each of the target dates refers to a flight whose itinerary, on the target date, is identical to the itinerary for the change date corresponding to the target date; a price difference calculation unit for calculating a price difference between each of the candidate flight combinations corresponding to each of the date units; a selection unit for selecting, from each of the candidate flight combinations corresponding to each of the date units, the candidate flight combination with the lowest price difference as a final selected flight combination corresponding to each of the date units; and a feedback unit for feeding back price differences and flight information of each of the date units and the corresponding final selected flight combinations to the current user.

[0015] Optionally, in the above-mentioned ticket change information processing device, the dividing unit: For each of the change dates, a division subunit is included for dividing each date of seven days with the change date as an intermediate date, and obtaining a target date corresponding to the change date.

[0016] Optionally, in the above-mentioned ticket change information processing device, the construction unit: a first construction unit for determining, when there is only one change date, each of the target dates corresponding to the change date as one of the date units; a date combination unit for combining the target dates corresponding to the change dates, respectively, to obtain a plurality of date combinations when there are a plurality of change dates, where each of the date combinations includes one of the target dates corresponding to each of the change dates; a second construction unit for screening the order of the target dates included in each of the date combinations and selecting the date combination that matches the itinerary order of the corresponding change date as the date unit.

[0017] Optionally, in the above-mentioned airline ticket change information processing device, the combination generation unit: a first generation unit for determining, for each of the date units when there is only one change date, each of the target flights on the target date in the date unit as a flight combination corresponding to the date unit based on flight information of the target date in the date unit; a flight combination unit for each of the date units, when there are a plurality of change dates, combining the target flights on the target dates in the date units based on flight information on the target dates in the date units to obtain a flight combination corresponding to the date unit, wherein one flight combination includes one target flight on each of the target dates in the date units; a screening unit for screening flight combinations corresponding to each of the date units based on the information of the current user to find flight combinations that meet the desires of the current user; a determining unit for determining, for each of the date units, whether the number of flight combinations corresponding to the screened date units is greater than a preset number; a second generation unit for determining, when it is determined that the number of flight combinations corresponding to the screened date units is equal to or less than a predetermined number, each flight combination corresponding to the screened date units as the candidate flight combination corresponding to the date unit; a score calculation unit for calculating a score of the flight combination corresponding to the screened date unit based on flight information of each of the target flights when it is determined that the number of flight combinations corresponding to the screened date unit is greater than a predetermined number; and a third generation unit for selecting the predetermined number of flight combinations from each flight combination corresponding to the screened date unit based on the scores of the flight combinations corresponding to the screened date unit, and determining them as the candidate flight combinations corresponding to the date unit.

[0018] Optionally, in the above-mentioned ticket change information processing device, a message generating unit for generating a calculation request message for each of the candidate flight combinations corresponding to each of the date units; The system further includes a storage unit for storing each of the date units, each of the candidate flight combinations corresponding to each of the date units, and a calculation request message thereof according to a two-stage storage structure.

[0019] Optionally, in the above-mentioned ticket change information processing device, the feedback unit: A feedback subunit is included for converting and integrating the price difference and flight information of each of the date units and the corresponding final selected flight combinations to obtain a calendar mode change search result, and feeding back the calendar mode change search result to the current user.

[0020] A third aspect of the present application is one or more processing units; a memory in which one or more programs are stored, An electronic device is provided that, when the one or more programs are executed by the one or more processing devices, causes the one or more processing devices to execute the method for processing airline ticket change information described in any one of the above.

[0021] A fourth aspect of the present application provides a computer storage medium for storing a program that, when executed, performs the method for processing airline ticket change information according to any one of the above claims. [Effects of the Invention]

[0022] This application provides a method for processing airline ticket change information, which obtains the change date of at least one itinerary for the current target stroke selected by the current user, thereby allowing the user to simultaneously search for changes to multiple itineraries. Each date within a preset range based on each change date is then divided to obtain a target date corresponding to each change date, allowing simultaneous calculations to be performed for each target date rather than fixed dates. The target dates corresponding to each change date are then used to construct each date unit, where each date unit includes one target date corresponding to each change date, and the order of the target dates matches the itinerary order of the corresponding change date. Then, based on the flight information for each target date, multiple candidate flight combinations corresponding to each date unit are generated. Here, one candidate flight combination corresponding to a date unit includes one target flight for each target date in the date unit, and a target flight for a target date refers to a flight whose itinerary on the target date matches the itinerary for the change date corresponding to the target date. Next, the price difference between each candidate flight combination corresponding to each date unit is calculated, and the candidate flight combination with the lowest price difference is selected as the final flight combination selected for that date unit, thereby screening out advantageous flight change methods for the user. Finally, the price difference and flight information for each date unit and its corresponding final flight combination are fed back to the current user. This realizes a method for simultaneously searching for changes to multiple itineraries, eliminating the need for multiple operations, and simultaneously performing corresponding calculations for multiple dates, and directly screening out advantageous flight change options for the user. [Brief explanation of the drawings]

[0023] In order to more clearly describe the technical solutions in the embodiments of the present application or the existing technology, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the existing technology. It is obvious that the accompanying drawings in the following description are only the embodiments of the present application, and those skilled in the art can obtain other accompanying drawings based on the accompanying drawings provided without any creative efforts. [Figure 1] 2 is a flowchart of a method for processing ticket change information according to an embodiment of the present application; [Figure 2] 1 is a flowchart of a method for constructing each date unit according to an embodiment of the present application; [Figure 3] 1 is a flowchart of a method for generating candidate flight combinations according to an embodiment of the present application; [Figure 4] 1 is a schematic diagram of the architecture of an apparatus for processing ticket change information according to an embodiment of the present application; [Figure 5] 1 is an architecture schematic diagram of an electronic device according to an embodiment of the present application; DETAILED DESCRIPTION OF THE INVENTION

[0024] The following clearly and completely describes the technical solutions in the embodiments of the present application, in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, and do not cover all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present application without any creative effort fall within the scope of protection of the present application.

[0025] In this application, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another and do not necessarily require or imply the existence of any such actual relationship or ordering between those entities or operations. Furthermore, the terms "comprises," "including," or any other variations thereof are intended to cover a non-exclusive "comprise," whereby a process, method, article, or device comprising a set of elements not only includes those elements, but also other elements not expressly listed or inherent in such process, method, article, or device. Absent further limitations, an element defined by the phrase "comprises one of" does not preclude the presence of other identical elements in the process, method, article, or device that includes that element.

[0026] An embodiment of the present application provides a method for processing ticket change information, which, as shown in FIG. 1, includes the following steps:

[0027] S101, obtain at least one itinerary change date of the current target stroke selected by the current user;

[0028] Here, the current target stroke refers to the stroke currently required to make the ticket change.

[0029] It should be noted that the ticket for the current target flight purchased by the current user may be a single outbound flight ticket, a round-trip flight ticket including one outbound flight and one return flight, or a one-way flight ticket including two routes, for example, a flight from Beijing to Tokyo must first go from Beijing to Hong Kong and then from Hong Kong to Tokyo, which is a one-way flight ticket including only the outbound flight but has two flight segments. Of course, it may also be other tickets including multiple routes.

[0030] Since changes can be made to each flight segment, users can now choose to change the date for only the outbound or return flight, or change the departure dates for both the outbound and return flights, as needed. Users can also choose whether a single flight segment, whether outbound or return, needs to be changed independently when multiple flight segments are involved, and choose the change date accordingly.

[0031] However, change dates can only be selected for unflown flight segments where changes are permitted, and the change date selection for each flight segment must match the sequence of each flight segment, and only one change date can be selected for each flight segment. For example, the change date for the outbound flight cannot be later than the change date for the return flight.

[0032] Therefore, for change dates selected on different flight segments, even if you select the same day, you have selected two change dates and there are two change dates.

[0033] S102: Divide each date within a preset range based on each change date, and obtain a target date corresponding to each change date.

[0034] In the embodiment of the present application, instead of searching for only one fixed date, each date within a preset range including each change date, i.e., each target date that includes the change date, is searched for.

[0035] Since each change date corresponds to a different itinerary, in the present embodiment, it is necessary to divide each date within a preset range based on each change date and obtain a target date corresponding to each change date. In addition, even if there are multiple change dates that belong to the same day, it is necessary to perform date division for each change date and obtain a target date corresponding to each change date for each itinerary.

[0036] Alternatively, each date within a preset range based on each change date may be a preset range from the change date and N days after the change date, or from N days before the change date to M days after the change date, or may be some other range.

[0037] Optionally, in another embodiment of the present application, a specific embodiment of step S102 may include: For each modification date, the method includes dividing each date in the seven days with the modification date as the intermediate date, and obtaining the target date corresponding to the modification date.

[0038] Therefore, in the embodiment of the present application, the target dates are set to the modified date, three days before the modified date, and three days after the modified date.

[0039] Optionally, since it is meaningless to calculate corresponding data for time that has already passed and it would increase the amount of unnecessary calculations, after obtaining the target dates corresponding to each change date, target dates corresponding to each change date that are earlier than the current day may be excluded.

[0040] S103, constructing each date unit using a target date corresponding to each modification date;

[0041] Here, one date unit includes one target date corresponding to each change date, and the order of each target date must match the itinerary order of the corresponding change date, so the number of target dates included in one date unit is equal to the number of change dates, and the order of each included target date must match the itinerary order corresponding to each target date, ensuring that it matches the current user's schedule. For example, since the outbound journey precedes the return journey, the target date corresponding to the change date of the outbound journey included in one date unit must be later than the target date corresponding to the change date of the return journey included. Therefore, the date unit is used to construct all feasible schedules.

[0042] Optionally, in another embodiment of the present application, a specific embodiment of step S103, as shown in FIG. 2, includes:

[0043] S201: Determine whether there is only one modification date.

[0044] If there is only one change date, only one itinerary needs to be changed and date combination is not required, so if it is determined that there is only one change date, step S202 is executed.If it is determined that there is more than one change date, that is, multiple change dates exist, step S203 is executed.

[0045] S202, each target date corresponding to the change date is determined as one date unit.

[0046] S203, each target date corresponding to each modification date is combined to obtain a plurality of date combinations.

[0047] Here, each date combination includes one target date corresponding to each modification date.

[0048] S204: Screening the order of the target dates included in each date combination, and determining the date combination that matches the itinerary order of the corresponding change date as the date unit.

[0049] Alternatively, for steps S203 and S204, a multidimensional array may be constructed, where each array represents a date combination, and date units may be screened based on the values ​​corresponding to each array. For example, the change date for the outbound trip selected by the current user is November 24th, and the change date for the return trip is November 26th. Therefore, a two-dimensional array as shown in Table 1 below may be constructed based on the target dates corresponding to the two change dates. Each value in the table is 1 if the target date for the outbound trip is not later than the target date for the return trip, and 0 if the target date for the outbound trip is later than the target date for the return trip. Therefore, each target date with a value of 1 in the table may be combined with a date unit. [Table 1]

[0050] S104, generating a plurality of candidate flight combinations corresponding to each date unit based on the flight information of each target date.

[0051] Here, one candidate flight combination corresponding to a date unit includes one target flight for each target date in the date unit, i.e., the number of target flights in a flight combination corresponding to one date unit matches the number of target dates in the date unit, i.e., matches the number of change dates, so if there is only one change date, one candidate flight combination includes only one flight. A target flight on a target date means a flight whose itinerary on the target date matches the itinerary of the change date corresponding to the target date.

[0052] Since there are often multiple flights in a single day, these flights often have multiple target flights that match the itinerary with the change date corresponding to the target date. For example, for a flight from Beijing to Shanghai, there are often flights at different times and with different airlines throughout the day. Therefore, even after determining the change date, i.e., after determining one date unit, there are still many flight options, and prices are not the same for different flight combinations. Therefore, it is necessary to determine the available flight combinations to determine which option offers the best value.

[0053] Optionally, in another embodiment of the present application, a specific embodiment of step S104, as shown in FIG. 3, includes the following steps:

[0054] S301: Determine whether there is only one modification date.

[0055] When there is only one change date, there is no need to combine target flights with different target dates, so when it is determined that there is only one change date, step S302 is executed.When it is determined that there is not just one change date, that is, when it is determined that there are multiple change dates, step S303 is executed.

[0056] S302: for each date unit, based on flight information of the target date in the date unit, determine each target flight on the target date in the date unit as a flight combination corresponding to the date unit.

[0057] S303, for each date unit, combine the target flights on the target dates in the date unit based on the flight information of the target dates in the date unit to obtain a flight combination corresponding to the date unit.

[0058] Here, one flight combination includes one target flight on each target date in the date unit.

[0059] S304: based on the current user's information, screening flight combinations corresponding to each date unit to find flight combinations that meet the current user's desires;

[0060] Taking into account different preferences of users, such as whether or not there are layovers, whether or not accommodation is required, and whether or not certain airlines are used, the amount of subsequent calculations can be reduced. In an embodiment of the present application, flight combinations that meet the current user's preferences are screened based on the current user's information, and subsequent calculations are performed on the screened flight combinations.

[0061] S305, for each date unit, determine whether the number of flight combinations corresponding to the screened date unit is greater than a preset number.

[0062] In this embodiment, since the calculation process for flight changes requires a large amount of calculation, it is possible to improve calculation efficiency and reduce the consumption of calculation resources. Therefore, the load is reduced by screening only a certain number of flight combinations from the flight combinations currently desired by the user before performing the subsequent calculation process. Therefore, for each date unit, it is necessary to determine whether the number of flight combinations corresponding to the screened date unit is greater than a predetermined number. Here, if it is determined that the number of flight combinations corresponding to the screened date unit is equal to or less than the predetermined number, step S306 can be performed. If it is determined that the number of flight combinations corresponding to the screened date unit is greater than the predetermined number, step S308 can be performed.

[0063] S306: Determine each of the screened flight combinations corresponding to the date unit as a candidate flight combination corresponding to the date unit.

[0064] S307, based on the flight information of each target flight, calculate the score of the flight combination corresponding to the screened date unit.

[0065] Specifically, the score of a flight combination can be calculated based on whether the target flight has a connection, the fare price, the flight altitude, the flight time, flight information, etc. For example, the fewer the connections, the shorter the flight time, the lower the fare price, and the lower the flight altitude, the higher the score.

[0066] S308: Based on the scores of the screened flight combinations corresponding to the date unit, a predetermined number of flight combinations are selected from each screened flight combination corresponding to the date unit, and determined as candidate flight combinations corresponding to the date unit.

[0067] Specifically, each flight combination can be sorted in descending order of score, and then the flight combinations sorted before a predetermined number of corresponding ranks can be selected as candidate flight combinations corresponding to the date unit.

[0068] S105, calculate the price difference of each candidate flight combination corresponding to each date unit respectively.

[0069] Specifically, the fare of the original ticket is recalculated, the corresponding refund change rule is obtained, the fare of the new stroke corresponding to each candidate flight combination is calculated based on the refund change rule, and finally the difference between the new and old strokes is calculated to obtain the difference between the fare of each candidate flight combination.

[0070] Optionally, in order to facilitate data distribution and management, in another embodiment of the present application, before performing step S105, the following steps may be further performed:

[0071] A calculation request message for each candidate flight combination corresponding to each date unit is generated, and each date unit, each candidate flight combination corresponding to each date unit, and the calculation request message are stored in a two-stage storage structure.

[0072] Here, the two-level storage structure refers to the use of two levels of key-value pairs for storage. Specifically, as shown in Table 2 below, the key of the first level key-value pair is the date unit, and the value is a two-level key-value pair consisting of a candidate flight combination and a calculation request message. The key of the second level key-value is the candidate flight combination, and the value is the calculation request message. [Table 2]

[0073] Alternatively, the method according to the embodiment of the present application may be performed by two modules: a main flight search module and a fare refund change calculation module. The calling relationship between the two modules may be cohesive or decoupled. The cohesive relationship can be understood as the two modules being nested within each other, and communication between the two modules does not depend on network transmission, for example, the fare calculation module being included in the flight search module. The decoupled relationship can be understood as the flight search module and the fare calculation module being independent from each other, and the two modules need to interact via network transmission. Therefore, to facilitate the flow between the two modules, the embodiment of the present application generates corresponding calculation request messages.

[0074] S106: Select the candidate flight combination with the lowest price difference from each candidate flight combination corresponding to each date unit as the final selected flight combination corresponding to each date unit.

[0075] S107, feedback the information of the target flight in each date unit and the corresponding final selected flight combination to the current user.

[0076] Optionally, in another embodiment of the present application, a specific embodiment of step S107 may include: The method includes converting and integrating the price difference and flight information of each date unit and the corresponding final selected flight combination to obtain the calendar mode change search result, and feeding back the calendar mode change search result to the current user.

[0077] To help users obtain relevant information more intuitively, the embodiment of the present invention adopts a calendar mode to provide feedback to users.

[0078] An embodiment of the present application provides a method for processing airline ticket change information, which obtains the change date of at least one itinerary for the current target stroke selected by the current user, thereby allowing the user to simultaneously search for changes to multiple itineraries. Each date within a preset range based on each change date is then divided to obtain a target date corresponding to each change date, allowing simultaneous calculations to be performed for each target date rather than fixed dates. The target dates corresponding to each change date are then used to construct each date unit. Here, one date unit includes one target date corresponding to each change date, and the order of the target dates matches the itinerary order of the corresponding change date. Then, multiple candidate flight combinations corresponding to each date unit are generated based on the flight information for each target date. Here, one candidate flight combination corresponding to a date unit includes one target flight for each target date in the date unit. A target flight for a target date refers to a flight whose itinerary on the target date matches the itinerary for the change date corresponding to the target date. Next, the price difference between each candidate flight combination corresponding to each date unit is calculated, and the candidate flight combination with the lowest price difference is selected as the final flight combination selected for that date unit, thereby screening out advantageous flight change methods for the user. Finally, the price difference and flight information for each date unit and its corresponding final flight combination are fed back to the current user. This realizes a method for simultaneously searching for changes to multiple itineraries, eliminating the need for multiple operations, and simultaneously performing corresponding calculations for multiple dates, and directly screening out advantageous flight change options for the user.

[0079] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functions, and operations that may be implemented in accordance with systems, methods, nodes, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowcharts or block diagrams may represent a module, program segment, or portion of code, which includes one or more executable instructions for implementing a given logical function. In alternative implementations, the functions displayed in the blocks may occur in a different order than that displayed in the accompanying drawings. For example, two blocks shown in succession may actually be executed substantially in parallel or may be executed in the reverse order depending on the functionality involved. Each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented by a dedicated hardware-based system that performs a given function or operation, or by a combination of dedicated hardware and computer instructions.

[0080] Although the operations are shown in a particular order, this should not be understood as requiring that the operations be performed in the particular order shown, or sequentially. In some environments, multitasking or parallel processing may be advantageous.

[0081] Another embodiment of the present application provides a processing device for ticket change information, as shown in FIG. 4, the device includes: an acquiring unit 401 for acquiring at least one itinerary change date of a current target stroke selected by a current user; a dividing unit 402 for dividing each date within a preset range based on each modification date, and obtaining a target date corresponding to each modification date; a construction unit 403 for constructing each date unit using a target date corresponding to each modification date, A construction unit 403, in which one date unit includes one target date corresponding to each change date, and the order of each target date matches the itinerary order of the corresponding change date; a combination generation unit 404 for generating a plurality of candidate flight combinations corresponding to each date unit based on flight information of each target date, Here, one candidate flight combination corresponding to a date unit includes one target flight for each target date in the date unit, and a combination generation unit 404, where a target flight for a target date means a flight whose itinerary on the target date matches the itinerary on the change date corresponding to the target date; a price difference calculation unit 405 for calculating a price difference for each candidate flight combination corresponding to each date unit, respectively; a selection unit 406 for selecting a candidate flight combination with the lowest price difference from each candidate flight combination corresponding to each date unit as a final selected flight combination corresponding to each date unit; and a feedback unit 407 for feeding back the price difference and flight information of each date unit and its corresponding final selected flight combination to the current user.

[0082] Optionally, in the apparatus for processing ticket change information according to another embodiment of the present application, the dividing unit: For each change date, a division subunit is included for dividing each date of the seven days with the change date as the intermediate date, and obtaining a target date corresponding to the change date.

[0083] Optionally, in the apparatus for processing ticket change information according to another embodiment of the present application, the construction unit: a first construction unit for determining, when there is only one change date, each target date corresponding to the change date as one date unit; a date combination unit for respectively combining target dates corresponding to each of the modification dates to obtain multiple date combinations when there are multiple modification dates, where each date combination includes one target date corresponding to each modification date; and a second construction unit for screening the order of the target dates included in each date combination and taking the date combination that matches the itinerary order of the corresponding change date as a date unit.

[0084] Optionally, in the processing device for ticket change information according to another embodiment of the present application, the combination generating unit: a first generation unit for determining, for each date unit, each target flight on the target date in the date unit as a flight combination corresponding to the date unit based on flight information of the target date in the date unit when there is only one change date; A flight combination unit for, when there are multiple change dates, combining each target flight on each target date in the date unit based on flight information of each target date in the date unit for each date unit to obtain a flight combination corresponding to the date unit, Here, one flight combination is defined as a flight combination unit including one target flight for each target date in a date unit; A screening unit for screening flight combinations corresponding to each date unit based on information of the current user to find flight combinations that meet the current user's desire; a determining unit for determining, for each date unit, whether the number of flight combinations corresponding to the screened date unit is greater than a preset number; a second generating unit for determining, when it is determined that the number of flight combinations corresponding to the screened date units is equal to or less than a predetermined number, each flight combination corresponding to the screened date units as a candidate flight combination corresponding to the date unit; a score calculation unit for calculating a score of the flight combination corresponding to the screened date unit based on the flight information of each target flight when it is determined that the number of flight combinations corresponding to the screened date unit is greater than a predetermined number; and a third generation unit for selecting a predetermined number of flight combinations from each flight combination corresponding to the screened date unit based on the scores of the flight combinations corresponding to the screened date unit, and determining them as candidate flight combinations corresponding to the date unit.

[0085] Optionally, in the processing device for ticket change information according to another embodiment of the present application, a message generating unit for generating a calculation request message for each candidate flight combination corresponding to each date unit; The system further includes a storage unit for storing each date unit, each candidate flight combination corresponding to each date unit, and its calculation request message according to a two-stage storage structure.

[0086] Optionally, in the apparatus for processing ticket change information according to another embodiment of the present application, the feedback unit: A feedback subunit is included for converting and integrating the price difference and flight information of each of the date units and the corresponding final selected flight combinations to obtain a calendar mode change search result, and feeding back the calendar mode change search result to the current user.

[0087] It should be noted that the specific operation process of each unit according to the above embodiments of the present application can be referred to the corresponding steps in the above method embodiments, and will not be described again here.

[0088] Furthermore, the functionality of each unit described above in the above embodiments may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), etc.

[0089] Another embodiment of the present disclosure provides an electronic device, and as shown in FIG. 5, it shows a structural schematic diagram of an electronic device 500 suitable for implementing the embodiment of the present disclosure. Here, the electronic device in the embodiment of the present disclosure may include, but is not limited to, electronic devices such as desktop computers, laptops, tablet computers, in-vehicle terminals, etc.

[0090] 5, the electronic device 500 includes one or more processing units 501, such as a central processing unit, a graphics processing unit, etc., and a memory 502 in which one or more programs are stored, whereby, when the one or more programs are executed by the one or more processing units 501, the one or more processing units 501 perform the method for processing ticket change information according to any one of the above embodiments.

[0091] Optionally, the electronic device may further include other components. Also referring to FIG. 5 , a processing unit 501, a read-only memory (ROM) 502, and a random access memory (RAM) 503 are connected to one another by a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504. Typically, the following devices can be connected to the I / O interface 505: input devices 506, including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 507, including, for example, a liquid crystal display, speaker, vibrator, etc.; storage devices 508, including, for example, a magnetic tape, hard disk, etc.; and a communication device 509. The communication device 509 can allow the electronic device 500 to communicate wirelessly or via wires with other devices to exchange data. While FIG. 5 illustrates the electronic device 500 with various devices, it should be understood that it is not required to implement or include all of the devices shown. Alternatively, more or fewer devices can be implemented or included.

[0092] Another embodiment of the present application provides a computer storage medium for storing a program for implementing, when executed, the method for processing ticket change information according to any one of the above claims.

[0093] Computer storage media include permanent and non-permanent media, and removable and non-removable media may implement information storage in any manner or technology. Information may be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, read-only disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical memory, cartridge-type magnetic tape, magnetic tape disk memory or other magnetic storage devices, or other non-transmission media that may be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transitory computer-readable media, such as modulated data signals and carrier waves.

[0094] Those skilled in the art will further recognize that the units and algorithm steps of each example described in connection with the embodiments disclosed herein can be realized in electronic hardware, computer software, or a combination of both, and that the above description generally describes the configurations and steps of each example functionally to clearly explain the interchangeability of hardware and software. Whether these functions are implemented in a hardware or software manner depends on the specific application and design constraints of the technical solution. Those skilled in the art may implement the described functions using different methods for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0095] The above description of the disclosed embodiments enables those skilled in the art to realize or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application is not limited to the embodiments set forth herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. The following clearly and completely describes the technical solutions in the embodiments of the present application, in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained based on the embodiments of the present application without the need for creative efforts by those skilled in the art are within the scope of protection of the present application.

Claims

1. obtaining a modification date for at least one itinerary of a current target stroke selected by a current user; Dividing each date within a predetermined range based on each of the change dates to obtain a target date corresponding to each of the change dates; constructing each date unit using the target dates corresponding to each of the change dates, wherein one date unit includes one target date corresponding to each of the change dates, and the order of each target date matches the itinerary order of the corresponding change dates; generating a plurality of candidate flight combinations corresponding to each of the date units based on flight information for each of the target dates, wherein one candidate flight combination corresponding to each of the date units includes one target flight for each of the target dates in the date units, and the target flight for each of the target dates refers to a flight whose itinerary, on the target date, matches the itinerary for the change date corresponding to the target date; calculating a price difference for each of the candidate flight combinations corresponding to each of the date units; selecting the candidate flight combination with the lowest price difference from each of the candidate flight combinations corresponding to each of the date units as a final selected flight combination corresponding to each of the date units; and feeding back to the current user the price difference and flight information for each of the date units and the corresponding final selected flight combination.

2. The step of dividing each date within a predetermined range based on the change date for each of the change dates and obtaining a target date corresponding to the change date includes:

2. The method for processing airline ticket change information according to claim 1, further comprising: for each change date, dividing each date within seven days with the change date as an intermediate date, and obtaining a target date corresponding to the change date.

3. The step of constructing each date unit using the target date corresponding to each of the change dates includes: When there is only one change date, determining each of the target dates corresponding to the change date as one of the date units; When there are a plurality of change dates, combining the target dates corresponding to the respective change dates to obtain a plurality of date combinations, each of the date combinations including one of the target dates corresponding to each of the change dates; 2. The method for processing airline ticket change information according to claim 1, further comprising the step of: screening the order of the target dates included in each of the date combinations; and determining the date combination that matches the itinerary order of the corresponding change date as the date unit.

4. generating a plurality of candidate flight combinations corresponding to each of the date units based on flight information for each of the target dates, When there is only one change date, for each of the date units, based on flight information of the target date in the date unit, determine each of the target flights on the target date in the date unit as a flight combination corresponding to the date unit; When there are a plurality of change dates, for each of the date units, based on flight information of each of the target dates in the date unit, combine each of the target flights on each of the target dates in the date unit to obtain a flight combination corresponding to the date unit, wherein one of the flight combinations includes one of the target flights on each of the target dates in the date unit; Screening flight combinations corresponding to each of the date units based on the information of the current user for flight combinations that meet the desires of the current user; For each of the date units, determining whether the number of flight combinations corresponding to the screened date units is greater than a preset number; When it is determined that the number of flight combinations corresponding to the screened date units is equal to or less than a predetermined number, determining each flight combination corresponding to the screened date units as the candidate flight combination corresponding to the date unit; When it is determined that the number of flight combinations corresponding to the screened date units is greater than a predetermined number, calculating a score for the flight combinations corresponding to the screened date units based on flight information of each of the target flights; and selecting the predetermined number of flight combinations from each flight combination corresponding to the screened date unit based on the score of the flight combination corresponding to the screened date unit, and determining them as the candidate flight combinations corresponding to the date unit.

5. Before the step of calculating the price difference for each of the candidate flight combinations corresponding to each of the date units, generating a calculation request message for each of the candidate flight combinations corresponding to each of the date units; 2. The method for processing airline ticket change information according to claim 1, further comprising: storing each of the date units, each of the candidate flight combinations corresponding to each of the date units, and its calculation request message according to a two-stage storage structure.

6. The step of feeding back the price difference and flight information of each of the date units and the corresponding final selected flight combination to the current user includes:

2. The method for processing airline ticket change information according to claim 1, further comprising: converting and integrating the price difference and flight information of each date unit and the corresponding final selected flight combination to obtain a calendar mode change search result; and feeding back the calendar mode change search result to the current user.

7. an acquisition unit for acquiring a change date of at least one itinerary of a current target stroke selected by a current user; a dividing unit for dividing each date within a predetermined range based on each of the change dates to obtain a target date corresponding to each of the change dates; a construction unit for constructing each date unit using the target dates corresponding to each of the change dates, wherein one date unit includes one target date corresponding to each of the change dates, and the order of each target date matches the itinerary order of the corresponding change dates; a combination generation unit for generating a plurality of candidate flight combinations corresponding to each of the date units based on flight information for each of the target dates, wherein one of the candidate flight combinations corresponding to each of the date units includes one target flight for each of the target dates in the date unit, and the target flight for the target date means a flight whose itinerary on the target date matches the itinerary of the change date corresponding to the target date; a price difference calculation unit for calculating a price difference between each of the candidate flight combinations corresponding to each of the date units; a selection unit for selecting, from each of the candidate flight combinations corresponding to each of the date units, the candidate flight combination with the lowest price difference as a final selected flight combination corresponding to each of the date units; and a feedback unit for feeding back price differences and flight information of each of the date units and the corresponding final selected flight combinations to the current user.

8. The division unit is 8. The processing device for airline ticket change information according to claim 7, further comprising a division subunit for dividing, for each of the change dates, each of the seven days with the change date as an intermediate date, and obtaining a target date corresponding to the change date.

9. one or more processing devices; a memory in which one or more programs are stored, An electronic device characterized in that, when the one or more programs are executed by the one or more processing devices, the one or more processing devices are caused to execute the airline ticket change information processing method described in any one of claims 1 to 6.

10. A computer storage medium used to store a program for carrying out the method for processing airline ticket change information according to any one of claims 1 to 6 when the program is executed.

Images