Heuristic Algorithm for Solving the Online Multi-Size Luggage Packing Problem

ZHANG Wei, CHAI Sheng-ming, WANG Wei, CHEN Yu-hao

Packaging Engineering ›› 2021 ›› Issue (21) : 213-221.

PDF(19676 KB)
PDF(19676 KB)
Packaging Engineering ›› 2021 ›› Issue (21) : 213-221. DOI: 10.19554/j.cnki.1001-3563.2021.21.030

Heuristic Algorithm for Solving the Online Multi-Size Luggage Packing Problem

  • ZHANG Wei, CHAI Sheng-ming, WANG Wei, CHEN Yu-hao
Author information +
History +

Abstract

The work aims to study online luggage stacking algorithm to solve the problem that most of the 3D boxing algorithms cannot solve the problem of online airport luggage stacking under the background of air transportation. First of all, a new sequential constraint and online multi-size luggage stacking mathematical model was proposed based on the practical application environment. Then, a rule that was different from traditional online question which only obtained one item at a time was designed. The position of 3D camera for capturing luggage information was changed to get more luggage information in advance. An online heuristic ''packing point'' algorithm was proposed to obtain K luggage size information and construct a combined stacking strategy each time. Finally, 3 pieces of real airport luggage information were gathered at a time for simulation and experiment. The results proved that the stacking layout scheme given by the algorithm could not only ensure the efficient stacking of checked luggage of different sizes in online state, but also obtain the packing rate of 84.86% by the optimized algorithm. Meanwhile, it had other good properties, such like high stacking stability. The stacking layout scheme given by the algorithm is reasonable and has good filling rate. It provides a new direction for the algorithm design of online 3D boxing under the background of air transportation.

Cite this article

Download Citations
ZHANG Wei, CHAI Sheng-ming, WANG Wei, CHEN Yu-hao. Heuristic Algorithm for Solving the Online Multi-Size Luggage Packing Problem[J]. Packaging Engineering. 2021(21): 213-221 https://doi.org/10.19554/j.cnki.1001-3563.2021.21.030
PDF(19676 KB)

Accesses

Citation

Detail

Sections
Recommended

/