Skip to main content
SpringerLink
Log in

Heuristic/meta-heuristic methods for restricted bin packing problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper addresses a special bin packing problem in which each item can only be assigned to a subset of the bins. We name this problem as the restricted bin packing problem (RBPP). This paper is designed to explore the relationships of RBPP with classic NP-complete problems, and to resolve the restrictions of assignment through heuristic and meta-heuristic algorithms. A new heuristic algorithm named ‘Max-fit Based on Zigzag Sorting with Retained Feasibility’ is proposed. In this heuristic algorithm, a feasibility retaining rule is constructed to assure the assignment of every item; a zigzag sorting method is designed to improve the performance of the algorithm. Our heuristic algorithm is able to generate better results in comparison with existing heuristics. Greedy Randomized Adaptive Search Procedure (GRASP) and Simulated Annealing (SA) are exploited to obtain better solutions for RBPP. A new construction method based on cliques and zigzag sorting are built for GRASP and SA. The proposed methods are shown to have higher efficiency than traditional ones through numeric examples.

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

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Baldi, M.M., De Giovanni, L., Perboli, G., Tadei, R.: The generalized bin packing problem. Transp. Res. Part E Logist. Transp. Rev. 48, 1205–1220 (2012)

    Article  Google Scholar 

  • Blazewicz, J., Ecker, K.: A linear time algorithm for restricted bin packing and scheduling problems. Oper. Res. Lett. 2, 80–83 (1983)

    Article  MathSciNet  Google Scholar 

  • Blazewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11–24 (1993)

    Article  MathSciNet  Google Scholar 

  • Brugger, B., Doerner, K.F., Hartl, R.F., Reimann, M.: Antpacking-an ant colony optimization approach for the one-dimensional bin packing problem. Evolut. Comput. Comb. Optim. 3004, 41–50 (2004)

    MATH  Google Scholar 

  • Christensen, H.I., Khan, A., Pokutta, S., Tetali, P.: Multidimensional bin packing and other related problems: a survey. Comput. Sci. Rev. 24, 63–79 (2017)

    Article  MathSciNet  Google Scholar 

  • Dósa, G., He, Y.: Bin packing problems with rejection penalties and their dual problems. Inf. Comput. 204(5), 795–815 (2006)

    Article  MathSciNet  Google Scholar 

  • Eilon, S., Christofides, N.: The loading problem. Manag. Sci. 17, 259–267 (1971)

    Article  Google Scholar 

  • Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1), 1–24 (2009)

    Google Scholar 

  • Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

    Article  MathSciNet  Google Scholar 

  • Festa, P., Resende, M.G.C.: An annotated bibliography of grasp—part i: algorithms. Int. Trans. Oper. Res. 16(1), 5–30 (2009a)

    Article  Google Scholar 

  • Festa, P., Resende, M.G.C.: An annotated bibliography of grasp—part ii: applications. Int. Trans. Oper. Res. 16(2), 131–172 (2009b)

    Article  MathSciNet  Google Scholar 

  • Gabrel, V.: Scheduling jobs within time windows on identical parallel machines: new model and algorithm. Eur. J. Oper. Res. 83, 230–329 (1995)

    Article  Google Scholar 

  • Garey, M.R., Graham, R.L., Johnson, D.S., Yao, A.C.-C.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory Ser. A 21(3), 257–298 (1976)

    Article  MathSciNet  Google Scholar 

  • Henderson, D., Jacobson, S., Johnson, A.: The theory and practice of simulated annealing. In: Handbook of Metaheuristics, Vol. 4, pp. 287–319. Springer, Boston (2006)

  • Hung, M.S., Brown, J.R.: An algorithm for a class of loading problem. Naval Res. Logist. Q. 25, 289–297 (1978)

    Article  Google Scholar 

  • Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256–278 (1974)

    Article  MathSciNet  Google Scholar 

  • Kirkpatrick, S.: Optimization by simulated annealing: quantitative studies. J. Stat. Phys. 34, 975–986 (1984)

    Article  MathSciNet  Google Scholar 

  • Korf, R.E.: A new algorithm for optimal bin packing. American Association for Artificial Intelligence 2002 Proceedings, pp. 731–736 (2002)

  • Layeb, A., Chenche, S.: A novel grasp algorithm for solving the bin packing problem. Int. J. Inf. Eng. Electron. Bus. 4(2), 8–14 (2012)

    Google Scholar 

  • Martello, S., Toth, P.: Bin-packing problem. In: Knapsack Problems: Algorithms and Computer Implementations, pp. 221– 240. Johnwiley & Sons Ltd, New York, (1990a)

  • Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28, 59–70 (1990b)

    Article  MathSciNet  Google Scholar 

  • Martello, S., Toth, P.: Application of genetic algorithm for the bin packing problem with a new representation scheme. Math. Sci. 4(3), 253–266 (2010)

    MathSciNet  Google Scholar 

  • Zehmakan, A.N.: Bin packing problem: two approximation algorithms. Int. J. Found. Comput. Sci. Technol. 5(4). arXiv preprint arXiv:1508.01376 (2015a)

  • Zehmakan, A.N.: Bin packing problem: a linear constant-space 3/2-approximation algorithm. Int. J. Found. Comput. Sci. Technol. 5(6). arXiv preprint arXiv:1509.06048 (2015b)

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Texas A&M University, College Station, USA

    Yu Fu & Amarnath Banerjee

Authors
  1. Yu Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amarnath Banerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amarnath Banerjee.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fu, Y., Banerjee, A. Heuristic/meta-heuristic methods for restricted bin packing problem. J Heuristics 26, 637–662 (2020). https://doi.org/10.1007/s10732-020-09444-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-020-09444-y

Keywords

Search

Navigation