Back to Search
Start Over
Two heuristics for the one-dimensional bin-packing problem.
- Source :
- OR Spectrum; Oct2007, Vol. 29 Issue 4, p765-781, 17p, 2 Diagrams, 11 Charts
- Publication Year :
- 2007
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01716468
- Volume :
- 29
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- OR Spectrum
- Publication Type :
- Academic Journal
- Accession number :
- 32854223
- Full Text :
- https://doi.org/10.1007/s00291-006-0071-2