Paper Info
Title
Two heuristics for the one-dimensional bin-packing problem
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.
Year
DOI
Venue
2007
10.1007/s00291-006-0071-2
Or Spektrum
Keywords
Field
DocType
combinatorial optimization · grouping genetic algorithm · heuristic · one-dimensional bin-packing,bin packing,combinatorial optimization,steady state,bin packing problem
Heuristic,Mathematical optimization,Hindi,Algorithm,Combinatorial optimization,Heuristics,Genetic algorithm,Mathematics,Bin packing problem
Journal
Volume
Issue
ISSN
29
4
0171-6468
Citations 
PageRank 
References 
18
1.18
9
Authors
2
Name
Order
Citations
PageRank
Alok Singh120117.15
Ashok K. Gupta2607.32