An airport task allocation method, device, equipment and medium

Abstract

The application provides an airport task allocation method and device, equipment and medium, which are used in the technical field of airport support task allocation, and include the following steps: randomly combining all execution objects and to-be-executed airport tasks to obtain a corresponding initial allocation scheme, and re-allocating the to-be-executed airport tasks in the initial allocation scheme to generate a to-be-determined allocation scheme; determining the hard constraint score and the soft constraint score corresponding to the initial allocation scheme and the to-be-determined allocation scheme respectively, and performing weighted summation on the hard constraint score and the soft constraint score to obtain a corresponding scheme score; determining a corresponding updated allocation scheme according to the initial scheme score and the to-be-determined scheme score, and iteratively performing task re-allocation on the updated allocation scheme to obtain a target allocation scheme; and determining the target execution object corresponding to the to-be-executed airport task based on the target allocation scheme, and allocating the to-be-executed airport task to the target execution object; in this way, the efficiency and accuracy of airport task allocation are improved.

Description

Technical Field

[0001] This application relates to the field of airport support task allocation technology, and in particular to an airport task allocation method, apparatus, equipment and medium. Background Technology

[0002] Airport ground support is a crucial link in the air transport chain, encompassing a tightly coupled operational process including aircraft guidance and parking, passenger bridge docking, baggage handling, catering, cleaning, refueling, and de-icing. In practice, the orderly execution of these tasks is achieved through the coordinated efforts of various specific support tasks. Any delay or improper allocation of any task can affect the efficiency of the entire ground support chain, thereby impacting flight punctuality.

[0003] Existing airport task allocation methods are usually based on preset fixed rules, such as round-robin, load balancing, and qualification priority, which are automatically allocated by the system; or they are allocated according to a single rule such as proximity, priority, or priority of idle personnel, or they are simply used to perform global optimization.

[0004] Therefore, existing airport task allocation methods suffer from low efficiency and accuracy in task allocation. Summary of the Invention

[0005] This application provides an airport task allocation method, apparatus, equipment, and medium to solve the problem of low efficiency and accuracy in existing airport task allocation methods.

[0006] Firstly, this application provides an airport task allocation method, the method comprising: All execution objects and airport tasks to be executed are randomly combined to obtain the corresponding initial allocation scheme, and the airport tasks to be executed in the initial allocation scheme are reallocated to generate an allocation scheme to be determined. Based on the task's hard constraints and soft constraints and their respective preset condition scores, the hard constraint scores and soft constraint scores corresponding to the initial allocation scheme and the allocation scheme to be determined are determined. Then, according to the preset weight values, the hard constraint scores and soft constraint scores are weighted and summed to obtain the corresponding scheme scores. Based on the initial scheme score and the undetermined scheme score, the corresponding updated allocation scheme is determined, and the updated allocation scheme is iteratively redistributed based on the preset number of iterations to obtain the target allocation scheme; wherein, the initial scheme score and the undetermined scheme score are the scheme scores corresponding to the initial allocation scheme and the undetermined allocation scheme, respectively. Based on the target allocation scheme, the target execution objects corresponding to the airport tasks to be executed are determined, and the airport tasks to be executed are allocated to the target execution objects.

[0007] In some embodiments of this application, the airport tasks to be executed in the initial allocation scheme are reallocated to generate an allocation scheme to be determined, including: Determine a preset number of task pairs from the initial allocation scheme, and determine the execution target of the task pairs based on the corresponding airport tasks to be executed; The execution objects in each task pair are swapped to obtain the swapped allocation scheme to be determined.

[0008] In some embodiments of this application, before determining the hard constraint score and soft constraint score corresponding to the initial allocation scheme and the allocation scheme to be determined based on the task hard constraints and task soft constraints and their respective corresponding preset condition scores, the method further includes: Based on the execution qualification conditions, execution time conditions, and task conflict conditions corresponding to each airport task to be executed, the corresponding hard constraints are determined, and the corresponding soft constraints are determined according to the target execution workload conditions and execution interval duration conditions.

[0009] In some embodiments of this application, based on task hard constraints and task soft constraints and their respective corresponding preset condition scores, the hard constraint scores and soft constraint scores corresponding to the initial allocation scheme and the allocation scheme to be determined are determined, including: For the initial allocation scheme and the allocation scheme to be determined, based on the hard constraints and soft constraints of the task, we traverse and determine the constraints that are satisfied and not satisfied for each allocation scheme. Based on the preset condition scores and constraint categories corresponding to satisfying the constraints, the allocation schemes are scored, and based on the preset condition scores and constraint categories corresponding to not satisfying the constraints, the allocation schemes are scored, resulting in hard constraint scores and soft constraint scores for each allocation scheme; among which, the constraint categories include task hard constraint categories and task soft constraint categories.

[0010] In some embodiments of this application, before determining the target execution object corresponding to the airport task to be executed based on the target allocation scheme, the method further includes: For each execution object in the allocation scheme, the airport tasks to be executed are divided into start events and end events based on the corresponding task start time and task end time. Based on the chronological order, the start and end events are sorted to obtain an event sequence, and the event sequence is traversed. When the current event is a start event, determine whether there is a corresponding target start event in the target set based on the execution object identifier corresponding to the start event; If it exists, the target execution object is not determined, and the corresponding conflict prompt message is output. The conflict prompt message is used to inform the user that there is an event conflict in the target allocation scheme and that it needs to be re-allocated. If it does not exist, then determine the target execution object and add the start event to the target set; When the current event is an end event, the corresponding execution object identifier in the target set is deleted based on the end event.

[0011] In some embodiments of this application, the updated allocation scheme is iteratively reassigned based on a preset number of iterations to obtain a target allocation scheme, including: Tasks are redistributed according to the updated allocation scheme to obtain the corresponding redistribution scheme. Based on the hard constraints and soft constraints of the tasks and their respective preset condition scores, the scheme scores corresponding to the updated allocation scheme and the redistribution scheme are determined. Compare the scores of each scheme to obtain the corresponding comparison results; If the comparison result shows that the scheme score corresponding to the reallocation scheme is larger, then the reallocation scheme is determined to be the updated allocation scheme obtained after the current iteration; If the comparison result shows that the updated allocation scheme has a larger scheme score, then the updated allocation scheme is determined to be the updated allocation scheme obtained after the current iteration. Based on the number of iterations, the updated allocation scheme obtained after the current iteration is used to redistribute tasks, resulting in the corresponding target allocation scheme.

[0012] In some embodiments of this application, based on the number of iterations, the updated allocation scheme obtained after the current iteration is reassigned to obtain the corresponding target allocation scheme, including: Based on the update allocation scheme corresponding to the last iteration, determine the allocation scheme to be verified, and determine whether the allocation scheme to be verified satisfies all task hard constraints. If all hard constraints of the tasks are met, then the allocation scheme to be verified is determined as the target allocation scheme. If at least one task hard constraint is not met, the algorithm iteratively checks whether the updated allocation scheme corresponding to the previous iteration satisfies all task hard constraints until a target allocation scheme that satisfies all task hard constraints is determined.

[0013] Secondly, this application provides an airport task allocation device, the device comprising: The combination module is used to randomly combine all execution objects and airport tasks to be executed to obtain the corresponding initial allocation scheme, and to reallocate the airport tasks to be executed in the initial allocation scheme to generate an allocation scheme to be determined. The summation module is used to determine the hard constraint score and soft constraint score of the initial allocation scheme and the allocation scheme to be determined based on the hard constraint conditions and soft constraint conditions of the task and their respective preset condition scores, and to perform a weighted summation of the hard constraint score and soft constraint score according to the preset weight value to obtain the corresponding scheme score. The iteration module is used to determine the corresponding updated allocation scheme based on the initial scheme score and the scheme score to be determined, and to iteratively redistribute tasks on the updated allocation scheme based on a preset number of iterations to obtain the target allocation scheme; wherein, the initial scheme score and the scheme score to be determined are the scheme scores corresponding to the initial allocation scheme and the allocation scheme to be determined, respectively. The determination module is used to determine the target execution object corresponding to the airport task to be executed based on the target allocation scheme, and to allocate the airport task to be executed to the target execution object.

[0014] Thirdly, this application provides a computer device, including: a processor, and a memory communicatively connected to the processor; The memory stores the instructions that the computer executes; The processor executes computer execution instructions stored in memory to implement the method of this application.

[0015] Fourthly, this application provides a computer-readable storage medium storing program code, which, when executed by a processor, is used to implement the method of this application.

[0016] Compared with existing technologies, the method in this application generates an initial allocation scheme by randomly combining all execution objects with airport tasks to be executed, thereby quickly completing the global basic matching of tasks and personnel and providing diverse initial schemes for subsequent optimization. It also broadens the diversity of schemes and avoids getting trapped in local optima by performing heuristic task reassignment on the initial allocation scheme to generate undetermined allocation schemes. Furthermore, it quantifies and scores schemes by combining preset hard and soft constraints and their corresponding scores, and obtains a weighted sum of the hard and soft constraint scores according to their weights, thus achieving a score for each scheme based on the degree of constraint satisfaction and scheduling. The rationality of the allocation scheme is comprehensively quantified. By comparing the scores of the initial allocation scheme and the allocation scheme to be determined, the optimal updated allocation scheme is selected, and the task redistribution optimization is performed cyclically according to the preset number of iterations. In the process of multiple iterations, unreasonable allocations are continuously eliminated and task timing conflicts are avoided, and the globally optimal target allocation scheme is gradually converged. Based on the target allocation scheme, the target execution objects corresponding to the tasks of each airport are determined, so as to achieve accurate and reasonable task assignment. While strictly meeting the hard requirements such as personnel qualifications and no time conflicts of tasks, the optimization goals such as balanced personnel workload are taken into account, thereby improving the efficiency of airport task scheduling and the overall rationality of the allocation scheme. Attached Figure Description

[0017] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0018] Figure 1 A flowchart illustrating an airport task allocation method provided in this application embodiment; Figure 2 A schematic diagram of an airport task allocation method provided in an embodiment of this application; Figure 3 A schematic diagram illustrating an airport task allocation method provided in this application embodiment; Figure 4 This is a schematic diagram of the structure of an airport task allocation device provided in an embodiment of this application; Figure 5 This is a structural block diagram of an apparatus for performing an airport task allocation method according to an embodiment of this application. Detailed Implementation

[0019] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0020] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will now be described with reference to the accompanying drawings.

[0021] In existing technologies, task pre-allocation requires consideration of multiple complex constraints, such as matching personnel qualifications, aligning personnel work hours with task schedules, balancing personnel workloads, and avoiding task timing and resource conflicts. Current ground support systems have significant limitations in task pre-allocation, making it difficult to simultaneously meet the complex pre-allocation needs of multiple tasks, resources, and constraints. Manually pre-allocating a large number of flight tasks is not only inefficient but also prone to errors, directly impacting the efficiency of airport ground support the following day and potentially triggering a chain reaction of problems such as flight delays.

[0022] Figure 1 This is a flowchart illustrating an airport task allocation method provided in an embodiment of this application. Figure 1As shown, this airport task allocation method may include the following steps: S110. Randomly combine all execution objects and airport tasks to be executed to obtain the corresponding initial allocation scheme, and reallocate the airport tasks to be executed in the initial allocation scheme to generate an allocation scheme to be determined.

[0023] The execution targets refer to the main body of staff within the airport operation system who are in a valid on-duty schedule, possess the corresponding business operation qualifications, and are capable of independently undertaking various designated tasks such as airport ground support, inspection, operation and maintenance, and service. Each execution target is bound to a corresponding identity identifier and can determine corresponding attribute data, including personal qualification level, permission to undertake task types, daily on-duty start and end time periods, historical cumulative workload, task execution efficiency, adjacent task interval adaptation requirements, physical scheduling load limit, and other information, which are used to bind and match with the airport tasks to be executed, and complete the corresponding assignment of personnel and tasks.

[0024] Airport tasks pending execution refer to all airport operations that have not yet been assigned personnel, scheduled for execution, and are awaiting dispatch during the daily operation and support of the airport. Each task has a unique task number and complete operational information, including task type, required qualification threshold, fixed task start time, task end time, task duration, task urgency priority, task location, and task execution specifications. All tasks pending execution require the completion of personnel assignment.

[0025] The initial allocation scheme is generated by traversing the database of all execution objects and the database of all airport tasks to be executed, and then using a global random combination matching rule to randomly bind each airport task to an execution object that meets the matching range. In this initial scheme, all tasks to be executed have been initially bound, and there are no unassigned tasks, thus serving as the result of the original random matching scheme.

[0026] Reassignment refers to adjusting the binding relationships based on the initial allocation scheme without completely disrupting the entire matching structure. Instead, it involves determining a preset number of task pairs or individual task records and making minor adjustments to the neighborhood, such as reassigning single tasks and swapping the execution objects of paired tasks. This allows the overall architecture of the initial scheme to be preserved during the adjustment process, with only the personnel assigned to local tasks being modified. It is a small-scale and refined operation that changes the allocation relationship.

[0027] The allocation scheme to be determined is the locally fine-tuned allocation scheme obtained after performing a heuristic reallocation operation on the initial allocation scheme.

[0028] Based on this, by randomly combining all execution objects and airport tasks to be executed, a corresponding initial allocation scheme is obtained. A small portion of the airport tasks to be executed in the initial allocation scheme are then reallocated to generate a locally fine-tuned allocation scheme to be determined. This allows for the derivation of a completely new allocation structure from the original allocation structure through fine-tuning. This local fine-tuning optimization avoids unreasonable assignments caused by the initial random allocation and, in conjunction with subsequent iterations, determines a better allocation scheme.

[0029] S120. Based on the task's hard constraints and soft constraints and their respective preset condition scores, determine the hard constraint scores and soft constraint scores corresponding to the initial allocation scheme and the allocation scheme to be determined, and perform a weighted summation of the hard constraint scores and soft constraint scores according to the preset weight values ​​to obtain the corresponding scheme scores.

[0030] Among them, the hard constraints of the task are mandatory bottom-line constraints that must be strictly followed and cannot be violated throughout the entire process of airport task allocation. Once a violation occurs, it means that the allocation plan has fatal defects such as being unable to be implemented, operational conflicts, or mismatch of qualifications. For example, the execution object needs to be subject to the constraint of matching the qualifications for task execution.

[0031] Task soft constraints are flexible optimization constraints that do not need to be forcibly met during the allocation process and are only used to improve the overall scheduling effect. They are not necessary conditions for the scheme to be qualified and a small number of violations are allowed. They are mainly used to optimize the scheduling structure and balance resource allocation, such as the workload of each execution object being subject to the constraint of work balancing.

[0032] Preset condition scores refer to fixed quantitative values ​​that are predetermined for each independent hard and soft constraint rule. In practical applications, the base score for hard constraints is large, while the base score for soft constraints is small. The score is set in advance according to the importance of each constraint. The higher the preset condition score, the more important the constraints in the game are in the task execution and the more they need to be met.

[0033] The hard constraint score refers to the cumulative value obtained by traversing the satisfaction and violation of all hard constraints in the allocation scheme, accumulating the points for each hard constraint satisfaction and deducting the points for each hard constraint violation. The higher the score, the higher the bottom-line compliance of the scheme and the fewer defects such as task conflicts and qualification mismatches.

[0034] Furthermore, in practical applications, hard constraints need to be scored separately, which can guide the search direction of local fine-tuning optimization, thereby providing optimization direction guidance during the iteration process and providing optimization gradient for iterative optimization.

[0035] The soft constraint score refers to the cumulative value obtained by traversing and checking the satisfaction and violation of all soft constraints in the allocation scheme, adding up the points for each soft constraint satisfaction and deducting the points for violation. The higher the score, the better the optimization goals such as workload balance and task interval are achieved.

[0036] The scheme score refers to the comprehensive total score obtained by performing a weighted summation operation on the independently calculated hard constraint scores and soft constraint scores according to the pre-set hard constraint weights and soft constraint weights. It is used to evaluate the overall quality of the allocation scheme. The higher the score, the better the overall performance of the scheme.

[0037] Based on this, by traversing and determining the hard and soft constraints of the task that the initial allocation scheme and the allocation scheme to be determined each satisfy and violate, points are added if the conditions are met and points are deducted if the conditions are violated, thus obtaining the hard constraint score and soft constraint score corresponding to each allocation scheme. Furthermore, based on the preset weight values ​​corresponding to the hard constraint score and soft constraint score, the hard constraint score and soft constraint score are weighted and summed to obtain the corresponding scheme score.

[0038] S130. Based on the initial scheme score and the scheme score to be determined, determine the corresponding updated allocation scheme, and based on the preset number of iterations, iteratively redistribute tasks according to the updated allocation scheme to obtain the target allocation scheme; wherein, the initial scheme score and the scheme score to be determined are the scheme scores corresponding to the initial allocation scheme and the scheme score to be determined, respectively.

[0039] The updated allocation scheme refers to the allocation scheme with the higher score determined by comparing the scores of the initial allocation scheme and the allocation scheme to be determined. This allocation scheme has better constraint satisfaction and better allocation rationality, thus retaining the best task allocation scheme in the current stage and discarding schemes with lower scores, more constraint violations, and unreasonable allocation. In the actual iterative optimization process, it serves as the basis for subsequent rounds of task redistribution and the generation of new allocation schemes, so as to ensure that each round of iteration continues to optimize based on the current optimal solution.

[0040] The preset number of iterations refers to the total number of iterations to be run in advance. Once this number is reached, the loop optimization will stop.

[0041] Iteration refers to the iterative optimization process based on updating the allocation scheme, repeatedly performing task redistribution, generating new alternative schemes, constraint scoring, score comparison, and selecting the best updated scheme. Each complete cycle is an iteration; through multiple iterations, the allocation structure is continuously fine-tuned and optimized.

[0042] The target allocation scheme refers to the optimal allocation scheme that is selected and retained after all preset number of iterations and optimizations. It is used to determine the dedicated execution object for each airport task to be executed and to complete the final task assignment.

[0043] Based on this, the updated allocation scheme is determined from the initial allocation scheme and the allocation scheme to be determined by the scheme score, so as to obtain the best task allocation scheme in the current stage. Then, the updated allocation scheme is further subjected to task redistribution for a preset number of iterations. That is, based on the updated allocation scheme, the iterative process of task redistribution, generating new alternative schemes, constraint scoring, score comparison and selection of the best updated scheme is repeatedly executed for a preset number of iterations to obtain the target allocation scheme.

[0044] S140. Based on the target allocation scheme, determine the target execution object corresponding to the airport task to be executed, and allocate the airport task to be executed to the target execution object.

[0045] Among them, the target execution object refers to the on-duty staff who are finally determined by the target allocation plan and matched one by one with each airport task to be executed, so as to clarify the final operation person in charge of each airport task to be executed and complete the final binding and assignment of personnel and tasks.

[0046] Based on this, the target allocation scheme is used to determine the target execution objects corresponding to each airport task to be executed, so as to allocate the airport tasks to the target execution objects.

[0047] Based on the feasible implementation of S110 described above, this application further provides a method for reallocating airport tasks to be executed in the initial allocation scheme to generate an allocation scheme to be determined, including: Determine a preset number of task pairs from the initial allocation scheme, and determine the execution target of the task pairs based on the corresponding airport tasks to be executed; The execution objects in each task pair are swapped to obtain the swapped allocation scheme to be determined.

[0048] The preset quantity refers to the total number of task pairs that need to be selected in advance, which limits the adjustment scale of a single redistribution operation and avoids destroying the overall allocation structure of the original scheme due to excessive changes in a single operation, thus achieving small-scale and refined local optimization of the scheme.

[0049] A task pair refers to a pair of pairs of independent airport tasks to be executed randomly selected from the initial allocation scheme. Each task pair contains two different tasks and the execution objects currently bound to each task. This allows for the change of task affiliation and the expansion of new allocation combinations without disrupting the original allocation framework, through a local adjustment method of swapping tasks in pairs.

[0050] Based on this, by extracting a preset number of task pairs from the initial allocation scheme and exchanging the execution objects in each task pair, a local fine-tuning of the scheme can be achieved, resulting in the allocation scheme to be determined after the exchange.

[0051] Based on the feasible implementation of S120 described above, this application further provides a method that, before determining the hard constraint score and soft constraint score corresponding to the initial allocation scheme and the allocation scheme to be determined based on the task hard constraint conditions and task soft constraint conditions and their respective corresponding preset condition scores, also includes: Based on the execution qualification conditions, execution time conditions, and task conflict conditions corresponding to each airport task to be executed, the corresponding hard constraints are determined, and the corresponding soft constraints are determined according to the target execution workload conditions and execution interval duration conditions.

[0052] Among them, the qualification conditions for execution refer to the operational qualification level, business authority, job type and skill requirements required for each airport task to be executed. In practical application, only when the qualifications of the task object meet the corresponding qualification conditions for execution can the task be executed.

[0053] The execution time condition refers to the limitation that the on-duty schedule of each execution object must be matched with the start and end times of the corresponding airport task to be executed, so as to ensure that the entire task operation is within the on-duty cycle of the personnel and avoid forcibly assigning tasks during the time when personnel are off duty, not on duty, or have already finished their work.

[0054] Task conflict conditions refer to the restriction that multiple airport tasks undertaken by the same execution object cannot overlap in time intervals; that is, a single execution object can only execute one task at a time, and parallel operations are not allowed.

[0055] The target workload condition refers to the optimized constraint condition used to balance the task load of all execution objects. It requires that the total amount of tasks, cumulative working time and workload of each on-duty execution object be as equal as possible, so as to avoid some people being overloaded and some people being idle.

[0056] The execution interval time requirement refers to the minimum time interval required between two adjacent tasks undertaken by the same execution object. This is used for personnel handover, site transfer, and rest buffering to avoid continuous and tight scheduling of tasks without intervals.

[0057] Therefore, in practical applications, hard constraints are inviolable constraints used to ensure the legality, security, and orderliness of task allocation. Violation of any hard constraint renders the corresponding allocation scheme infeasible. These constraints may include: qualification matching constraints (e.g., personnel assigned to a ground support task must possess all the necessary operational qualifications for that task; personnel lacking the required qualifications cannot be assigned such tasks); time matching constraints (e.g., personnel assigned to a ground support task must be on duty within the planned start and end times of the task; personnel not on duty or who have already left work cannot be assigned); and task conflict constraints (e.g., the same support personnel cannot be assigned to the same task). Personnel can only undertake one ground support task at a time, and the same personnel must not be assigned two or more tasks with overlapping time slots. Soft constraints are optimization goals that should be met as much as possible to improve the rationality and fairness of task allocation. They are not mandatory to be fully met and can include workload balance, that is, the workload of support personnel should be as balanced as possible on the same day to avoid some personnel being overworked while others are idle; and the interval between adjacent tasks, that is, for tasks of the same support personnel with adjacent time slots, the end time of the previous task and the start time of the next task should be no less than 20 minutes to ensure that support personnel have time to prepare for the next support task.

[0058] Based on the feasible implementation of S120 described above, this application further provides a method for determining the hard constraint score and soft constraint score corresponding to the initial allocation scheme and the allocation scheme to be determined, based on the task hard constraint conditions and task soft constraint conditions and their respective corresponding preset condition scores, including: For the initial allocation scheme and the allocation scheme to be determined, based on the hard constraints and soft constraints of the task, we traverse and determine the constraints that are satisfied and not satisfied for each allocation scheme. Based on the preset condition scores and constraint categories corresponding to satisfying the constraints, the allocation schemes are scored, and based on the preset condition scores and constraint categories corresponding to not satisfying the constraints, the allocation schemes are scored, resulting in hard constraint scores and soft constraint scores for each allocation scheme; among which, the constraint categories include task hard constraint categories and task soft constraint categories.

[0059] Based on this, by traversing each constraint condition, including hard and soft constraints, for both the initial allocation scheme and the allocation scheme to be determined, it is determined whether the allocation scheme satisfies or does not meet the hard and soft constraints. In order to further obtain the hard constraint score corresponding to the hard constraint category and the soft constraint score corresponding to the soft constraint category, points are added if the scheme satisfies the hard constraints and points are deducted if it does not satisfy the hard constraints.

[0060] Based on the feasible implementation of S120 described above, this application further provides a method that includes, before determining the target execution object corresponding to the airport task to be executed based on the target allocation scheme: For each execution object in the allocation scheme, the airport tasks to be executed are divided into start events and end events based on the corresponding task start time and task end time. Based on the chronological order, the start and end events are sorted to obtain an event sequence, and the event sequence is traversed. When the current event is a start event, determine whether there is a corresponding target start event in the target set based on the execution object identifier corresponding to the start event; If it exists, the target execution object is not determined, and the corresponding conflict prompt message is output. The conflict prompt message is used to inform the user that there is an event conflict in the target allocation scheme and that it needs to be re-allocated. If it does not exist, then determine the target execution object and add the start event to the target set; When the current event is an end event, the corresponding execution object identifier in the target set is deleted based on the end event.

[0061] The task start time refers to the time when a task at an airport is scheduled to begin. For example, if a baggage handling task is scheduled to start at 08:00, then 08:00 is the task start time for this task.

[0062] The task end time refers to the time when a certain airport task to be performed is scheduled to end. For example, if the baggage loading and unloading task is scheduled to be completed at 09:00, then 09:00 is the task end time for this task.

[0063] A start event is a timing signal node generated with the task start time as the trigger node. It is used to mark that the corresponding task is about to start and the execution object is about to enter a busy state. For example, the baggage loading and unloading task start signal triggered at 08:00 is the start event corresponding to the task.

[0064] An end event is a time-series signal node generated with the task end time as the trigger node. It is used to mark the completion of the corresponding task, the end of the busy state of the execution object, and the release of human resources. For example, the baggage loading and unloading task completion signal triggered at 09:00 is the end event corresponding to the task.

[0065] The execution object identifier is an ID or code used to identify each execution object. It is usually an employee number, personnel ID, etc. For example, the unique identification number of an employee is P01. This number is the corresponding execution object identifier and is used to bind task ownership, personnel retrieval, and status comparison to avoid personnel confusion.

[0066] The target set is a collection used to store the identifiers of execution objects that are currently executing tasks and are in a busy, occupied state. In practical applications, it is dynamically updated with time events. When a start event is encountered, personnel are added; when an end event is encountered, personnel are deleted, thereby reflecting the busy and idle status of personnel in real time. This is to record all tasks that have started but have not yet ended during the current scanline processing. For example, if staff member P01 is executing a task at 08:10, then [P01] is stored in the set; when the task ends at 09:00, [P01] is deleted from the set.

[0067] A target start event refers to the start event of other tasks that have been pre-stored in the target set and are still in a valid occupied state. It can be understood as an active task occupancy record that already exists in the set and corresponds to the same execution object. It indicates that the person is currently occupied by other tasks and has not yet been released. For example, if execution object P01 has a task from 08:00 to 09:00 stored in the set, and a new task starting at 08:30 arrives, the target start event corresponding to P01 is found in the set, and a time conflict is directly determined.

[0068] Conflict alert messages are messages used to inform users that there is an event conflict in the currently determined target allocation scheme and that a reassignment is required. These messages can be voice or other forms of alerts.

[0069] Based on this, in practical applications, all tasks can be broken down into start and end events in time sequence based on the start and end times of the tasks corresponding to each execution object. According to the target set, the current work occupancy status of personnel can be dynamically recorded, and the start event of each task can be checked in chronological order. This can accurately detect whether the same execution object undertakes multiple tasks in the same time period or whether there are overlapping time intervals and conflicts, thereby determining whether the personnel task assignment in the allocation plan is compliant and eliminating unreasonable allocations that cannot be executed on-site, such as personnel working in parallel or time sequence collisions.

[0070] Based on the feasible implementation of S130 described above, this application further provides a method for iteratively reallocating tasks according to a preset number of iterations to obtain a target allocation scheme, including: Tasks are redistributed according to the updated allocation scheme to obtain the corresponding redistribution scheme. Based on the hard constraints and soft constraints of the tasks and their respective preset condition scores, the scheme scores corresponding to the updated allocation scheme and the redistribution scheme are determined. Compare the scores of each scheme to obtain the corresponding comparison results; If the comparison result shows that the scheme score corresponding to the reallocation scheme is larger, then the reallocation scheme is determined to be the updated allocation scheme obtained after the current iteration; If the comparison result shows that the updated allocation scheme has a larger scheme score, then the updated allocation scheme is determined to be the updated allocation scheme obtained after the current iteration. Based on the number of iterations, the updated allocation scheme obtained after the current iteration is used to redistribute tasks, resulting in the corresponding target allocation scheme.

[0071] The redistribution scheme refers to the scheme obtained by performing a redistribution operation of swapping internal execution objects within the task again, based on the update allocation scheme corresponding to the current iteration round during a single iteration process, thereby making local fine adjustments to the original update allocation scheme.

[0072] Based on this, in practical applications, based on the preset total number of iterations, the iterative process of reassignment to generate new schemes, comprehensive scoring of the two schemes, score comparison and selection of the best scheme, and updating and retaining the best scheme is repeatedly executed. In this way, the optimized allocation scheme is determined in multiple iterations. During the iteration process, the allocation scheme with the highest comprehensive score in each iteration round is retained. After reaching the preset number of iterations, the globally optimal target allocation scheme is converged.

[0073] Based on the feasible implementation of S130 described above, this application further provides a method for reallocating tasks based on the number of iterations, using the updated allocation scheme obtained after the current iteration to obtain a corresponding target allocation scheme, including: Based on the update allocation scheme corresponding to the last iteration, determine the allocation scheme to be verified, and determine whether the allocation scheme to be verified satisfies all task hard constraints. If all hard constraints of the tasks are met, then the allocation scheme to be verified is determined as the target allocation scheme. If at least one task hard constraint is not met, the algorithm iteratively checks whether the updated allocation scheme corresponding to the previous iteration satisfies all task hard constraints until a target allocation scheme that satisfies all task hard constraints is determined.

[0074] Among them, the allocation scheme to be verified refers to the updated allocation scheme determined after the last iteration after completing all preset number of iterations. In practical applications, it is also necessary to further conduct a full-item hard constraint compliance review and verification of the allocation scheme to be verified in order to verify whether there are any hard violations such as qualification mismatch, personnel time conflict, or exceeding the on-duty time.

[0075] Based on this, after determining the update allocation scheme corresponding to the last iteration, it is necessary to further conduct a full hard constraint compliance review of the allocation scheme to be verified. If all task hard constraint conditions are met, the allocation scheme to be verified is determined as the target allocation scheme. If at least one task hard constraint condition is not met, the update allocation schemes retained in the previous and earlier iterations are retrieved in reverse order of iteration, and the full hard constraint verification is performed one by one in a loop to determine the target allocation scheme that meets all task hard constraint conditions.

[0076] Please refer to Figure 2 , Figure 2 This is a schematic diagram of an airport task allocation method provided in an embodiment of this application; as shown below. Figure 2 As shown, by implementing the allocation model and constructing the hard and soft constraint conditions system for tasks, and importing data such as execution object information and airport task attributes to be executed, task pre-allocation calculations are carried out based on the constructed model and constraint rules to generate an initial task assignment scheme. The resource timing conflict verification of the entire scheme is completed according to the timing scanline detection mechanism to investigate problems such as overlapping personnel tasks and job conflicts.

[0077] Please refer to Figure 3 , Figure 3 This application provides a schematic diagram of an airport task allocation method according to an embodiment of the present application; for example... Figure 3 As shown, the solution parameters are initialized, and a set of allocation schemes is randomly generated and scored, which is then retained as the current optimal scheme. A new allocation scheme is generated based on a heuristic algorithm and its score is calculated to determine whether the score of the new scheme is higher. If so, it is updated as the current optimal scheme; otherwise, the current optimal scheme is retained. The solution is then checked to see if the termination condition is met. If not, the solution returns to generate a new scheme and compares and updates the scores. If the condition is met, the allocation scheme is output.

[0078] Based on the above steps, it can be seen that this application generates an initial allocation scheme by randomly combining all execution objects with airport tasks to be executed, thereby quickly completing the global basic matching of tasks and personnel, and providing diverse initial schemes for subsequent optimization; by performing heuristic task reassignment on the initial allocation scheme to generate allocation schemes to be determined, the diversity of schemes is broadened, avoiding getting trapped in local optima; by combining preset hard constraints, soft constraints and corresponding scores for quantitative scoring, and by weighted summation of hard constraint scores and soft constraint scores according to weights, the score of each scheme is obtained, realizing the degree of constraint satisfaction of allocation schemes and adjustment. The rationality of the allocation scheme is comprehensively quantified. By comparing the scores of the initial allocation scheme and the allocation scheme to be determined, the optimal updated allocation scheme is selected, and the task redistribution optimization is performed cyclically according to the preset number of iterations. In the process of multiple iterations, unreasonable allocations are continuously eliminated and task timing conflicts are avoided, and the globally optimal target allocation scheme is gradually converged. Based on the target allocation scheme, the target execution objects corresponding to the tasks of each airport are determined, so as to achieve accurate and reasonable task assignment. While strictly meeting the hard requirements such as personnel qualifications and no time conflicts of tasks, the optimization goals such as balanced personnel workload are taken into account, thereby improving the efficiency of airport task scheduling and the overall rationality of the allocation scheme.

[0079] Figure 4 This is a schematic diagram of the structure of an airport task allocation device provided in an embodiment of this application. Figure 4 As shown, this airport task allocation device includes: a combination module, a summation module, an iteration module, and a determination module; wherein: The combination module is used to randomly combine all execution objects and airport tasks to be executed to obtain the corresponding initial allocation scheme, and to reallocate the airport tasks to be executed in the initial allocation scheme to generate an allocation scheme to be determined. The summation module is used to determine the hard constraint score and soft constraint score of the initial allocation scheme and the allocation scheme to be determined based on the hard constraint conditions and soft constraint conditions of the task and their respective preset condition scores, and to perform a weighted summation of the hard constraint score and soft constraint score according to the preset weight value to obtain the corresponding scheme score. The iteration module is used to determine the corresponding updated allocation scheme based on the initial scheme score and the scheme score to be determined, and to iteratively redistribute tasks on the updated allocation scheme based on a preset number of iterations to obtain the target allocation scheme; wherein, the initial scheme score and the scheme score to be determined are the scheme scores corresponding to the initial allocation scheme and the allocation scheme to be determined, respectively. The determination module is used to determine the target execution object corresponding to the airport task to be executed based on the target allocation scheme, and to allocate the airport task to be executed to the target execution object.

[0080] In this embodiment of the application, the combination module can also be specifically used for: Determine a preset number of task pairs from the initial allocation scheme, and determine the execution target of the task pairs based on the corresponding airport tasks to be executed; The execution objects in each task pair are swapped to obtain the swapped allocation scheme to be determined.

[0081] In this embodiment of the application, other modules of the airport task allocation device may also be specifically used for: Based on the execution qualification conditions, execution time conditions, and task conflict conditions corresponding to each airport task to be executed, the corresponding hard constraints are determined, and the corresponding soft constraints are determined according to the target execution workload conditions and execution interval duration conditions.

[0082] In this embodiment of the application, the summation module can also be specifically used for: For the initial allocation scheme and the allocation scheme to be determined, based on the hard constraints and soft constraints of the task, we traverse and determine the constraints that are satisfied and not satisfied for each allocation scheme. Based on the preset condition scores and constraint categories corresponding to satisfying the constraints, the allocation schemes are scored, and based on the preset condition scores and constraint categories corresponding to not satisfying the constraints, the allocation schemes are scored, resulting in hard constraint scores and soft constraint scores for each allocation scheme; among which, the constraint categories include task hard constraint categories and task soft constraint categories.

[0083] In this embodiment of the application, other modules of the airport task allocation device may also be specifically used for: For each execution object in the allocation scheme, the airport tasks to be executed are divided into start events and end events based on the corresponding task start time and task end time. Based on the chronological order, the start and end events are sorted to obtain an event sequence, and the event sequence is traversed. When the current event is a start event, determine whether there is a corresponding target start event in the target set based on the execution object identifier corresponding to the start event; If it exists, the target execution object is not determined, and the corresponding conflict prompt message is output. The conflict prompt message is used to inform the user that there is an event conflict in the target allocation scheme and that it needs to be re-allocated. If it does not exist, then determine the target execution object and add the start event to the target set; When the current event is an end event, the corresponding execution object identifier in the target set is deleted based on the end event.

[0084] In this embodiment of the application, the iteration module can also be specifically used for: Tasks are redistributed according to the updated allocation scheme to obtain the corresponding redistribution scheme. Based on the hard constraints and soft constraints of the tasks and their respective preset condition scores, the scheme scores corresponding to the updated allocation scheme and the redistribution scheme are determined. Compare the scores of each scheme to obtain the corresponding comparison results; If the comparison result shows that the scheme score corresponding to the reallocation scheme is larger, then the reallocation scheme is determined to be the updated allocation scheme obtained after the current iteration; If the comparison result shows that the updated allocation scheme has a larger scheme score, then the updated allocation scheme is determined to be the updated allocation scheme obtained after the current iteration. Based on the number of iterations, the updated allocation scheme obtained after the current iteration is used to redistribute tasks, resulting in the corresponding target allocation scheme.

[0085] In this embodiment of the application, the iteration module can also be specifically used for: Based on the update allocation scheme corresponding to the last iteration, determine the allocation scheme to be verified, and determine whether the allocation scheme to be verified satisfies all task hard constraints. If all hard constraints of the tasks are met, then the allocation scheme to be verified is determined as the target allocation scheme. If at least one task hard constraint is not met, the algorithm iteratively checks whether the updated allocation scheme corresponding to the previous iteration satisfies all task hard constraints until a target allocation scheme that satisfies all task hard constraints is determined.

[0086] Figure 5 This is a schematic diagram of the structure of an apparatus for performing an airport task allocation method according to an embodiment of this application. Figure 5 As shown, the device includes: The device may include one or more processors with processing cores, one or more computer-readable storage media such as memory, communication components, etc. The processor, memory, and communication components are connected via a bus.

[0087] In the specific implementation process, at least one processor executes computer execution instructions stored in memory, causing at least one processor to execute the airport task allocation method described above.

[0088] The specific implementation process of the processor can be found in the above method embodiments, and its implementation principle and technical effect are similar, so it will not be repeated here.

[0089] Furthermore, the processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), etc. A general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in this application can be directly manifested as being executed by a hardware processor, or executed by a combination of hardware and software modules within the processor.

[0090] The memory may include random access memory (RAM) and may also include non-volatile memory (NVM), such as at least one disk storage device.

[0091] The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, the buses shown in the accompanying drawings are not limited to a single bus or a single type of bus.

[0092] In some embodiments, a computer program product is also provided, including a computer program or instructions that, when executed by a processor, implement the steps in any of the above-described airport task allocation methods.

[0093] For details on the implementation of each of the above operations, please refer to the previous examples, which will not be repeated here.

[0094] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be performed by instructions, or by instructions controlling related hardware. These instructions can be stored in a computer-readable storage medium and loaded and executed by a processor.

[0095] Therefore, embodiments of this application provide a computer-readable storage medium storing a plurality of program codes that can be loaded by a processor to execute the steps in any of the airport task allocation methods provided in embodiments of this application.

[0096] The storage medium may include: read-only memory (ROM), random access memory (RAM), disk or optical disk, etc.

[0097] According to one aspect of this application, a computer program product or computer program is provided, the computer program product or computer program including computer instructions stored in a computer-readable storage medium.

[0098] Since the instructions stored in the storage medium can execute the steps in any of the airport task allocation methods provided in the embodiments of this application, the beneficial effects that any of the airport task allocation methods provided in the embodiments of this application can achieve can be realized. For details, please refer to the previous embodiments, which will not be repeated here.

[0099] Other embodiments of this application will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this application that follow the general principles of this application and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope of this application is indicated by the appended claims.

[0100] It should be understood that this application is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope.

Claims

1. An airport task allocation method, characterized in that, The method includes: All execution objects and airport tasks to be executed are randomly combined to obtain the corresponding initial allocation scheme, and the airport tasks to be executed in the initial allocation scheme are reallocated to generate an allocation scheme to be determined. Based on the task's hard constraints and soft constraints and their respective preset condition scores, the hard constraint scores and soft constraint scores corresponding to the initial allocation scheme and the allocation scheme to be determined are determined. Then, according to the preset weight values, the hard constraint scores and soft constraint scores are weighted and summed to obtain the corresponding scheme scores. Based on the initial scheme score and the undetermined scheme score, a corresponding update allocation scheme is determined, and based on a preset number of iterations, the updated allocation scheme is iteratively reassigned to obtain the target allocation scheme; wherein, the initial scheme score and the undetermined scheme score are the scheme scores corresponding to the initial allocation scheme and the undetermined allocation scheme, respectively. Based on the target allocation scheme, the target execution object corresponding to the airport task to be executed is determined, and the airport task to be executed is allocated to the target execution object.

2. The method according to claim 1, characterized in that, The step of reallocating the airport tasks to be executed in the initial allocation scheme to generate an allocation scheme to be determined includes: A preset number of task pairs are determined from the initial allocation scheme, and the execution object of the task pair is determined according to the corresponding airport task to be executed; The execution objects in each of the task pairs are swapped to obtain the swapped allocation scheme to be determined.

3. The method according to claim 1, characterized in that, Before determining the hard constraint score and soft constraint score corresponding to the initial allocation scheme and the allocation scheme to be determined based on the task hard constraints and task soft constraints and their respective preset condition scores, the method further includes: Based on the execution qualification conditions, execution time conditions, and task conflict conditions corresponding to each airport task to be executed, the corresponding hard constraints of the task are determined, and the corresponding soft constraints of the task are determined according to the target execution workload conditions and execution interval duration conditions.

4. The method according to claim 1, characterized in that, The process of determining the hard constraint score and soft constraint score corresponding to the initial allocation scheme and the allocation scheme to be determined, based on the task's hard constraints and soft constraints and their respective preset condition scores, includes: For the initial allocation scheme and the allocation scheme to be determined, based on the task hard constraints and the task soft constraints, the constraints that are satisfied and those that are not satisfied are determined for each allocation scheme. Based on the preset condition score and constraint category corresponding to the fulfillment of the constraint conditions, the allocation scheme is scored, and based on the preset condition score and constraint category corresponding to the non-fulfillment of the constraint conditions, the allocation scheme is scored, resulting in the hard constraint score and soft constraint score for each allocation scheme; wherein, the constraint category includes task hard constraint category and task soft constraint category.

5. The method according to claim 4, characterized in that, Before determining the target execution object corresponding to the airport task to be executed based on the target allocation scheme, the method further includes: For each execution object in the allocation scheme, the airport task to be executed is divided into a start event and an end event based on the corresponding task start time and task end time. Based on the time order, the start events and the end events are sorted to obtain an event sequence, and the event sequence is traversed. When the current event is the start event, determine whether there is a corresponding target start event in the target set based on the execution object identifier corresponding to the start event; If such a conflict exists, the target execution object is not determined, and a corresponding conflict warning message is output. The conflict warning message is used to inform the user that there is an event conflict in the target allocation scheme and that it needs to be reallocated. If it does not exist, then determine the target execution object and add the start event to the target set; When the current event is the termination event, the corresponding execution object identifier in the target set is deleted based on the termination event.

6. The method according to claim 1, characterized in that, The step of iteratively reallocating tasks based on a preset number of iterations to obtain a target allocation scheme includes: The update allocation scheme is reassigned to obtain a corresponding reassignment scheme. Based on the task hard constraints and the task soft constraints and their respective preset condition scores, the scheme scores corresponding to the update allocation scheme and the reassignment scheme are determined. By comparing the numerical values ​​of the scores for each of the proposed schemes, the corresponding comparison results are obtained. If the comparison result shows that the scheme score corresponding to the redistribution scheme is larger, then the redistribution scheme is determined to be the updated allocation scheme obtained after the current iteration; If the comparison result shows that the updated allocation scheme has a larger scheme score, then the updated allocation scheme is determined to be the updated allocation scheme obtained after the current iteration; Based on the number of iterations, the updated allocation scheme obtained after the current iteration is reassigned to obtain the corresponding target allocation scheme.

7. The method according to claim 6, characterized in that, The step of reallocating tasks based on the number of iterations to obtain the corresponding target allocation scheme includes: Based on the update allocation scheme corresponding to the last iteration, determine the allocation scheme to be verified, and determine whether the allocation scheme to be verified satisfies all the hard constraints of the task. If all the hard constraints of the task are met, then the allocation scheme to be verified is determined to be the target allocation scheme; If at least one of the task hard constraints is not met, the system iteratively determines whether the update allocation scheme corresponding to the previous iteration satisfies all the task hard constraints, until the target allocation scheme that satisfies all the task hard constraints is determined.

8. An airport task allocation device, characterized in that, The device includes: The combination module is used to randomly combine all execution objects and airport tasks to be executed to obtain the corresponding initial allocation scheme, and to reallocate the airport tasks to be executed in the initial allocation scheme to generate an allocation scheme to be determined. The summation module is used to determine the hard constraint score and soft constraint score corresponding to the initial allocation scheme and the allocation scheme to be determined, based on the task hard constraint conditions and task soft constraint conditions and their respective preset condition scores, and to perform a weighted summation of the hard constraint score and the soft constraint score according to preset weight values ​​to obtain the corresponding scheme score. An iterative module is used to determine the corresponding updated allocation scheme based on the initial scheme score and the scheme score to be determined, and to iteratively redistribute tasks on the updated allocation scheme based on a preset number of iterations to obtain the target allocation scheme; wherein, the initial scheme score and the scheme score to be determined are the scheme scores corresponding to the initial allocation scheme and the scheme score to be determined, respectively. The determination module is used to determine the target execution object corresponding to the airport task to be executed based on the target allocation scheme, and to allocate the airport task to be executed to the target execution object.

9. A computer device, characterized in that, include: One or more processors; Memory; One or more programs, wherein the one or more programs are stored in memory and configured to be executed by one or more processors, the one or more programs being configured to perform the method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores program code that can be called by a processor to perform the method as described in any one of claims 1 to 7.

Images