Skip to main content

2015 | OriginalPaper | Buchkapitel

A Container Bin Packing Algorithm for Multiple Objects

verfasst von : Fei Luo, Chunhua Gu, Xu Fang, Yi Tang

Erschienen in: Intelligent Computing Theories and Methodologies

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Literatur
1.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat Yao, A.C.-C.: New algorithms for bin packing. J. ACM 27, 207–227 (1980)CrossRef Yao, A.C.-C.: New algorithms for bin packing. J. ACM 27, 207–227 (1980)CrossRef
15.
Zurück zum Zitat 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.
Zurück zum Zitat 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.
Zurück zum Zitat 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)
Metadaten
Titel
A Container Bin Packing Algorithm for Multiple Objects
verfasst von
Fei Luo
Chunhua Gu
Xu Fang
Yi Tang
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-22186-1_12