Air container loading based on improved genetic algorithm

被引:0
|
作者
Zhang C. [1 ]
Zhai Y. [1 ]
机构
[1] College of Electronic Information and Automation, Civil Aviation University of China, Tianjin
来源
Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics | 2021年 / 47卷 / 07期
基金
中国国家自然科学基金;
关键词
Actual constraints; Anthropomorphic loading strategy; Different container types; Improved genetic algorithm; Visualization;
D O I
10.13700/j.bh.1001-5965.2020.0197
中图分类号
学科分类号
摘要
Aimed at the problems of slow convergence speed, premature maturity, and poor optimization results when the standard genetic algorithm solves the loading plan, based on the anthropomorphic loading strategy, an improved genetic algorithm is proposed to maximize the utilization of container space, considering the loading sequence, volume, and quality of the goods, center of gravity, non-overlapping and other practical constraints. First, the real number code combined with the placement state of the goods is used to randomly generate the initial population. Second, the optimal solution preservation strategy is added to the routine selection operation, and the stability, support constraints, and center of gravity constraints are taken into account after linear scale transformation. In the fitness function, the evaluation value of each loading scheme is calculated by this. Finally, the scheme with the highest evaluation value is output as the optimal loading scheme. In the experimental part, the performance test was performed using test cases with different heterogeneity, and then three sets of specific cargo loading data were combined to prove the universality and practicability of the algorithm. The results show that the proposed algorithm has better optimization effect in solving the process of strong heterogeneous cargo loading, and is suitable for solving the container loading problem. Compared with the standard genetic algorithm, the convergence and search speed have been improved. The space utilization of the two different container types has increased by 3.82% and 3.66%, and the running time has been shortened by 7.9 s and 5.58 s. The optimal loading can be found quickly. The solution can effectively solve the problem of cargo packing in regular and irregular containers. At the same time, the visualization of the loading plan is realized based on MATLAB software, which provides a theoretical basis for the real-time loading decision of the container. © 2021, Editorial Board of JBUAA. All right reserved.
引用
收藏
页码:1345 / 1352
页数:7
相关论文
共 18 条
  • [1] RAMOS A G, SILVA E, OLIVEIRA J F., A new load balance methodology for container loading problem in road transportation, European Journal of Operational Research, 266, 3, pp. 1140-1152, (2018)
  • [2] MAXENCE D, MANUEL I., Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems, Informs Journal on Computing, 32, 1, pp. 101-119, (2020)
  • [3] LIU S, SHEN D Y, SHANG X Q, Et al., Multi-layer tree search algorithm for solving three-dimensional packing problem, Journal of Automation, 46, 6, pp. 1178-1187, (2020)
  • [4] LIU S, TAN W, XU Z, Et al., A tree search algorithm for the container loading problem, Computers & Industrial Engineering, 75, pp. 20-30, (2014)
  • [5] ALINE A S, FRANKLINA M B, TOLEDO J, Et al., Irregular packing problems:A review of mathematical models, European Journal of Operational Research, 282, 3, pp. 803-822, (2020)
  • [6] MAURO D, FABIO F, MANUEL I., A branch-and-price algorithm for the temporal bin packing problem, Computers and Operations Research, 114, pp. 1-16, (2020)
  • [7] YU F, AMARNATH B., Heuristic/meta-heuristic methods for restricted bin packing problem, Journal of Heuristics, 26, pp. 637-662, (2020)
  • [8] HE K, HUANG W Q., A deterministic and efficient solution algorithm for the three-dimensional packing problem based on action space, Journal of Computer Science, 37, 8, pp. 1786-1793, (2014)
  • [9] HE K, HUANG W Q, HU Q., Acuity algorithm for solving three-dimensional rectangular boxing problem based on action space, Computer Science, 37, 10, pp. 181-183, (2010)
  • [10] HE K, HUANG W Q., Anthropomorphic algorithm for solving three-dimensional rectangular Packing problems, Science in China:Information Science, 40, 12, pp. 1586-1595, (2010)