An air ticket change information processing method and device, electronic equipment and storage medium

Abstract

The application discloses a kind of ticket change information processing method and device, electronic equipment, storage medium, the method comprises: obtaining the change date of at least one segment of the current target journey of current user selected journey;Respectively, each date in the preset range with each change date as reference is split, and the target date corresponding to each change date is obtained;Using the target date corresponding to each change date, each date unit is constructed;Based on the flight information of each target date, generate a plurality of candidate flight combinations corresponding to each date unit;The difference of each candidate flight combination corresponding to each date unit is calculated respectively;From each date unit corresponding each candidate flight combination, the candidate flight combination with the lowest difference is selected as the final selected flight combination corresponding to each date unit respectively;The difference and flight information of each date unit and its corresponding final selected flight combination are fed back to current user.

Description

Technical Field

[0001] This application relates to the field of air ticket information processing technology, and in particular to a method and apparatus for processing air ticket change information, an electronic device, and a storage medium. Background Technology

[0002] With the development of airline e-commerce direct sales, self-service ticket sales on self-service devices and mobile phones are becoming increasingly sophisticated. The ticket change service, which is closely related to ticket sales, also needs to be continuously improved and made more automated, and can no longer rely too much on manual processing.

[0003] Currently, passengers can process flight changes themselves by searching for a specific date on their original ticket. The system then recalculates the original ticket and obtains its change rules. Based on the searched date, the system calculates the change fees for various flights on that date and provides the passenger with a selection to make the change.

[0004] However, the existing method only searches for information related to flight changes on a fixed date each time, so it provides users with limited information to choose from. Users need to perform multiple operations, and separate searches are required for changes to round trips. Therefore, the existing method is not only inconvenient to operate, but also does not allow passengers to quickly and accurately select the most suitable flight changes. Summary of the Invention

[0005] In view of the shortcomings of the prior art, this application provides a method and device for processing flight ticket change information, an electronic device, and a storage medium to solve the problems that the prior art is not convenient enough and is not easy to select the most suitable flight.

[0006] To achieve the above objectives, this application provides the following technical solution:

[0007] The first aspect of this application provides a method for processing flight ticket change information, including:

[0008] Get the change date of at least one segment of the current target itinerary selected by the current user;

[0009] Each date within a preset range based on each of the aforementioned change dates is split to obtain the target date corresponding to each of the aforementioned change dates;

[0010] Each date unit is constructed using the target date corresponding to each of the change dates; wherein, each date unit includes a target date corresponding to each change date, and the order of each target date conforms to the flight sequence of the corresponding change date;

[0011] generate a plurality of candidate flight combinations corresponding to each of the date units based on flight information of each of the target dates, wherein one of the candidate flight combinations corresponding to the date unit includes one target flight of each of the target dates in the date unit, and the target flight of the target date refers to a flight in the target date with a same flight route as a flight route of the change date corresponding to the target date;

[0012] calculate a price difference of each of the candidate flight combinations corresponding to each of the date units, respectively;

[0013] select 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, respectively;

[0014] feed back the price difference and flight information of each of the date units and the final selected flight combination corresponding to the date unit to a current user.

[0015] Optionally, in the flight change information processing method, the splitting each date within a preset range based on the change date to obtain the target date corresponding to the change date includes:

[0016] splitting each date within seven days with the change date as a middle date to obtain the target date corresponding to the change date.

[0017] Optionally, in the flight change information processing method, the constructing each date unit by using the target date corresponding to each of the change dates includes:

[0018] if there is only one change date, each of the target dates corresponding to the change date is determined as one date unit, respectively;

[0019] if there are a plurality of change dates, each of the target dates corresponding to each of the change dates is combined to obtain a plurality of date combinations, wherein each of the date combinations includes one target date corresponding to each of the change dates;

[0020] select the date combination including the target dates in a sequence conforming to a flight route sequence of the corresponding change dates from each of the date combinations as the date unit.

[0021] Optionally, in the flight change information processing method, the generating a plurality of candidate flight combinations corresponding to each of the date units based on flight information of each of the target dates includes:

[0022] If there is only one change date, then for each date unit, based on the flight information of the target date in the date unit, each target flight in the target date in the date unit is determined as the flight combination corresponding to the date unit.

[0023] If there are multiple change dates, then for each date unit, based on the flight information of each target date in the date unit, the target flights of each target date in the date unit are combined to obtain the flight combination corresponding to the date unit; wherein, a flight combination includes one target flight of each target date in the date unit;

[0024] Based on the current user's information, select flight combinations that meet the current user's expectations from the flight combinations corresponding to each date unit;

[0025] For each date unit, determine whether the number of flight combinations corresponding to the selected date unit is greater than a preset number;

[0026] If it is determined that the number of flight combinations corresponding to the selected date unit is not greater than the preset number, then each flight combination corresponding to the selected date unit is determined as the candidate flight combination corresponding to the date unit.

[0027] If it is determined that the number of flight combinations corresponding to the selected date unit is greater than the preset number, then a score for the flight combinations corresponding to the selected date unit is calculated based on the flight information of each target flight.

[0028] Based on the scores of the flight combinations corresponding to the selected date units, a preset number of flight combinations are selected from each of the selected flight combinations corresponding to the date units to determine the candidate flight combinations corresponding to the date units.

[0029] Optionally, in the above-described method for processing flight change information, before calculating the price difference for each candidate flight combination corresponding to each date unit, the method further includes:

[0030] Generate calculation request messages for each of the candidate flight combinations corresponding to each of the date units;

[0031] Each date unit, each candidate air traffic control combination corresponding to each date unit, and their calculation request messages are stored according to a two-level storage structure.

[0032] Optionally, in the above-described method for processing flight change information, the step of feeding back the price difference and flight information of each date unit and its corresponding final flight combination to the current user includes:

[0033] The price difference and flight information of each date unit and its corresponding final flight combination are converted and integrated to obtain the calendar mode change search results, and the calendar mode change search results are fed back to the current user.

[0034] A second aspect of this application provides a ticket change information processing device, comprising:

[0035] The acquisition unit is used to acquire the change date of at least one segment of the current target itinerary selected by the current user;

[0036] The splitting unit is used to split each date within a preset range based on each of the change dates to obtain the target date corresponding to each of the change dates;

[0037] A construction unit is used to construct each date unit using the target dates corresponding to each of the change dates; wherein, each date unit includes a target date corresponding to each change date, and the order of each target date conforms to the flight sequence of the corresponding change dates;

[0038] A combination generation unit is used to generate multiple candidate flight combinations corresponding to each of the target dates based on flight information for each of the target dates; wherein, a candidate flight combination corresponding to each date date includes one target flight for each of the target dates in the date date; the target flight for the target date refers to a flight on the target date whose flight path is consistent with the flight path of the changed date corresponding to the target date;

[0039] The price difference calculation unit is used to calculate the price difference of each candidate flight combination corresponding to each date unit respectively;

[0040] A selection unit is used to select the candidate flight combination with the lowest price difference from each candidate flight combination corresponding to each date unit, and use it as the final selected flight combination for each date unit.

[0041] The feedback unit is used to provide the current user with the price difference and flight information of each date unit and its corresponding final flight combination.

[0042] Optionally, in the above-mentioned ticket change information processing device, the splitting unit includes:

[0043] The splitting subunit is used to split each of the seven days with the change date as the intermediate date for each change date, so as to obtain the target date corresponding to the change date.

[0044] Optionally, in the above-mentioned ticket change information processing device, the building unit includes:

[0045] The first construction unit is configured to determine each target date corresponding to the change date as a date unit when there is only one change date;

[0046] A date combination unit is used to combine the target dates corresponding to each of the multiple change dates when there are multiple change dates, to obtain multiple date combinations; wherein each date combination includes one target date corresponding to each change date;

[0047] The second construction unit is used to filter out the order of the target dates included in each of the date combinations, and the date combinations that conform to the flight sequence of the corresponding change date are used as the date units.

[0048] Optionally, in the above-mentioned ticket change information processing device, the combination generation unit includes:

[0049] The first generation unit is configured to, when there is only one change date, determine each target flight in the target date of the date unit as a flight combination corresponding to the date unit based on the flight information of the target date in the date unit for each date unit;

[0050] A flight combination unit is configured to, when there are multiple change dates, combine the target flights of each target date in the date unit based on the flight information of each target date in the date unit to obtain a flight combination corresponding to the date unit; wherein, a flight combination includes one target flight of each target date in the date unit;

[0051] The filtering unit is used to filter out flight combinations that meet the current user's expectations from the flight combinations corresponding to each date unit, based on the information of the current user.

[0052] The judgment unit is used to determine, for each date unit, whether the number of flight combinations corresponding to the filtered date unit is greater than a preset number;

[0053] The second generation unit is used to determine each flight combination corresponding to the selected date unit as the candidate flight combination corresponding to the date unit when it is determined that the number of flight combinations corresponding to the selected date unit is not greater than a preset number.

[0054] The scoring calculation unit is used to calculate the score of the flight combination corresponding to the selected date unit based on the flight information of each target flight when it is determined that the number of flight combinations corresponding to the selected date unit is greater than a preset number.

[0055] The third generation unit is used to select the preset number of flight combinations from the selected flight combinations corresponding to the date unit based on the scores of the selected flight combinations corresponding to the date unit, and determine them as the candidate flight combinations corresponding to the date unit.

[0056] Optionally, the aforementioned ticket change information processing device further includes:

[0057] The message generation unit is used to generate calculation request messages for each of the candidate flight combinations corresponding to each of the date units;

[0058] The storage unit is used to store each of the date units, each of the candidate air traffic control combinations corresponding to each of the date units, and their calculation request messages in a two-level storage structure.

[0059] Optionally, in the above-mentioned ticket change information processing device, the feedback unit includes:

[0060] The feedback subunit is used to convert and integrate the price difference and flight information of each date unit and its corresponding final flight combination to obtain the calendar mode change search results, and to feed back the calendar mode change search results to the current user.

[0061] A third aspect of this application provides an electronic device, comprising:

[0062] One or more processing devices;

[0063] A memory on which one or more programs are stored;

[0064] When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the ticket change information processing method as described in any of the above.

[0065] The fourth aspect of this application provides a computer storage medium for storing a program, which, when executed, implements the ticket change information processing method as described in any of the preceding claims.

[0066] This application provides a method for processing flight ticket change information. It obtains the change dates for at least one segment of the current user's selected target itinerary, allowing the user to simultaneously search for changes to multiple itineraries. Then, it breaks down each date within a preset range based on each change date to obtain the target dates corresponding to each change date. This allows for simultaneous calculations on each target date, rather than focusing on a fixed date. Next, it constructs date units using the target dates corresponding to each change date. Each date unit includes one target date corresponding to each change date, and the order of the target dates corresponds to the flight order of the corresponding change dates. Then, based on the flight information for each target date, it generates multiple candidate flight combinations for each date unit. Each candidate flight combination for a date unit includes one target flight for each target date within the date unit; a target flight for a target date refers to a flight on the target date whose flight path matches the flight path of the change date corresponding to the target date. Next, the price difference for each candidate flight combination corresponding to each date unit is calculated. Then, the candidate flight combination with the lowest price difference is selected from all the candidate flight combinations for each date unit as the final selected flight combination, thus filtering out the most cost-effective change option for the user. Finally, the price difference and flight information for each date unit and its corresponding final selected flight combination are fed back to the current user. This achieves a method that allows simultaneous search for changes to multiple itineraries without requiring multiple operations, performing calculations for multiple dates simultaneously, and directly filtering out the most cost-effective change option for the user. Attached Figure Description

[0067] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0068] Figure 1 A flowchart illustrating a method for processing flight ticket change information provided in this application embodiment;

[0069] Figure 2 A flowchart illustrating a method for constructing various date units provided in this application embodiment;

[0070] Figure 3 A flowchart illustrating a method for generating candidate flight combinations provided in this application embodiment;

[0071] Figure 4 A schematic diagram of the architecture of a ticket change information processing device provided in this application embodiment;

[0072] Figure 5 This is a schematic diagram of the architecture of an electronic device provided in an embodiment of this application. Detailed Implementation

[0073] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0074] 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 any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0075] This application provides a method for processing flight ticket change information, such as... Figure 1 As shown, it includes the following steps:

[0076] S101. Obtain the change date of at least one segment of the current target itinerary selected by the current user.

[0077] The current target itinerary refers to the itinerary for which flight changes are currently required.

[0078] It should be noted that a ticket purchased by a user for their current target itinerary could be a single outbound ticket, a round-trip ticket including both outbound and return flights, or a one-way ticket comprising two segments. For example, an itinerary from Beijing to Tokyo might require flying from Beijing to Hong Kong first, and then from Hong Kong to Tokyo; although it's a one-way ticket only including the outbound flight, it still contains two segments. Of course, it could also be any other type of ticket comprising multiple segments.

[0079] Since changes can be made for each flight segment, users can choose to change only the departure or return flight dates, or both. Furthermore, regardless of whether the journey involves multiple segments, users can select whether a single segment needs to be changed and choose the corresponding change date.

[0080] However, changes can only be made to unflyed segments that are permitted to be changed. Furthermore, the selection of change dates for each segment must adhere to the order of the segments, and only one change date can be selected for each segment. For example, the change date for an outbound flight cannot be later than the change date for a return flight.

[0081] Therefore, even if the same day is selected for different flight segments, there are still two different change dates.

[0082] S102. Each date within a preset range based on each change date is split to obtain the target date corresponding to each change date.

[0083] It should be noted that in this embodiment of the application, the search is no longer performed on a single fixed date, but on a range of dates within a preset range, including various change dates. That is, the search is performed on various target dates, and the target dates include change dates.

[0084] Since each change date applies to a different flight, in this embodiment, it is necessary to split each date within a preset range based on each change date to obtain the target date corresponding to each change date. Furthermore, even multiple change dates belonging to the same day need to be split separately to obtain the target date corresponding to the change date for each flight.

[0085] Optionally, each date within a preset range based on each change date can be the change date and N days after the change date, or a preset range from N days before the change date to M days after the change date, or other ranges.

[0086] Optionally, in another embodiment of this application, one specific implementation of step S102 includes:

[0087] For each change date, the dates within seven days of the change date are broken down to obtain the target date corresponding to the change date.

[0088] Therefore, in this embodiment of the application, the change date, 3 days before the change date, and 3 days after the change date are separated and used as the target date.

[0089] Optionally, considering that calculating the corresponding data for past times is meaningless and increases unnecessary computation, after obtaining the target dates corresponding to each change date, each target date earlier than the current date can be removed from the target dates corresponding to each change date.

[0090] S103. Construct each date unit using the target date corresponding to each change date.

[0091] A date unit includes a target date corresponding to each changed date, and the order of these target dates conforms to the flight sequence of their respective changed dates. Therefore, the number of target dates in a date unit is equal to the number of changed dates, and the order of the target dates must match the flight sequence of their respective destinations to ensure compatibility with the current user's travel plans. For example, if the outbound journey precedes the return journey, the target date corresponding to the changed date of the outbound journey in a date unit should be no later than the target date corresponding to the changed date of the return journey. Thus, the date unit constructs all feasible travel arrangements.

[0092] Optionally, in another embodiment of this application, one specific implementation of step S103 is as follows: Figure 2 As shown, it includes:

[0093] S201. Determine if there is only one change date.

[0094] If there is only one change date, only one segment of the flight needs to be changed, so there is no need to combine dates. Therefore, if it is determined that there is only one change date, proceed to step S202. If it is determined that there is more than one change date, i.e., there are multiple change dates, proceed to step S203.

[0095] S202. Determine each target date corresponding to the change date as a date unit.

[0096] S203. Combine the target dates corresponding to each change date to obtain multiple date combinations.

[0097] Each date combination includes a target date corresponding to each change date.

[0098] S204. Select the order of the target dates included in each date combination, and use the date combination that matches the flight sequence of the corresponding change date as the date unit.

[0099] Optionally, for steps S203 and 204, a multidimensional array can be constructed, where each array represents a date combination. Then, date units are selected based on the values ​​corresponding to each array. For example, the user currently selects November 24th for the outbound journey and November 26th for the return journey. Therefore, based on the target dates corresponding to the two change dates, a two-dimensional array as shown in Table 1 can be constructed. Specifically, each value in the table is 1 if the outbound target date is not later than the return target date, and 0 if the outbound target date is later than the return target date. Therefore, finally, the target dates with a value of 1 in the table can be combined into date units.

[0100] Table 1

[0101]

[0102] S104. Based on the flight information for each target date, generate multiple candidate flight combinations corresponding to each date unit.

[0103] In this context, a candidate flight combination corresponding to a date unit includes one target flight for each target date within that date unit. That is, the number of target flights in a flight combination corresponding to a date unit is the same as the number of target dates in the date unit, which is also the same as the number of change dates. Therefore, when there is only one change date, a candidate flight combination includes only one flight. A target flight for a target date refers to a flight on that target date whose flight path matches the flight path of the corresponding change date.

[0104] It's important to note that there are usually multiple flights operating within a single day, and these flights often have multiple corresponding itineraries for the same change date as the target date. For example, for a flight from Beijing to Shanghai, there are typically multiple flights at different times and from different airlines on a given day. Therefore, after determining the change date—that is, after defining a date unit—there are various flight options available, and different flight combinations have different prices. Thus, it's necessary to identify all the available flight combinations to determine which option offers the best value.

[0105] Optionally, in another embodiment of this application, one specific implementation of step S104 is as follows: Figure 3 As shown, it includes the following steps:

[0106] S301. Determine if there is only one change date.

[0107] Since there is no need to combine target flights for different target dates when there is only one change date, step S302 is executed when it is determined that there is only one change date. If it is determined that there is more than one change date, i.e., multiple change dates exist, then step S303 is executed.

[0108] S302. For each date unit, based on the flight information of the target date in that date unit, determine each target flight in the target date of that date unit as the flight combination corresponding to that date unit.

[0109] S303. For each date unit, based on the flight information of each target date in that date unit, combine each target flight in each target date in that date unit to obtain the flight combination corresponding to that date unit.

[0110] One flight combination consists of one target flight for each target date in the date unit.

[0111] S304. Based on the current user's information, select flight combinations that meet the current user's expectations from the flight combinations corresponding to each date unit.

[0112] Considering the different preferences of different users, such as whether there is a layover, whether an overnight stay is required, and certain airlines' flights, and in order to reduce the amount of subsequent calculations, in this embodiment of the application, flight combinations that meet the current user's expectations are selected based on the current user's information, and then subsequent calculations are performed on the selected flight combinations.

[0113] S305. For each date unit, determine whether the number of flight combinations corresponding to that date unit is greater than the preset number.

[0114] Because the calculation process for changing flights involves a large amount of computation, in order to improve computational efficiency and reduce the consumption of computing resources, this embodiment only selects a certain number of flight combinations from the flight combinations currently expected by the user to perform the subsequent calculation process. Therefore, it is necessary to determine whether the number of flight combinations corresponding to the selected date unit is greater than a preset number for each date unit. If it is determined that the number of flight combinations corresponding to the selected date unit is not greater than the preset number, step S306 can be executed. If it is determined that the number of flight combinations corresponding to the selected date unit is greater than the preset number, step S308 needs to be executed.

[0115] S306. The selected flight combinations corresponding to the date unit are determined as candidate flight combinations for the date unit.

[0116] S307. Based on the flight information of each target flight, calculate the score of the flight combination corresponding to the selected date unit.

[0117] Specifically, the score for flight combinations can be calculated based on factors such as whether the target flight has a connecting flight, fare, detour altitude, flight time, and other flight information. For example, the fewer the connecting flights, the shorter the flight time, the lower the fare, and the lower the detour altitude, the higher the score.

[0118] S308. Based on the scores of the flight combinations corresponding to the selected date unit, select a preset number of flight combinations from each of the selected flight combinations corresponding to the date unit and determine them as candidate flight combinations corresponding to the date unit.

[0119] Specifically, the flight combinations can be sorted in descending order according to their scores, and then the flight combinations ranked before the preset number of times can be selected as the candidate flight combinations for the corresponding date units.

[0120] S105. Calculate the price difference for each candidate flight combination corresponding to each date unit.

[0121] Specifically, the original ticket price is recalculated, and the corresponding refund and change rules are obtained. Then, based on the refund and change rules, the fare for the new itinerary corresponding to each candidate flight combination is calculated. Finally, the price difference between the old and new itineraries is calculated to obtain the price difference for each candidate flight combination.

[0122] Optionally, to facilitate data flow and management, in another embodiment of this application, before executing step S105, the following may be further performed:

[0123] Generate calculation request messages for each candidate flight combination corresponding to each date unit, and store each date unit, each candidate flight combination corresponding to each date unit, and their calculation request messages according to a two-level storage structure.

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

[0125] Table 2

[0126]

[0127]

[0128] Optionally, the method provided in this application embodiment can be implemented through two modules: a main flight search module and a fare refund / change calculation module. The calling relationship between these two modules can be either cohesive or separate. A cohesive relationship means the two modules are nested within each other, and communication between them does not rely on network transmission, such as the fare calculation module being included within the flight search module. A separate relationship means the flight search module and the fare calculation module are independent of each other, and they need to interact via network transmission. Therefore, to facilitate the flow between the two models, corresponding calculation request messages are generated in this application embodiment.

[0129] S106. Select the candidate flight combination with the lowest price difference from each candidate flight combination corresponding to each date unit, and use it as the final flight combination corresponding to each date unit.

[0130] S107. Feed back the information of the target flights in each date unit and its corresponding final flight combination to the current user.

[0131] Optionally, in another embodiment of this application, one specific implementation of step S107 includes:

[0132] The system converts and integrates the price difference and flight information of each date unit and its corresponding final flight combination to obtain the calendar mode change search results, and then feeds the calendar mode change search results back to the current user.

[0133] To facilitate users obtaining relevant information more intuitively, a calendar mode is used in this embodiment to provide feedback to users.

[0134] This application provides a method for processing flight ticket change information. It obtains the change dates of at least one segment of the current user's selected target itinerary, allowing the user to simultaneously search for changes to multiple itineraries. Then, it breaks down each date within a preset range based on each change date to obtain the target date corresponding to each change date. This allows for simultaneous calculations on each target date, rather than focusing on a fixed date. Subsequently, it constructs date units using the target dates corresponding to each change date. Each date unit includes one target date corresponding to each change date, and the order of the target dates conforms to the flight order of the corresponding change dates. Then, based on the flight information of each target date, it generates multiple candidate flight combinations corresponding to each date unit. Each candidate flight combination corresponding to a date unit includes one target flight for each target date in the date unit; the target flight for a target date refers to a flight on the target date whose flight path matches the flight path of the change date corresponding to the target date. Next, the price difference for each candidate flight combination corresponding to each date unit is calculated. Then, the candidate flight combination with the lowest price difference is selected from all the candidate flight combinations for each date unit as the final selected flight combination, thus filtering out the most cost-effective change option for the user. Finally, the price difference and flight information for each date unit and its corresponding final selected flight combination are fed back to the current user. This achieves a method that allows simultaneous search for changes to multiple itineraries without requiring multiple operations, performing calculations for multiple dates simultaneously, and directly filtering out the most cost-effective change option for the user.

[0135] It should be noted that the flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, nodes, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0136] Although the operations are described in a specific order, this should not be construed as requiring these operations to be performed in the specific order shown or in a sequential order. In certain environments, multitasking and parallel processing may be advantageous.

[0137] Another embodiment of this application provides a ticket change information processing device, such as... Figure 4 As shown, it includes:

[0138] The acquisition unit 401 is used to acquire the change date of at least one segment of the current target itinerary selected by the current user.

[0139] The splitting unit 402 is used to split each date within a preset range based on each change date to obtain the target date corresponding to each change date.

[0140] Construction unit 403 is used to construct each date unit using the target date corresponding to each change date.

[0141] Each date unit includes a target date corresponding to each change date, and the order of the target dates conforms to the flight sequence of the corresponding change dates.

[0142] The combination generation unit 404 is used to generate multiple candidate flight combinations corresponding to each date unit based on the flight information of each target date.

[0143] A candidate flight combination corresponding to a date unit includes one target flight for each target date within that date unit. A target flight for a target date refers to a flight on the target date whose flight path is identical to the flight path on the corresponding change date.

[0144] Price difference calculation unit 405 is used to calculate the price difference of each candidate flight combination corresponding to each date unit.

[0145] Selection unit 406 is used to select the candidate flight combination with the lowest price difference from each candidate flight combination corresponding to each date unit, and use it as the final selected flight combination for each date unit.

[0146] Feedback unit 407 is used to provide the current user with the price difference and flight information for each date unit and its corresponding final flight combination.

[0147] Optionally, in another embodiment of the ticket change information processing apparatus provided in this application, the split unit includes:

[0148] The splitting sub-unit is used to split each date within seven days with the change date as the median date for each change date, so as to obtain the target date corresponding to the change date.

[0149] Optionally, in another embodiment of the ticket change information processing apparatus provided in this application, the construction unit includes:

[0150] The first building unit is used to determine each target date corresponding to the change date as a date unit when there is only one change date.

[0151] The date combination unit is used to combine the target dates corresponding to each change date when there are multiple change dates, resulting in multiple date combinations. Each date combination includes one target date corresponding to each change date.

[0152] The second building unit is used to filter the order of the target dates included in each date combination, and the date combination that conforms to the flight sequence of the corresponding change date is used as the date unit.

[0153] Optionally, in another embodiment of the ticket change information processing apparatus provided in this application, the combined generation unit includes:

[0154] The first generation unit is used to determine each target flight in the target date of the date unit as the flight combination corresponding to the date unit, based on the flight information of the target date in the date unit, when there is only one change date.

[0155] The flight combination unit is used to combine the target flights of each target date in a date unit based on the flight information of each target date when there are multiple change dates, so as to obtain the flight combination corresponding to the date unit.

[0156] One flight combination consists of one target flight for each target date in the date unit.

[0157] The filtering unit is used to filter flight combinations that meet the current user's expectations from the flight combinations corresponding to each date unit, based on the current user's information.

[0158] The judgment unit is used to determine, for each date unit, whether the number of flight combinations corresponding to the filtered date unit is greater than the preset number.

[0159] The second generation unit is used to determine each flight combination corresponding to the selected date unit as a candidate flight combination corresponding to the date unit when it is determined that the number of flight combinations corresponding to the selected date unit is not greater than a preset number.

[0160] The scoring calculation unit is used to calculate the score of the flight combination corresponding to the selected date unit based on the flight information of each target flight when it is determined that the number of flight combinations corresponding to the selected date unit is greater than the preset number.

[0161] The third generation unit is used to select a preset number of flight combinations from the various flight combinations corresponding to the selected date units based on the scores of the flight combinations corresponding to the selected date units, and determine them as candidate flight combinations corresponding to the date units.

[0162] Optionally, in another embodiment of the ticket change information processing device provided in this application, the device further includes:

[0163] The message generation unit is used to generate calculation request messages for each candidate flight combination corresponding to each date unit.

[0164] The storage unit is used to store each date unit, each candidate aerospace combination corresponding to each date unit, and their calculation request messages in a two-level storage structure.

[0165] Optionally, in another embodiment of the ticket change information processing device provided in this application, the feedback unit includes:

[0166] The feedback subunit is used to convert and integrate the price difference and flight information of each date unit and its corresponding final flight combination to obtain the calendar mode change search results, and to feed back the calendar mode change search results to the current user.

[0167] It should be noted that the specific working process of each unit provided in the above embodiments of this application can be referred to the corresponding steps in the above method embodiments, and will not be repeated here.

[0168] Furthermore, the functions of each unit described in the above embodiments can be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that can be used include: Field Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application Standard Products (ASSPs), System-on-Chip (SOCs), Complex Programmable Logic Devices (CPLDs), etc.

[0169] Another embodiment of this application provides an electronic device, such as... Figure 5 The diagram illustrates a structural schematic of an electronic device 500 suitable for implementing embodiments of the present disclosure. The electronic device in these embodiments may include, but is not limited to, electronic devices such as desktop computers, laptops, tablets, and vehicle terminals.

[0170] like Figure 5As shown, the electronic device 500 includes one or more processing devices 501, such as a central processing unit, a graphics processing unit, etc., and a memory 502 on which one or more programs are stored. When one or more programs are executed by one or more processing devices 501, the one or more processing devices 501 implement the ticket change information processing method provided in any of the above embodiments.

[0171] Alternatively, the electronic device may also include other components, see also [reference needed]. Figure 5 The processing device 501, read-only memory 502, and random access memory 503 are interconnected via bus 504. Input / output (I / O) interface 505 is also connected to bus 504. Typically, the following devices can be connected to I / O interface 505: input devices 506 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 507 including, for example, liquid crystal displays, speakers, vibrators, etc.; storage devices 508 including, for example, magnetic tape, hard disks, etc.; and communication devices 509. Communication device 509 allows electronic device 500 to communicate wirelessly or wiredly with other devices to exchange data. Although... Figure 5 An electronic device 500 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively.

[0172] Another embodiment of this application provides a computer storage medium for storing a program, which, when executed, implements the ticket change information processing method as described in any of the above claims.

[0173] Computer storage media, including both permanent and non-permanent, removable and non-removable media, can store information using any method or technology. Information can 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, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0174] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0175] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily 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 this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for processing flight ticket change information, characterized in that, include: Get the change date of at least one segment of the current target itinerary selected by the current user; Each date within a preset range based on each of the aforementioned change dates is split to obtain the target date corresponding to each of the aforementioned change dates; Each date unit is constructed using the target dates corresponding to each of the change dates, including: if there is only one change date, then each target date corresponding to the change date is determined as a date unit; if there are multiple change dates, then each target date corresponding to each change date is combined to obtain multiple date combinations; wherein each date combination includes one target date corresponding to each change date; the order of the target dates included in each date combination is selected, and the date combination that conforms to the flight order of the corresponding change date is taken as the date unit; wherein each date unit includes one target date corresponding to each change date, and the order of the target dates conforms to the flight order of the corresponding change date; Based on the flight information for each target date, multiple candidate flight combinations are generated for each date unit; wherein, a candidate flight combination for each date unit includes one target flight for each target date in the date unit; the target flight for the target date refers to a flight on the target date whose flight path is consistent with the flight path of the changed date corresponding to the target date; Calculate the price difference for each of the candidate flight combinations corresponding to each of the date units; The candidate flight combination with the lowest price difference is selected from each candidate flight combination corresponding to each date unit, and this is taken as the final selected flight combination for each date unit. The price difference and flight information for each date unit and its corresponding final flight combination are fed back to the current user.

2. The method according to claim 1, characterized in that, For each of the aforementioned change dates, each date within a preset range based on the change date is broken down to obtain the target date corresponding to the change date, including: For each of the aforementioned change dates, the dates within seven days with the change date as the median date are split to obtain the target date corresponding to the change date.

3. The method according to claim 1, characterized in that, The step of generating multiple candidate flight combinations corresponding to each of the target dates based on flight information includes: If there is only one change date, then for each date unit, based on the flight information of the target date in the date unit, each target flight in the target date in the date unit is determined as the flight combination corresponding to the date unit. If there are multiple change dates, then for each date unit, based on the flight information of each target date in the date unit, the target flights of each target date in the date unit are combined to obtain the flight combination corresponding to the date unit; wherein, a flight combination includes one target flight of each target date in the date unit; Based on the current user's information, select flight combinations that meet the current user's expectations from the flight combinations corresponding to each date unit; For each date unit, determine whether the number of flight combinations corresponding to the selected date unit is greater than a preset number; If it is determined that the number of flight combinations corresponding to the selected date unit is not greater than the preset number, then each flight combination corresponding to the selected date unit is determined as the candidate flight combination corresponding to the date unit. If it is determined that the number of flight combinations corresponding to the selected date unit is greater than the preset number, then a score for the flight combinations corresponding to the selected date unit is calculated based on the flight information of each target flight. Based on the scores of the flight combinations corresponding to the selected date units, a preset number of flight combinations are selected from each of the selected flight combinations corresponding to the date units to determine the candidate flight combinations corresponding to the date units.

4. The method according to claim 1, characterized in that, Before calculating the price difference for each of the candidate flight combinations corresponding to each of the date units, the method further includes: Generate calculation request messages for each of the candidate flight combinations corresponding to each of the date units; Each date unit, each candidate air traffic control combination corresponding to each date unit, and their calculation request messages are stored according to a two-level storage structure.

5. The method according to claim 1, characterized in that, The step of feeding back the price difference and flight information of each date unit and its corresponding final flight combination to the current user includes: The price difference and flight information of each date unit and its corresponding final flight combination are converted and integrated to obtain the calendar mode change search results, and the calendar mode change search results are fed back to the current user.

6. A ticket change information processing device, characterized in that, include: The acquisition unit is used to acquire the change date of at least one segment of the current target itinerary selected by the current user; The splitting unit is used to split each date within a preset range based on each of the change dates to obtain the target date corresponding to each of the change dates; A construction unit is used to construct each date unit using the target dates corresponding to each of the change dates; wherein, each date unit includes a target date corresponding to each change date, and the order of each target date conforms to the flight sequence of the corresponding change dates; The building unit includes: a first building unit, a date combination unit, and a second building unit; The first construction unit is configured to, when there is only one change date, determine each target date corresponding to the change date as a date unit; The date combination unit is used to combine the target dates corresponding to each of the multiple change dates when there are multiple change dates, to obtain multiple date combinations; wherein each date combination includes one target date corresponding to each change date; The second construction unit is used to filter out the order of the target dates included in each of the date combinations, and the date combinations that conform to the flight sequence of the corresponding change date are used as the date units; A combination generation unit is used to generate multiple candidate flight combinations corresponding to each of the target dates based on flight information for each of the target dates; wherein, a candidate flight combination corresponding to each date date includes one target flight for each of the target dates in the date date; the target flight for the target date refers to a flight on the target date whose flight path is consistent with the flight path of the changed date corresponding to the target date; The price difference calculation unit is used to calculate the price difference of each candidate flight combination corresponding to each date unit respectively; A selection unit is used to select the candidate flight combination with the lowest price difference from each candidate flight combination corresponding to each date unit, and use it as the final selected flight combination for each date unit. The feedback unit is used to provide the current user with the price difference and flight information of each date unit and its corresponding final flight combination.

7. The apparatus according to claim 6, characterized in that, The splitting unit includes: The splitting subunit is used to split each of the seven days within the range of the change date as the intermediate date for each change date, so as to obtain the target date corresponding to the change date.

8. An electronic device, characterized in that, include: One or more processing devices; A memory on which one or more programs are stored; When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the ticket change information processing method as described in any one of claims 1 to 5.

9. A computer storage medium, characterized in that, Used to store a program, which, when executed, is used to implement the ticket change information processing method as described in any one of claims 1 to 5.

Images