Luggage pallet truck optimization method for reducing airport operation cost
Through a hybrid integer linear planning model based on the spatiotemporal network model, the service path of ground handlers in the airport is optimized, and the problems of high operating costs and low efficiency in the ground handlers in the optimization of scheduling and optimization of ground handlers are solved, and the efficient operation and cost reduction of luggage check-in services are achieved.
Patent Information
- Application Number
- CN202411159714.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-22
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2044-08-22
AI Technical Summary
Due to the huge scale of ground vehicle scheduling optimization problems in airport ground service, the traditional method is slow to solve, resulting in high operating costs and lack of effective overall optimization solutions.
Adopting a hybrid integer linear programming model based on the spatiotemporal network model, the optimization goal is to minimize the operating cost of luggage tow trucks and delay penalty for freight tasks. By building a spatiotemporal network for airport cargo transportation, a collection of driving arcs and stationary arcs are generated, and the output is optimal. Vehicle service paths and luggage trailer number allocation.
It improves the operation efficiency of luggage check-in services, reduces airport operation costs, ensures the normal operation of flight loading and unloading tasks, and provides an overall coordinated allocation plan for ground vehicle dispatch.
Smart Images

Figure CN119067279A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of airport ground vehicle dispatching, and in particular to a luggage trolley optimization method for reducing airport operation costs. Background Art
[0002] As the demand for air travel continues to grow, airports around the world have become busier and more crowded, resulting in flight delays and serious economic losses. As a key link in the operation of the entire airport system, the operating efficiency of airport ground services directly determines the efficiency of flight turnover. However, the ground services of many airports are complicated and lack a coordinated optimization plan, resulting in low cargo loading and unloading efficiency and high operating costs of ground service vehicles. At present, a feasible strategy is to use flight schedule data to improve the efficiency of airport ground services and achieve scientific cargo loading and unloading services.
[0003] At present, there are few studies on the optimal scheduling of airport ground handling vehicles. Most studies build mathematical programming models based on the classic vehicle routing problem and time window model (VRPTW). However, the traditional method takes too long to solve and can only be optimized through heuristic algorithms. The ground handling vehicle scheduling optimization problem can be naturally expressed as a vehicle routing problem (VRP), but the problem is large in scale, resulting in a slow solution speed. Therefore, most of the research on ground handling vehicle scheduling focuses on building a scheduling optimization model through VRP and developing heuristic algorithms to optimize the solution. Few studies have built scheduling optimization models from the perspective of spatiotemporal networks.
[0004] Therefore, the present invention provides a baggage trolley optimization method for reducing airport operating costs, so as to dynamically meet ground vehicle scheduling needs, thereby improving ground service efficiency and reducing operating costs. Summary of the invention
[0005] The present invention provides a luggage trolley optimization method for reducing airport operating costs, aiming to coordinately allocate ground services for aircraft loading and unloading tasks and output ground vehicle scheduling paths.
[0006] The purpose of the present invention can be achieved by the following technical solutions:
[0007] The luggage trolley optimization method for reducing airport operating costs provided by the present invention comprises the following steps:
[0008] S1. Basic data input:
[0009] a1. Read airport basic data;
[0010] a2. Initialize the number of luggage trailers and luggage pallets in each garage;
[0011] S2. Basic data processing:
[0012] b1. Identify potential conflicts in cargo transportation tasks;
[0013] b2. Generate aircraft cargo transportation schedule;
[0014] b3. Constructing a spatiotemporal network for airport cargo transportation;
[0015] b4. Generate a driving arc set and a stationary arc set;
[0016] S3, path optimization solution:
[0017] A mixed integer linear programming model for the optimization of airport baggage trolley scheduling based on a spatiotemporal network model is constructed. The optimization goal is to minimize the baggage trolley operating cost and the delay penalty of freight tasks, and output the optimal solution, including the baggage trolley service path and the number of baggage trolleys and trolleys allocated to each path.
[0018] S4. Result visualization output:
[0019] The optimized luggage trolley service routes are displayed in the airport space-time network diagram, and the routes that require a large number of luggage trolleys are marked.
[0020] Preferably, in step S1, the airport basic data to be read includes terminal location information, apron location information, luggage trolley garage location information, airport flight service schedule, the quantity of cargo transported on each flight, the departure point-destination of the cargo transportation task, the allowed loading time and expected end time and the latest end time of the cargo transportation task.
[0021] Preferably, in step S2, the basic data processing specifically includes:
[0022] Identify potential conflicts in cargo transportation tasks: When a luggage trolley performs a task, there is a theoretical minimum transportation time from the starting point to the destination. If the completion time specified by the cargo transportation task is lower than this minimum transportation time, the task is considered infeasible in actual operation;
[0023] Generate an aircraft cargo transportation schedule and anchor the start-end time of each task: Generate an aircraft cargo transportation schedule between the origin and destination of the cargo transportation task based on the allowed loading time and expected end time of the cargo transportation task, so as to prepare for the subsequent route optimization selection;
[0024] Constructing the spatiotemporal network of airport cargo transportation: Based on the basic data of the airport, the parking spaces of a specific cluster are constructed into an apron node. The aircraft capacity of each apron node is the number of parking spaces. At the same time, the terminal building node and the baggage trolley garage node are included to construct the spatiotemporal network of airport cargo transportation;
[0025] Generate a set of driving arcs and a set of stationary arcs: The stationary arc represents the process of a luggage trolley being parked at rest. Each stationary arc is vertically upward and spans one time step. A double for loop is used to generate a set of stationary arcs. The driving arc represents the movement of the luggage trolley and luggage between the apron node and the terminal node. Each driving arc points diagonally upward. The time span is related to the node distance. A double for loop with judgment is used to generate a set of moving arcs.
[0026] Preferably, in the path optimization solution of step S3, the path optimization model objective function includes:
[0027] A mixed integer linear programming model for optimizing airport baggage trolley scheduling based on a spatiotemporal network model is constructed. The optimization goal is to minimize the operating cost of ground handling vehicles and the delay penalty of freight tasks:
[0028]
[0029] in, represents the cost per unit time of the luggage trailer traveling on the travel arc a, represents the cost per unit time of dragging a single luggage carriage on the driving arc a, It represents the cost per unit time of dragging a unit luggage package on the driving arc a;
[0030] represents the cost per unit time of the baggage trailer staying on the stationary arc a, represents the cost per unit time of the luggage carriage staying on the stationary arc a;
[0031] represents the delay cost of task j on travel arc a. If the end point of travel arc a is after the expected delivery time of task j, then otherwise
[0032] Preferably, in the path optimization solution of step S3, the path optimization model constraints include:
[0033]
[0034]
[0035] Where D is the collection of garages (designated storage points for luggage trailers and luggage pallets),
[0036] M is the terminal collection;
[0037] P is the apron assembly;
[0038] is the union of the two arcs (for simplicity, the working arc can be ignored and it is assumed that loading and unloading are completed quickly);
[0039] is a stationary arc set;
[0040] is a stationary arc set;
[0041] Assemble for loading and unloading tasks;
[0042] q j The number of packages packed for task j (each package fits exactly one flat panel);
[0043] r j ,s j are the starting point and arrival point of task j, and Indicates loading; and Indicates unloading;
[0044] is the earliest start time (allowed for loading), expected end time (exceeding it will result in delay penalty), and the latest end time (exceeding it is unacceptable) of task j, and, and It should exceed the time span of the driving arc between the two places;
[0045] is the number of luggage trailers and luggage pallets initially stored in garage d;
[0046] p is the maximum number of flatbed trucks that a lead truck can tow;
[0047] Among them, constraints (1) ensure that the flow conservation of ground vehicles at the garage space-time nodes is met, (2) ensure that the flow conservation of flatbed trucks at the garage space-time nodes is met, (3) ensure that the flow conservation of ground vehicles at the terminal and apron space-time nodes is met, (4) ensure that the flow conservation of flatbed trucks at the terminal and apron space-time nodes is met, (5) ensure that the flow conservation of luggage packages at the terminal and apron space-time nodes is met, and (6) is to ensure that on the driving arc, the ground vehicle tows at most p flatbed trucks, each of which is loaded with one piece of luggage.
[0048] Preferably, in step S4, the result visualization output is specifically:
[0049] d1. Output the path optimization results, including the objective function results, the optimized paths of ground handling vehicles and flatbed trucks;
[0050] d2. Display the optimized baggage trolley path and baggage pallet path in the airport space-time network diagram.
[0051] Compared with the related art, the luggage trolley optimization method for reducing airport operating costs provided by the present invention has the following beneficial effects:
[0052] The present invention provides a luggage trolley optimization method for reducing airport operating costs. From the perspective of ensuring the operation of airport flight loading and unloading tasks and reducing the operating costs of luggage trolleys, a luggage trolley scheduling optimization model is constructed, and a luggage trolley service path is generated in an airport space-time network diagram. The overall coordinated allocation of luggage trolley scheduling is provided, which helps to ensure the normal operation of flight loading and unloading and improve the operating efficiency of baggage consignment services. BRIEF DESCRIPTION OF THE DRAWINGS
[0053] Figure 1 A schematic flow chart of a luggage trolley optimization method for reducing airport operating costs provided by the present invention;
[0054] Figure 2 It is a bird's-eye view of the airport in a specific embodiment of the present invention, including the path optimization result;
[0055] Figure 3 The driving path of the lead vehicle in the time-space network diagram in a specific embodiment of the present invention;
[0056] Figure 4 The driving path of the trailer in the time-space network diagram according to a specific embodiment of the present invention;
[0057] Figure 5 The service path of each task in the time-space network diagram of the specific embodiment of the present invention;
[0058] Figure 6 It is a schematic diagram of a driving arc set and a stationary arc set generated in a specific embodiment of the invention. DETAILED DESCRIPTION
[0059] The present invention will be further described below in conjunction with the accompanying drawings and implementation modes.
[0060] like Figure 1 As shown, a luggage trolley optimization method for reducing airport operating costs includes the following steps:
[0061] S1. Basic data input: read the airport basic data, including the location information of the terminal building, the location information of the apron, the location information of the baggage pallet garage, the airport flight service schedule, the quantity of cargo transported by each flight, the departure point-destination of the cargo transportation task, the allowed loading time and the expected end time of the cargo transportation task, and initialize the number of vehicles and pallets in each garage;
[0062] S2. Basic data processing: Identify potential conflicts in cargo transportation tasks; generate an aircraft cargo transportation schedule and anchor the start-end time of each task; construct an airport cargo transportation spatiotemporal network based on the spatiotemporal network model, and generate corresponding travel arc sets and stationary arc sets for each pair of terminal spatiotemporal nodes and apron spatiotemporal nodes, apron spatiotemporal nodes and garage spatiotemporal nodes, and garage spatiotemporal nodes and terminal spatiotemporal nodes according to the travel arc and stationary arc classification algorithm;
[0063] S3. Path optimization solution: Construct a mixed integer linear programming model for the optimization of airport baggage trolley scheduling based on the spatiotemporal network model. The optimization goal is to minimize the baggage trolley operating cost and the delay penalty of freight tasks, and output the optimal solution, including the baggage trolley service path and the number of baggage trolleys and trolleys allocated to each path;
[0064] S4. Result visualization output: The optimized luggage trolley service paths are displayed in the airport space-time network diagram, and the paths that require a large number of luggage trolleys are marked.
[0065] In step S1, basic data is input, and the specific process is as follows:
[0066] Step 1.1: Read the road network data of Shanghai Pudong International Airport, including the terminal building nodes, apron nodes, and luggage trolley garage nodes; read the flight service schedule of Shanghai Pudong Airport, including the quantity of cargo transported by each flight, the departure point-destination of the cargo transportation task, the allowed loading time and the expected end time and the latest end time of the cargo transportation task;
[0067] Step 1.2: Initialize the number of luggage trailers and luggage pallets in each garage of the garage node. Here, each garage is initialized to have 20 luggage trailers and 60 luggage pallets;
[0068] Step 1.3: Multiple parking stands with close locations are constructed into an apron node. The aircraft capacity of each apron node is the number of parking stands. The number of arriving flights at each apron node is the sum of the number of flights at each parking stand. An airport loading and unloading network is constructed. The example data used in the present invention are shown in Tables 1 and 2.
[0069] Table 1
[0070]
[0071] Table 2
[0072]
[0073] In step S2, basic data processing, the specific process is as follows:
[0074] Step 2.1: Identify potential conflicts in cargo transportation tasks: When the luggage trolley performs the task, there is a theoretical minimum transportation time from the starting point to the destination. If the completion time specified in the cargo transportation task is lower than this minimum transportation time, the task is considered infeasible in actual operation;
[0075] Step 2.2: Generate an aircraft cargo transportation schedule: Generate an aircraft cargo transportation schedule between the origin and destination of the cargo transportation task based on the allowed loading time and the expected end time and the latest end time of the cargo transportation task, so as to prepare for the subsequent route optimization selection;
[0076] Step 2.3: Construct the airport cargo transportation spatiotemporal network: Based on the airport basic data, the parking spaces of a specific cluster are constructed into an apron node. The aircraft capacity of each apron node is the number of parking spaces. At the same time, the terminal building node and the ground service garage node are included to construct the airport cargo transportation spatiotemporal network, such as Figure 3 As shown;
[0077] Step 2.4: Generate a set of driving arcs and a set of stationary arcs: The stationary arc represents the process of ground handling vehicles being parked at rest. Each stationary arc is vertically upward and spans one time step. A double for loop is used to generate a set of stationary arcs. The driving arc represents the movement of ground handling vehicles, pallet trucks, and luggage between the apron nodes and the terminal building nodes. Each driving arc points diagonally upward, and the time span is related to the node distance. A double for loop with judgment is used to generate a set of moving arcs, as follows Figure 6 shown.
[0078] In step S3, the path optimization solution is performed, and the specific process is as follows:
[0079] Step 3.1: The path optimization model objective function includes the following:
[0080] A mixed integer linear programming model for optimizing airport baggage trolley scheduling based on a spatiotemporal network model is constructed. The optimization goal is to minimize the operating cost of ground handling vehicles and the delay penalty of freight tasks:
[0081]
[0082] in, represents the cost per unit time of the luggage trailer traveling on the travel arc a, represents the cost per unit time of dragging a single luggage carriage on the driving arc a, It represents the cost per unit time of dragging a unit luggage package on the driving arc a;
[0083] represents the cost per unit time of the baggage trailer staying on the stationary arc a, represents the cost per unit time of the luggage carriage staying on the stationary arc a;
[0084] represents the delay cost of task j on travel arc a. If the end point of travel arc a is after the expected delivery time of task j, then otherwise
[0085] Step 3.2: The path optimization model constraints include the following:
[0086]
[0087] Where D is the collection of garages (designated storage points for luggage trailers and luggage pallets),
[0088] M is the terminal collection;
[0089] P is the apron assembly;
[0090] is the union of the two arcs (for simplicity, the working arc can be ignored and it is assumed that loading and unloading are completed quickly);
[0091] is a stationary arc set;
[0092] is a stationary arc set;
[0093] Assemble for loading and unloading tasks;
[0094] q j The number of packages packed for task j (each package fits exactly one flat panel);
[0095] r j ,s j are the starting point and arrival point of task j, and Indicates loading; and Indicates unloading;
[0096] is the earliest start time (allowed for loading), expected end time (exceeding it will result in delay penalty), and the latest end time (exceeding it is unacceptable) of task j, and, and It should exceed the time span of the driving arc between the two places;
[0097] is the number of luggage trailers and luggage pallets initially stored in garage d;
[0098] p is the maximum number of flatbed trucks that a lead truck can tow;
[0099] Among them, constraints (1) ensure that the flow conservation of luggage trolleys at the garage space-time nodes is met, (2) ensure that the flow conservation of luggage trolleys at the garage space-time nodes is met, (3) ensure that the flow conservation of luggage trolleys at the terminal and apron space-time nodes is met, (4) ensure that the flow conservation of luggage trolleys at the terminal and apron space-time nodes is met, (5) ensure that the flow conservation of luggage parcels at the terminal and apron space-time nodes is met, and (6) is to ensure that on the driving arc, the luggage trolley tows at most p luggage trolleys, each trolley is loaded with one piece of luggage.
[0100] In step S4, the results are visualized and output. The specific process is as follows:
[0101] Step 4.1: Output the luggage trolley scheduling optimization results, including the objective function result and the optimized luggage trolley service path;
[0102] Step 4.2: Display the optimized luggage trolley service path in the airport space-time network diagram, including the luggage trolley's driving path to the apron to serve the aircraft and the optimized paths of the luggage trolleys following different luggage trolleys;
[0103] Attached Figure 3 , 4 5 shows the schematic diagram of the path optimization result of the example in the present invention, which details the luggage trolley service path and the optimized path of the luggage trolley. These paths are calculated by the spatiotemporal network model, aiming to provide accurate planning time for airport baggage check-in services;
[0104] The preferred specific embodiments of the present invention are described in detail above. It should be understood that a person skilled in the art can make many modifications and changes based on the concept of the present invention without creative work. Therefore, any technical solution that can be obtained by a person skilled in the art through logical analysis, reasoning or limited experiments based on the concept of the present invention on the basis of the prior art should be within the scope of protection determined by the claims.
Claims
1. A luggage trolley optimization method for reducing airport operating costs, characterized in that: The steps include: S1. Basic data input: a1. Read airport basic data; a2. Initialize the number of luggage trailers and luggage pallets in each garage; S2. Basic data processing: b1. Identify potential conflicts in cargo transportation tasks; b2. Generate aircraft cargo transportation schedule; b3. Constructing a spatiotemporal network for airport cargo transportation; b4. Generate a driving arc set and a stationary arc set; S3, path optimization solution: A mixed integer linear programming model for the optimization of airport baggage trolley scheduling based on a spatiotemporal network model is constructed. The optimization goal is to minimize the baggage trolley operating cost and the delay penalty of freight tasks, and output the optimal solution, including the baggage trolley service path and the number of baggage trolleys and trolleys allocated to each path. S4. Result visualization output: The optimized luggage trolley service routes are displayed in the airport space-time network diagram, and the routes that require a large number of luggage trolleys are marked.
2. The luggage trolley optimization method for reducing airport operating costs according to claim 1, characterized in that: In step S1, the airport basic data to be read includes terminal location information, apron location information, luggage trolley garage location information, airport flight service schedule, the quantity of cargo transported on each flight, the departure point-destination of the cargo transportation task, the allowed loading time and expected end time of the cargo transportation task, and the latest end time.
3. The luggage trolley optimization method for reducing airport operating costs as claimed in claim 1, characterized in that: In step S2, the basic data processing specifically includes: Identify potential conflicts in cargo transportation tasks: When a luggage trolley performs a task, there is a theoretical minimum transportation time from the starting point to the destination. If the completion time specified by the cargo transportation task is lower than this minimum transportation time, the task is considered infeasible in actual operation; Generate an aircraft cargo transportation schedule and anchor the start-end time of each task: Generate an aircraft cargo transportation schedule between the origin and destination of the cargo transportation task based on the allowed loading time and expected end time of the cargo transportation task, so as to prepare for the subsequent route optimization selection; Constructing the spatiotemporal network of airport cargo transportation: Based on the basic data of the airport, the parking spaces of a specific cluster are constructed into an apron node. The aircraft capacity of each apron node is the number of parking spaces. At the same time, the terminal building node and the baggage trolley garage node are included to construct the spatiotemporal network of airport cargo transportation; Generate a set of driving arcs and a set of stationary arcs: The stationary arc represents the process of a luggage trolley being parked at rest. Each stationary arc is vertically upward and spans one time step. A double for loop is used to generate a set of stationary arcs. The driving arc represents the movement of the luggage trolley and luggage between the apron node and the terminal node. Each driving arc points diagonally upward. The time span is related to the node distance. A double for loop with judgment is used to generate a set of moving arcs.
4. The luggage trolley optimization method for reducing airport operating costs as claimed in claim 1, characterized in that: In the path optimization solution of step S3, the path optimization model objective function includes: A mixed integer linear programming model for optimizing airport baggage trolley scheduling based on a spatiotemporal network model is constructed. The optimization goal is to minimize the operating cost of ground handling vehicles and the delay penalty of freight tasks: in, represents the cost per unit time of the luggage trailer traveling on the travel arc a, represents the cost per unit time of dragging a single luggage carriage on the driving arc a, It represents the cost per unit time of dragging a unit luggage package on the driving arc a; represents the cost per unit time of the baggage trailer staying on the stationary arc a, represents the cost per unit time of the luggage carriage staying on the stationary arc a; represents the delay cost of task j on travel arc a. If the end point of travel arc a is after the expected delivery time of task j, then otherwise 5. The luggage trolley optimization method for reducing airport operating costs as claimed in claim 4, characterized in that: In the path optimization solution of step S3, the path optimization model constraints include: Where D is the collection of garages (designated storage points for luggage trailers and luggage pallets), M is the terminal collection; P is the apron assembly; is the union of the two arcs (for simplicity, the working arc can be ignored and it is assumed that loading and unloading are completed quickly); is a stationary arc set; is a stationary arc set; Assemble for loading and unloading tasks; q j The number of packages packed for task j (each package fits exactly one flat panel); r j ,s j are the starting point and arrival point of task j, and Indicates loading; and Indicates unloading; is the earliest start time (allowed for loading), expected end time (exceeding it will result in delay penalty), and the latest end time (exceeding it is unacceptable) of task j, and, and It should exceed the time span of the driving arc between the two places; is the number of luggage trailers and luggage pallets initially stored in garage d; p is the maximum number of flatbed trucks that a lead truck can tow; Among them, constraints (1) ensure that the flow conservation of ground vehicles at the garage space-time nodes is met, (2) ensure that the flow conservation of flatbed trucks at the garage space-time nodes is met, (3) ensure that the flow conservation of ground vehicles at the terminal and apron space-time nodes is met, (4) ensure that the flow conservation of flatbed trucks at the terminal and apron space-time nodes is met, (5) ensure that the flow conservation of luggage packages at the terminal and apron space-time nodes is met, and (6) is to ensure that on the driving arc, the ground vehicle tows at most p flatbed trucks, each of which is loaded with one piece of luggage.
6. The luggage trolley optimization method for reducing airport operating costs as claimed in claim 1, characterized in that: In step S4, the result visualization output is specifically: d1. Output the path optimization results, including the objective function results, the optimized paths of ground handling vehicles and flatbed trucks; d2. Display the optimized baggage trolley path and baggage pallet path in the airport space-time network diagram.
Citation Information
Patent Citations
HTCPN-based airport tractor dynamic optimization scheduling method
CN111310383A
Task allocation and conflict-free path planning method for pull-type multi-AGV system
CN111459108A
Robust optimization method for airport resource scheduling
CN114358446A
Unmanned and unmanned coexisting airport ferry vehicle scheduling method
CN117593873A
Airport support vehicle path optimization method, system, equipment and medium
CN117933510A
