Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2009.04.008
Title: A heuristic algorithm for yard truck scheduling and storage allocation problems
Authors: Lee, D.-H. 
Cao, J.X.
Shi, Q.
Chen, J.H.
Keywords: Container terminal operations
Heuristic algorithm
Storage allocation
Yard truck scheduling
Issue Date: Sep-2009
Source: Lee, D.-H., Cao, J.X., Shi, Q., Chen, J.H. (2009-09). A heuristic algorithm for yard truck scheduling and storage allocation problems. Transportation Research Part E: Logistics and Transportation Review 45 (5) : 810-820. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2009.04.008
Abstract: The yard truck scheduling and the storage allocation are two important decision problems affecting the efficiency of container terminal operations. This paper proposes a novel approach that integrates these two problems into a whole. The objective is to minimize the weighted sum of total delay of requests and the total travel time of yard trucks. Due to the intractability of the proposed problem, a hybrid insertion algorithm is designed for effective problem solutions. Computational experiments are conducted to examine the key factors of the problem and the performance of the proposed heuristic algorithm. © 2009 Elsevier Ltd. All rights reserved.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/54238
ISSN: 13665545
DOI: 10.1016/j.tre.2009.04.008
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

53
checked on Dec 11, 2017

WEB OF SCIENCETM
Citations

42
checked on Dec 11, 2017

Page view(s)

40
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


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