| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6898192 | European Journal of Operational Research | 2012 | 10 Pages |
Abstract
⺠We developed a new Greedy-Lookahead tree search algorithm for the SCLP. ⺠We showed that selecting spaces is as important as selecting blocks of boxes. ⺠We proposed a simpler and more effective evaluation heuristic for selecting spaces. ⺠We considered the SCLP both with and without full support constraint. ⺠We outperformed all existing approaches based on 1600 benchmark instances.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Wenbin Zhu, Andrew Lim,