AGV scheduling and routing for automated container terminals
Routing and scheduling for Automated Guided Vehicles (AGVs) between the vessels and the storage yard is investigated. AGVs are constrained to move in a predefined network of roads and changing their locations over time. AGVs are continuously assigned a transportation task with a deadlines, once the...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2016
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/66815 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | Routing and scheduling for Automated Guided Vehicles (AGVs) between the vessels and the storage yard is investigated. AGVs are constrained to move in a predefined network of roads and changing their locations over time. AGVs are continuously assigned a transportation task with a deadlines, once the previous task is completed. Given such an environment, a path planner algorithm is presented to find a collision-free and deadlock-free route in the network that takes the AGV from a given start node to a destination node in minimum time. Our scheduler selects the AGV to be planned in an appropriate order to minimize tardiness in delivering containers. The problem is solved by: (1) dynamic path planning algorithm using a space-time spanning tree, and (2) scheduler using sliding window. Algorithms for the two sub-problems are presented and experimental results of the algorithms is analyzed |
|---|