Skip to main content
Top

2015 | OriginalPaper | Chapter

A Container Bin Packing Algorithm for Multiple Objects

Authors : Fei Luo, Chunhua Gu, Xu Fang, Yi Tang

Published in: Intelligent Computing Theories and Methodologies

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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) 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)
2.
go back to reference 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)MathSciNetCrossRef 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)MathSciNetCrossRef
3.
go back to reference 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)CrossRef 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)CrossRef
4.
go back to reference Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman, New York (1979) Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman, New York (1979)
5.
go back to reference Dosa, G., Tuza, Z., Ye, D.: Bin packing with Largest In Bottom constraint tighter bounds and generalizations. J Comb. Optim. 26, 416–436 (2013)MathSciNetCrossRef Dosa, G., Tuza, Z., Ye, D.: Bin packing with Largest In Bottom constraint tighter bounds and generalizations. J Comb. Optim. 26, 416–436 (2013)MathSciNetCrossRef
6.
go back to reference 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) 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)
7.
go back to reference 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) 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)
8.
go back to reference Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272–314 (1974)CrossRef Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272–314 (1974)CrossRef
9.
go back to reference Demange, M., Grisoni, P., Paschos, V.T.: Differential approximation algorithms for some combinatorial optimization problems. Theor. Comput. Sci. 209, 107–122 (1998)MathSciNetCrossRef Demange, M., Grisoni, P., Paschos, V.T.: Differential approximation algorithms for some combinatorial optimization problems. Theor. Comput. Sci. 209, 107–122 (1998)MathSciNetCrossRef
10.
go back to reference Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Trans. Algorithms 3, 1–24 (2007)MathSciNetCrossRef Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Trans. Algorithms 3, 1–24 (2007)MathSciNetCrossRef
11.
go back to reference Boyar, J., Epstein, L., Levin, A.: Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411, 2572–2580 (2010)MathSciNetCrossRef Boyar, J., Epstein, L., Levin, A.: Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411, 2572–2580 (2010)MathSciNetCrossRef
12.
go back to reference de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + epsilonin linear time. Combinatorica 1(4), 349–355 (1981)MathSciNetCrossRef de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + epsilonin linear time. Combinatorica 1(4), 349–355 (1981)MathSciNetCrossRef
13.
go back to reference Batu, T., Berenbrink, P., Sohler, C.: A sublinear-time approximation scheme forbin packing. Theor. Comput. Sci. 410, 5082–5092 (2009)MathSciNetCrossRef Batu, T., Berenbrink, P., Sohler, C.: A sublinear-time approximation scheme forbin packing. Theor. Comput. Sci. 410, 5082–5092 (2009)MathSciNetCrossRef
14.
15.
go back to reference 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) 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)
16.
go back to reference Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM J. Comput. 30, 1532–1551 (2000)MathSciNetCrossRef Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM J. Comput. 30, 1532–1551 (2000)MathSciNetCrossRef
17.
go back to reference Johnson, D.S.: Near-Optimal Bin Packing Algorithms. Ph.D thesis, MIT, Cambridge, MA (1976) Johnson, D.S.: Near-Optimal Bin Packing Algorithms. Ph.D thesis, MIT, Cambridge, MA (1976)
Metadata
Title
A Container Bin Packing Algorithm for Multiple Objects
Authors
Fei Luo
Chunhua Gu
Xu Fang
Yi Tang
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-22186-1_12

Premium Partner