A method, system and storage medium for intelligent dispatching of airport ground services

Through the linear planning optimization algorithm of operations research, an intelligent dispatch model for airport ground services was built, which solved the problem of limitations of task assignment in the existing technology, maximized the task completion rate and took into account the interests of all parties, and improved dispatch Scheduling efficiency.

CN114386761BActive Publication Date: 2024-12-31SHAMEN ZHAO XIANG ZHINENG SCI & TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111502215.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-10
Publication Date
2024-12-31
Estimated Expiration
2041-12-10

AI Technical Summary

Technical Problem

The task assignment of existing airport ground services is based on human settings, with relatively limited dimensions, making it difficult to maximize the task completion rate and cannot take into account the interests of all parties.

Method used

Using the operation research linear planning optimization algorithm, by obtaining flight task information, airport location information, employee information, and shift information, building a dispatched planning model, combining constraints to solve, obtaining the decision variable matrix, optimizing task allocation, and ensuring the task completion rate, Comprehensive optimization of the number of short-stop tasks and working hours utilization.

Benefits of technology

It maximizes the task completion rate, takes into account the interests of all parties, reduces the work pressure of security personnel, reduces manual mistakes, and improves the efficiency of dispatching and dispatching.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114386761B_ABST
    Figure CN114386761B_ABST
Patent Text Reader

Abstract

The present application relates to an intelligent dispatching method, system and storage medium for airport ground services, which solves the problem that the artificially set task assignment scheme for airport ground services has relatively limited dimensions and cannot take into account the interests of all parties to maximize the task completion rate. It includes: based on the data involved in the intelligent dispatching of airport ground services, and combined with the pre-built dispatching planning model and constraints, the constraints are configured and solved to obtain the final decision variable matrix X; the information in the decision variable matrix X is extracted to obtain the employees assigned to each task. The present application has the following effects: using the operations research linear programming optimization algorithm to realize the intelligent allocation of ground service dispatching, improve the dispatching scheduling efficiency, optimize the allocation results, and reasonable scheduling can not only make full use of human resources, but also reduce the work pressure of security personnel, thereby reducing human errors, so as to meet the current needs of high-quality and safe development of airport ground services.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of computer scheduling technology, and in particular to an intelligent dispatching method, system and storage medium for airport ground services. Background Art

[0002] As an important infrastructure for air transportation, airports are an important part of the comprehensive transportation system. Airport ground services play an important role in ensuring the safe landing and normal operation of aircraft. Airport ground services include many aspects, such as machine maintenance and cleaning, baggage unloading or loading, catering services, and consulting services.

[0003] Airport ground service dispatch refers to arranging ground staff to provide services for flights. It is a task assignment problem and one of the important resource scheduling of airports. The existing airport ground service task assignment is based on manual settings.

[0004] Regarding the above-mentioned related technologies, the inventors believe that there are the following defects: the artificially set task assignment plan for airport ground services has relatively limited dimensions of consideration, cannot take into account the interests of all parties, and it is difficult to 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 work, improve the efficiency of work dispatching, and optimize the allocation results, reasonable scheduling can not only make full use of human resources, but also reduce the work pressure of security personnel, thereby reducing human errors, so as to meet the current needs of high-quality and safe development of airport ground services, this application provides an airport ground service intelligent work dispatching method, system and storage medium.

[0006] In the first aspect, the present application provides an intelligent dispatching method for airport ground services, which adopts the following technical solutions:

[0007] An intelligent dispatching method for airport ground services, comprising:

[0008] Acquire data involved in intelligent dispatching of airport ground services, which at least includes flight mission information, aircraft stand information, route information, employee information, and flight information;

[0009] Based on the data involved in the intelligent dispatching of airport ground services, combined with the pre-built dispatching planning model and constraints, the constraints are configured and solved to obtain the final decision variable matrix X;

[0010] Extract the information in the decision variable matrix X to obtain the employee assigned to each task.

[0011] Optionally, the construction of the dispatch planning model includes:

[0012] Assume that there are M tasks to be assigned on the day, there are N employees on duty, the decision variable is matrix X, and x i,j is a 0-1 variable, indicating whether task j is assigned to employee i, with a value of 1 for yes and 0 for no;

[0013] The goals of establishing a dispatch planning model are as follows: 1. The task completion rate is as high as possible; 2. The number of short-stop task connections is as high as possible; 3. 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 function isJoin(k1,k2) is used to indicate whether tasks k1 and k2 are a group of short stops, 1 for yes and 0 for no. The duration of each task 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] Apply the pre-built task completion rate g1, short-stop connection number g2, man-hour utilization variance g3, and total objective function The calculation formula is used to analyze the task completion rate g1, the number of short-stop connections g2, the variance of man-hour utilization g3 and the total objective function one by one.

[0017] Among them, the calculation formula of task completion rate g1 is as follows:

[0018] The calculation formula for the number of short-stop connections g2 is as follows:

[0019] Among them, the calculation formula of the variance of working time utilization rate g3 is as follows:

[0020] Among them, the overall objective function The calculation formula is as follows:

[0021] Optionally, constraints include:

[0022] Unique constraint: each task can be assigned to at most one employee, that is:

[0023]

[0024] 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:

[0025]

[0026] 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).

[0027] Optionally, the following steps are included after extracting the information in the decision variable matrix X to obtain the employee assigned to each task:

[0028] Get the execution time of each task and the employee assigned to it;

[0029] Analyze and confirm the time period information for notifying employees based on the response time of the assigned employees in different time periods and working states, as well as the time period when the employees are expected to depart;

[0030] The assigned employees are notified based on the analyzed and confirmed time period information of the notified employees.

[0031] Optionally, the time period information for analyzing and confirming the notification to the employee includes:

[0032] From a preset first database storing employees and the response times of the corresponding employees in different time periods and different working states in the corresponding time periods, the assigned employee, the notification time period information and the working state information at the time of notification are used as query objects to query and obtain the response time of the corresponding employee in the working state in the corresponding time period, wherein the working state includes a busy state and an idle state;

[0033] Based on the employees' expected departure time and response time, analyze and confirm the time period information for notifying the employees.

[0034] Optionally, the method further includes the following steps: querying and obtaining the response time of the corresponding employee in the working state during the corresponding time period, and analyzing and confirming the time period information of the notified employee based on the employee's expected departure time period and the response time period:

[0035] If not, query to obtain the response time of the corresponding employee in the working state during the corresponding period;

[0036] Then, the employee and the corresponding time period are used as query objects, and the response time of the employee in other working states in the corresponding time period is queried in the first database;

[0037] Taking the employee and the corresponding work status as the query object, querying the reaction time of the employee in the corresponding work status in the first database, and comparing it with the reaction time of the employee in other work statuses, analyzing and obtaining the average difference of each reaction time;

[0038] The average of the reaction time differences for each time is added to the reaction time of the employee in other working states in the corresponding period, and the reaction time of the employee in the current working state in the current period is analyzed to obtain the reaction time.

[0039] Optionally, the analysis and acquisition of the employee's expected departure time includes:

[0040] Obtain the corresponding relationship between employees’ effective travel speeds at different time periods;

[0041] Analyze and confirm the employee's travel time based on the correspondence between the distance from the employee to the location where the task is to be performed and the employee's effective travel speed at different times;

[0042] Based on the execution time of the task and the travel time of the employees, the estimated departure time of the employees is analyzed.

[0043] In the second aspect, the present application provides an airport ground service intelligent dispatching system, which adopts the following technical solutions:

[0044] An airport ground service intelligent dispatching 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 dispatching method as described in the first aspect when loaded and executed by the processor.

[0045] In a third aspect, the present application provides a computer storage medium, which adopts the following technical solution:

[0046] A computer storage medium includes a program that can be loaded and executed by a processor to implement an intelligent dispatching method for airport ground services as described in the first aspect.

[0047] To summarize, the beneficial technical effects of this application are: comprehensively considering whether the qualifications of the staff and the tasks match, whether the same employee is doing multiple tasks, and also considering the distance between tasks, whether two machines are used, whether there is a connection at a station, whether it falls within the shift time, employee fatigue, fairness and other issues, and comprehensively considering various constraints, taking into account the interests of all parties, and maximizing the task completion rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] 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.

[0049] Figure 1 It is a schematic diagram of the overall steps of the intelligent dispatching method for airport ground services according to an embodiment of the present application.

[0050] Figure 2 is a schematic diagram of the steps after extracting the information in the decision variable matrix X to obtain the employee assigned to each task.

[0051] Figure 3 yes Figure 2 Schematic diagram of the steps of analyzing and confirming the time period information of the notified employee in step S500.

[0052] Figure 4 This is a schematic diagram of the steps for analyzing the employee's expected departure time period mentioned in step S5A0. DETAILED DESCRIPTION

[0053] 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.

[0054] 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.

[0055] 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.

[0056] 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.

[0057] The present application is further described in detail below in conjunction with the accompanying drawings.

[0058] Reference Figure 1 , is an airport ground service intelligent dispatching method disclosed in this application, comprising:

[0059] Step S100, obtaining data related to the intelligent dispatching of airport ground services, where the data related to the intelligent dispatching of airport ground services at least includes flight mission information, aircraft stand information, route information, employee information, and shift information.

[0060] The data involved in the intelligent dispatching of airport ground services mentioned in step S100 may be obtained through a relevant database.

[0061] Step S200, based on the data involved in the intelligent dispatching of airport ground services, and in combination with the pre-built dispatching planning model and constraints, the constraints are configured and solved to obtain the final decision variable matrix X.

[0062] Step S300: extract information from the decision variable matrix X to obtain the employee assigned to each task.

[0063] The construction of the work dispatch planning model mentioned in step S200 includes:

[0064] 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 decision variable to be matrix X, and x i,j It is a 0-1 variable, indicating whether task j is assigned to employee i. It is 1 for yes and 0 for no.

[0065] Step S2B0, establish the objectives of the work dispatch planning model, which are as follows: 1. The task completion rate is as high as possible; 2. The number of short-stop task connections is as high as possible; 3. The variance of employee work time utilization is as small as possible.

[0066] 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:

[0067] Step S2D0, let the function isJoin(k1,k2) be used to indicate whether tasks k1 and k2 are a group of short stops, 1 for yes, 0 for no, and the duration of each task 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.

[0068] Step S2E0, applying the pre-built task completion rate g1, short-stop connection number g2, man-hour utilization variance g3 and the total objective function The calculation formula is used to analyze the task completion rate g1, the number of short-stop connections g2, the variance of man-hour utilization g3 and the total objective function one by one.

[0069] Among them, the calculation formula of task completion rate g1 is as follows:

[0070] The calculation formula for the number of short-stop connections g2 is as follows:

[0071] Among them, the calculation formula of the variance of working time utilization rate g3 is as follows:

[0072] Among them, the overall objective function The calculation formula is as follows:

[0073] The constraints mentioned in step S200 include uniqueness constraints, distance constraints, and qualification and shift constraints.

[0074] Among them, the uniqueness constraint is that each task can only be assigned to one employee at most, that is:

[0075]

[0076] Among them, the distance constraint is 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:

[0077]

[0078] Among them, the qualification and shift constraints mean that 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).

[0079] Reference Figure 2 , considering the subsequent notification of employees, an airport ground service intelligent dispatching method also includes steps after extracting information in the decision variable matrix X to obtain the employees assigned to each task, specifically including:

[0080] Step S400, obtaining the execution time of each task and the assigned employee.

[0081] Step S500, based on the response time of the assigned employee in different time periods and working states, and the employee's expected departure time period, analyze and confirm the time period information to be notified to the employee.

[0082] Step S600: Notify the assigned employee based on the analyzed and confirmed time period information of the notified employee.

[0083] The notification of the assigned employee mentioned in step S600 may be sent by sending a short message or by voice notification.

[0084] Reference Figure 3 , wherein the analysis and confirmation of the time period information notified to the employee mentioned in step S500 includes step S5A0:

[0085] Step S5A0, from a preset first database storing employees and the reaction times of the corresponding employees in different time periods and different working states in the corresponding time periods, the assigned employee, notification time period information and working state information at the time of notification are used as query objects to query and obtain the reaction time of the corresponding employee in the working state in the corresponding time period, wherein the working state includes a busy state and an idle state.

[0086] Reference Figure 4 , wherein the analysis and acquisition of the employee's estimated departure time mentioned in step S5A0 includes:

[0087] Step S5Aa, obtaining the corresponding relationship between the effective travel speeds of employees in different time periods.

[0088] The corresponding relationship between the effective travel speeds of employees in different time periods mentioned in step S5Aa may be obtained by querying a database storing the corresponding relationship between the effective travel speeds of employees in different time periods.

[0089] Step S5Ab, based on the correspondence between the distance from the employee to the location where the task is to be performed and the employee's effective travel speed at different time periods, analyze and confirm the employee's travel time.

[0090] Specifically, the distance from the employee to the location where the task is to be performed can be obtained in the following manner: a mobile phone tracker is installed in the employee's mobile phone to track the employee's location, and the location of the task is used as the end point. A route from the employee to the task location is planned and the distance of the corresponding route is obtained.

[0091] The corresponding relationship between the effective travel speeds of employees in different time periods can be obtained by querying from a preset database that stores the employees and the corresponding effective travel speeds of the employees in different time periods. The effective travel speed can be obtained in the following way: the total moving distance of the employees in the corresponding time period is obtained as the dividend, the total time consumed by the employees' movement is used as the divisor, and the quotient obtained is calculated as the effective travel speed of the employees.

[0092] Step S5Ac, based on the task execution time and the employee's travel time, analyze the employee's estimated departure time.

[0093] For example, assuming that the task is to be executed at 11:00 and the employee's travel time is 30 minutes, the employee's estimated departure time is 10:30.

[0094] Step S5B0, if the response time of the corresponding employee in the working state of the corresponding time period is not queried, the employee and the corresponding time period are used as query objects, and the response time of the employee in other working states of the corresponding time period is queried in the first database.

[0095] Step S5C0, taking the employee and the corresponding work status as the query object, querying the reaction time of the employee in the corresponding work status in the first database, and comparing it with the reaction time of the employee in other work statuses, analyzing and obtaining the average difference of each reaction time.

[0096] It should be noted that, in the same period of time, the reaction times of the two working states can be analyzed.

[0097] Step S5D0, adding the average of the reaction time difference each time to the reaction time of the employee in other working states in the corresponding time period, and analyzing to obtain the reaction time of the employee in the current working state in the current time period.

[0098] Assuming that the average difference in reaction time for each time is 10 seconds, the employee is currently in an idle state, and the reaction time of the employee in a busy state is 20 seconds, then the reaction time of the employee in the current working state during the current period is 30 seconds.

[0099] Step S5E0, based on the employee's expected departure time period and response time, analyze and confirm the time period information to be notified to the employee.

[0100] Assuming that the employee's estimated departure time is 11 o'clock and the response time is 30 seconds, the time period notified to the employee is 10:59:30.

[0101] An embodiment of the present invention provides a computer-readable storage medium, comprising a computer-readable storage medium capable of being loaded and executed by a processor to implement the following Figure 1-Figure 4 Procedure for either method.

[0102] The computer-readable storage medium includes, for example, various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0103] Based on the same inventive concept, an embodiment of the present invention provides an airport ground service intelligent dispatching 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 4 Procedure for either method.

[0104] 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 dispatching method for airport ground services, characterized in that: include: Acquire data involved in intelligent dispatching of airport ground services, which at least includes flight mission information, aircraft stand information, route information, employee information, and flight information; Based on the data involved in the intelligent dispatching of airport ground services, combined with the pre-built dispatching planning model and constraints, the constraints are configured and solved to obtain the final decision variable matrix X: Extract the information in the decision variable matrix X to obtain the employees assigned to each task; The construction of the dispatch planning model includes: Assume that there are M tasks to be assigned on the day, there are N employees on duty, the decision variable is matrix X, and x i,j is a 0-1 variable, indicating whether task j is assigned to employee i, with a value of 1 for yes and 0 for no; The goals of establishing a dispatch planning model are as follows:

1. The task completion rate is as high as possible; 2. The number of short-stop task connections is as high as possible; 3. The variance of employee time utilization is as small as possible; 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 function isJoin(k1, k2) is used to indicate whether tasks k1 and k2 are a group of short stops, 1 for yes, 0 for no, and the duration of each task 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={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, short-stop connection number g2, man-hour utilization variance g3, and total objective function The calculation formula is used to analyze the task completion rate g1, the number of short-stop connections g2, the variance of man-hour utilization g3 and the total objective function one by one. Among them, the calculation formula of the task completion rate g1 is as follows: The calculation formula for the number of short-stop connections g2 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 behind. Two consecutive tasks performed by the same person should meet the time interval of the distance. 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 Whether task j falls under a certain shift of employee i, 1 for yes and 0 for no. The specific formula is as follows: x i,j ≤q i,j ×s i,j (i=1,2,…,M,j=1,2,…,N); It also includes the steps after extracting the information in the decision variable matrix X to obtain the employee assigned to each task: Get the execution time of each task and the employee assigned to it; Analyze and confirm the time period information for notifying employees based on the response time of the assigned employees in different time periods and working states, as well as the time period when the employees are expected to depart; The assigned employees are notified based on the analyzed and confirmed time period information of the notified employees.

2. The intelligent dispatching method for airport ground services according to claim 1 is characterized in that: The analysis confirms that the time period for notifying employees includes: From a preset first database storing employees and the response times of the corresponding employees in different time periods and different working states in the corresponding time periods, the assigned employee, the notification time period information and the working state information at the time of notification are used as query objects to query and obtain the response time of the corresponding employee in the working state in the corresponding time period, wherein the working state includes a busy state and an idle state; Based on the employees' expected departure time and response time, analyze and confirm the time period information for notifying the employees.

3. The intelligent dispatching method for airport ground services according to claim 2 is characterized in that: The steps include querying and obtaining the response time of the corresponding employee in the working state of the corresponding time period and analyzing and confirming the time period information of the notified employee based on the employee's expected departure time period and the response time period: If not, query to obtain the response time of the corresponding employee in the working state during the corresponding period; Then, the employee and the corresponding time period are used as query objects, and the response time of the employee in other working states in the corresponding time period is queried in the first database; Taking the employee and the corresponding work status as the query object, querying the reaction time of the employee in the corresponding work status in the first database, and comparing it with the reaction time of the employee in other work statuses, analyzing and obtaining the average difference of each reaction time; The average of the reaction time differences for each time is added to the reaction time of the employee in other working states in the corresponding period, and the reaction time of the employee in the current working state in the current period is analyzed to obtain the reaction time.

4. An intelligent dispatching method for airport ground services according to any one of claims 1 to 3, characterized in that: The analysis and acquisition of the employee's expected departure time includes: Obtain the corresponding relationship between employees’ effective travel speeds at different time periods; Analyze and confirm the employee's travel time based on the correspondence between the distance from the employee to the location where the task is to be performed and the employee's effective travel speed at different times; Based on the execution time of the task and the travel time of the employees, the estimated departure time of the employees is analyzed.

5. An airport ground service intelligent dispatching 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 implement an intelligent dispatching method for airport ground services as claimed in any one of claims 1 to 4 when loaded and executed by the processor.

6. A computer storage medium, characterized in that , including a program that can be loaded and executed by a processor to implement an airport ground service intelligent dispatching method as described in any one of claims 1 to 4.