Please use this identifier to cite or link to this item: https://doi.org/10.1016/S1007-0214(10)70089-4
Title: Integrated quay crane and yard truck schedule problem in container terminals
Authors: Cao, J.
Shi, Q.
Lee, D.-H. 
Keywords: container terminal
heuristic algorithm
mixed integer programming
scheduling
Issue Date: 2010
Source: Cao, J.,Shi, Q.,Lee, D.-H. (2010). Integrated quay crane and yard truck schedule problem in container terminals. Tsinghua Science and Technology 15 (4) : 467-474. ScholarBank@NUS Repository. https://doi.org/10.1016/S1007-0214(10)70089-4
Abstract: Quay crane and yard truck scheduling are two important subproblems in container terminal operations which have been studied separately in previous research. This paper proposes a new problem for the integrated quay crane and yard truck scheduling for inbound containers. The problem is formulated as a mixed integer programming (MIP) model. Due to the intractability, a genetic algorithm (GA) and a modified Johnson's Rule-based heuristic algorithm (MJRHA) are used for the problem solution. In addition, two closed form lower bounds are given to evaluate the solution accuracy. Computational experiments show that the solution algorithm can efficiently handle the scheduling problem and that the integrated methods are very useful. © 2010 Tsinghua University Press.
Source Title: Tsinghua Science and Technology
URI: http://scholarbank.nus.edu.sg/handle/10635/65722
ISSN: 10070214
DOI: 10.1016/S1007-0214(10)70089-4
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

26
checked on Dec 13, 2017

Page view(s)

31
checked on Dec 8, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.