Flight orchestration method and system and electronic equipment

Abstract

The invention provides a flight orchestration method and system and electronic equipment, and relates to the technical field of communication, and the method comprises the steps: obtaining a plurality of first flight orchestration plans and a plurality of second flight orchestration plans; the plurality of first flight scheduling plans are initial flight scheduling plans of different branch companies; the second flight scheduling plan is currently stored flight scheduling plans of a plurality of branch companies; performing difference comparison on the plurality of first flight scheduling plans and the second flight scheduling plan to obtain a third flight scheduling plan; the third flight scheduling plan is a scheduling plan which is different from the second flight scheduling plan in time, take-off and landing airports and flight information in the plurality of first flight scheduling plans; modifying conflicting flights in the third flight scheduling plan to generate a fourth flight scheduling plan without conflicting flights; and updating the fourth flight scheduling plan to the second flight scheduling plan, and generating an integrated final flight scheduling plan. The method can effectively relieve the pressure of the database.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a flight scheduling method, system, and electronic equipment. Background Art

[0002] With the rapid development of the domestic and international civil aviation markets, the number of airline flights has increased exponentially. Flight scheduling systems are facing challenges such as large data volumes, complex scheduling rules, and high conflict rates.

[0003] In related technologies, since flight scheduling is usually performed in parallel by multiple aircraft management units (such as the flight department, maintenance department, and operation control center) through the client, in a multi-person collaborative editing scenario, if the user-edited data is included in the execution data every time, it will cause system response delays, seriously affecting the user's operation smoothness and editing efficiency.

[0004] In this context, how to effectively reduce database pressure has become an urgent problem to be solved. Summary of the Invention

[0005] The present application provides a flight scheduling method, system and electronic equipment, which avoids repeated data processing, thereby significantly reducing the storage and computing load of the database and effectively alleviating the database pressure.

[0006] In order to solve the above problems, the embodiments of the present application provide the following technical solutions:

[0007] In a first aspect, the present application provides a flight scheduling method, which includes: obtaining multiple first flight scheduling plans and second flight scheduling plans; comparing the differences between the multiple first flight scheduling plans and the second flight scheduling plans to obtain a third flight scheduling plan; modifying the conflicting flights in the third flight scheduling plan to generate a fourth flight scheduling plan without conflicting flights; updating the fourth flight scheduling plan to the second flight scheduling plan to generate an integrated final flight scheduling plan.

[0008] Among them, multiple first flight schedules are initial flight schedules of different branches; second flight schedules are flight schedules currently stored by multiple branches; and third flight schedules are schedules among the multiple first flight schedules that differ from the second flight schedules in terms of time, take-off and landing airports, and flight information.

[0009] Based on this, the embodiment of the present application obtains the initial flight scheduling plans of multiple branches and the currently stored scheduling plans, and identifies the third scheduling plan with differences in time, take-off and landing airports and flight information through difference comparison, accurately locates the target data to be processed, and reduces redundant operations; then, the conflicting flights in the third scheduling plan are modified to effectively eliminate flight conflicts and improve the rationality and executability of the scheduling plan; finally, the integrated final plan is generated by updating the stored second scheduling plan, avoiding repeated data processing, thereby significantly reducing the storage and computing load of the database and effectively alleviating the database pressure.

[0010] In one possible implementation, conflicting flights in a third flight schedule are modified to generate a fourth flight schedule without conflicting flights, including: obtaining time information, take-off and landing airport information, and aircraft type information of all flights in the third flight schedule; and adjusting the third flight schedule based on the time information, take-off and landing airport information, and aircraft type information to obtain a fourth flight schedule.

[0011] Based on this, the embodiment of the present application adjusts the conflict information of the acquired time, airport and aircraft model, making conflict detection and modification more targeted, effectively improving the accuracy and efficiency of flight plan adjustment, and providing an accurate data basis for generating a conflict-free plan.

[0012] In one possible implementation, the third flight schedule is adjusted based on time information, take-off and landing airport information, and aircraft type information to obtain a fourth flight schedule, including: grouping flights in the third flight schedule based on the take-off and landing airport information and the aircraft type information; and sorting the grouped flights on a timeline using a first-in-first-out algorithm and / or a last-in-first-out algorithm to obtain the fourth flight schedule.

[0013] Based on this, the embodiment of the present application decomposes the complex conflict problem into a more easily handled airport / aircraft model group sorting problem through the strategy of grouping first and then sorting, significantly reducing the complexity of conflict resolution and improving the processing efficiency of large-scale flight data.

[0014] In one possible implementation, the grouped flights are sorted on a time axis using a first-in-first-out algorithm and / or a last-in-first-out algorithm to obtain a fourth flight schedule, including: establishing a time priority queue based on the scheduled departure time of the flight and the airport resource constraints of the group to which it belongs; screening flights that meet the minimum stopover time requirement from the time priority queue and using last-in-first-out matching to generate first flight data; using first-in-first-out matching for the remaining unmatched flights to generate second flight data; and generating the fourth flight schedule based on the first flight data and the second flight data.

[0015] Among them, the priority weight of the time priority queue is positively correlated with the urgency of the flight's stopover.

[0016] Based on this, the embodiment of the present application establishes a time priority queue that is positively correlated with the urgency of the stopover, and combines two algorithms to handle flights of different urgency levels respectively. It can efficiently utilize resources while ensuring that key flights are on time and achieve optimal scheduling of resource allocation.

[0017] In one possible implementation, for any one of the multiple first flight schedules, the method further includes: obtaining a fifth flight schedule; the fifth flight schedule is a real-time flight schedule during a user editing process; performing a pre-conflict detection on the fifth flight schedule and the flight schedule to generate a conflicting flight list; based on the conflicting flight list, eliminating conflicting flights within the branch corresponding to the flight schedule to generate a sixth flight schedule without conflicting flights; and updating the sixth flight schedule to the flight schedule.

[0018] Based on this, the embodiment of the present application pre-checks internal conflicts within the branch during the user's real-time editing stage, intercepts local data contradictions in advance, avoids conflicts, reduces the cost of later corrections, and reduces the computational burden of subsequent global integration.

[0019] In a second aspect, the present application provides a flight scheduling device, which includes: a processing unit and an acquisition unit; the acquisition unit is used to acquire multiple first flight scheduling plans and second flight scheduling plans; the processing unit is used to compare the differences between the multiple first flight scheduling plans and the second flight scheduling plans to obtain a third flight scheduling plan; the processing unit is also used to modify the conflicting flights in the third flight scheduling plan to generate a fourth flight scheduling plan without conflicting flights; the processing unit is also used to update the fourth flight scheduling plan to the second flight scheduling plan to generate an integrated final flight scheduling plan.

[0020] Among them, multiple first flight schedules are initial flight schedules of different branches; second flight schedules are flight schedules currently stored by multiple branches; and third flight schedules are schedules among the multiple first flight schedules that differ from the second flight schedules in terms of time, take-off and landing airports, and flight information.

[0021] In a third aspect, the present application provides an electronic device comprising: a processor and a memory. The memory stores instructions executable by the processor, and when the processor is configured to execute the instructions, the electronic device implements the method of the first aspect described above.

[0022] In a fourth aspect, the present application provides a readable storage medium, the readable storage medium comprising software instructions. When the software instructions are executed in an electronic device, the electronic device implements the method of the first aspect.

[0023] In a fifth aspect, the present application provides a computer program product, which includes computer instructions. When the computer instructions are executed on an electronic device, the electronic device implements the method of the first aspect.

[0024] The beneficial effects of the second to fifth aspects mentioned above can be referred to the first aspect and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0026] Figure 1 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application;

[0027] Figure 2 A schematic diagram of the structure of a flight scheduling system provided in an embodiment of the present application;

[0028] Figure 3 A framework diagram of flight view data provided in an embodiment of the present application;

[0029] Figure 4 A schematic diagram of the structure of another flight scheduling system provided in an embodiment of the present application;

[0030] Figure 5 A flowchart of a flight scheduling method provided in an embodiment of the present application;

[0031] Figure 6 A scenario diagram of flight grouping provided in an embodiment of the present application;

[0032] Figure 7 A flowchart of another flight scheduling method provided in an embodiment of the present application;

[0033] Figure 8 A schematic diagram of the composition of a flight scheduling device provided in an embodiment of the present application;

[0034] Figure 9 A schematic structural diagram of another electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0035] In the following, the terms "first," "second," and "third," etc. are used for descriptive purposes only and should not be understood to indicate or imply relative importance or implicitly specify the number of the technical features indicated. Thus, a feature qualified as "first," "second," or "third," etc. may explicitly or implicitly include one or more of the features. In the description of this embodiment, unless otherwise specified, "plurality" means two or more.

[0036] It should be noted that, in this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described in this application as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0037] In addition, for ease of understanding, the technical terms involved in the embodiments of the present application are first introduced below.

[0038] The rapid development of the domestic and international civil aviation markets has led to an explosive growth in flight volume, placing higher demands on flight scheduling systems for intelligence, localization, and refinement. However, the core functionality of the purchased flight scheduling system has not been updated in years. Limited by factors such as demand response mechanisms, system concepts, and architecture, it is no longer customizable for the unique local environment, making it even more difficult to meet the current massive, differentiated, and conflicting flight data scheduling needs.

[0039] In related technologies, since flight scheduling is usually performed in parallel by multiple aircraft management units (such as the flight department, maintenance department, and operation control center) through the client, in a multi-person collaborative editing scenario, if the user-edited data is included in the execution data every time, it will cause system response delays, seriously affecting the user's operation smoothness and editing efficiency.

[0040] In this context, how to effectively reduce database pressure and improve user interaction experience has become an urgent problem that needs to be solved.

[0041] Therefore, in order to overcome the above problems, the embodiment of the present application provides a flight scheduling method, which obtains the initial flight scheduling plans and currently stored scheduling plans of multiple branches, and identifies a third scheduling plan with differences in time, take-off and landing airports and flight information through difference comparison, accurately locates the target data to be processed, and reduces redundant operations; then, the conflicting flights in the third scheduling plan are modified to effectively eliminate flight conflicts and improve the rationality and executability of the scheduling plan; finally, the integrated final plan is generated by updating the stored second scheduling plan, avoiding repeated data processing, thereby significantly reducing the storage and computing load of the database and effectively alleviating the database pressure.

[0042] The flight scheduling method provided by this embodiment is described below, and first an introduction to related technologies is given.

[0043] like Figure 1 As shown, Figure 1 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. The electronic device 100 includes a display 101, at least one processor 102, a transceiver 103, and may also include a memory 104. The processor 102, the memory 104, and the transceiver 103 may be connected via a communication line.

[0044] In the embodiment of the present application, the processor 102 can be a chip. The chips can include five categories: logic chips, memory chips, sensor chips, power chips and communication chips. Among them, the processor class mainly undertakes chips for specific calculation and control tasks in the system, such as microcontroller unit (MCU), central processing unit (CPU), graphics processing unit (GPU), neural network processing unit (NPU), etc. The storage class mainly undertakes chips for data storage in the system, as well as some storage controller chips, such as dynamic random access memory (DRAM), static random access memory (SRAM), flash memory (Flash), etc. The sensor class mainly undertakes chips for information collection, presentation and interaction in the system, such as input and output devices, some signal processing chips, etc. Communication chips (wired and wireless) mainly undertake communication functions in the system, such as some Ethernet chips, switching chips, wide area and local area network, point-to-point and ad hoc network chips, as well as filtering, amplification, power and other devices that assist in communication can all belong to this category. Commonly known to the public are wireless fidelity (WiFi), Bluetooth, fifth-generation mobile communication technology (5G) baseband, global positioning system (GPS), narrowband internet of things (NB-IoT), network cards, switches, etc. can all be classified into this category.

[0045] In addition, the actions and terms involved in the various embodiments of this application can refer to each other without limitation. The message names or parameter names in the messages exchanged between the various devices in the embodiments of this application are only examples, and other names can also be used in specific implementations without limitation.

[0046] like Figure 2 As shown, Figure 2 This is a schematic diagram of the structure of a flight scheduling system 200 provided in an embodiment of the present application. The flight scheduling system 200 is independently deployed by branch, and each flight scheduling system 200 only allows the terminal of the corresponding branch to access the plan storage module 201.

[0047] Specifically, independent deployment by branch means that each branch, such as the Beijing branch and the Shanghai branch, is deployed with independent, physically or logically isolated server clusters and database instances. This ensures data security and operational independence for each branch, preventing a single node failure from affecting other branches. The modules in the flight scheduling system 200 exist as distributed services.

[0048] It should be understood that the flight scheduling system 200 effectively implements the isolated management and independent operation and maintenance of each branch's flight plan data by independently deploying each branch, thereby avoiding data coupling and mutual interference between multiple branches.

[0049] The flight scheduling system 200 includes a plan storage module 201 and an execution storage module 202 .

[0050] The plan storage module 201 is used to store the first flight scheduling plan, which is the initial flight scheduling plan of the branch.

[0051] For example, the flight scheduling system 200 is the scheduling system of the Beijing branch, and therefore the plan storage module 201 stores the Beijing branch's initial flight schedule. For example, the first flight schedule is the Beijing branch's baseline schedule for the summer and autumn flight seasons. The first flight schedule includes, but is not limited to, the flight number (e.g., CA1234), the planned departure / destination airport codes, the planned departure / arrival times, and the aircraft type (e.g., B737-800).

[0052] It should be understood that the plan storage module 201 is specifically used to store the branch's initial flight scheduling plan, providing a stable and reliable basis for flight scheduling.

[0053] The execution storage module 202 is used to store the second flight scheduling plan, which is the flight scheduling plan currently stored by multiple branches.

[0054] It should be understood that currently stored refers to the latest flight schedule that has been approved and officially released and is effective.

[0055] For example, the execution module of the Beijing branch stores the flight scheduling plans of the Shanghai branch, Chongqing branch, Shenzhen branch and itself.

[0056] It should be understood that the execution storage module 202 is responsible for storing the currently effective flight scheduling plans of multiple branches, supporting each branch to dynamically adjust and publish plans in real time according to its own operational needs, thereby improving system flexibility and business responsiveness.

[0057] In a possible implementation, the flight scheduling system 200 includes an editing cache module 203, which is configured to store a fifth flight scheduling plan. The fifth flight scheduling plan is a real-time flight scheduling plan during a user editing process.

[0058] For example, in response to user editing operations (such as dragging a flight timeline, copying a flight, or deleting a flight), the edit cache module 203 can store the flight schedule in real time. For example, if a user (planner) drags the aircraft model for flight CA1234 from a B737-800 to an A330-300, the change is immediately updated in the cache and highlighted for user confirmation, but the data in the schedule storage module 201 remains unchanged. Users can undo or redo operations at any time. Only after clicking the "Publish" button will all changes be submitted to the schedule storage module 201 after conflict detection.

[0059] Based on this, the embodiment of the present application uses the editing cache module 203 to temporarily store the user's modifications to the flight plan during the editing process in real time and isolate them from the effective plan, avoiding misoperation, ensuring the flexibility of the editing process and data security, and improving user experience and system reliability.

[0060] In addition, the execution storage module 202 , the plan storage module 201 and the editing cache module 203 can constitute a scheduling module 210 .

[0061] In a possible implementation, the flight scheduling system 200 includes a resource configuration module 204 , which is configured to store static configuration data of time zone information.

[0062] For example, when the time zone information is updated (daylight saving time is enabled in a certain area), it only needs to be updated once in this module, and the calculation and display of all flight times will automatically follow the updated daylight saving time.

[0063] Furthermore, the static configuration data in the resource configuration module 204 includes but is not limited to global airport basic data (such as Chinese name, runway information), aircraft model data (aircraft model code, number of seats, maximum range, fuel tank capacity), airline code and cabin class (such as F / J / Y).

[0064] Based on this, the embodiment of the present application uses a resource configuration module to centrally manage static data such as time zones, providing a unified and accurate benchmark reference for the flight scheduling of each branch, ensuring the consistency of flight plan calculation and display across time zones, and reducing scheduling errors.

[0065] In addition, if Figure 3 As shown, it is a framework diagram of flight view data provided by an embodiment of the present application. In order to build a complete flight view model, the system relies on the following scheduled tasks to synchronize and preprocess basic data. First, the external three-warehouse data is accessed through task scheduling (timer), and the red-head data provides business data support for some business views of intelligent orchestration. The synchronized aircraft information, aircraft model data, efficiency indicators, airport information and other basic data are loaded into the memory model in real time to ensure that the data used by the calculation engine is the latest version, supporting real-time data calculation and front-end visualization.

[0066] like Figure 4 As shown, it is a structural diagram of another flight scheduling system provided in an embodiment of the present application. The flight scheduling system includes a database, a service layer, a communication layer and a presentation layer. Among them, the database is used to store and manage data, such as the DAMO database and MongoDB. The service layer is used to implement the core business logic and rules of the system and handle all calculations and decisions, such as authentication, configuration center, and message queue. The communication layer is responsible for internal and external communication and data exchange within the system, such as hypertext transfer protocol (HTTP), Nginx, Linux virtual server (LVS), and Sooket. The presentation layer is used to display the final flight scheduling plan and interact with users, such as the Web front end and Restfu interface.

[0067] In flight list compilation, the present application's embodiments fully utilize advanced page optimization techniques such as virtual lists, background image border and shadow positioning, and asynchronous loading, achieving efficient rendering of the visible area. The system supports the smooth presentation of massive custom flight data blocks, possesses rapid real-time response capabilities, and deeply integrates innovative scenario-based functions such as one-click verification of time resources, sales progress assessment and analysis, and quick historical benefit review. Shanshu's improvements significantly enhance the efficiency and experience of flight scheduling across multiple business segments, while ensuring efficient database processing and rapid page response, effectively supporting the efficient management of various personalized needs.

[0068] The following combination Figure 5 , describes a flight scheduling method provided in an embodiment of the present application.

[0069] It should be noted that in the following embodiments of the present application, the message names, parameter names, or information names between devices are only examples. In other embodiments, they may also be other names. The flight scheduling method provided in this application does not make specific limitations on this.

[0070] It is understood that in the embodiments of the present application, each device may perform some or all of the S in the embodiments of the present application. These S or operations are merely examples, and the embodiments of the present application may also perform other operations or variations of various operations. In addition, each S may be performed in a different order than that presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application need to be performed.

[0071] Figure 5 This is a flow chart illustrating a flight scheduling method provided in an embodiment of the present application. Of course, the subject executing the actions in this method may also be a device / module within a generating device, and this embodiment of the present application does not specifically limit this. It should be noted that the "S" in this embodiment of the present application represents a logical relationship and does not imply a strict order of precedence.

[0072] For example, Figure 5 As shown, the flight scheduling method provided in the embodiment of the present application includes:

[0073] S501: Acquire multiple first flight scheduling plans and second flight scheduling plans.

[0074] Among them, the multiple first flight scheduling plans are initial flight scheduling plans of different branches.

[0075] Illustratively, the first flight schedule includes, but is not limited to, the flight's planned departure time, planned arrival time, take-off and landing airports, aircraft model, crew arrangements, and route information.

[0076] The second flight scheduling plan is a flight scheduling plan currently stored by multiple branches.

[0077] It should be understood that the second flight schedule is a flight schedule that has been stored and executed in the flight schedule system or a flight schedule that has been confirmed in the previous version. The second flight schedule includes but is not limited to the flight's takeoff time, arrival time, take-off and landing airports, aircraft type, crew arrangement, and route information. It is a data set of the current actual operation or the most recently confirmed flight operation status.

[0078] For example, an airline group has three subsidiaries, A, B, and C. Each subsidiary has compiled its own initial flight schedule for the new season, known as the first flight schedule, which are Plan A, Plan B, and Plan C. At the same time, the system already stores the flight schedules for each subsidiary from the previous season or the current season, known as the second flight schedules. This embodiment of the present application obtains Plan A, Plan B, Plan C, and the second flight schedule from each subsidiary.

[0079] For example, the first flight schedule of Branch A includes flight HU7632 (Shanghai Pudong-Beijing Daxing, taking off at 08:00 every day), flight MU5101 (Nanjing Lukou-Guangzhou Baiyun, taking off at 10:30 every day), and flight CZ3502 (Guangzhou Baiyun-Chengdu Tianfu, taking off at 09:15 every day).

[0080] S502: Compare the differences between the plurality of first flight scheduling plans and the second flight scheduling plans to obtain a third flight scheduling plan.

[0081] The third flight schedule is a schedule among the multiple first flight schedules that differs from the second flight schedule in terms of time, take-off and landing airports, and flight information. Flight information includes but is not limited to flight number and aircraft type.

[0082] As a possible implementation of S502, the flight parameters in the plurality of first flight schedules and the second flight schedule are compared field by field to determine a difference comparison result; and a third flight schedule is obtained based on the difference comparison result.

[0083] Among them, flight parameters include but are not limited to flight number, planned departure time, planned arrival time, departure airport, arrival airport, and aircraft type.

[0084] For example, the difference comparison is performed by matching flight records one by one. The flight number is used as the main field. If the flight number matches, other fields are further compared. If the flight number does not match, it is considered a newly added or deleted flight and is also included in the schedule with a difference.

[0085] When a flight has inconsistencies in any of the above key fields (such as departure time, arrival time, take-off and landing airports, and aircraft type) between the first flight schedule and the second flight schedule, the flight is determined to be a discrepancy flight and is included in the third flight schedule.

[0086] For example, in Branch A's first flight schedule, flight CA1234 is scheduled to depart from Beijing Capital Airport (CAN) at 08:00 and arrive at Shanghai Hongqiao Airport (HRB) at 11:00, operating on a B737-800 aircraft. In the second flight schedule, the same flight, CA1234, is scheduled to depart at 07:30 and arrive at 10:30, departing from CAN again but arriving at Shanghai Pudong Airport (PVG), operating on an A320 aircraft. Since the two schedules differ in all four dimensions—departure time, arrival time, arrival airport, and aircraft type—CA1234 will be identified as a discrepancy and included in the third flight schedule.

[0087] S503: Modify the conflicting flights in the third flight schedule to generate a fourth flight schedule without conflicting flights.

[0088] As a possible implementation of S503, the time information, take-off and landing airport information, and aircraft type information of all flights in the third flight schedule are obtained; based on the time information, take-off and landing airport information, and aircraft type information, the third flight schedule is adjusted to obtain a fourth flight schedule.

[0089] Illustratively, based on the take-off and landing airport information and the aircraft type information, the flights in the third flight schedule are grouped; the grouped flights are sorted on the time axis using a first-in-first-out algorithm and / or a last-in-first-out algorithm to obtain a fourth flight schedule.

[0090] It should be understood that the first-in, first-out algorithm means that flights are queued according to the order in which they arrive at the airport, and the first arriving aircraft is given priority for takeoff. In other words, within the same airport, the first landing (arrival) flight is given priority for matching the time slots / resources of the first departure (departure).

[0091] The last-in, first-out (LIFO) algorithm prioritizes flights arriving later in the flight schedule or resources for departing earlier. This means that later arriving aircraft skip the queue and receive priority for takeoff resources. This algorithm is often used to optimize specific objectives (such as reducing total delays or ensuring critical flight safety).

[0092] For example, as shown in Table 1 below.

[0093] Table 1

[0094]

[0095] For example, Figure 6As shown, flights X, Z, and G are grouped according to departure airport CAN and departure airport HRB. Flights X, Z, and G are grouped together, and flight Y is grouped together. Flights X, Z, and G departing from departure airport CAN are then time-sorted to determine if they use the same aircraft or crew, potentially creating a conflict. If a conflict exists (for example, if both Flight X and Flight Z plan to use a B737, but only one is available), Flight X is prioritized based on the time priority queue (where Flight X has a higher priority due to its earlier departure time). Flight Z is then delayed or has a different aircraft. This means that since Flight X arrives at departure airport CAN first, it receives priority departure, ensuring that Flight X, arriving earlier, can complete its stops (cleaning, refueling, loading and unloading, etc.) and depart as quickly as possible.

[0096] For example, among Flights X, Z, and G, Flight G is scheduled to arrive the latest. To prevent the later flight from having low aircraft utilization and failing to match the flight schedule, a last-in-first-out rule is set. This means that Flight G is given priority for takeoff, preventing the later flight from having to wait too long.

[0097] It should be understood that different aircraft types have different operating characteristics (such as range, take-off and landing performance, passenger capacity, etc.). By grouping aircraft types, the first-in-first-out algorithm and the last-in-first-out algorithm can play a better scheduling role in timeline sorting.

[0098] For example, aircraft types are divided into narrow-body aircraft (such as Boeing 737 and Airbus A320) and wide-body aircraft (such as Boeing 787 and Airbus A350). Narrow-body aircraft are usually used for short-haul, high-density routes, with high frequency of flight takeoffs and landings and strict requirements on time accuracy. They are relatively more suitable for the first-in, first-out algorithm. Execution in the order of scheduled takeoff time can reduce the accumulation of delays. However, if a narrow-body flight is delayed due to an emergency, the last-in, first-out algorithm can be used to avoid chain delays. Wide-body aircraft are usually used for long-haul international routes, with larger flight intervals, but the impact of delays is more serious. Therefore, when airport resources are sufficient, the first-in, first-out algorithm can be used for wide-body aircraft. If airport resources are tight, the last-in, first-out algorithm can be used to reduce delay losses for high-value flights.

[0099] For example, the flight group of A320 aircraft operating at the departure airport CAN adopts first-in-first-out sorting to ensure that all flights take off as planned and avoid additional ground waiting time caused by adjusting the sequence.

[0100] For example, the international B777 flight group at a hub airport adopts a last-in, first-out sorting system. If a flight has a time conflict due to a delay of the previous flight, this flight can be adjusted to the front of the queue first to reduce the impact of the delay on connecting passengers.

[0101] In practice, a hybrid strategy of FIFO and LIFO can be employed for different aircraft groups. For example, for a mixed group of narrow-body and wide-body aircraft (e.g., an airport operating both the A320 and B787), a FIFO algorithm can be used for preliminary sorting, followed by a LIFO algorithm for the wide-body aircraft, to ensure that high-priority flights are not affected by the dense scheduling of narrow-body aircraft.

[0102] For example, during the morning rush hour at an airport, flights operating A320 aircraft are sorted by first-in-first-out (FIFO). However, a flight operating B787 aircraft needs to take off first due to international airspace restrictions. In this case, LIFO is used to adjust it to the front of the queue to avoid resource conflicts or accumulated delays caused by a single algorithm.

[0103] Furthermore, a time priority queue is established based on the scheduled departure time of the flight and the airport resource constraints of the group to which it belongs; from the time priority queue, flights that meet the minimum stopover time requirement are screened and a last-in-first-out matching is adopted to generate the first flight data; a first-in-first-out matching is adopted for the remaining unmatched flights to generate the second flight data; based on the first flight data and the second flight data, a fourth flight scheduling plan is generated.

[0104] Among them, the priority weight of the time priority queue is positively correlated with the urgency of the flight's stopover.

[0105] It should be understood that the minimum turnaround time requirement refers to the shortest time standard required for an aircraft to complete the process from landing to taking off again at an airport.

[0106] For example, the minimum stopover time for domestic narrow-body aircraft (such as A320) is usually 30-45 minutes, while that for wide-body aircraft (such as B777) may take 60-90 minutes; therefore, only flights whose current time is greater than or equal to the flight arrival time + minimum stopover time can adopt the last-in-first-out matching strategy to avoid forced takeoff of flights due to insufficient stopover time, which may cause safety hazards or subsequent delays.

[0107] For example, the landing time of flight G is 12:00, and the minimum stopover time is 40 minutes. If the current time is 12:30 (less than 40 minutes), it will be excluded from the queue; if the current time is 12:40, it will be adjusted to the front of the queue, allowing flight G to perform last-in-first-out matching, and the original scheduled departure time of flight G from 15:00 is adjusted to 14:00 to generate the first flight data.

[0108] For flights that don't meet the minimum turnaround time requirement, forward-forward matching is used. For example, if flight Z (landing at 2:10 PM, scheduled to depart at 2:30 PM) has a minimum turnaround time of only 20 minutes (less than the A320's 30-minute requirement) due to a preceding flight delay, its departure will be postponed to 3:00 PM to generate the second flight data. The first and second flight data are then integrated to generate the fourth flight schedule.

[0109] If the generated fourth flight plan does not meet the requirements, the splitting algorithm is activated: all flights in the plan are disbanded and each flight is individually assigned to an aircraft based on its date and time information. Then, steps S301 to S303 can be repeated for a new round of optimized scheduling.

[0110] Based on this, the embodiment of the present application uses the combined strategy of grouping, sorting, priority scheduling and resource constraint verification to ultimately generate a conflict-free fourth flight schedule, ensuring that all flights are compliant and operate efficiently in terms of time, space and resources.

[0111] S504: Update the fourth flight scheduling plan to the second flight scheduling plan to generate an integrated final flight scheduling plan.

[0112] For example, a completeness check is performed on the fourth flight schedule to confirm that the flight parameters (flight number, scheduled departure time, scheduled arrival time, departure airport, arrival airport, and aircraft type) for each flight are complete and free of logical errors. The fourth flight schedule is then updated to the second flight schedule. Once the update is complete, a final, integrated flight schedule is generated and synchronously stored in the plan storage modules of the head office and each branch, ensuring that all links have access to the latest schedule.

[0113] Based on this, the embodiment of the present application obtains the initial flight scheduling plans and currently stored scheduling plans of multiple branches, which can fully cover the flight data of each branch and avoid information omissions; through difference comparison, a third scheduling plan with differences in time, take-off and landing airports and flight information is identified, and the target data to be processed is accurately located to reduce redundant operations; then, the conflicting flights in the third scheduling plan are modified to effectively eliminate flight conflicts and improve the rationality and executability of the scheduling plan; finally, by updating the stored second scheduling plan to generate the integrated final plan, the orderly integration and unified management of multi-source data are realized, and repeated data processing is avoided, thereby significantly reducing the storage and computing load of the database and effectively alleviating the database pressure.

[0114] like Figure 7 As shown, for any one of the multiple first flight scheduling plans, the flight scheduling method may further include S701-S704. S701-S704 are described in detail below.

[0115] S701. Obtain the fifth flight schedule.

[0116] Among them, the fifth flight schedule is a real-time flight schedule during the user editing process.

[0117] For example, the dispatcher of Branch A adjusts the departure time of flight CA123 from 08:00 to 08:15 via the corresponding terminal device, and the system generates a fifth flight schedule in real time that includes this change. It should be understood that this fifth flight schedule is not included in the plan storage module of Branch A.

[0118] S702: Perform a pre-conflict detection on the fifth flight schedule and the flight schedule, and generate a conflicting flight list.

[0119] For example, the flight parameters of all flights in the fifth schedule are traversed and compared item by item with the flight schedule of Branch A. Detailed information (e.g., conflict type, associated flights, and time) is recorded for each conflicting flight, and a conflict list is output. The following describes two conflict scenarios.

[0120] Scenario 1: Time Conflict

[0121] The user changes the departure time of flight G from 14:00 to 14:15, overlapping with the originally scheduled flight Z (14:10-15:00, same runway) by 5 minutes.

[0122] Scenario 1: Connecting Flight Conflict

[0123] The minimum transit time between Flight X (international arrival, 10:00) and Flight Y (domestic departure, 10:30) is only 30 minutes, which is lower than the international-to-domestic transfer standard (60 minutes).

[0124] S703: Based on the conflicting flight list, eliminate the conflicting flights within the branch corresponding to the flight scheduling plan to generate a sixth flight scheduling plan without conflicting flights.

[0125] For example, for conflicts in runway occupancy, a sliding window algorithm can be used to automatically adjust the flight order. For example, if the runway times of Flight G and Flight Z overlap, the system will delay Flight Z by 15 minutes and adjust the subsequent flights accordingly.

[0126] In another example, for a conflict caused by mismatched parking stand types, a suitable alternative resource can be selected from the free resource pool, such as adjusting flight Y from G12 to wide-body aircraft parking stand G05.

[0127] It should be noted that the method for eliminating conflicting flights may also adopt the content of S303 above, and the details will not be repeated here.

[0128] S704. Update the sixth flight scheduling plan to the flight scheduling plan.

[0129] For example, a completeness check is performed on the sixth flight schedule to confirm that the flight parameters (flight number, scheduled departure time, scheduled arrival time, departure airport, arrival airport, and aircraft type) for each flight are complete and free of logical errors. The sixth flight schedule is then updated to Branch A's flight schedule.

[0130] It should be understood that the flight scheduling plan of Branch A is stored in the plan storage module.

[0131] Based on the above technical solution, the embodiment of the present application pre-checks internal conflicts within the branch during the user's real-time editing stage, intercepts local data contradictions in advance, avoids conflicts, reduces the cost of later corrections, and reduces the computational burden of subsequent global integration.

[0132] The above mainly introduces the solution provided by the embodiment of the present application from the perspective of the method. In order to realize the above functions, the flight scheduling device includes a hardware structure and / or software module corresponding to the execution of each function. It should be easy to realize that the technical goals in this field are combined with the units and algorithm S of each example described in the embodiment disclosed in this article, and the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional technical goals can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0133] In an exemplary embodiment, the present application also provides a flight scheduling device, which may include one or more functional modules for implementing the flight scheduling method of the above method embodiment.

[0134] For example, Figure 8 As shown, the flight scheduling device includes: a processing module 801 and an acquisition module 802; the acquisition module 802 is used to acquire multiple first flight scheduling plans and second flight scheduling plans; the processing module 801 is used to compare the multiple first flight scheduling plans and the second flight scheduling plans to obtain a third flight scheduling plan; the processing module 801 is also used to modify conflicting flights in the third flight scheduling plan to generate a fourth flight scheduling plan without conflicting flights; the processing module 801 is also used to update the fourth flight scheduling plan to the second flight scheduling plan to generate an integrated final flight scheduling plan.

[0135] Among them, multiple first flight schedules are initial flight schedules of different branches; second flight schedules are flight schedules currently stored by multiple branches; and third flight schedules are schedules among the multiple first flight schedules that differ from the second flight schedules in terms of time, take-off and landing airports, and flight information.

[0136] In one possible implementation, the acquisition module 802 is further used to obtain the time information, take-off and landing airport information, and aircraft type information of all flights in the third flight schedule; the processing module 801 is specifically used to adjust the third flight schedule based on the time information, take-off and landing airport information, and aircraft type information to obtain a fourth flight schedule.

[0137] In one possible implementation, processing module 801 is specifically configured to group flights in the third flight schedule based on take-off and landing airport information and aircraft type information; and sort the grouped flights on a timeline using a first-in-first-out algorithm and / or a last-in-first-out algorithm to obtain a fourth flight schedule.

[0138] In one possible implementation, processing module 801 is specifically configured to establish a time priority queue based on the scheduled departure time of a flight and the airport resource constraints of the group to which it belongs; the priority weight of the time priority queue is positively correlated with the urgency of the flight's stopover; from the time priority queue, flights that meet the minimum stopover time requirement are screened and matched using last-in-first-out matching to generate first flight data; for the remaining unmatched flights, first-in-first-out matching is performed to generate second flight data; and based on the first flight data and the second flight data, a fourth flight schedule is generated.

[0139] In one possible implementation, for any one of the multiple first flight schedules, the acquisition unit 802 is further configured to acquire a fifth flight schedule; the fifth flight schedule is a real-time flight schedule during the user editing process; the processing module 801 is further configured to perform a pre-conflict detection on the fifth flight schedule and the flight schedule to generate a conflicting flight list; the processing module 801 is further configured to eliminate conflicting flights within the branch corresponding to the flight schedule based on the conflicting flight list to generate a sixth flight schedule without conflicting flights; the processing module 801 is further configured to update the sixth flight schedule to the flight schedule.

[0140] It should be noted that Figure 8 The module division described is illustrative and represents only one logical functional division. Actual implementations may employ different divisions. For example, two or more functions may be integrated into a single processing module. These integrated modules may be implemented as either hardware or software functional modules.

[0141] In the exemplary embodiment, as described above, the electronic device may be a computer or a server or other electronic device with computing and processing functions. In this case, the embodiment of the present application further provides an electronic device, Figure 9 This is a structural diagram of another electronic device provided in an embodiment of the present application. Figure 9 As shown, the electronic device includes: a processor 10 , a memory 20 , a communication line 30 , a communication interface 40 , and an input / output interface 50 .

[0142] The processor 10 , the memory 20 , the communication interface 40 , and the input / output interface 50 may be connected via a communication line 30 .

[0143] The processor 10 is used to execute the instructions stored in the memory 20 to implement the flight scheduling method provided in the above embodiment of the present application. The processor 10 can be a CPU, a general-purpose processor network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller (MCU) / single-chip microcomputer / single-chip microcomputer, a programmable logic device (PLD) or any combination thereof. The processor 10 can also be any other device with processing functions, such as a circuit, a device or a software module, which is not limited in the embodiment of the present application. In one example, the processor 10 may include one or more CPUs, such as Figure 9 As an optional implementation, the electronic device may include multiple processors, for example, in addition to the processor 10, it may also include a processor 60 ( Figure 9 The dashed line is used as an example.

[0144] The memory 20 is used to store instructions. For example, the instruction may be a computer program. Optionally, the memory 20 may be a read-only memory (ROM) or other types of static storage devices that can store static information and / or instructions, or a random access memory (RAM) or other types of dynamic storage devices that can store information and / or instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compact disc, laser disc, optical disc, digital versatile disc, Blu-ray disc, etc.), a magnetic disk storage medium or other magnetic storage device, etc., and the embodiments of the present application are not limited thereto.

[0145] It should be noted that the memory 20 may exist independently of the processor 10 or may be integrated with the processor 10. The memory 20 may be located inside the electronic device or outside the electronic device, which is not limited in the embodiment of the present application.

[0146] The communication line 30 is used to transmit information between the components included in the electronic device.

[0147] The communication interface 40 is used to communicate with other devices or other communication networks. The other communication networks may be Ethernet, radio access networks (RAN), wireless local area networks (WLAN), etc. The communication interface 40 may be a module, circuit, transceiver, or any other device capable of communication.

[0148] The input / output interface 50 is used to implement human-computer interaction between a user and the electronic device, for example, to implement action interaction or information interaction between the user and the electronic device.

[0149] For example, the input / output interface 50 may be a mouse, keyboard, display screen, or touch screen screen, etc. Action interaction or information interaction between a user and the electronic device may be achieved through the mouse, keyboard, display screen, or touch screen screen, etc.

[0150] It should be noted that Figure 9 The structure shown in the figure does not constitute a limitation on the electronic device, except Figure 9 In addition to the components shown, the electronic device may include more or fewer components than shown, or a combination of certain components, or a different arrangement of components.

[0151] In an exemplary embodiment, the present application also provides a readable storage medium including software instructions, which, when executed on an electronic device, enables the electronic device to execute any one of the methods provided in the above embodiments.

[0152] In an exemplary embodiment, the present application also provides a computer program product including computer-executable instructions, which, when executed on an electronic device, enables the electronic device to execute any one of the methods provided in the above embodiments.

[0153] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using a software program, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer-executable instructions. When the computer-executable instructions are loaded and executed on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer-executable instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer-executable instructions can be transmitted from a website, computer, server or data center to another website, computer, server or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that contains one or more media that can be integrated. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state disk (SSD)).

[0154] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or S, and "a" or "an" does not exclude multiple situations. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0155] Although the present application has been described with reference to specific features and embodiments thereof, it is apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present application. Accordingly, this specification and the drawings are merely illustrative of the present application as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present application. Obviously, those skilled in the art may make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, the present application is intended to include such modifications and variations as fall within the scope of the claims of the present application and their equivalents.

[0156] The above are only specific embodiments of the present application, but the scope of protection of the present application is not limited thereto. Any changes or replacements within the technical scope disclosed in this application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A flight scheduling method, characterized in that: The method comprises: Acquire multiple first flight scheduling plans and second flight scheduling plans; the multiple first flight scheduling plans are initial flight scheduling plans of different branches; the second flight scheduling plans are currently stored flight scheduling plans of multiple branches; Comparing the plurality of first flight schedules with the second flight schedule to obtain a third flight schedule; the third flight schedule being a schedule among the plurality of first flight schedules that differs from the second flight schedule in terms of time, take-off and landing airports, and flight information; Modifying the conflicting flights in the third flight schedule to generate a fourth flight schedule without conflicting flights; The fourth flight schedule plan is updated to the second flight schedule plan to generate an integrated final flight schedule plan.

2. The method according to claim 1, characterized in that The step of modifying the conflicting flights in the third flight schedule to generate a fourth flight schedule without conflicting flights includes: Obtaining time information, take-off and landing airport information, and aircraft type information for all flights in the third flight schedule; Based on the time information, the take-off and landing airport information, and the aircraft type information, the third flight schedule is adjusted to obtain the fourth flight schedule.

3. The method according to claim 2, characterized in that The adjusting the third flight schedule based on the time information, the take-off and landing airport information, and the aircraft type information to obtain the fourth flight schedule includes: Grouping flights in the third flight schedule based on the take-off and landing airport information and the aircraft type information; The grouped flights are sorted on a time axis using a first-in-first-out algorithm and / or a last-in-first-out algorithm to obtain the fourth flight scheduling plan.

4. The method according to claim 3, characterized in that The grouped flights are sorted on a time axis using a first-in-first-out algorithm and / or a last-in-first-out algorithm to obtain the fourth flight schedule, including: Establish a time priority queue based on the scheduled departure time of the flight and the airport resource constraints of the group to which it belongs; the priority weight of the time priority queue is positively correlated with the urgency of the flight's stopover; From the time priority queue, flights that meet the minimum transit time requirement are screened and matched using last-in-first-out matching to generate first flight data; Use first-in-first-out matching for the remaining unmatched flights to generate the second flight data; The fourth flight schedule is generated based on the first flight data and the second flight data.

5. The method according to claim 1, wherein For any one of the plurality of first flight schedules, the method further includes: Obtaining a fifth flight schedule; wherein the fifth flight schedule is a real-time flight schedule during the user editing process; Performing a pre-conflict detection on the fifth flight schedule and the flight schedule to generate a conflicting flight list; Eliminating conflicting flights within the branch company corresponding to the flight schedule based on the conflicting flight list to generate a sixth flight schedule without conflicting flights; The sixth flight schedule plan is updated to the flight schedule plan.

6. A flight scheduling system, characterized in that: The flight scheduling system is independently deployed by branch; The flight scheduling system includes: a plan storage module, the plan storage module being configured to store a first flight scheduling plan, where the first flight scheduling plan is an initial flight scheduling plan of the branch; An execution storage module is used to store a second flight scheduling plan, where the second flight scheduling plan is a flight scheduling plan currently stored by multiple branches.

7. The system according to claim 6, characterized in that The flight scheduling system includes: The editing cache module is used to store the fifth flight schedule plan, which is a real-time flight schedule plan during the user editing process.

8. The system according to claim 6 or 7, characterized in that The flight scheduling system includes: A resource configuration module is used to store static configuration data of time zone information.

9. An electronic device, characterized in that: include: processor and memory; The memory stores instructions executable by the processor; When the processor is configured to execute the instructions, the electronic device implements the method according to any one of claims 1 to 5.

10. A computer-readable storage medium, characterized in that The storage medium stores a computer program or instruction, and when the computer program or instruction is executed by a processing device, the method according to any one of claims 1 to 5 is implemented.

11. A computer program product comprising a computer program or instructions, characterized in that When the computer program or instruction is executed on a processing device, the method according to any one of claims 1 to 5 is implemented.

Images