IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/1818| Title: | A heuristic procedure for one dimensional bin packing problem with additional constraints |
| Authors: | Kumar, Satyendra Rao, V. Venkata Tirupati, Devanath |
| Keywords: | Algorithm;Heuristic algorithm;Bin-packing algorithm;Vehicle-allocation;Heuristic procedure |
| Issue Date: | 31-Mar-2010 |
| Series/Report no.: | WP;2003/1783 |
| 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. |
| URI: | http://hdl.handle.net/11718/1818 |
| Appears in Collections: | Working Papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2003-11-02satyendra.pdf | 225.16 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.