Dead position combination optimization method and optimization device for domestic freight rate search
By generating a dead combination set of the same cabin combination and low-priced cabin combination, the search speed problem caused by the large amount of calculation of the full cabin mode is solved, and the user experience of fast query is achieved.
Patent Information
- Application Number
- CN202411906633.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-23
- Publication Date
- 2025-04-15
AI Technical Summary
The existing domestic ticket search system has a slow search speed due to the large amount of calculation of the full-class mode, which cannot meet the users' fast query needs.
By obtaining the cabin information of the target flight combination, the first cabin combination set and the second cabin combination set are generated, including the same cabin combination and the low-priced cabin combination respectively. Finally, the final dead combination set is generated through union operation, reducing the calculation amount and improving the search speed.
It has achieved the reduction of calculation volume without reducing the cabin combination results displayed in the full-cabin mode, significantly improving the search speed of domestic ticket search systems and improving user experience.
Smart Images
Figure CN119831099A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of flight combination, and in particular to a method and device for optimizing the flight position combination of domestic freight rate search. Background Art
[0002] With the continuous development of the aviation market and the ever-changing travel needs of passengers, the traditional low-price model of the domestic ticket search system, that is, a flight combination only displays the lowest price, has been unable to meet the current market demand.
[0003] The full-class mode is a mode that displays the prices of all class combinations of all flight combinations. Compared with the traditional low-price mode, the full-class mode can display more prices and display more class combination products of the airline, which can meet the needs of passengers with different travel preferences. The full-class mode requires that the classes of all flights of the itinerary be combined first, and the prices of all class combinations be calculated, so that all prices of the itinerary can be obtained and finally returned to the front end. As the number of flights in the itinerary increases, the amount of calculation will increase exponentially, especially for itineraries with transfers on both the round trip, the amount of calculation is hundreds of thousands of times that of the low-price mode, and the size of the result message returned to the front-end website will also increase significantly, the search speed will be slow, and finally lead to a poor user experience.
[0004] There is no effective solution to the technical problem that the existing domestic ticket search system has a slow search speed due to the large amount of calculation in the full-class mode. Summary of the invention
[0005] The embodiment of the present invention provides a method and device for optimizing the flight combination of domestic fare search, so as to at least solve the technical problem that the existing domestic ticket search system has a slow search speed due to the large amount of calculation in the full-class mode.
[0006] According to one aspect of an embodiment of the present invention, a method for optimizing flight combinations for domestic fare search is provided, comprising: obtaining the space information of a target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price; generating a first space combination set based on the space code of each target flight, wherein the first space combination set includes a plurality of first space combinations, the first space combination includes a space of each target flight, and all spaces in the same first space combination have the same space code; generating a second space combination set based on the space price of each target flight, wherein the second space combination set includes a plurality of second space combinations, the second space combination includes a low-priced space of each target flight; generating a final space combination set of the target flight combination based on the first space combination set and the second space combination set.
[0007] Further, generating a first class space combination set according to the class space code of each target flight includes: generating multiple code sets according to the class space code of each target flight; performing an intersection operation on the multiple code sets to generate a target code set; and determining the first class space combination set based on the target code set.
[0008] Furthermore, based on the seat prices of each target flight, a second seat combination set is generated, including: obtaining a low-price seat set in each target flight according to the seat prices of each target flight, wherein the number of seats in each low-price seat set is the same; performing a Cartesian product operation on the obtained multiple low-price seat sets to generate a second seat combination set.
[0009] Furthermore, based on the seat price of each target flight, a set of low-priced seats in each target flight is obtained, including: sorting all seats of the target flight according to the seat price of the target flight to generate a seat sorting list, wherein the seat price of each seat in the seat sorting list is sorted from low to high; in combination with a preset number of low-priced seats, seats are selected from the seat sorting list, and the selected seats are combined to generate a set of low-priced seats.
[0010] Furthermore, obtaining a low-price seat set in each target flight according to the seat price of each target flight also includes: before sorting all the seats of the target flights, performing weighted calculation on the seat prices of the target flights.
[0011] Further, based on the first space combination set and the second space combination set, determining a final space combination set of the target flight combination includes: performing a union operation on the first space combination set and the second space combination set to generate a final space combination set.
[0012] According to another aspect of an embodiment of the present invention, a flight space combination optimization device for domestic fare search is also provided, comprising: an acquisition module, the acquisition module is used to acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price; a first generation module, the first generation module is used to generate a first space combination set based on the space codes of each target flight, wherein the first space combination set includes multiple first space combinations, the first space combination includes a space of each target flight, and the space code of all spaces in the same first space combination is the same; a second generation module, the second generation module is used to generate a second space combination set based on the space prices of each target flight, wherein the second space combination set includes multiple second space combinations, and the second space combination includes a low-priced space of each target flight; a third generation module, the third generation module is used to generate a final flight space combination set of the target flight combination based on the first space combination set and the second space combination set.
[0013] According to another aspect of an embodiment of the present invention, a computer storage medium is provided. The computer storage medium includes a stored program, wherein when the program is running, the device where the computer storage medium is located is controlled to execute the above-mentioned optimization method.
[0014] According to another aspect of an embodiment of the present invention, a processor is further provided. The processor is used to run a program. The processor is configured to run a computer program to execute the above-mentioned optimization method.
[0015] According to another aspect of an embodiment of the present invention, a computer program product is provided, including a computer program, and the computer program is executed by a processor to perform the above-mentioned optimization method.
[0016] In an embodiment of the present invention, according to the cabin code of each target flight, the cabins with the same cabin code in each target flight are combined to generate a first cabin combination set; according to the cabin price of each target flight, the low-priced cabins in each target flight are combined to generate a second cabin combination set; based on the first cabin combination set and the second cabin combination set, a final flight combination set of the target flight combination is generated. In the above scheme, only the low-priced cabin combination and the same cabin combination are retained in the final flight combination set, which not only enables the full cabin mode to display various cabin combination results, but also reduces the calculation amount of the full cabin mode, thereby improving the search speed of the domestic passenger ticket search system. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:
[0018] Figure 1 It is a hardware structure block diagram of a computer terminal (or mobile device) for implementing a dead-position combination optimization method for domestic freight rate search according to an embodiment of the present invention;
[0019] Figure 2 is a flow chart of a dead-space combination optimization method for domestic freight rate search according to an embodiment of the present invention;
[0020] Figure 3 It is a structural block diagram of a dead-centering combination optimization device for domestic freight rate search according to an embodiment of the present invention. DETAILED DESCRIPTION
[0021] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0023] Example 1
[0024] According to an embodiment of the present invention, an embodiment of a method for optimizing a dead-end combination for searching domestic freight rates is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.
[0025] Figure 1 1 is a hardware structure block diagram of a computer terminal (or mobile device) for implementing a dead-position combination optimization method for domestic freight rate search according to an embodiment of the present invention. Figure 1 As shown, the computer terminal (or mobile device) may include one or more processors 102 (the processor may include but is not limited to a central processing unit (CPU), a graphics processing unit (GPU), a digital signal processing (DSP) chip, a microprocessor (MCU), a field programmable logic device (FPGA), a neural network processor (NPU), a tensor processing unit (TPU), an artificial intelligence (AI) type processor, etc.) and a memory 104 for storing data. In addition, a transmission device 106 for communication functions, an input and output device 108, and a display 110 may also be included. It can be understood by those skilled in the art that Figure 1The structure shown is for illustration only and does not limit the structure of the above-mentioned computer terminal (or mobile device). For example, the computer terminal may also include more or fewer components than the above-mentioned structure description, or have a configuration different from the above-mentioned structure description.
[0026] The memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the method for the combination optimization of domestic freight rate search in the embodiment of the present invention. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, the method for the combination optimization of domestic freight rate search mentioned above is realized. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include a memory remotely arranged relative to the processor 102, and these remote memories may be connected to the mobile terminal via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof.
[0027] The transmission device 106 is used to receive or send data via a network. The specific example of the above network may include a wireless network provided by a communication provider of the mobile terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, referred to as NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 can be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.
[0028] The display 110 may be a touch screen type liquid crystal display (LCD). The liquid crystal display may enable a user to interact with a user interface of the mobile terminal. In some embodiments, the mobile terminal has a graphical user interface (GUI), and a user may interact with the GUI by finger contact and / or gestures on a touch-sensitive surface, wherein the human-computer interaction functions here may optionally include the following interactions: creating web pages, drawing, word processing, making electronic documents, games, video conferencing, instant messaging, sending and receiving emails, call interfaces, playing digital videos, playing digital music and / or web browsing, etc. Executable instructions for performing the above human-computer interaction functions are configured / stored in a computer program product or readable storage medium executable by one or more processors.
[0029] Figure 2 FIG. 1 is a flow chart of a method for optimizing a dead-end combination for searching domestic freight rates according to one embodiment of the present invention. Figure 2As shown, the process includes the following steps:
[0030] Step S1: Acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price.
[0031] Step S2: Based on the space codes of each target flight, a first space combination set is generated, wherein the first space combination set includes multiple first space combinations, each of which includes one space of each target flight, and all spaces in the same first space combination have the same space code.
[0032] It should be noted that, through investigating the product data of airline cabin combinations and passenger order data, it can be seen that products with the same cabin combination are more popular with users, so the same cabin combination is used as a kind of flight combination method in the full cabin mode.
[0033] Step S3: generating a second class space combination set based on the class space prices of each target flight, wherein the second class space combination set includes a plurality of second class space combinations, and the second class space combination includes a low-priced class space of each target flight.
[0034] It should be noted that for passengers with limited budgets, low-priced cabins can reduce travel costs, and for short-haul flights, the comfort level of low-priced cabins is not much different, making it an economical and affordable choice. Therefore, the low-priced cabin combination is used as a type of cabin combination in the full-cabin mode.
[0035] Step S4: Based on the first space combination set and the second space combination set, a final space combination set of the target flight combination is generated.
[0036] In an embodiment of the present application, according to the cabin code of each target flight, the cabins with the same cabin code in each target flight are combined to generate a first cabin combination set; according to the cabin price of each target flight, the low-priced cabins in each target flight are combined to generate a second cabin combination set; based on the first cabin combination set and the second cabin combination set, a final flight combination set of the target flight combination is generated. In the above scheme, only the low-priced cabin combination and the same cabin combination are retained in the final flight combination set, which not only enables the full cabin mode to display various cabin combination results, but also reduces the calculation amount of the full cabin mode, thereby improving the search speed of the domestic passenger ticket search system.
[0037] In an exemplary embodiment of the present application, in step S2, generating a first class combination set according to the class code of each target flight includes the following steps:
[0038] Step S21: Generate multiple code sets according to the cabin codes of each target flight.
[0039] It should be noted that the seats of each target flight are marked with a class code, and different flight seats are marked with different class codes, which are represented by 26 letters from A to Z. Among them, the class code is used to distinguish different cabin levels, for example: F (First Class) is the first class, providing the most comfortable seats and the highest level of service; C (Business Class) is the business class, providing more spacious seats and additional services than the economy class; Y (Economy Class) is the economy class, with relatively low fares and moderate seat space and service quality; P (Premium Economy) is the premium economy class, between the economy class and the business class, providing more comfortable seats and additional services; H (Economy Comfort) is the comfort economy class, which is a type of economy class and provides more legroom and additional services; R (Restricted Coach) is the restricted economy class, which is usually cheaper, but has more restrictions, such as not being able to change flights, etc.; Q (Basic Economy) is the basic economy class, with the lowest fares, but has more restrictions, such as not including baggage check-in and not being able to choose seats, etc.
[0040] Specifically, all the cabin codes of each target flight are reflected in a set manner, that is, a corresponding code set is generated.
[0041] Step S22: performing an intersection operation on multiple code sets to generate a target code set.
[0042] Exemplarily, a trip includes two target flights (Flight A and Flight B). The code set of Flight A and the code set of Flight B are intersected to obtain the class codes that both Flight A and Flight B have (i.e., the same class codes). For example, the same class codes include C, D, E, and F, thereby generating a target code set [C, D, E, F].
[0043] Step S23: Determine a first class combination set based on the target code set.
[0044] Exemplarily, the target code set [C, D, E, F] is combined in the same class to obtain the same class combinations [C, C], [D, D], [E, E] and [F, F], and then the first class combination set [[C, C], [D, D], [E, E], [F, F]] is obtained.
[0045] In an exemplary embodiment of the present application, step S3 generates a second class combination set based on the class prices of each target flight, including the following steps:
[0046] Step S31: according to the space prices of each target flight, a low-price space set in each target flight is obtained, wherein the number of spaces in each low-price space set is the same.
[0047] Specifically, the second generation module interacts with the cabin price query unit and the low-price cabin quantity setting unit. The second generation module obtains the cabin prices of each target flight through the cabin price query unit, and sets the number of low-price cabins through the low-price cabin quantity setting unit. The second generation module obtains the low-price cabin sets in each target flight based on the cabin prices of each target flight and the number of low-price cabins.
[0048] Step S32: Perform a Cartesian product operation on the obtained multiple low-price cabin sets to generate a second cabin combination set.
[0049] Exemplarily, a trip includes two target flights (Flight A and Flight B). The low-price cabin set of Flight A is [C, D, E], and the low-price cabin set of Flight B is [G, C, D]. The Cartesian product combination of [C, D, E] and [G, C, D] yields the second cabin combination set [[C, G], [C, C], [C, D], [D, G], [D, C], [D, D], [E, G], [E, C], [E, D]].
[0050] Preferably, step S31 obtains the low-price cabin sets in each target flight according to the cabin prices of each target flight, including the following steps:
[0051] Step S311: Sort all the cabins of the target flight according to the cabin price of the target flight to generate a cabin sort list, where the cabin prices of the cabins in the cabin sort list are sorted in ascending order.
[0052] Exemplarily, a trip includes two target flights (Flight A and Flight B). The cabin price query unit is called to query the prices of all the cabins A, B, C, D, E, F of Flight A. Assume that the cabin price magnitudes are C < D < E < F < A < B, that is, the cabin sort list of Flight A is CDEFGH; and, the prices of all the cabins C, D, E, F, G, H of Flight B are queried. Assume that the cabin price magnitudes are as follows: G < C < D < E < F < H, that is, the cabin sort list of Flight A is GCDEFH. Among them, each cabin is marked with a cabin code.
[0053] Step S312: Combine the preset quantity of low-price cabins, select cabins from the cabin sort list, and combine the selected cabins to generate a low-price cabin set.
[0054] Exemplarily, the preset number of low-priced seats is 3, that is, the low-priced seats for flight A are [C, D, E], and the low-priced seats for flight B are [G, C, D]. Cartesian product combination of [C, D, E] and [G, C, D] yields [[C, G], [C, C], [C, D], [D, G], [D, C], [D, D], [E, G], [E, C], [E, D]].
[0055] Furthermore, obtaining a low-price seat set in each target flight according to the seat price of each target flight also includes: before sorting all the seats of the target flights, performing weighted calculation on the seat prices of the target flights.
[0056] It should be noted that low-priced cabins are dynamically configured. The cabin prices are weighted according to the popularity and profit contribution of different cabins, and the cabins are sorted according to the weighted prices so that more attractive fares can be displayed first when selling.
[0057] Furthermore, step S4 determines a final flight combination set of the target flight combination based on the first flight combination set and the second flight combination set, including: performing a union operation on the first flight combination set and the second flight combination set to generate a final flight combination set.
[0058] Illustratively, the first class combination set is [[C, C], [D, D], [E, E], [F, F]], and the second class combination set is [[C, G], [C, C], [C, D], [D, G], [D, C], [D, D], [E, G], [E, C], [E, D]]. There are repeated class combinations in the first and second class combination sets, and the duplicates are removed by union operation to generate the final flight combination set [[C, C], [D, D], [E, E], [F, F], [C, G], [C, D], [D, G], [D, C], [E, G], [E, C], [E, D]].
[0059] According to another specific embodiment of the present application, a dead-position combination optimization device for searching domestic freight rates is also provided. Figure 3 As shown, the dead position combination optimization device includes: an acquisition module, a first generation module, a second generation module and a third generation module.
[0060] The acquisition module is used to acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information at least includes: a space code and a space price.
[0061] The first generating module is used to generate a first class space combination set based on the class space code of each target flight, wherein the first class space combination set includes multiple first class space combinations, the first class space combination includes a class space of each target flight, and the class space code of all classes in the same first class space combination is the same.
[0062] The second generating module is used to generate a second space combination set based on the space prices of each target flight, wherein the second space combination set includes multiple second space combinations, and the second space combination includes a low-priced space of each target flight.
[0063] The third generating module is used to generate a final flight combination set of the target flight combination based on the first flight combination set and the second flight combination set.
[0064] In an embodiment of the present application, according to the cabin code of each target flight, the cabins with the same cabin code in each target flight are combined to generate a first cabin combination set; according to the cabin price of each target flight, the low-priced cabins in each target flight are combined to generate a second cabin combination set; based on the first cabin combination set and the second cabin combination set, a final flight combination set of the target flight combination is generated. In the above scheme, only the low-priced cabin combination and the same cabin combination are retained in the final flight combination set, which not only enables the full cabin mode to display various cabin combination results, but also reduces the calculation amount of the full cabin mode, thereby improving the search speed of the domestic passenger ticket search system.
[0065] According to another specific embodiment of the present application, a computer storage medium is also provided, and the computer storage medium includes a stored program, wherein when the program is running, the device where the computer storage medium is located is controlled to execute the above-mentioned optimization method.
[0066] In an embodiment of the present application, the above storage medium may be configured to store a computer program for performing the following steps:
[0067] Step S1: Acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price.
[0068] Step S2: Based on the space codes of each target flight, a first space combination set is generated, wherein the first space combination set includes multiple first space combinations, each of which includes one space of each target flight, and all spaces in the same first space combination have the same space code.
[0069] Step S3: generating a second class space combination set based on the class space prices of each target flight, wherein the second class space combination set includes a plurality of second class space combinations, and the second class space combination includes a low-priced class space of each target flight.
[0070] Step S4: Based on the first space combination set and the second space combination set, a final space combination set of the target flight combination is generated.
[0071] In an embodiment of the present application, according to the cabin code of each target flight, the cabins with the same cabin code in each target flight are combined to generate a first cabin combination set; according to the cabin price of each target flight, the low-priced cabins in each target flight are combined to generate a second cabin combination set; based on the first cabin combination set and the second cabin combination set, a final flight combination set of the target flight combination is generated. In the above scheme, only the low-priced cabin combination and the same cabin combination are retained in the final flight combination set, which not only enables the full cabin mode to display various cabin combination results, but also reduces the calculation amount of the full cabin mode, thereby improving the search speed of the domestic passenger ticket search system.
[0072] According to another specific embodiment of the present application, a processor is also provided. The processor is used to run a program. The processor is configured to run a computer program to execute the above-mentioned optimization method.
[0073] In this embodiment, the processor may be configured to perform the following steps through a computer program:
[0074] Step S1: Acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price.
[0075] Step S2: Based on the space codes of each target flight, a first space combination set is generated, wherein the first space combination set includes multiple first space combinations, each of which includes one space of each target flight, and all spaces in the same first space combination have the same space code.
[0076] Step S3: generating a second class space combination set based on the class space prices of each target flight, wherein the second class space combination set includes a plurality of second class space combinations, and the second class space combination includes a low-priced class space of each target flight.
[0077] Step S4: Based on the first space combination set and the second space combination set, a final space combination set of the target flight combination is generated.
[0078] In an embodiment of the present application, according to the cabin code of each target flight, the cabins with the same cabin code in each target flight are combined to generate a first cabin combination set; according to the cabin price of each target flight, the low-priced cabins in each target flight are combined to generate a second cabin combination set; based on the first cabin combination set and the second cabin combination set, a final flight combination set of the target flight combination is generated. In the above scheme, only the low-priced cabin combination and the same cabin combination are retained in the final flight combination set, which not only enables the full cabin mode to display various cabin combination results, but also reduces the calculation amount of the full cabin mode, thereby improving the search speed of the domestic passenger ticket search system.
[0079] According to another specific embodiment of the present application, a computer program product is also provided, including a computer program, and the computer program is executed by a processor to perform the above-mentioned optimization method.
[0080] In this embodiment, the processor may be configured to perform the following steps through a computer program:
[0081] Step S1: Acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price.
[0082] Step S2: Based on the space codes of each target flight, a first space combination set is generated, wherein the first space combination set includes multiple first space combinations, each of which includes one space of each target flight, and all spaces in the same first space combination have the same space code.
[0083] Step S3: generating a second class space combination set based on the class space prices of each target flight, wherein the second class space combination set includes a plurality of second class space combinations, and the second class space combination includes a low-priced class space of each target flight.
[0084] Step S4: Based on the first space combination set and the second space combination set, a final space combination set of the target flight combination is generated.
[0085] In an embodiment of the present application, according to the cabin code of each target flight, the cabins with the same cabin code in each target flight are combined to generate a first cabin combination set; according to the cabin price of each target flight, the low-priced cabins in each target flight are combined to generate a second cabin combination set; based on the first cabin combination set and the second cabin combination set, a final flight combination set of the target flight combination is generated. In the above scheme, only the low-priced cabin combination and the same cabin combination are retained in the final flight combination set, which not only enables the full cabin mode to display various cabin combination results, but also reduces the calculation amount of the full cabin mode, thereby improving the search speed of the domestic passenger ticket search system.
[0086] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.
[0087] In the above embodiments of the present invention, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0088] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units can be a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.
[0089] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.
[0090] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0091] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk and other media that can store program codes.
[0092] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A method for dead-position combination optimization for domestic freight rate search, characterized in that: include: Acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price; Based on the class code of each of the target flights, a first class combination set is generated, wherein the first class combination set includes a plurality of first class combinations, each of the first class combinations includes one class of each of the target flights, and all the classes in the same first class combination have the same class code; Based on the space prices of each of the target flights, a second space combination set is generated, wherein the second space combination set includes a plurality of second space combinations, and the second space combination includes a low-priced space of each of the target flights; A final flight combination set of the target flight combination is generated based on the first flight combination set and the second flight combination set.
2. The method for dead position combination optimization according to claim 1, characterized in that: Generating a first class combination set according to the class code of each target flight includes: Generating a plurality of code sets according to the cabin code of each of the target flights; Performing an intersection operation on a plurality of the code sets to generate a target code set; Based on the target code set, the first space combination set is determined.
3. The dead position combination optimization method according to claim 1, characterized in that: Based on the space prices of each of the target flights, a second space combination set is generated, including: According to the space prices of the target flights, a low-price space set in each target flight is obtained, wherein the number of spaces in each low-price space set is the same; Cartesian product operation is performed on the obtained multiple low-price space sets to generate the second space combination set.
4. The method for dead position combination optimization according to claim 3, characterized in that: According to the space prices of each target flight, a low-price space set of each target flight is obtained, including: According to the space price of the target flight, all the spaces of the target flight are sorted to generate a space sorting list, wherein the space price of each space in the space sorting list is sorted from low to high; In combination with the preset number of the low-priced cabins, cabins are selected from the cabin ranking list, and the selected cabins are combined to generate the low-priced cabin set.
5. The dead position combination optimization method according to claim 4, characterized in that: According to the space prices of the target flights, a low-price space set of the target flights is obtained, which further includes: Before sorting all the seats of the target flight, weighted calculation is performed on the seat prices of the target flight.
6. The dead position combination optimization method according to claim 1, characterized in that: Determining a final flight combination set of the target flight combination based on the first flight combination set and the second flight combination set includes: A union operation is performed on the first space combination set and the second space combination set to generate the final space combination set.
7. A dead-position combination optimization device for domestic freight rate search, characterized in that: include: An acquisition module, the acquisition module is used to acquire the space information of the target flight combination, wherein the target flight combination includes at least two target flights, and the space information includes at least: a space code and a space price; A first generating module, the first generating module is used to generate a first class space combination set based on the class space code of each of the target flights, wherein the first class space combination set includes a plurality of first class space combinations, the first class space combination includes one class space of each of the target flights, and the class space code of all the classes in the same first class space combination is the same; A second generating module, the second generating module is used to generate a second class combination set based on the class price of each target flight, wherein the second class combination set includes a plurality of second class combinations, and the second class combination includes a low-priced class of each target flight; A third generating module is used to generate a final flight space combination set of the target flight combination based on the first flight space combination set and the second flight space combination set.
8. A computer storage medium, characterized in that The computer storage medium includes a stored program, wherein when the program is executed, the device where the computer storage medium is located is controlled to execute the dead position combination optimization method according to any one of claims 1 to 6.
9. A processor, characterized in that: The processor is used to run a program, and the processor is configured to run a computer program to execute the dead position combination optimization method according to any one of claims 1 to 6.
10. A computer program product, comprising a computer program, characterized in that The computer program is executed by a processor to implement the dead position combination optimization method according to any one of claims 1 to 6.