2011 IEEE International Conference on Automation Science and Engineering 2011
DOI: 10.1109/case.2011.6042520
|View full text |Cite
|
Sign up to set email alerts
|

An improved Least Cost Heuristic for dynamic yard crane deployment in container terminals

Abstract: Yard Crane (YC) deployment in a multi-berth terminal is a very complex problem. The total amount of work to the entire terminal yard changes dynamically over time. The levels of workload to different parts of the yard also vary greatly and change over time. So the YC deployment algorithm plays a critical role in increasing YC productivity and reducing vehicle waiting times in the yard. This paper proposes two improved Least Cost Heuristic (LCH) algorithms. The two algorithms consider practical operation constr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…However, they would be useful in some situations. For example, when the number of YCs in the terminal is low compared with other types of equipment like vehicles or QCs, then scheduling YCs to minimize makespan may offer opportunities for faster YC re-deployment to other blocks (Huang et al 2011). The existing single YC scheduling algorithms compute job sequences to minimize vehicle waiting time, not makespan.…”
Section: Introductionmentioning
confidence: 99%
“…However, they would be useful in some situations. For example, when the number of YCs in the terminal is low compared with other types of equipment like vehicles or QCs, then scheduling YCs to minimize makespan may offer opportunities for faster YC re-deployment to other blocks (Huang et al 2011). The existing single YC scheduling algorithms compute job sequences to minimize vehicle waiting time, not makespan.…”
Section: Introductionmentioning
confidence: 99%
“…Many heuristic scheduling papers in the past have been concerned with ensuring that cranes on ports achieve the most efficient throughput and turnaround times (Huang and Guo, 2011;Ng and Mak, 2005), to minimise the number of required relocations (Kim and Hong, 2004;Ehleiter and Jaehn, 2016;Chen et al, 2000), or even to address the adjacency problem in facility layouts (Wascher and Merker, 1997).…”
Section: Rate Of Trucks Per Hour = Approximately 9 Trucks Per Hour 17mentioning
confidence: 99%