AbstractThe 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.
A heuristic algorithm for yard truck scheduling and storage allocation problems
Transportation Research Part E: Logistics and Transportation Review ; 45 , 5 ; 810-820
2009-04-10
11 pages
Article (Journal)
Electronic Resource
English
A heuristic algorithm for yard truck scheduling and storage allocation problems
Online Contents | 2009
|A heuristic algorithm for yard truck scheduling and storage allocation problems
Online Contents | 2009
|The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods
Online Contents | 2010
|