Skip to main content
SpringerLink
Log in

A heuristic algorithm for cube packing with time schedule

  • Research Papers
  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

Packing problem has been proved to be an NP-hard problem. Many algorithms such as simulation annealing algorithm, genetic algorithm and other heuristic algorithms have been proposed to solve two-dimensional and three-dimensional packing problem. To solve the cube packing problem with time schedule, this paper first introduces some concepts such as packing level, space distance and average neighbor birth order and then proposes a greedy algorithm. The algorithm tries every feasible corner greedily to calculate the space utilization, packing level, space distance, average neighbor birth order of this placement, and chooses the best placement according to these criteria. Theoretical analysis indicates that the time complexity of this algorithm is O(A 2 B 2 C 2 T 2 n 5). The experiments show that the average space utilization of non-guillotine cutting test cases is 98.81%, and the average space utilization of guillotine cutting test cases achieves 99.87%. Furthermore, optimal solutions of more than half cases are achieved by this algorithm. The experimental results show that this algorithm can solve the problem of cube packing with time schedule effectively and efficiently.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beasley J E. A population heuristic for constrained two-dimensional non-guillotine cutting. Eur J Oper Res, 2004, 156: 601–627

    Article  MATH  MathSciNet  Google Scholar 

  2. Huang W Q, Liu J F. A deterministic heuristic algorithm based on euclidian distance for solving the rectangles packing problem. Chinese J Comput, 2006, 29: 734–739

    Google Scholar 

  3. Teich J, Fekete S P, Schepers J. Compile-time optimization of dynamic hardware reconfigurations. In: Proc PDPTA, Las Vegas, USA, 1999. 1097–1103

  4. Yuh P H, Yang C L, Chang Y W, et al. Temporal floorplanning using 3D-subTCG. In: Proc ASPDAC, Yokohama, Japan, 2004. 723–728

  5. Huang WQ. Quasi-physical and quasi-social method for tackling NP-hard problems. In: Proceedings of the International Workshop on Discrete Mathematics and Algorithms, China. Jinan: Jinan University Press, 1994. 89–91

    Google Scholar 

  6. Huang W Q, Xu R C. Two personification strategies for solving circles packing problem. Sci China Ser F-Inf Sci, 1999, 42: 595–602

    MATH  Google Scholar 

  7. Wu Y L, Huang W Q. An effective quasi-human based heuristic for solving the rectangle packing problem. Eur J Oper Res, 2002, 141: 341–358

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhou Z, Dong S Q, Hong X L, et al. A new approach based on LFF for optimization of dynamic hardware reconfigurations. In: Proc of IEEE Int Symposium on Circuits and Systems, Hong Kong, 2005. 1210–1213

  9. Chen D B, Huang W Q. Greedy algorithm for rectangle-packing problem. Comput Eng, 2007, 33: 160–162

    Google Scholar 

  10. Huang W Q, Zhan S H. A quasi-physical method of solving packing problems. Math Rev Am Math Society, 1982, 82h: 52002

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Software Development Environment, Beihang University, Beijing, 100191, China

    Wei Li, DongChen Jiang & XiangLong Liu

  2. School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, 430074, China

    WenQi Huang

Authors
  1. Wei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. WenQi Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. DongChen Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. XiangLong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, W., Huang, W., Jiang, D. et al. A heuristic algorithm for cube packing with time schedule. Sci. China Ser. F-Inf. Sci. 53, 18–29 (2010). https://doi.org/10.1007/s11432-010-0022-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-0022-z

Keywords

Search

Navigation