A heuristic procedure for one dimensional bin packing problem with additional constraints
Rao, V. Venkata
MetadataShow full item record
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.
- Working Papers