Intelligent flexible airport baggage pick-up carousel distribution method

Abstract

The application provides an intelligent and flexible airport luggage extraction carousel distribution method, which comprises the following steps: S1, obtaining airport arrival flight information and airport luggage processing system data; S2, taking a towing trolley as a basic processing unit, splitting the luggage of each arrival flight into luggage units to obtain a set of to-be-processed luggage units; S3, designing a model solving algorithm; S4, performing a mathematical model checking and algorithm parameter design, and solving the established mathematical optimization model by using the designed algorithm to obtain the destination carousel direction and processing process scheme of each luggage unit; and S5, importing the obtained luggage carousel distribution scheme and luggage processing process scheme results into a passenger luggage information service system in real time, so that passengers can query the personal luggage information state and progress. The application can reduce the waiting time of passengers to extract luggage, and can also dynamically adjust and optimize the allocation of luggage carousel resources according to the actual situation, so that the service quality of passengers is improved and the utilization intensity of resources is balanced.

Description

Technical Field

[0001] The present invention relates to the field of civil aviation transportation management, and in particular to an intelligent and flexible airport baggage claim carousel allocation method. Background Art

[0002] There are two main baggage carousel configurations in the arrival halls of civil aviation airports: one in which the feeding station and baggage carousel are integrated; the other in which the feeding station and baggage carousel are connected via a baggage conveyor system. Both carousel configurations share a common feature: flights are uniquely paired with baggage carousels, and passengers only have access to baggage information accurate to the flight level.

[0003] Traditional baggage carousel allocation methods lack flexibility, leading to uneven utilization of resources, long passenger wait times, and low system efficiency. Furthermore, passengers currently rely solely on signage and public displays to locate the carousels, lacking accurate, real-time information on the status and location of their luggage. This inadequate information service further exacerbates the already poor passenger experience.

[0004] The primary factor affecting passenger wait times at airport inbound baggage claim is the time it takes for baggage to be transferred to the carousel. The number of bags on the carousel directly impacts subsequent baggage delivery, and thus passenger wait times. Therefore, a method for allocating inbound baggage carousels that allows multiple carousels to simultaneously serve a single flight is both scientific and necessary.

[0005] In recent years, the rapid development of information technologies such as the Internet of Things, big data, and mobile internet has ushered in new opportunities for the development of baggage handling and information services at civil aviation airports. Researching new, more flexible baggage carousel allocation methods and enhanced passenger information services for inbound baggage handling systems is crucial for improving the efficiency and service quality of baggage handling operations at civil aviation airports. Summary of the Invention

[0006] In view of this, the present invention provides, on one hand, an intelligent and flexible airport baggage claim carousel allocation method, the method comprising:

[0007] S1: Obtain inbound flight information and airport baggage handling system data;

[0008] S2: Using a towed trolley as a basic processing unit, the baggage of each incoming flight is divided into baggage units to obtain a collection of baggage units to be processed. A mathematical model is constructed with the goal of balancing the utilization intensity of the baggage carousel and shortening passenger waiting time.

[0009] S3: Design model solving algorithm;

[0010] S4: Execute the verification of the mathematical model and the design of the algorithm parameters, and use the designed algorithm to solve the established mathematical optimization model to obtain the destination carousel and processing plan of each baggage unit;

[0011] S5: The baggage carousel allocation plan and baggage handling process plan obtained are immediately imported into the passenger baggage information service system so that passengers can check the status and progress of their personal baggage information.

[0012] Furthermore, the objective function of the mathematical optimization model is:

[0013] (1);

[0014] The constraints of the mathematical optimization model are:

[0015] (2);

[0016] (3);

[0017] (4);

[0018] (5);

[0019] (6);

[0020] (7);

[0021] (8);

[0022] (9);

[0023] (10);

[0024] (11);

[0025] (12);

[0026] in, For luggage unit The set of baggage carousels that can be assigned, is a collection of luggage units, For luggage unit The set of feeding stations that can be assigned, For luggage unit The set of possible pairs of feeding stations and baggage carousels that can be assigned, For the collection of flights, is the set of all baggage batches, For flights The collection of baggage units contained, indexed by For batch The collection of baggage units contained, indexed by ;

[0027] Weighting parameters for the objective function; For batch The first car arrives at the feeding station moment; For batch The last car arrives at the feeding station moment; The maximum number difference between different baggage carousels that can be allocated to baggage on the same flight; For flights The time of entry; is the starting time of the largest time slice in the studied time period; is the starting time of the minimum time slice in the studied time period; From the feeding station to the baggage carousel The transportation time; intermediate variables: The penalty factor for baggage claim waiting depends on the baggage unit. Number of pieces of luggage and baggage carousels exist The state of the moment; Indicates the relationship between baggage unit and baggage batch. If baggage unit Belong to baggage batch Then take 1, otherwise take 0; ,in Indicates the relationship between baggage unit and baggage batch. If baggage unit Belong to baggage batch Then take 1, otherwise take 0; For feeding stations Luggage unit The service time difference between Indicates the relationship between baggage unit and flight. If baggage unit Flights Then take 1, otherwise take 0; For luggage unit Delivery to baggage carousel The baggage claim time is determined by the baggage unit Number of bags and baggage carousels The status of For luggage carousel Total service time, ;

[0028] is a 0-1 variable. If the luggage unit exist Baggage feeding starts at time t, and the allocation tuple is selected Then take 1, otherwise take 0; is a 0-1 variable, luggage unit than luggage unit Arrive at the feeding station first Then take 1, otherwise take 0; is a 0-1 variable. If the luggage unit of luggage is sorted to the baggage carousel And in If the moment is extracted, it takes 1, otherwise it takes 0; This is the maximum usage intensity of all baggage carousels.

[0029] Furthermore, the allocation method includes an inbound baggage carousel intelligent allocation optimization model algorithm and a passenger baggage information service system.

[0030] Furthermore, the inbound flight information includes taxi-in time, parking space, luggage quantity, cargo hold, and cabin door opening time; and the airport baggage handling system data includes the working status of the baggage feeding station and the working status of the baggage carousel.

[0031] Furthermore, the towing trolley is regarded as a basic processing unit, and each basic unit is the luggage loaded on the towing trolley, that is, a luggage unit. The allocation result and processing process of a luggage unit are the same and unique.

[0032] Furthermore, the same flight includes one or more baggage units, and different baggage units can be assigned to different baggage claim carousels. Passengers can use the baggage information service system to query their personal baggage handling results and progress.

[0033] Furthermore, the luggage claiming time of the luggage unit is obtained by investigating and fitting luggage piece data.

[0034] Furthermore, the application of the designed algorithm to solve the established mathematical optimization model specifically includes:

[0035] Step 1: The arrival time, retrieval time, and remaining service time of the baggage carousel are collected into data sets.

[0036] Step 2: Update the remaining service time of all carousels according to the arrival time of the baggage unit at the feeding station;

[0037] Step 3: Sort the baggage carousel remaining service time dataset from small to large;

[0038] Step 4: Allocate the baggage unit to the baggage carousel closest to the flight's parking stand with the shortest remaining service time;

[0039] Step 5: Update the remaining service time of the assigned baggage carousel;

[0040] Step 6: Repeat steps 2 to 5 until the data set related to the baggage unit to be allocated is cleared;

[0041] Before each baggage unit is allocated, the remaining service time of the available baggage carousel can be estimated by the number of baggage pieces remaining for service on the baggage carousel.

[0042] In a second aspect, the present invention further provides an electronic device comprising a memory and a processor, wherein the memory is used to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement an intelligent and flexible airport baggage claim carousel allocation method as described above.

[0043] In a third aspect, the present invention further provides a readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-mentioned intelligent and flexible airport baggage claim carousel allocation method.

[0044] Beneficial effects of the present invention:

[0045] 1. This invention reorganizes and optimizes the traditional inbound baggage handling process and proposes a flexible and intelligent baggage carousel allocation method. This method overcomes the shortcomings of the traditional baggage carousel allocation model, such as long passenger waiting times and high and uneven carousel utilization. It not only reduces passenger waiting times for baggage retrieval, but also dynamically adjusts and optimizes baggage carousel resource allocation based on actual conditions, thereby improving passenger service quality and balancing resource utilization intensity.

[0046] 2. This auxiliary system implements user-level information display, allowing passengers to check their baggage handling status via their mobile phone after deplaning. This solution balances efficiency with humanistic considerations, reorganizing and optimizing the airport passenger baggage claim process and enabling intelligent upgrades.

[0047] 3. The mathematical model of this invention uses the baggage unit as the minimum processing optimization unit, effectively balancing the complexity of the problem and the optimization potential, while also not disrupting existing baggage handling procedures or adding additional burden and cost to current baggage loading, unloading, feeding, and other operations.

[0048] 4. The mathematical model of the present invention provides decision makers with two optimization objectives: balancing baggage carousel utilization and reducing passenger baggage claim waiting time. This allows decision makers to reasonably adjust the weight of each objective based on actual conditions to better meet actual decision-making needs.

[0049] 5. The mathematical model of this invention allows decision makers to allocate baggage on the same flight to adjacent or nearby baggage carousels based on actual needs. This makes it easier for passengers with limited mobility, those with difficulty operating information systems, or specific travel groups to collect their baggage, demonstrating humanistic care.

[0050] 6. The solution algorithm developed by the present invention for the mathematical optimization model of the problem can be regarded as a special greedy algorithm with simple principles, concise and easy-to-understand steps, easy execution, low requirements for computing hardware, high solution quality and computing efficiency, and strong practicality and operability.

[0051] 7. The overall implementation model of the present invention meets actual operational needs. For flights with schedule changes or delays, only the changed flight data needs to be entered in the new round of planning, and the allocation results will be reasonably adjusted based on the new round of calculations. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] The present invention has the following accompanying drawings:

[0053] Figure 1 is a flow chart of the steps of the present invention;

[0054] Figure 2 It is the algorithm flow chart of the present invention;

[0055] Figure 3 This is a comparison of the usage intensity of each luggage carousel of the present invention and the traditional model;

[0056] Figure 4 It is a reference example of the passenger baggage information service system of the present invention. DETAILED DESCRIPTION

[0057] In order to make the objects, advantages and features of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

[0058] An intelligent and flexible airport baggage claim carousel allocation method specifically includes the following steps:

[0059] Step 1: Obtain inbound flight information and airport baggage handling system related data;

[0060] Step 2: Using the towing trolley as the basic processing unit, the baggage of each incoming flight is divided into baggage units to obtain a set of baggage units to be processed. Based on this, a mathematical model is constructed with the goal of balancing the utilization intensity of the baggage carousel and shortening passenger waiting time;

[0061] Step 3: Design model solving algorithm;

[0062] First, the arrival time, retrieval time, and remaining service time of the baggage unit are collected into data sets. The remaining service time of all carousels is updated based on the arrival time of baggage unit e at the feeding station. The remaining service time data sets of the baggage carousels are sorted from smallest to largest, and baggage unit e is assigned to the baggage carousel with the shortest remaining service time and closest to the flight parking stand. The remaining service time of the assigned baggage carousel is then updated. This process is repeated until the relevant data sets of the baggage unit to be assigned are cleared.

[0063] Step 4: Validate the mathematical model and design algorithm parameters. Use the designed algorithm to solve the established mathematical optimization model, and then obtain the destination carousel and processing plan for each baggage unit.

[0064] Step 5: The baggage carousel allocation plan and baggage handling process plan obtained are immediately imported into the passenger baggage information service system so that passengers can check the status and progress of their personal baggage information.

[0065] In the system of the present invention, the mathematical model described in step 2 is defined as:

[0066] Objective function:

[0067] (1);

[0068] Constraints:

[0069] (2);

[0070] (3);

[0071] (4);

[0072] (5);

[0073] (6);

[0074] (7);

[0075] (8);

[0076] (9);

[0077] (10);

[0078] (11);

[0079] (12);

[0080] Where: Formula 1 indicates that allocation is based on baggage carousel utilization intensity and passenger baggage claim waiting time. The first term on its right side aims to reduce the maximum baggage carousel utilization intensity, and the second term aims to shorten passenger waiting time. Formula 2 indicates that each baggage unit can only be assigned one feasible feeding station and baggage carousel combination. Formulas 3 and 4 require that adjacent baggage units must meet the corresponding timing relationship and there must be no manual handling delays. Formula 5 indicates that a single feeding station can only handle one baggage unit at a time, reflecting the processing capacity limit. Formula 6 stipulates that baggage carousels assigned to the same flight cannot be too far apart. Formula 7 ensures that all bags can be claimed. Formula 8 stipulates that the baggage claim completion time cannot be earlier than the theoretical earliest completion time. Formula 9 defines the upper bound of the baggage carousel utilization intensity. Formulas 10 to 12 are the basic definitions of the decision variables.

[0081] For luggage unit The set of baggage carousels that can be assigned, is a collection of luggage units, For luggage unit The set of feeding stations that can be assigned, For luggage unit The set of possible pairs of feeding stations and baggage carousels that can be assigned, For the collection of flights, is the set of all baggage batches, For flights The collection of baggage units contained, indexed by For batch The collection of baggage units contained, indexed by Weighting parameters for the objective function; For batch The first car arrives at the feeding station moment; For batch The last car arrives at the feeding station moment; The maximum number difference between different baggage carousels that can be allocated to baggage on the same flight; For flights The time of entry; is the starting time of the largest time slice in the studied time period; is the starting time of the minimum time slice in the studied time period; From the feeding station to the baggage carousel The length of transportation; The penalty factor for baggage claim waiting depends on the baggage unit. Number of pieces of luggage and baggage carousels exist The state of the moment; Indicates the relationship between baggage unit and baggage batch. If baggage unit Belong to baggage batch Then take 1, otherwise take 0; ,in Indicates the relationship between baggage unit and baggage batch. If baggage unit Belong to baggage batch Then take 1, otherwise take 0; For feeding stations Luggage unit The service time difference between , Indicates the relationship between baggage unit and flight. If baggage unit Flights Then take 1, otherwise take 0; For luggage unit Delivery to baggage carousel The baggage claim time is determined by the baggage unit Number of bags and baggage carousels The status of For luggage carousel Total service time, ; is a 0-1 variable. If the luggage unit exist Baggage feeding starts at time t, and the allocation tuple is selected Then take 1, otherwise take 0; is a 0-1 variable, luggage unit than luggage unit Arrive at the feeding station first Then take 1, otherwise take 0; is a 0-1 variable. If the luggage unit of luggage is sorted to the baggage carousel And in If the moment is extracted, it takes 1, otherwise it takes 0; This is the maximum usage intensity of all baggage carousels.

[0082] Example 1

[0083] This case study uses the domestic baggage handling system at Beijing Daxing International Airport as an example. Flight data for this case study was collected from 8:00 AM to 1:00 PM on September 22, 2024, encompassing 95 incoming flights. Passenger walking time and baggage handling time were calculated using a sliding scale, corresponding to the aircraft's docking position. The duration of operations such as door opening and passenger disembarkation after the aircraft arrives at the airport was determined based on actual operational data from China Southern Airlines' various aircraft types at Daxing Airport. Data related to the baggage handling system was also based on the layout of the domestic baggage handling hall at Beijing Daxing International Airport.

[0084] The optimization margin is calculated as the ratio of the reduction in the waiting time for baggage claim of each flight passenger under the system of the present invention to the waiting time for baggage claim under the traditional allocation method;

[0085] Table 1 shows the optimization effect of flights in different time periods of the present invention compared with the traditional mode.

[0086] Table 1

[0087]

[0088] Figure 3 This is a comparison of the usage intensity of each luggage carousel of the present invention and the traditional model;

[0089] Figure 4 It is a reference example of the passenger baggage information service system of the present invention;

[0090] All incoming baggage is divided into baggage units using tow carts in accordance with the relevant provisions of the airport's operating standards. Combined with the relevant data of incoming flights and the baggage handling system, the designed algorithm is used to calculate and allocate the baggage, and the allocation results are compared with the current allocation model.

[0091] The comparison results show that under the system of the present invention, the average waiting time for baggage collection for passengers on all flights is reduced by 42.66% compared with the traditional mode. There are 30 flights with a reduction of more than 50%. In addition, the system performs efficiently and stably during peak hours, indicating that the new method is efficient and feasible.

[0092] The comparison results show that in terms of baggage carousel resource utilization, under the solution of the system of the present invention, baggage carousel resources will be more evenly distributed to inbound flights, thereby achieving the goal of enabling passengers on each flight to collect their luggage faster.

[0093] like Figure 4 As shown in the figure, the present invention, based on the embodiments, has implemented preliminary functional and user interface construction for a passenger baggage information inquiry system. In addition to providing passengers with information on the processing progress of each checked bag, this system also assists passengers in navigating to the baggage carousel and displays the real-time location of their baggage on the carousel. With a simple click, passengers can navigate, precisely locate, and retrieve their baggage, effectively improving the baggage claim experience while ensuring the operability of the new solution.

[0094] The present invention provides a comprehensive, integrated, and intelligent baggage carousel allocation system for civil aviation transport airports. It can meet the needs of reducing the waiting time for passengers to collect their luggage, dynamically monitoring the service status of baggage carousels, balancing the utilization intensity of each carousel, and reducing the walking distance of passengers. At the same time, it can also provide technical support for improving the operating environment of civil aviation airports and enhancing service quality.

[0095] Example 2:

[0096] An electronic device includes a memory and a processor, wherein the memory is used to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the above-mentioned intelligent and flexible airport baggage claim carousel allocation method.

[0097] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the electronic device described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0098] Example 3:

[0099] A computer-readable storage medium stores computer instructions, which implement the steps of the method in Example 1 when executed by a processor.

[0100] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, apparatus, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0101] The present invention is described with reference to the flowcharts and / or block diagrams of the method, terminal device (system), and computer program product according to the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing terminal device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing terminal device generate instructions for implementing the process in the flowchart and / or block diagram. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0102] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing terminal device to operate in a specific manner, so that the instructions stored in the computer readable memory produce a manufactured product including an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0103] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device so that a series of operating steps are executed on the computer or other programmable terminal device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable terminal device to implement the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0104] The above embodiments provide a detailed description of the technical solutions of the present invention. Obviously, the present invention is not limited to the described embodiments. Based on the embodiments of the present invention, those skilled in the art may make various modifications. However, any modifications that are equivalent to or similar to the present invention fall within the scope of protection of the present invention.

[0105] The contents not described in detail in this specification belong to the prior art known to those skilled in the art.

Claims

1. An intelligent and flexible airport baggage claim carousel allocation method, characterized in that: The method comprises: S1: Obtain inbound flight information and airport baggage handling system data; S2: Using a towed trolley as a basic processing unit, the baggage of each incoming flight is divided into baggage units to obtain a collection of baggage units to be processed. A mathematical model is constructed with the goal of balancing the utilization intensity of the baggage carousel and shortening passenger waiting time. S3: Design model solving algorithm; S4: Execute the verification of the mathematical model and the design of the algorithm parameters, and use the designed algorithm to solve the established mathematical optimization model to obtain the destination carousel and processing plan of each baggage unit; S5: The baggage carousel allocation plan and baggage handling process plan obtained are immediately imported into the passenger baggage information service system so that passengers can check the status and progress of their personal baggage information; The objective function of the mathematical optimization model is: ; The constraints of the mathematical optimization model are: ; ; ; ; ; ; （8）； ； ； ； ； in, For luggage unit The set of baggage carousels that can be assigned, is a collection of luggage units, For luggage unit The set of feeding stations that can be assigned, For luggage unit The set of possible pairs of feeding stations and baggage carousels that can be assigned, For the collection of flights, is the set of all baggage batches, For flights The collection of baggage units contained, indexed by For batch The collection of baggage units contained, indexed by ; Weighting parameters for the objective function; For batch The first car arrives at the feeding station moment; For batch The last car arrives at the feeding station moment; The maximum number difference between different baggage carousels that can be allocated to baggage on the same flight; For flights The time of entry; is the starting time of the largest time slice in the studied time period; is the starting time of the minimum time slice in the studied time period; From the feeding station to the baggage carousel The transportation time; intermediate variables: The penalty factor for baggage claim waiting depends on the baggage unit. Number of pieces of luggage and baggage carousels exist The state of the moment; Indicates the relationship between baggage unit and baggage batch. If baggage unit Belong to baggage batch Then take 1, otherwise take 0; ,in Indicates the relationship between baggage unit and baggage batch. If baggage unit Belong to baggage batch Then take 1, otherwise take 0; For feeding stations Luggage unit The service time difference between Indicates the relationship between baggage unit and flight. If baggage unit Flights Then take 1, otherwise take 0; For luggage unit Delivery to baggage carousel The baggage claim time is determined by the baggage unit Number of bags and baggage carousels The status of For luggage carousel Total service time, ; is a 0-1 variable. If the luggage unit exist Baggage feeding starts at time t, and the allocation tuple is selected Then take 1, otherwise take 0; is a 0-1 variable, luggage unit than luggage unit Arrive at the feeding station first Then take 1, otherwise take 0; is a 0-1 variable. If the luggage unit of luggage is sorted to the baggage carousel And in If the moment is extracted, it takes 1, otherwise it takes 0; This is the maximum usage intensity of all baggage carousels; The method of solving the established mathematical optimization model by using the designed algorithm specifically includes: Step 1: The arrival time, retrieval time, and remaining service time of the baggage carousel are collected into data sets. Step 2: Update the remaining service time of all carousels according to the arrival time of the baggage unit at the feeding station; Step 3: Sort the baggage carousel remaining service time dataset from small to large; Step 4: Allocate the baggage unit to the baggage carousel closest to the flight's parking stand with the shortest remaining service time; Step 5: Update the remaining service time of the assigned baggage carousel; Step 6: Repeat steps 2 to 5 until the data set related to the baggage unit to be allocated is cleared; Before each baggage unit is allocated, the remaining service time of the available baggage carousel can be estimated by the number of baggage pieces remaining for service on the baggage carousel.

2. An intelligent and flexible airport baggage claim carousel allocation method as claimed in claim 1, characterized in that: The inbound flight information includes taxi-in time, parking space, baggage quantity, and cargo hold or passenger cabin door opening time; the airport baggage handling system data includes the working status of the baggage feeding station or the baggage carousel.

3. The intelligent and flexible airport baggage claim carousel allocation method according to claim 2, characterized in that: The towing trolley is regarded as a basic processing unit, and specifically includes: each basic unit is the luggage loaded on the towing trolley, that is, a luggage unit; the allocation result and processing process of a luggage unit are the same and unique.

4. The intelligent and flexible airport baggage claim carousel allocation method according to claim 3, characterized in that: The same flight includes one or more baggage units. Different baggage units can be assigned to different baggage claim carousels. Passengers can use the baggage information service system to query their personal baggage handling results and progress.

5. The intelligent and flexible airport baggage claim carousel allocation method according to claim 4, characterized in that: The luggage claiming time of the luggage unit is obtained by investigating or fitting luggage piece data.

6. An electronic device, characterized in that: The invention comprises a memory and a processor, wherein the memory is used to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement an intelligent and flexible airport baggage claim carousel allocation method as described in any one of claims 1 to 5.

7. A readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the intelligent and flexible airport baggage claim carousel allocation method as claimed in any one of claims 1 to 5 are implemented.

Images