Loading...
Please wait, while we are loading the content...
Similar Documents
Repairing bin packing constraints.
| Content Provider | CiteSeerX |
|---|---|
| Author | Fukunaga, Alex S. |
| Abstract | Abstract. We consider a variant of the bin packing problem, where items are initially assigned to bins, and the goal is to rearrange the items in the minimum number of steps such that the capacity constraints are satisfied. We consider two search spaces for solving this problem, a commitment-based search space and a difference-based search space. We evaluate depth-first branch and bound and IDA * algorithms in these search spaces, and show that IDA * in the commitment-based search space significantly outperforms the alternatives. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Bin Packing Constraint Search Space Commitment-based Search Space Bin Packing Problem Depth-first Branch Difference-based Search Space Minimum Number Capacity Constraint |
| Content Type | Text |
| Resource Type | Article |
