A method for automatically matching a flight plan application with a flight time library
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-02-10
- Publication Date
- 2026-08-11
AI Technical Summary
传统上,这一过程依赖于人工审核和比对,不仅耗时费力,而且容易出错
[0012]本发明通过采用创新的数据处理和匹配逻辑,能够自动为航班计划申请分配合理的起飞和降落时间,实现航班时刻的自动化分配,从而减少人工干预,降低人为错误的风险,提高了航班时刻管理的效率和准确性。
Smart Images

Figure CN122548047A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of air transport management technology, specifically to a method for automatically matching flight schedule application information with regional administration flight time slot database data. Background Technology
[0002] In the domestic flight management system, airlines pre-upload their flight schedule application data, which, after confirmation by the Civil Aviation Administration of China (CAAC), forms the flight slot database, serving as the operational data for the corresponding flights. With seasonal changes, especially the transition between winter / spring and summer / autumn, flight demand fluctuates significantly. To adapt to these changes and ensure safe and efficient flight operations, domestic airlines formulate and implement seasonal flight plans according to the unified deployment of the CAAC. First, airlines formulate seasonal flight plans based on market demand, capacity arrangements, and airport support capabilities, and submit them to the CAAC. The CAAC (slot agency) then preliminarily allocates flight slots to each airline based on relevant policies, regulations, and airport operational capabilities, ensuring reasonable time intervals between flights and avoiding conflicts. Each airline confirms the preliminarily allocated flight slots and submits any possible adjustment requests. Among these, the comparison and allocation of flight slots is a crucial step in ensuring smooth flight operations. Traditionally, this process relies on manual review and comparison, which is not only time-consuming and labor-intensive but also prone to errors. With the rapid growth of air transport volume, the need for automation and intelligentization of flight slot allocation algorithms is increasingly urgent. Therefore, it is of great significance to develop a method that can automatically match flight plan applications with flight time database data. Summary of the Invention
[0003] The purpose of this invention is to address the shortcomings of existing technologies by providing a method for automatically matching flight plan requests with a flight timetable database. To achieve the above objective, this invention adopts the following technical solution:
[0004] 1. A method for automatically matching flight schedule requests with a flight timetable database, characterized by comprising the following steps:
[0005] (1) Obtain flight plan application data from relevant systems or data sources, including flight number, execution date, departure and arrival airports and departure and arrival times, and group flight data with the same flight number and departure and arrival airport information into a group, and process the application data in groups;
[0006] (2) For each set of flight information, generate several subsequences based on the number of flight dates. The subsequences contain the flight number, execution date, departure and arrival airports and departure and arrival times required for matching.
[0007] (3) Scan the data in the flight time database and match the flight time data with the flight plan application data based on the execution date and departure and arrival airport information;
[0008] (4) Based on the matched flight schedules, the flight schedule application data sequence is divided into two arrays: an array that matches the existing flight schedules and an array that does not match the existing flight schedules.
[0009] (5) Update the data in the flight time database to the array sequence to generate the merged database result data, so that the application data and the time data are synchronized and consistent, including allocating the existing flight time data to the matching application data.
[0010] Furthermore, it also includes the following steps:
[0011] (6) Based on the updated array sequence, the flight application data is split and processed. For application data that matches the array, new application data with time slots is formed as expected flight plan data. For application data that does not match the array, the merged database result data is retained, and the airline deletes it or contacts the time slot agency for communication and adjustment.
[0012] This invention employs innovative data processing and matching logic to automatically allocate reasonable takeoff and landing times for flight schedule applications, thereby achieving automated allocation of flight slots, reducing manual intervention, lowering the risk of human error, and improving the efficiency and accuracy of flight slot management. Attached Figure Description
[0013] Figure 1 Flowchart for the automatic matching of flight plan applications with the flight timetable database. Detailed Implementation
[0014] This embodiment provides an example of automatic matching based on flight plan requests and a flight timetable database. Taking timetable data from flight CCA123 as an example, it specifically illustrates one implementation scheme of the present invention, including the following steps:
[0015]
[0016]
[0017] (1) Obtain and group flight schedule application data: Obtain the flight schedule data from the schedule application database uploaded by the airline in advance, and group the flight data with the same flight number and take-off and landing airport information into one group. For example, group the schedule application data with the same take-off and landing airport under flight number CCA123 into one group. As shown in the content of serial number 1 in the above list, flight number CCA123 applied for seven schedules from Monday to Sunday in the following week. Each application data includes key information such as flight number, execution date, take-off and landing airport, and take-off and landing time.
[0018] (2) Generate flight schedule subsequences:
[0019] The grouped flight number "CCA123" is divided into 7 sub-sequences based on the number of flight dates "1234567", as shown in numbers 2-8. Each sub-sequence corresponds to one flight date and includes the flight number, the operation day (e.g., Monday, Tuesday), the departure and arrival airports (ZBAA and ZPSD), and the departure and arrival times (e.g., 0800-1000).
[0020] (3) Scan and match flight schedule data:
[0021] From the regional flight timetable database data transmitted by the regional administration via MQ (such as the departure airport timetable database (ZBAA) data for serial numbers 9-11 and the arrival airport timetable database (ZSPD) data for serial numbers 12-13), search for all timetable data related to each subsequence of flight number "CCA123". Based on the execution date and departure and arrival airport information, match the flight timetable data with the flight plan application data. The specific matching method is as follows:
[0022] The subsequence 1000000 of sequence number 2 is related to the flight schedule data 1000000 in the departure airport timetable database (ZBAA) (see sequence number 9) and the flight schedule data 1000000 in the arrival airport timetable database (ZSPD).
[0023] (See serial number 13) The execution date and arrival / departure airport information are completely matched. For this case of complete match, its time status is set to 11; The execution date and arrival / departure airport information of the subsequences 0200000 and 0030000 of serial numbers 3 and 4 are completely matched with the departure airport time database (ZBAA) time data 0230000 (see serial number 11) and the arrival airport time database (ZSPD) time data 0230000 (see serial number 12). The time status is set to 11; The execution date and arrival / departure airport information of the subsequence 0000007 of serial number 8 are completely matched with the departure airport time database (ZBAA) time data 0000007.
[0024] (See serial number 10) If there is no matching data with the flight schedule data in the landing airport timetable database (ZSPD), the time status is set to 10 for this matching case; the three subsequences of serial numbers 5-7 have no matching data with the flight schedule data in the departure airport timetable database (ZBAA) and the flight schedule data in the landing airport timetable database (ZSPD), so the original flight schedule data is retained and the time status is set to 00.
[0025] (4) Based on the time slots and schedules, the application data sequence is divided into two arrays: a matching array and a non-matching array. Among them, schedules 1, 2, and 3 are the matching array sequence, and schedules 4, 5, 6, and 7 are the non-matching array sequence.
[0026] ① Matching array: contains application data that fully matches the execution date and take-off and landing airport information of existing flight schedules in the timetable database.
[0027] ②Mismatched array: contains application data that does not match or does not fully match the execution date and airport information of existing flight schedules in the timetable database.
[0028] (5) Update flight time data to the array sequence:
[0029] The data in the flight timetable database is updated to the two array sequences to generate merged database result data, ensuring that the application data and the matching timetable data are synchronized and consistent. This includes allocating existing flight timetable data to matching application data. For example, in the merged database result of sequence number 14, for flight date 0230000, the departure time data of the departure airport is updated to the matching data ZBAA-0830 in the departure timetable database, and the landing time data of the landing airport is updated to the matching data 0950-ZPSD in the landing timetable database. The updated merged database result data is ZBAA-0830-0950-ZPSD. In the merged database result of sequence number 15, for flight date 1000000, the departure time data of the departure airport is updated to the matching data ZBAA-0830 in the departure timetable database, and the landing time data of the landing airport is updated to the matching data ZBAA-0950-ZPSD in the landing timetable database. For the data in sequence 16, the departure time data of the departure airport is updated to the matching data 1030-ZPSD in the departure time database, and the updated merged database result is ZBAA-0830-1030-ZPSD; for the merged database result of sequence 16, for the flight schedule 0000007, the departure time data of the departure airport is updated to the matching data ZBAA-0900 in the departure time database, and the landing time data of the landing airport without matching data is retained as the original application data 1000-ZPSD, and the updated merged database result is ZBAA-0900-1000-ZPSD; for the merged database result of sequence 17, for the flight schedule data 0004560, there is no matching data with either the departure or arrival airport time database, so the original application data ZBAA-0800-1000-ZPSD is retained, and the updated merged database result is ZBAA-0800-1000-ZPSD.
[0030] (6) Process flight application data in separate steps:
[0031] The flight application data in the merged database results are split and processed. For application data that fully matches the existing flight schedules (i.e., application data with a time status marked as 11), new application data with time slots is generated as the subsequent expected flight plan data, including flight number, updated flight schedule, departure and arrival airports, and adjusted departure and arrival times. For application data in the mismatch array, the original merged database result data is retained, and manual processing is performed later. The airlines either delete the data themselves or communicate with the time slot agency to make adjustments.
[0032] The above description is only a partial embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, any modifications, equivalent substitutions, or improvements made without departing from the principles of the present invention should be included within the scope of protection of the present invention.
Claims
1. A method for automatically matching flight plan requests with a flight slot database, characterized in that, Includes the following steps: (1) Obtain flight plan application data from relevant systems or data sources, including flight number, execution date, departure and arrival airports and departure and arrival times, and group flight data with the same flight number and departure and arrival airport information into a group, and process the application data in groups; (2) For each set of flight information, generate several subsequences based on the number of flight dates. The subsequences contain the flight number, execution date, departure and arrival airports and departure and arrival times required for matching. (3) Scan the data in the flight time database and match the flight time data with the flight plan application data based on the execution date and departure and arrival airport information; (4) Based on the matched flight schedules, the flight schedule application data sequence is divided into two arrays: an array that matches the existing flight schedules and an array that does not match the existing flight schedules. (5) Update the data in the flight time database to the array sequence to generate the merged database result data, so that the application data and the time data are synchronized and consistent, including allocating the existing flight time data to the matching application data.
2. The method of claim 1, wherein, It also includes the following steps: Based on the updated array sequence, the flight application data is split and processed. For application data that matches the array, new application data with time slots is generated as expected flight plan data. For application data that does not match the array, the merged database result data is retained, and the airline can delete it itself or contact the time slot agency for communication and adjustment.