Abstract
In this paper we have proposed two heuristics for the one-dimensional bin-packing problem. One is a hybrid steady-state grouping genetic algorithm, whereas the other is an improved version of Perturbation MBS’ heuristic (Fleszar and Hindi in Comput Oper Res 29:821–839, 2002). A combined approach using these two heuristics gives results which are comparable with the best methods known so far.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alvim ACF, Ribeiro CC, Glover F, Aloise DJ (2004) A hybrid improvement heuristic for the one dimensional bin packing problem. J Heuristics 10:205–229
Bhatia AK, Basu SK (2004) Packing bins using multi-chromosomal genetic representation and better fit heuristic Lecture notes in computer science, vol 3316. Springer, Berlin Heidelberg New York, pp 181–186
Carvalho JMV De (1999) Exact solution of bin packing problem using column generation and branch and bound. Ann Oper Res 86:629–659
Coffman Jr. EG, Garey MR, Johnson DS (1997) Approximation algorithm for bin packing: a survey. In: Hochbaum D (ed) Approximation algorithm for NP-hard problems. PWS Publishing, Boston, pp 46–93
Falkenauer E (1995) Solving equal piles with the grouping genetic algorithm. In: Proceedings of the 6th international conference on genetic algorithms (ICGA 95). Morgan Kaufman, San Matco, pp 492–497
Falkenauer E (1996) A hybrid grouping genetic algorithm for the bin packing. J Heuristics 2:5–30
Fleszar K, Hindi KS (2002) New heuristics for one dimensional bin-packing. Comput Oper Res 29:821–839
Galinier P, Hao JK (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3:379–397
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco
Gupta JND, Ho JC (1999) A new heuristic algorithm for the one-dimensional bin-packing problem. Prod Plan Control 10:598–603
Martello S, Toth P (1990a) Lower bounds and reduction procedures for the bin packing problem. Discrete Appl Math 28:59–70
Martello S, Toth P (1990b) Knapsack problems: algorithms and computer implemnatations. Wiley, Chichester
Scholl A, Klein R, Jurgens C (1997) BISON: a fast hybrid procedure for exactly solving the one dimensional bin packing problem. Comput Oper Res 24:627–645
Schwerin P, Wäscher G (1997) The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. Int Trans Oper Res 4:377–389
Schwerin P, Wäscher G (1999) A new lower bound for the bin-packing problem and its integratin into MTP. Pesquisa Operacional 19:111–129
Wäscher G, Gau T (1996) Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18:131–144
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Singh, A., Gupta, A.K. Two heuristics for the one-dimensional bin-packing problem. OR Spectrum 29, 765–781 (2007). https://doi.org/10.1007/s00291-006-0071-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-006-0071-2