Performing A* search for yard crane dispatching in container terminals
We address the problem of dispatching a yard crane in its appointed zone of a container terminal. The objective of yard crane dispatching is to determine a sequence for handling all coming jobs within the zone that minimizes the average vehicle waiting time. We propose 2 modified A* search algorithm...
Saved in:
Main Authors: | , |
---|---|
其他作者: | |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2011
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/79824 http://hdl.handle.net/10220/6839 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!