Please use this identifier to cite or link to this item:
Title: Integrated bay allocation and yard crane scheduling problem for transshipment containers
Authors: Lee, D.-H. 
Jin, J.
Chen, J.
Issue Date: 1-Dec-2011
Citation: Lee, D.-H., Jin, J., Chen, J. (2011-12-01). Integrated bay allocation and yard crane scheduling problem for transshipment containers. Transportation Research Record (2222) : 63-71. ScholarBank@NUS Repository.
Abstract: The integrated problem for bay allocation and yard crane scheduling in transshipment container terminals was addressed. Unlike space allocation under the entire yard overview and slot assignment within a yard bay, the bay allocation problem focuses on a block and aims to allocate bay resource to fleets of transshipment containers in a more efficient way. The receiving operation and retrieving operation in the storage yards were considered simultaneously to achieve a more efficient operation of yard crane. The bay allocation and the yard crane scheduling were integrated as a whole process. A mixed integer programming model was developed for the problem formulation with the objective of minimizing total costs, including yard crane cost and delay cost. Considering the high complexity of the problem, a simulated annealing heuristic algorithm was developed to obtain near-optimal solutions. Numerical experiments were also conducted to test the efficiency of the proposed algorithm.
Source Title: Transportation Research Record
ISSN: 03611981
DOI: 10.3141/2222-08
Appears in Collections:Staff Publications

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


checked on Mar 21, 2019


checked on Mar 11, 2019

Page view(s)

checked on Mar 16, 2019

Google ScholarTM



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