Stowage optimization method for aviation logistics container

By applying the constrained multi-objective optimization method of IDEA algorithm in the field of aviation logistics, the problem of long time and cost instability caused by relying on personal experience in manual loading is solved, the cargo load capacity and transportation costs are maximized, and the aviation logistics company is enhanced profit.

CN119090041APending Publication Date: 2024-12-06GUILIN UNIVERSITY OF TECHNOLOGY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410976621.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-21
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

The cargo loading process in the existing aviation logistics field mainly relies on manual loading, which leads to long time and unstable costs, making it difficult to maximize profits, and it is impossible to comprehensively consider the various factors of cargo and containers to formulate the optimal loading plan.

Method used

Using the constrained multi-objective optimization method based on IDEA algorithm, combining cargo and transport resource information, a multi-objective optimization model is built, and the optimal loading scheme is obtained through intelligent calculation, taking into account the minimization of time and transportation costs and the maximum load capacity and volume of the cargo To avoid local optimal solutions using infeasible solution repair methods.

Benefits of technology

Obtain a better loading solution in a shorter time, reduce transportation costs, increase profits by at least 10%, and maximize cargo loading and transportation costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090041A_ABST
    Figure CN119090041A_ABST
Patent Text Reader

Abstract

The invention discloses a stowage optimization method for an aviation logistics container, and aims to solve the problems of manual stowage limitation and time consumption in the field of aviation logistics. At present, the number of aviation logistics email is gradually increased, and a traditional manual stowage mode is difficult to ensure that the space utilization rate of a container is maximized and the profit cannot be maximized depending on employee experience. According to the method, an actual problem in the field of aviation logistics is mainly converted into a constrained multi-objective optimization problem, and an intelligent stowage method is constructed. The stowage method mainly considers the minimization of the total cost and the maximization of the loading capacity of the container, the total cost comprises the time cost and the transportation cost, and meanwhile, factors such as the limit constraint of the loading capacity and the maximum volume of the container and the loading requirement of special goods are considered. Mathematical modeling is carried out by utilizing a matlab technology, the system can combine and consider cargo information, container information and various constraint information to intelligently optimize a distribution scheme to give out optimal stowage, and finally, the overall benefit maximization is realized.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of intelligent optimization. According to the actual needs of air logistics, a method for optimizing the loading of air logistics containers is designed. That is, on the premise of meeting the shortest possible time limit, the positions of the goods placed on the containers are reasonably arranged to reduce the transportation cost and time cost of the containers with the maximum loading capacity, thereby maximizing the profits of air logistics companies. Background Art

[0002] At present, in the field of aviation logistics, the process of loading goods onto containers is basically done manually. The manual method mainly combines and matches the goods to be loaded based on the personal experience of employees. With the expansion of scale, the increase in types and the intensification of industry competition, the manual loading method is difficult to ensure the optimal loading plan and thus difficult to achieve near-optimal profits. The main disadvantages are as follows: first, it takes a long time to manually combine and match goods; second, it is impossible to comprehensively consider various factors of goods and containers to formulate the optimal cargo distribution plan, resulting in unstable costs and the problem of unable to maximize profits, which is difficult to meet the needs of the current aviation logistics industry.

[0003] Based on a detailed investigation of air logistics companies, we have developed an air logistics container loading optimization method, which can obtain a better loading solution in the shortest possible time compared to manual allocation, and ultimately maximize profits. According to the survey, an experienced loader takes more than 3 hours to load a narrow-body cargo plane. Compared with manual work, the air logistics container loading optimization method can shorten the time to 10 minutes and increase profits by at least 10%. With the globalization of the economy, there is a huge profit space in the air logistics business. The loading of cargo aircraft containers involves the relevant information of the goods provided by the customer and the transportation resources purchased by the air logistics company. The system mainly considers minimizing costs and maximizing cargo capacity, where the total cost includes time cost and transportation cost, and also considers factors such as the weight and volume of the goods on each container cannot exceed the limit, the remaining transportation capacity, and the loading requirements of special goods. According to different actual needs, the allocation plan obtained through the intelligent optimization of the system gives the optimal loading, and ultimately maximizes the overall benefits. Summary of the invention

[0004] The implementation of the present invention is mainly divided into two parts: establishing a model according to actual needs and optimizing the algorithm.

[0005] 1. Build a model based on actual needs

[0006] The problem of optimizing the loading of aviation logistics containers is similar to the 0-1 knapsack problem. At present, the product considers minimizing the cost and maximizing the amount of cargo loaded under the premise of absolute safety of various indicators and scopes. The cost here includes time cost and transportation cost. At the same time, it is also necessary to consider factors such as the weight and volume of cargo in each flight cannot exceed the limit, the remaining capacity and the loading requirements of special cargo. Of course, if there are other additional or unnecessary requirements, they can also be flexibly added or deleted through the interface.

[0007] 2. Algorithm optimization

[0008] Air logistics container loading optimization is a multi-objective optimization problem with constraints, and each objective is mutually constrained. When improving the performance index of one objective, it is often at the expense of the performance of other objectives. Therefore, there is no solution that can optimize all objectives at the same time. And under the constraints, it is more difficult to explore the optimal solution. When dealing with constrained multi-objective optimization problems, the area that satisfies all constraints is called the feasible area, otherwise it is the infeasible area. Solving this problem usually results in a non-dominated solution set, namely the Pareto solution set. The constrained multi-objective evolutionary algorithm is an algorithm used to solve constrained multi-objective optimization problems. Its main core is to coordinate the relationship between different objective functions, satisfy all constraints, and find a solution set that can make each objective function reach the relatively optimal. The IDEA algorithm (Indicator-Driven Evolutionary Algorithm) is a constrained multi-objective optimization algorithm proposed by team members. Its core is to save high-quality infeasible solutions through three-indicator archives, and use the information of these infeasible solutions to balance the convergence, diversity and feasibility indicators, and finally find the optimal solution. The algorithm has been experimented on multiple constrained multi-objective optimization problems and compared with 7 advanced algorithms. The experiments fully demonstrated the effectiveness of IDEA. The main advantages of the IDEA algorithm include

[0009] 1. Adaptability and robustness: The IDEA algorithm can adaptively adjust the search strategy according to the characteristics of the problem and has strong problem adaptability. It has good robustness in dealing with nonlinear, multimodal, and complex constraint problems.

[0010] 2. Global search capability: The IDEA algorithm uses an unconstrained population for preliminary exploration and uses three-index archiving to explore promising infeasible areas in detail, with good diversity and convergence. It can effectively avoid falling into the local optimal area and help find the global optimal solution or a solution close to the optimal solution.

[0011] 3. Better performance: Compared with other optimization algorithms, the IDEA algorithm has fewer parameters, the effective information of infeasible solutions can be fully utilized, the exploration of the optimal solution is more demanding, and the solution set obtained is better.

[0012] 4. Diversity maintenance: The IDEA algorithm uses indicator-driven population coordination strategy and indicator-driven diversity strategy to maintain diversity in the population and avoid premature convergence and premature falling into local optimal solutions. This helps to increase the search breadth and depth of the algorithm.

[0013] Therefore, the IDEA algorithm is more suitable as a solver for optimizing the loading of aviation logistics containers. Of course, the characteristics of the models built for different actual needs are different, and a more targeted multi-objective evolutionary algorithm can be selected for solving. In addition, considering that genetic algorithms are prone to fall into local optimal solutions, we proposed a simple infeasible solution repair method in the optimization process, so that the population can enter the feasible domain as quickly as possible, and at the same time jump out of the local optimal solution.

[0014] At present, in the field of domestic aviation logistics, the loading of cargo planes is mainly done manually, which is highly dependent on personal experience. It is difficult to ensure the loading plan that maximizes the cargo capacity and minimizes the transportation cost and time cost. Relatively speaking, intelligent loading optimization can ensure that the optimal or near-optimal solution is achieved in a shorter time. Under the premise of ensuring safety, it not only saves time, but also obtains the optimal loading plan through intelligent calculation, thereby reducing transportation costs.

[0015] The advantages of the present invention are:

[0016] At present, in the field of domestic aviation logistics, the loading of cargo planes is mainly done manually, which is highly dependent on personal experience. It is difficult to ensure the loading plan that maximizes the cargo capacity and minimizes the center of gravity offset. Relatively speaking, intelligent loading optimization can ensure that the optimal or near-optimal solution is achieved in a shorter time. Under the premise of ensuring safety, it not only saves time, but also obtains the optimal loading plan through intelligent calculation, thereby reducing transportation costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 is a schematic diagram of the optimized loading process.

[0018] Figure 2 is a schematic diagram of the modeling process.

[0019] Figure 3 is a schematic diagram of the solution process DETAILED DESCRIPTION

[0020] The present invention designs a method for optimizing the loading of aviation logistics containers. The core design of the present invention is to use the relevant information of the goods provided by the customer and the transportation resources purchased by the aviation logistics company, and consider the two main objective factors of minimizing the total cost and maximizing the cargo load (where the total cost includes the air transportation cost and the time cost), and at the same time, take the weight and volume of the cargo in each flight as constraints, the remaining transportation capacity and the loading requirements of special cargo as constraints to construct a constrained multi-objective optimization problem. Finally, the IDEA algorithm is used as a solver for intelligent loading optimization of aviation logistics to obtain the optimal logistics loading plan and maximize profits.

[0021] The specific steps are as follows:

[0022] Step 1: Input cargo information data

[0023] Convert the cargo data in Excel into a .mat file and read it into the matlab buffer.

[0024] Step 2: Modeling

[0025] Set the cargo that can be loaded into the container to 1, and the cargo that cannot be loaded into the container to 0. Suppose there are 3 cargoes a, b, c, and two containers A and B. Then 10 can represent a cargo loaded into container A. There are eight loading schemes: 101010, 101001, 100110, 100101, 011010, 011001, 010110, 010101 (each cargo can only be loaded in one location). At the same time, there is a requirement that cargo can only be loaded into certain containers, so cargo that can be loaded into the container is considered 1, and cargo that cannot be loaded is considered 0. For example, if there are 101011 cargoes (i.e. a and b can only be loaded in A, while c can be loaded in A and B), then after performing dot multiplication, eight loading schemes will be obtained based on the above conditions, namely 101010, 101001, 100010, 100001, 001010, 001001, 000010, 000001. The model contains two objective functions and multiple constraints. The objective functions are the total cost (total cost includes air transport cost and time cost) and the amount of cargo loaded, and the constraints are the weight and volume constraints of each cabin container. The goal of the solution is to find the solution with the minimum total cost and the maximum amount of cargo loaded under the premise of satisfying the constraints.

[0026] Step 3: Solve

[0027] Use IDEA algorithm for optimization solution.

[0028] In the process of generating solutions, the algorithm is prone to fall into local optimality, and a large number of infeasible solutions may be generated. In order to solve faster and jump out of the local optimality, an infeasible solution repair method is proposed. If the generated solution is infeasible, first calculate the weight excess ratio Rw and volume excess ratio Rv of the infeasible solution. If Rw is greater than Rv, first load the goods according to the weight sorting of the goods. If the weight of the goods meets the requirements, then load the goods according to the volume sorting of the goods. If Rv is greater than Rw, first sort by volume and then unload by weight. Then, check the loading status of the goods. If there are goods loaded in multiple containers at the same time, randomly select a container to unload the goods until the goods are loaded in only one container. If a certain cargo is not loaded, load the cargo in order. If all containers cannot be loaded, randomly unload the loaded cargo from the containers that can be loaded with the cargo until the cargo is loaded. When all the cargo has been checked, the infeasible solution repair process ends. If the cargo meets the loading requirements, the infeasible solution repair process can be jumped out in advance.

Claims

1. The method for optimizing loading of aviation logistics containers is characterized by: The air logistics company has the relevant information such as the weight, volume, and special characteristics of the goods, as well as the capacity resources and transportation information purchased by the air logistics company. Different types of cargo boxes are placed on containers of different types. Minimizing the total cost and maximizing the cargo capacity are taken as two optimization goals, where the total cost includes time cost and transportation cost. At the same time, factors such as the weight and volume of the goods in each container cannot exceed the limit and the loading requirements of special goods are taken as constraints to construct a constrained multi-objective optimization problem.

2. The method for optimizing loading of aviation logistics containers according to claim 1, characterized in that: The IDEA algorithm proposed by the team is used as the main optimization method. This method effectively utilizes the information provided by the auxiliary population to ensure the convergence of the population. Through the three-indicator archive population in the algorithm, it effectively utilizes high-quality infeasible solutions to fully explore the target space and ensure diversity.

3. The method for optimizing loading of aviation logistics containers according to claim 1, characterized in that: The weight, volume, and loading requirements of special cargo on the container are taken as constraints, and minimizing transportation costs and maximizing cargo capacity are taken as two optimization goals.

4. The method for optimizing loading of aviation logistics containers according to claim 1, characterized in that: The following steps are involved: SO1: Coding: Set the cargo that can be loaded into the container to 1, and that cannot be loaded into the container to 0; suppose there are 3 cargoes a, b, c, and two containers A and B; then all the relationships between cargoes loaded into containers A and B can be expressed as eight relationships: 101010, 101001, 100110, 100101, 011010, 011001, 010110, 010101; among which 101010 means that the three cargoes can only be loaded into container A; SO2: Use Matlab to perform dot multiplication: Use Matlab software to perform dot multiplication, and you will get eight loading schemes under the above conditions, namely 101010, 101001, 100010, 100001, 001010, 001001, 000010, 000001; SO3: Determine the constraint function and objective function, and establish a constrained multi-objective optimization problem: According to the actual situation, the constraint function is set as the weight and volume constraints of each container; the objective functions of air logistics are established as minimizing the total cost and maximizing the cargo carrying capacity, where the total cost includes time cost and transportation cost; SO4: Optimization solution: Through MATLAB programming, using the IDEA algorithm developed by the team, under the conditions of meeting the above constraints, until the cargo is loaded, find the solution with the minimum total cost and the maximum loading volume, where the total cost includes time cost and transportation cost; When all goods have been checked, the infeasible solution optimization process ends; if the goods meet the loading requirements, the infeasible solution optimization process can be jumped out in advance.