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: | Guo, Xi, Huang, Shell Ying |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/79824 http://hdl.handle.net/10220/6839 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Yard crane dispatching based on real time data driven simulation for container terminals
by: Guo, Xi, et al.
Published: (2011) -
Simulation-based dynamic partitioning of yard crane workload for container terminal operations
by: Guo, Xi, et al.
Published: (2011) -
A simulation based hybrid algorithm for yard crane dispatching in container terminals
by: Guo, Xi, et al.
Published: (2011) -
Deciding on planning windows by partitioning time
for yard crane management in container terminals
by: Guo, Xi, et al.
Published: (2011) -
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals
by: Huang, Shell Ying, et al.
Published: (2013)