A near-optimal algorithm for constraint test ordering in automated stowage planning
The container stowage planning problem is known to be NP-hard and heuristic algorithms have been proposed. Conventionally, the efficiency of the stowage planning algorithms are improved by pruning or reducing the search space. We observe that constraint evaluation is the core of most algorithms. I...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/106121 http://hdl.handle.net/10220/47888 http://dx.doi.org/10.1109/TASE.2017.2779470 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|