A heuristic algorithm for yard crane dispatching in container terminals
In any optimization algorithm with NP-hard problems, embedded simulation in that area usually incur high computation costs. One of the example would be the Yard Crane (YC) dispatching in container terminals. As such, it is of importance to reduce the simulation cost in YC dispatching. In this report...
Saved in:
Main Author: | Lee, Zhen Jie |
---|---|
Other Authors: | Huang Shell Ying |
Format: | Final Year Project |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/59996 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A heuristic algorithm to schedule twin yard crane to Mmnimize job tardiness in container terminals
by: Chua, Jason Zhen Sheng
Published: (2014) -
Reducing simulation costs in embedded simulation in yard crane dispatching in container terminals
by: Ong, Yi Long.
Published: (2013) -
Yard crane dispatching to minimize maximum tardiness of the jobs
by: Wan, Zhi Yong
Published: (2014) -
Comparison of yard crane scheduling algorithms
by: Low, Yihang.
Published: (2012) -
Smallest job completion time heuristics for yard crane dispatching in container terminals
by: Ching, Yu Xin.
Published: (2012)