Skip to main content
SpringerLink
Log in

Analysis of Heuristics for Vector Scheduling and Vector Bin Packing

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14286))

Included in the following conference series:

  • 458 Accesses

Abstract

Fundamental problems in operational research are vector scheduling and vector bin packing where a set of vectors or items must be packed into a fixed set of bins or a minimum number of bins such that, in each bin, the sum of the vectors does not exceed the bin’s vector capacity. They have many applications such as scheduling virtual machines in compute clouds where the virtual and physical machines can be regarded as items and bins, respectively. As vector scheduling and vector bin packing are NP-hard, no efficient exact algorithms are known.

In this paper we introduce new heuristics and provide the first extensive evaluation of heuristics and algorithms for vector scheduling and bin packing including several heuristics from the literature. The new heuristics are a local search algorithm, a game-theoretic approach and a best-fit heuristic. Our experiments show a general trade-off between running time and packing quality. The new local search algorithm outperforms almost all other heuristics while maintaining a reasonable running time.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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. Bansal, N., Oosterwijk, T., Vredeveld, T., van der Zwaan, R.: Approximating vector scheduling: almost matching upper and lower bounds. Algorithmica 76, 1077–1096 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brandão, F., Pedroso, J.P.: Bin packing and related problems: general arc-flow formulation with graph compression. Comput. Oper. Res. 69, 56–67 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  3. Buljubašić, M., Vasquez, M.: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Comput. Oper. Res. 76, 12–21 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  4. Caprara, A., Toth, P.: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret. Appl. Math. 111(3), 231–262 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput. 33(4), 837–851 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9–15 (1962)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  8. Gurobi Optimization Inc.: Gurobi Optimizer (2022)

    Google Scholar 

  9. Heßler, K., Gschwind, T., Irnich, S.: Stabilized branch-and-price algorithms for vector packing problems. Eur. J. Oper. Res. 271(2), 401–419 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  10. IBM: IBM ILOG CPLEX Optimizer (2022)

    Google Scholar 

  11. Irving, R.W.: An efficient algorithm for the stable roommates problem. J. Algorithms 6(4), 577–595 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kou, L.T., Markowsky, G.: Multidimensional bin packing algorithms. IBM J. Res. Dev. 21(5), 443–448 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kulik, A., Mnich, M., Shachnai, H.: An Asymptotic (4/3+\(\epsilon \))-approximation for the 2-dimensional Vector Bin Packing Problem. preprint arXiv:2205.12828 (2022)

  14. Mannai, F., Boulehmi, M.: A guided tabu search for the vector bin packing problem. In: The 2018 International Conference of the African Federation of Operational Research Societies (AFROS 2018) (2018)

    Google Scholar 

  15. Masson, R., et al.: An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst. Appl. 40(13), 5266–5275 (2013)

    Article  Google Scholar 

  16. Pandit, D., Chattopadhyay, S., Chattopadhyay, M., Chaki, N.: Resource allocation in cloud using simulated annealing. In: 2014 Applications and Innovations in Mobile Computing (AIMoC), pp. 21–27. IEEE (2014)

    Google Scholar 

  17. Panigrahy, R., Talwar, K., Uyeda, L., Wieder, U.: Heuristics for vector bin packing. research. microsoft. com (2011)

    Google Scholar 

  18. Sadiq, M.S., Shahid, K.S.: Optimal multi-dimensional vector bin packing using simulated evolution. J. Supercomput. 73(12), 5516–5538 (2017)

    Article  Google Scholar 

  19. Sandeep, S.: Almost optimal inapproximability of multidimensional packing problems. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 245–256. IEEE (2022)

    Google Scholar 

  20. Wilcox, D., McNabb, A., Seppi, K.: Solving virtual machine packing with a reordering grouping genetic algorithm. In: 2011 IEEE Congress of Evolutionary Computation (CEC), pp. 362–369. IEEE (2011)

    Google Scholar 

  21. Woeginger, G.J.: There is no asymptotic PTAS for two-dimensional vector packing. Inf. Process. Lett. 64(6), 293–297 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wood, T., Shenoy, P.J., Venkataramani, A., Yousif, M.S.: Black-box and gray-box strategies for virtual machine migration. In: 4th Symposium on Networked Systems Design and Implementation (NSDI). USENIX (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Loughborough University, Loughborough, UK

    Lars Nagel & Ze Wang

  2. iC-Haus GmbH, Bodenheim, Germany

    Nikolay Popov

  3. Fulda University of Applied Science, Fulda, Germany

    Tim Süß

Authors
  1. Lars Nagel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikolay Popov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tim Süß
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ze Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lars Nagel .

Editor information

Editors and Affiliations

  1. InsideOpt, Dover, DE, USA

    Meinolf Sellmann

  2. Bielefeld University, Bielefeld, Germany

    Kevin Tierney

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nagel, L., Popov, N., Süß, T., Wang, Z. (2023). Analysis of Heuristics for Vector Scheduling and Vector Bin Packing. In: Sellmann, M., Tierney, K. (eds) Learning and Intelligent Optimization. LION 2023. Lecture Notes in Computer Science, vol 14286. Springer, Cham. https://doi.org/10.1007/978-3-031-44505-7_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-44505-7_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-44504-0

  • Online ISBN: 978-3-031-44505-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation