Two heuristics for the one-dimensional bin-packing problem

dc.contributor.author	Singh, Alok
dc.contributor.author	Gupta, Ashok K.
dc.date.accessioned	2022-03-27T06:07:21Z
dc.date.available	2022-03-27T06:07:21Z
dc.date.issued	2007-10-01
dc.description.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. © 2006 Springer-Verlag.
dc.identifier.citation	OR Spectrum. v.29(4)
dc.identifier.issn	01716468
dc.identifier.uri	10.1007/s00291-006-0071-2
dc.identifier.uri	http://link.springer.com/10.1007/s00291-006-0071-2
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9381
dc.subject	Combinatorial optimization
dc.subject	Grouping genetic algorithm
dc.subject	Heuristic
dc.subject	One-dimensional bin-packing
dc.title	Two heuristics for the one-dimensional bin-packing problem
dc.type	Journal. Article
dspace.entity.type

Now showing 1 - 1 of 1