A tree search loadind algorithm for airport checked baggage
A tree search loadind algorithm for airport checked baggage
- Author(s): C. Shengming 1 ; Z. Wei 2 ; D. Zhaobin 3 ; W. Liwen 4
- DOI: 10.1049/icp.2021.0332
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Thank you
Your recommendation has been sent to your librarian.
- Author(s): C. Shengming 1 ; Z. Wei 2 ; D. Zhaobin 3 ; W. Liwen 4
-
-
View affiliations
-
Affiliations:
1:
College of Aeronautical Engineering , Civil Aviation University of China , Tianjin, China ;
2: College of Aeronautical Engineering, Civil Aviation University of China; CAAC Aviation Special Ground Equipment Research Base; Civil Aviation Key Laboratory of Artificial Intelligence for Airlines , Jinbei Road 2898, Dongli District, Tianjin, China ;
3: Basic Experiment Center , Civil Aviation University of China , Jinbei Road 2898, Dongli District, Tianjin, China ;
4: College of Aeronautical Engineering, Civil Aviation University of China ; CAAC Aviation Special Ground Equipment Research Base Jinbei Road 2898, Dongli District, Tianjin, China
Source:
CSAA/IET International Conference on Aircraft Utility Systems (AUS 2020),
2021
p.
923 – 927
-
Affiliations:
1:
College of Aeronautical Engineering , Civil Aviation University of China , Tianjin, China ;
- Conference: CSAA/IET International Conference on Aircraft Utility Systems (AUS 2020)
- DOI: 10.1049/icp.2021.0332
- ISBN: 978-1-83953-419-5
- Location: Online Conference
- Conference date: 18-21 September 2020
- Format: PDF
The paper aims to study the luggage loading algorithm to solve the labor-intensive and inefficient problems in the current airport checked baggage stacking process. With the container loading of airline luggage as the research object, an efficient container loading algorithm for the registration of airline luggage was proposed. In this algorithm, all the luggages are grouped into strips while two constraints, i.e., full support constraint and orientation constraint are satisfied. A binary tree is created where each tree node denotes a container loading plan. Each leaf node denotes a complete container loading plan. The solution is the strip set whose total volume of the luggages is the greatest among all tree nodes. Experiments were carried out with 36 pieces of real passenger luggages, and the results showed that the layout scheme proposed by the algorithm was reasonable, satisfying the loading stability constraint and filling rate. This algorithm can obtain a good layout scheme under complex constraint conditions and satisfy the loading rate.
Inspec keywords: loading; containers; airports; planning; tree searching
Subjects: Systems theory applications in industry; Goods distribution; Systems theory applications; Combinatorial mathematics; Combinatorial mathematics; Optimisation techniques; Planning