Skip to main content
SpringerLink
Log in

A Container Bin Packing Algorithm for Multiple Objects

  • Conference paper
  • First Online:
Intelligent Computing Theories and Methodologies (ICIC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9226))

Included in the following conference series:

  • 1580 Accesses

Abstract

The bin packing problem considered in this paper has the character with items arriving in batches, such as the task dispatching process in the cloud. The problem has two packing objects, one of which is to minimize the number of used bins, and the other is to reduce the packing time. To meet the objects, a container packing algorithm is presented, which consists of rounds of packing. In one round the number of the necessary bins is first calculated, and those bins are opened in batch to pack items in parallel. This round will be iterated until there are no unpacked items. The proposed algorithm is compared with other classical bin packing algorithms through experiments, which have the same property of simplicity for implementation. It is shown that the novel algorithm not only saves the packing time, but also achieves better combined performance than others.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Coffman, E.G., Jr., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin Packing Approximation Algorithms Survey and Classification, Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Boston (2011)

    Google Scholar 

  2. Bergner, M., Caprara, A., Ceselli, A., Furini, F., Lübbecke, M.E., Malaguti, E., Traversi, E.: Mathematical programming algorithms for bin packing problems with item fragmentation. Comput. Oper. Res. 46, 1–11 (2014)

    Article  MathSciNet  Google Scholar 

  3. Burns, A., Davis, R.I., Wang, P., Zhang, F.: Partitioned EDF scheduling for multiprocessors using a C = D task splitting scheme. Real-Time Syst. 48, 3–33 (2012)

    Article  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman, New York (1979)

    Google Scholar 

  5. Dosa, G., Tuza, Z., Ye, D.: Bin packing with Largest In Bottom constraint tighter bounds and generalizations. J Comb. Optim. 26, 416–436 (2013)

    Article  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Approximation algorithm for bin-packing problems: a survey, Analysis and Design of Algorithm. In: Ausiello, G., Lucertini, M. (eds.) Combinatorial Optimization, pp. 147–172. Springer, New York (1981)

    Google Scholar 

  7. Kenyon, C.: Best-fit bin-packing with random order. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms Atlanta, GA, pp. 359–364. ACM/SIAM, Philadelphia (1996)

    Google Scholar 

  8. Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272–314 (1974)

    Article  Google Scholar 

  9. Demange, M., Grisoni, P., Paschos, V.T.: Differential approximation algorithms for some combinatorial optimization problems. Theor. Comput. Sci. 209, 107–122 (1998)

    Article  MathSciNet  Google Scholar 

  10. Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Trans. Algorithms 3, 1–24 (2007)

    Article  MathSciNet  Google Scholar 

  11. Boyar, J., Epstein, L., Levin, A.: Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411, 2572–2580 (2010)

    Article  MathSciNet  Google Scholar 

  12. de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + epsilonin linear time. Combinatorica 1(4), 349–355 (1981)

    Article  MathSciNet  Google Scholar 

  13. Batu, T., Berenbrink, P., Sohler, C.: A sublinear-time approximation scheme forbin packing. Theor. Comput. Sci. 410, 5082–5092 (2009)

    Article  MathSciNet  Google Scholar 

  14. Yao, A.C.-C.: New algorithms for bin packing. J. ACM 27, 207–227 (1980)

    Article  Google Scholar 

  15. Lee, C.C., Lee, D.T.: A new algorithm for on-line bin-packing. In: Technical report 83-03-FC-02, Department of Electrical Engineering and computer Science Northwestern University, Evanston, IL (1983)

    Google Scholar 

  16. Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM J. Comput. 30, 1532–1551 (2000)

    Article  MathSciNet  Google Scholar 

  17. Johnson, D.S.: Near-Optimal Bin Packing Algorithms. Ph.D thesis, MIT, Cambridge, MA (1976)

    Google Scholar 

Download references

Acknowledgement

This paper is supported by the Nature Science Fund of China (NSFC) (No. 61472139) and China Postdoctoral Science Foundation (No. 2013M541487).

Author information

Authors and Affiliations

  1. School of Information and Engineering, East China University of Science and Technology, Shanghai, China

    Fei Luo, Chunhua Gu & Xu Fang

  2. Shanghai ChinaNetCenter Development Co., Ltd., Shanghai, China

    Yi Tang

Authors
  1. Fei Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunhua Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xu Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yi Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fei Luo .

Editor information

Editors and Affiliations

  1. Tongji University, Shanghai, China

    De-Shuang Huang

  2. University of Ulsan, Ulsan, Korea (Republic of)

    Kang-Hyun Jo

  3. Liverpool John Moores University, Liverpool, United Kingdom

    Abir Hussain

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Luo, F., Gu, C., Fang, X., Tang, Y. (2015). A Container Bin Packing Algorithm for Multiple Objects. In: Huang, DS., Jo, KH., Hussain, A. (eds) Intelligent Computing Theories and Methodologies. ICIC 2015. Lecture Notes in Computer Science(), vol 9226. Springer, Cham. https://doi.org/10.1007/978-3-319-22186-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22186-1_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22185-4

  • Online ISBN: 978-3-319-22186-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation