Online Luggage Loading Optimization Based on Improved Particle Swarm Algorithm

ZHANG Chang-yong, ZHANG Qian-qian, ZHAI Yi-ming, LIU Jia-yu

Packaging Engineering ›› 2021 ›› Issue (21) : 200-206.

PDF(37034 KB)
PDF(37034 KB)
Packaging Engineering ›› 2021 ›› Issue (21) : 200-206. DOI: 10.19554/j.cnki.1001-3563.2021.21.028

Online Luggage Loading Optimization Based on Improved Particle Swarm Algorithm

  • ZHANG Chang-yong, ZHANG Qian-qian, ZHAI Yi-ming, LIU Jia-yu
Author information +
History +

Abstract

The work aims to solve the key loading algorithm problem in the automatic loading and unloading of air luggage, realize automatic loading and unloading of air luggage and meet the actual needs of flow operation. Based on the key point loading strategy, an improved particle swarm optimization (PSO) algorithm that considered constraints such as the weight, volume and loading order of luggage was proposed with the utilization of loading space as the optimization objective. Firstly, the key point method was used to output all the point sequences of the bags to be loaded on the pipeline. Then, the speed and position of the particle swarm optimization algorithm were redefined according to the constraint conditions. The space utilization was used as the fitness function for iterative optimization, and the global optimal solution was output to optimize the loading position and attitude. In the experimental part, the real luggage data was used to verify the algorithm. The results showed that the improved particle swarm optimization algorithm could improve the box space utilization by 10.8% and the average layout efficiency by 26.5%. The proposed loading algorithm can effectively solve the actual luggage packing problem, and provide a theoretical basis and reference for the cargo loading of luggage flow process.

Cite this article

Download Citations
ZHANG Chang-yong, ZHANG Qian-qian, ZHAI Yi-ming, LIU Jia-yu. Online Luggage Loading Optimization Based on Improved Particle Swarm Algorithm[J]. Packaging Engineering. 2021(21): 200-206 https://doi.org/10.19554/j.cnki.1001-3563.2021.21.028
PDF(37034 KB)

Accesses

Citation

Detail

Sections
Recommended

/