| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 476004 | Computers & Operations Research | 2008 | 9 Pages |
Abstract
In this paper, we develop a new procedure that uses the concept of weight annealing to solve the one-dimensional bin packing problem. Our procedure is straightforward and easy to follow. We apply it to 1587 instances taken from benchmark problem sets and compare our results to those found in the literature. We find that our procedure produces very high-quality solutions very quickly and generates several new optimal solutions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Kok-Hua Loh, Bruce Golden, Edward Wasil,