A heuristic procedure for one dimensional bin packing problem with additional constraints

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/1818

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kumar, Satyendra
dc.contributor.author	Rao, V. Venkata
dc.contributor.author	Tirupati, Devanath
dc.date.accessioned	2010-03-31T03:54:19Z
dc.date.available	2010-03-31T03:54:19Z
dc.date.copyright	2003-11-02
dc.date.issued	2010-03-31T03:54:19Z
dc.identifier.uri	http://hdl.handle.net/11718/1818
dc.description.abstract	We proposed a heuristic algorithm to solve the one-dimensional bin-packing problem with additional constraints. The proposed algorithm has been applied to solve a practical vehicle-allocation problem. The experimental results show that our proposed heuristic provides optimal or near-optimal results, and performs better than the first fit decreasing algorithm modified to incorporate additional constraints.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;2003/1783
dc.subject	Algorithm	en
dc.subject	Heuristic algorithm	en
dc.subject	Bin-packing algorithm	en
dc.subject	Vehicle-allocation	en
dc.subject	Heuristic procedure	en
dc.title	A heuristic procedure for one dimensional bin packing problem with additional constraints	en
dc.type	Working Paper	en
Appears in Collections:	Working Papers

Files in This Item:

File	Description	Size	Format
2003-11-02satyendra.pdf		225.16 kB	Adobe PDF	View/Open