An intelligent scheduling method and system for airport ground services
Through the operation research linear planning optimization algorithm, the airport ground service scheduling model is constructed, which solves the problems that the existing scheduling methods are complicated to adjust and the qualification constraints are difficult to comprehensively consider, and more efficient task allocation and resource utilization are achieved.
Patent Information
- Application Number
- CN202111505270.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-12-10
- Publication Date
- 2025-03-21
- Estimated Expiration
- 2041-12-10
AI Technical Summary
The existing airport ground service scheduling methods are cumbersome to adjust the personnel and the qualification constraints of staff and tasks, resulting in low task completion rate and resource utilization rate.
The linear planning optimization algorithm of operations research is adopted to obtain relevant data and build a scheduling planning model, configure constraints, and solve the problem-solving variable matrix to realize the intelligence of employee task allocation and work and rest arrangement.
The scheduling efficiency has been improved, the scheduling results have been optimized, and the airport's operating efficiency and resource utilization have been improved.
Smart Images

Figure CN114154906B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of computer scheduling, and in particular to an intelligent scheduling method and system for airport ground services. Background Art
[0002] As an important part of the air transportation process, the airport is one of the most complex systems operated by humans on the ground. Airport ground services play an important role in ensuring the safe landing and normal operation of aircraft. Airport ground services refer to the services provided by ground staff for flights, so it involves task assignment and scheduling issues.
[0003] Currently, airport scheduling is mainly based on rough assignment to determine the schedule of each employee. Usually, an experienced dispatcher needs to spend an hour or even several hours to schedule employees. In actual operation, the schedule must be adjusted in real time according to the temporary adjustment of flights and staff.
[0004] Regarding the above-mentioned related technologies, the inventors believe that there are the following defects: manual adjustments are rather troublesome, and it is difficult to comprehensively consider relevant constraints such as the qualifications of staff and tasks, balance the interests of all parties, and maximize the task completion rate. Summary of the invention
[0005] In order to utilize the operations research linear programming optimization algorithm to realize the intelligent allocation of ground service scheduling, improve the scheduling efficiency, optimize the scheduling results, and ultimately improve the airport operation efficiency and resource utilization, the present application provides an airport ground service intelligent scheduling method and system.
[0006] In the first aspect, the present application provides an intelligent scheduling method for airport ground services, which adopts the following technical solutions:
[0007] An intelligent scheduling method for airport ground services, comprising:
[0008] Acquire data involved in intelligent scheduling of airport ground services, which at least includes flight mission information, aircraft stand information, route information, staff information, and shift information;
[0009] Based on the data involved in the intelligent scheduling of airport ground services, combined with the pre-built scheduling planning model and constraints, the constraints are configured and solved to obtain the final decision variable matrix X and decision variable matrix Y, where the decision variable matrix X corresponds to the task allocation of each employee every day, and the decision variable matrix Y corresponds to the work and rest schedule of each employee every day;
[0010] Extract the information in the decision variable matrix X to obtain the task allocation of each employee every day, and extract the information in the decision variable matrix Y to obtain the work and rest schedule of each employee every day.
[0011] Optionally, the construction of the shift planning model includes:
[0012] Assume that there are M tasks to be assigned on the day, there are N employees on duty, and the shifts are scheduled for D days. The decision variables are matrix X, and x i,j is a 0-1 variable, indicating whether task j is assigned to employee i. It is 1 for yes and 0 for no. y i,d is a 0-1 variable, indicating whether employee i works on date d;
[0013] The goals of establishing a shift planning model are as follows: 1. The task completion rate is as high as possible; 2. The variance of employee time utilization is as small as possible;
[0014] The above target is set as Ω = {g i |i=1,2,…,p}, assign weights respectively Re-weighting, we get the total objective function for:
[0015] The duration of each task is C = {c j |j=1,2,…,N}, each employee’s on-the-job working hours B={b i |i=1,2,…,M}, the actual working hours of each employee Α={a i =x i,j ×c j |i=1,2,…,M;j=1,2,…,N},Each employee’s working time utilization rate R={r i =a i ÷b i |i=1,2,…,M}, the average working time utilization rate of all employees Let P = {p j |j=1,2,…,N} is the start execution time of each task, Q={q j |j=1,2,…,N} is the end execution time;
[0016] Application pre-built task completion rate g 1 , variance of working time utilization g 3 And the overall objective function The calculation formula is used to analyze the task completion rate g one by one. 1 , variance of working time utilization g 3 And the overall objective function
[0017] Among them, the task completion rate g 1 The calculation formula is as follows:
[0018] Among them, the variance of working time utilization rate g 3 The calculation formula is as follows:
[0019] Among them, the overall objective function The calculation formula is as follows:
[0020] Optionally, constraints include:
[0021] Unique constraint: each task can be assigned to at most one employee, that is:
[0022]
[0023] Route constraints, remember For task j 1 j 2 The travel time between 1 In front 2 After that, two consecutive tasks performed by the same person should satisfy the distance interval, and the constant matrix is recorded as Whether the interval between any two tasks meets the distance interval, 1 means yes, 0 means no, the specific formula is as follows:
[0024]
[0025] Qualification and shift constraints: employees must have the qualifications required to complete the task before they can perform the task. The constant matrix q ij Is employee i qualified to perform task j, 1 for yes, 0 for no. The task can only be assigned if the start time falls on a certain shift of the employee. The constant matrix s ij x is whether task j falls under a certain shift of employee i, 1 for yes and 0 for no. The specific formula is as follows: i,j ≤q i,j ×s i,j (i=1,2,…,M,j=1,2,…,N);
[0026] Work-rest constraint: a certain work-rest pattern will be followed in the shift scheduling. There must be at least r days of rest in f days, that is, each day must work at most fr days in the f days ahead. The specific formula is as follows:
[0027]
[0028] Optionally, the method further includes extracting information from the decision variable matrix X to obtain the task allocation of each employee every day, and extracting information from the decision variable matrix Y to obtain the work and rest schedule of each employee every day, specifically including:
[0029] Obtain the task allocation information and work and rest information of each employee every day as the information to be sent;
[0030] Based on the information to be sent and each employee's requirement for information encryption, determine whether to encrypt the information sent to the corresponding employee;
[0031] Encrypt the information that needs to be encrypted and send it to the corresponding employees, and send the rest of the information to the corresponding employees.
[0032] Optionally, determining whether to encrypt information sent to a corresponding employee includes:
[0033] Obtain information about employees' settings for information encryption requirements;
[0034] If the employee has set encryption requirements for information, confirm that the information sent to the corresponding employee is encrypted;
[0035] If the employee has not set encryption requirements, confirm that the information sent to the corresponding employee is not encrypted.
[0036] Optionally, determining whether to encrypt information sent to a corresponding employee includes:
[0037] Obtain information about employees' settings for information encryption requirements;
[0038] If the employee has set encryption requirements for information, confirm that the information sent to the corresponding employee is encrypted;
[0039] If the employee has not set encryption requirements, confirm that the information sent to the corresponding employee is not encrypted.
[0040] Optionally, confirm the correct decryption password includes:
[0041] The sum of the current time period in which the encrypted information is successfully sent and the last time the information was sent is used as password one;
[0042] Obtain the sum of the digits of the password 1 as the ID card number information intercepted from the front to the back as the password 2;
[0043] If the number of time periods is an odd number, password 1 is ranked before password 2, forming the correct decryption password;
[0044] If the number of time periods is an even number, password 2 is ranked before password 1, forming the correct decryption password.
[0045] Optionally, if the comparison is inconsistent, the correct decryption password is changed to include:
[0046] Add the original password 1 and the original password 2, and use the sum as the third password;
[0047] The third password is inserted between the first password and the second password of the original correct password to construct a correct decryption password.
[0048] In the second aspect, the present application provides an airport ground service intelligent scheduling system, which adopts the following technical solutions:
[0049] An airport ground service intelligent scheduling system includes a memory, a processor, and a program stored in the memory and executable on the processor. The program can implement an airport ground service intelligent scheduling method as described in the first aspect when loaded and executed by the processor. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the structures shown in these drawings without paying creative work.
[0051] Figure 1 It is a schematic diagram of the steps of an intelligent scheduling method for airport ground services according to an embodiment of the present application.
[0052] Figure 2 It is a schematic diagram of the steps after extracting the information in the decision variable matrix X to obtain the task allocation of each employee every day, and extracting the information in the decision variable matrix Y to obtain the work and rest schedule of each employee every day.
[0053] Figure 3 This is a schematic diagram of the step of determining whether the information sent to the corresponding employee is encrypted as mentioned in step Sb00.
[0054] Figure 4 This is a diagram of the steps after the information to be encrypted is encrypted and sent to the corresponding employees.
[0055] Figure 5 This is a schematic diagram of the steps for confirming the correct decryption password mentioned in step SB00.
[0056] Figure 6 This is a schematic diagram of the steps of changing the correct decryption password if the comparison is inconsistent as mentioned in step SE00.
[0057] The realization of the purpose, functional features and advantages of the present invention will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION
[0058] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions 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 are within the scope of protection of the present invention.
[0059] It should be noted that all directional indications in the embodiments of the present invention (such as up, down, left, right, front, back, etc.) are only used to explain the relative position relationship, movement status, etc. between the components under a certain specific posture (as shown in the accompanying drawings). If the specific posture changes, the directional indication will also change accordingly.
[0060] In addition, the descriptions of "first", "second", etc. in the present invention are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include such features. In addition, the technical solutions between the various embodiments can be combined with each other, but they must be based on the ability of ordinary technicians in the field to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such combination of technical solutions does not exist and is not within the scope of protection required by the present invention.
[0061] In the present invention, unless otherwise clearly specified and limited, the terms "connection", "fixation", etc. should be understood in a broad sense. For example, "fixation" can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two elements or the interaction relationship between two elements, unless otherwise clearly defined. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0062] The present application is further described in detail below in conjunction with the accompanying drawings.
[0063] Reference Figure 1 , is an airport ground service intelligent scheduling method disclosed in this application, comprising:
[0064] Step S100, obtaining data related to the intelligent scheduling of airport ground services, where the data related to the intelligent scheduling of airport ground services at least includes flight mission information, aircraft stand information, route information, employee information, and shift information.
[0065] Among them, the data involved in the intelligent scheduling of airport ground services can be obtained by querying the relevant database.
[0066] Step S200, based on the data involved in the intelligent scheduling of airport ground services, and in combination with the pre-built scheduling planning model and constraints, the constraints are configured and solved to obtain the final decision variable matrix X and decision variable matrix Y, where the decision variable matrix X corresponds to the task allocation of each employee every day, and the decision variable matrix Y corresponds to the work and rest schedule of each employee every day.
[0067] Step S300: extract information from the decision variable matrix X to obtain the task allocation of each employee every day, and extract information from the decision variable matrix Y to obtain the work and rest schedule of each employee every day.
[0068] The construction of the shift planning model mentioned in step S200 includes:
[0069] Step S2a0, set the number of tasks to be assigned on the day to be M, the number of employees on duty to be N, the number of shifts to be D days, the decision variable to be matrix X, and x i,j is a 0-1 variable, indicating whether task j is assigned to employee i. It is 1 for yes and 0 for no. y i,d It is a 0-1 variable, indicating whether employee i works on date d.
[0070] Step S2b0, establish the objectives of the shift scheduling model, which are as follows: 1. The task completion rate is as high as possible; 2. The variance of employee working time utilization is as small as possible.
[0071] Step S2c0, set the above target to Ω = {g i |i=1,2,…,p}, assign weights respectively Re-weighting, we get the total objective function for: The duration of each task is C = {c j |j=1,2,…,N}, each employee’s on-the-job working hours B={b i |i=1,2,…,M}, the actual working hours of each employee Α={a i =x i,j ×c j |i=1,2,…,M;j=1,2,…,N},Each employee’s working time utilization rate R={r i =a i ÷b i |i=1,2,…,M}, the average working time utilization rate of all employees Let P = {p j |j=1,2,…,N} is the start execution time of each task, Q={q j |j=1,2,…,N} is the end execution time.
[0072] Step S2d0, apply the pre-built task completion rate g 1 , variance of working time utilization g 3 And the overall objective function The calculation formula is used to analyze the task completion rate g one by one. 1 , variance of working time utilization g 3 And the overall objective function Among them, the task completion rate g 1 The calculation formula is as follows: Among them, the variance of working time utilization rate g 3 The calculation formula is as follows: Among them, the overall objective function The calculation formula is as follows:
[0073] The constraints mentioned in step S200 include:
[0074] Unique constraint: each task can be assigned to at most one employee, that is:
[0075]
[0076] Route constraints, remember For task j 1 j 2 The travel time between 1 In front 2 After that, two consecutive tasks performed by the same person should satisfy the distance interval, and the constant matrix is recorded as Whether the interval between any two tasks meets the distance interval, 1 means yes, 0 means no, the specific formula is as follows:
[0077]
[0078]
[0079] Qualification and shift constraints: employees must have the qualifications required to complete the task before they can perform the task. The constant matrix q ij Is employee i qualified to perform task j, 1 for yes, 0 for no. The task can only be assigned if the start time falls on a certain shift of the employee. The constant matrix s ij x is whether task j falls under a certain shift of employee i, 1 for yes and 0 for no. The specific formula is as follows: i,j ≤q i,j ×s i,j (i=1,2,…,M, j=1,2,…,N);
[0080] Work-rest constraint: a certain work-rest pattern will be followed in the shift scheduling. There must be at least r days of rest in f days, that is, each day must work at most fr days in the f days ahead. The specific formula is as follows:
[0081]
[0082] Reference Figure 2 A method for intelligent scheduling of airport ground services further includes the following steps: extracting information from a decision variable matrix X to obtain task assignments for each employee each day, and extracting information from a decision variable matrix Y to obtain work and rest schedules for each employee each day, specifically including:
[0083] Step Sa00, obtaining the task allocation information of each employee every day and the work and rest information of each employee every day as the information to be sent.
[0084] Step Sb00, based on the information to be sent and each employee's requirement for information encryption, determine whether to encrypt the information sent to the corresponding employee.
[0085] Step Sc00, encrypt the information that needs to be encrypted and send it to the corresponding employee, and send the remaining information to the corresponding employee.
[0086] Reference Figure 3 , wherein the determination of whether the information sent to the corresponding employee is encrypted as mentioned in step Sb00 includes:
[0087] Step Sb10, obtaining the setting information of the employee's requirement for information encryption;
[0088] Step Sb20: If the employee sets encryption requirements for the information, confirm that the information sent to the corresponding employee is encrypted;
[0089] Step Sb30: If the employee has not set an encryption requirement, confirm that the information sent to the corresponding employee is not encrypted.
[0090] Reference Figure 4 , considering the decryption of information by corresponding employees, an intelligent scheduling method for airport ground services also includes steps after encrypting the information to be encrypted and sending it to the corresponding employees, specifically including:
[0091] Step SA00, obtaining the information to be encrypted.
[0092] Step SB00, based on the time period in which the encrypted information is successfully sent and the corresponding employee ID information, confirm the correct decryption password.
[0093] Step SC00, comparing the decryption password input by the employee with the confirmed correct decryption password.
[0094] Step SD00: If the comparison is consistent, decryption is completed to obtain information.
[0095] Step SE00: If the comparison is inconsistent, change the correct decryption password and wait for the employee to input it again for comparison.
[0096] Reference Figure 5 , wherein the confirmation of the correct decryption password mentioned in step SB00 includes:
[0097] Step SB10, the sum of the number of time periods in which the encrypted information is successfully sent and the number of time periods in which the information was sent last time is taken as password one.
[0098] For example, the number of time periods in which the encrypted information is successfully sent is 11, and the number of time periods in which the information was sent last time is 12, so password one is 23.
[0099] Step SB20, obtain the sum of the digits of password one as the ID card number information intercepted from front to back as password two.
[0100] For example, if the sum of the digits of the first password is 5, the first five digits are taken from the front to the back as the second password.
[0101] Step SBA0, if the time period number is an odd number, password one is ranked before password two to form a correct decryption password.
[0102] Step SBB0, if the number of time periods is an even number, password 2 is sorted before password 1 to form a correct decryption password.
[0103] Reference Figure 6 , wherein if the comparison mentioned in step SE00 is inconsistent, then changing the correct decryption password includes:
[0104] Step SE10, add the original password 1 and the original password 2, and use the added sum as the third password.
[0105] For example, assuming that the original password one is 23 and the original password two is 13568, the sum is 13591, which is the third password.
[0106] Step SE20: insert the third password between the first password and the second password of the original correct password to construct a correct decryption password.
[0107] Based on the same inventive concept, an embodiment of the present invention provides an airport ground service intelligent scheduling system, including a memory and a processor, wherein the memory stores a program that can be executed on the processor to implement the following Figures 1 to 6 Procedure for either method.
[0108] The embodiments of this specific implementation method are all preferred embodiments of the present application, and are not intended to limit the protection scope of the present application. Therefore, all equivalent changes made based on the structure, shape, and principle of the present application should be included in the protection scope of the present application.
Claims
1. An intelligent scheduling method for airport ground services, characterized in that: include: Obtain data related to intelligent scheduling of airport ground services. The data related to intelligent dispatching of airport ground services includes at least flight mission information, aircraft stand information, route information, employee information, and shift information; Based on the data involved in the intelligent dispatching of airport ground services, combined with the pre-built scheduling planning model and constraints, the constraints are configured and solved to obtain the final decision variable matrix X and decision variable matrix Y, where the decision variable matrix X corresponds to the task allocation of each employee every day, and the decision variable matrix Y corresponds to the work and rest schedule of each employee every day; Extract the information in the decision variable matrix X to obtain the task allocation of each employee every day, and extract the information in the decision variable matrix Y to obtain the work and rest schedule of each employee every day; The construction of the shift planning model includes: Assume that there are M tasks to be assigned on the day, there are N employees on duty, and the shifts are scheduled for D days. The decision variables are matrix X, and x i,j is a 0-1 variable, indicating whether task j is assigned to employee i. It is 1 for yes and 0 for no. y i,d is a 0-1 variable, indicating whether employee i works on date d; The objectives of establishing a shift planning model are as follows: The above target is set as Ω = {g i |i=1,2,…,p}, assign weights respectively Re-weighting, we get the total objective function for: The duration of each task is C = {c j |j=1,2,…,N}, each employee’s on-the-job working hours B={b i |i=1,2,…,M}, the actual working hours of each employee Α={a i =x i,j ×c j |i=1,2,…,M;j=1,2,…,N},Each employee’s working time utilization rate R={r i =a i ÷b i |i=1,2,…,M}, the average working time utilization rate of all employees Let P = {p j |j=1,2,…,N} is the start execution time of each task, Q={q j |j=1,2,…,N} is the end execution time; Apply the pre-built task completion rate g1, time utilization variance g3, and total objective function The calculation formula is used to analyze the task completion rate g1, the variance of working time utilization rate g3 and the total objective function one by one. Among them, the calculation formula of the task completion rate g1 is as follows: Among them, the calculation formula of the variance of working time utilization rate g3 is as follows: Among them, the overall objective function The calculation formula is as follows: The constraints include: Unique constraint: each task can be assigned to at most one employee, that is: Route constraints, remember is the travel time between tasks j1j2, j1 is in front and j2 is in the back. Two consecutive tasks done by the same person should meet the travel time interval. The constant matrix is recorded as Whether the interval between any two tasks meets the distance interval, 1 means yes, 0 means no, the specific formula is as follows: Qualification and shift constraints: employees must have the qualifications required to complete the task before they can perform the task. The constant matrix q ij Is employee i qualified to perform task j, 1 for yes, 0 for no. The task can only be assigned if the start time falls on a certain shift of the employee. The constant matrix s ij x is whether task j falls under a certain shift of employee i, 1 for yes and 0 for no. The specific formula is as follows: i,j ≤q i,j ×s i,j (i=1,2,…,M,j=1,2,…,N); Work-rest constraint: a certain work-rest pattern will be followed in the scheduling. There must be at least r days of rest in f days, that is, each day must work at most fr days in the f days ahead. The specific formula is as follows:
2. The intelligent scheduling method for airport ground services according to claim 1, characterized in that: The steps further include extracting information from the decision variable matrix X to obtain the task allocation of each employee every day, and extracting information from the decision variable matrix Y to obtain the work and rest schedule of each employee every day, specifically including: Obtain the task allocation information and work and rest information of each employee every day as the information to be sent; Based on the information to be sent and each employee's requirement for information encryption, determine whether to encrypt the information sent to the corresponding employee; Encrypt the information that needs to be encrypted and send it to the corresponding employees, and send the rest of the information to the corresponding employees.
3. The intelligent scheduling method for airport ground services according to claim 2, characterized in that: Determining whether information sent to appropriate employees is encrypted includes: Obtain information about employees' settings for information encryption requirements; If the employee has set encryption requirements for information, confirm that the information sent to the corresponding employee is encrypted; If the employee has not set encryption requirements, confirm that the information sent to the corresponding employee is not encrypted.
4. The intelligent scheduling method for airport ground services according to claim 3 is characterized in that: It also includes the steps after the information that needs to be encrypted is encrypted and sent to the appropriate employees, including: Get the information you want to encrypt; Confirm the correct decryption password based on the time period during which the encrypted information was successfully sent and the corresponding employee ID information; Compare the decryption password entered by the employee with the confirmed correct decryption password; If the comparison is consistent, the decryption is completed to obtain the information; If the comparison is inconsistent, change the correct decryption password and wait for the employee to enter it again for comparison.
5. The intelligent scheduling method for airport ground services according to claim 4, characterized in that: Confirming the correct decryption password includes: The sum of the current time period in which the encrypted information is successfully sent and the last time the information was sent is used as password one; Obtain the sum of the digits of the password 1 as the ID card number information intercepted from the front to the back as the password 2; If the number of time periods is an odd number, password 1 is ranked before password 2, forming the correct decryption password; If the number of time periods is an even number, password 2 is ranked before password 1, forming the correct decryption password.
6. The intelligent scheduling method for airport ground services according to claim 5, characterized in that: If the comparison is inconsistent, the correct decryption password is changed to include: Add the original password 1 and the original password 2, and use the sum as the third password; The third password is inserted between the first password and the second password of the original correct password to construct a correct decryption password.
7. An airport ground service intelligent scheduling system, characterized in that: The invention comprises a memory, a processor and a program stored in the memory and executable on the processor, wherein the program can be loaded and executed by the processor to implement an intelligent scheduling method for airport ground services as described in any one of claims 1 to 6.
Citation Information
Patent Citations
Encryption method and decryption method applied to online bidding
CN108462721A
Airport check-in personnel scheduling method based on constraint relaxation solution
CN113034015A
Cited By
Flight operation guarantee task intelligent adjustment method, system and device and storage medium
CN115689144A