Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals
Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle job...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/99035 http://hdl.handle.net/10220/12795 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-99035 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-990352020-05-28T07:17:36Z Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals Huang, Shell Ying Guo, Xi Hsu, Wen Jing Lim, Wei Lin School of Computer Engineering Winter Simulation Conference (2012 : Berlin, Germany) DRNTU::Engineering::Computer science and engineering Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle jobs. This is important for minimizing vessel turnaround time. In the search for an optimal job sequence, the evaluation of the total tardiness of (partial) job sequences requires sequence dependent job service times. Simulation is embedded in our optimization algorithms to help provide accurate YC service times. This results in a more accurate evaluation of job tardiness but incurs costs. Experimental results show that this is feasible despite the simulation costs. MTA* and MT-RBA * significantly outperform the Earliest Due Date First and the Smallest Completion time Job First heuristics in minimizing job tardiness. MT-RBA* is computationally more efficient. 2013-08-01T04:41:12Z 2019-12-06T20:02:32Z 2013-08-01T04:41:12Z 2019-12-06T20:02:32Z 2012 2012 Conference Paper https://hdl.handle.net/10356/99035 http://hdl.handle.net/10220/12795 10.1109/WSC.2012.6465137 en |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Computer science and engineering |
spellingShingle |
DRNTU::Engineering::Computer science and engineering Huang, Shell Ying Guo, Xi Hsu, Wen Jing Lim, Wei Lin Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals |
description |
Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle jobs. This is important for minimizing vessel turnaround time. In the search for an optimal job sequence, the evaluation of the total tardiness of (partial) job sequences requires sequence dependent job service times. Simulation is embedded in our optimization algorithms to help provide accurate YC service times. This results in a more accurate evaluation of job tardiness but incurs costs. Experimental results show that this is feasible despite the simulation costs. MTA* and MT-RBA * significantly outperform the Earliest Due Date First and the Smallest Completion time Job First heuristics in minimizing job tardiness. MT-RBA* is computationally more efficient. |
author2 |
School of Computer Engineering |
author_facet |
School of Computer Engineering Huang, Shell Ying Guo, Xi Hsu, Wen Jing Lim, Wei Lin |
format |
Conference or Workshop Item |
author |
Huang, Shell Ying Guo, Xi Hsu, Wen Jing Lim, Wei Lin |
author_sort |
Huang, Shell Ying |
title |
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals |
title_short |
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals |
title_full |
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals |
title_fullStr |
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals |
title_full_unstemmed |
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals |
title_sort |
embedding simulation in yard crane dispatching to minimize job tardiness in container terminals |
publishDate |
2013 |
url |
https://hdl.handle.net/10356/99035 http://hdl.handle.net/10220/12795 |
_version_ |
1681058539761565696 |