-
Computational Logistics - Second International Conference, ICCL 2011, Hamburg, Germany, September 19-22, 2011. Proceedings; 01/2011
-
[show abstract]
[hide abstract]
ABSTRACT: Common deficiencies found in previous studies that modelled quay crane scheduling with non-crossing constraints (QCSNC) in port container terminals are identified. Remedies for the problems are proposed to prevent the occurrence of unrealistic optimal solutions for QCSNC. Additionally, two approximation schemes for QCSNC are studied. The first one is called the best partition (BP) method, which can be solved by dynamic programming (DP) with time complexity of (mn 2). A more efficient algorithm is designed to improve the original DP by adopting binary search. Next, based on BP and an exact algorithm for QCSNC (with pseudo-polynomial computational time), the second approximation scheme, called the enhanced best partition (EBP) method, is proposed to achieve a better estimation of the optimal makespan for QCSNC. The results of numerical experiments show that EBP is an effective approximation scheme for the problem of QCSNC.
Engineering Optimization 01/2010; 42(1):1-15. · 0.94 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: Quay crane scheduling a yard truck scheduling are two important subproblems in container terminal operations, which have been studied separately in previous research. This paper treats the scheduling of quay crane and yard truck in a whole. The problem is formulated as a mixed integer programming model and solved with a genetic algorithm. Computational examples show the benefits of integrated methods and the efficiency of the proposed algorithm.
Industrial Engineering and Engineering Management, 2008. IEEM 2008. IEEE International Conference on; 01/2009
-
[show abstract]
[hide abstract]
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.
Transportation Research Part E: Logistics and Transportation Review.
-
[show abstract]
[hide abstract]
ABSTRACT: This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders' decomposition, are developed for problem solution; namely, the general Benders' cut-based method and the combinatorial Benders' cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods.
Transportation Research Part E Logistics and Transportation Review 46(3):344-353. · 1.65 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: In this research, continuous and dynamic Berth Allocation Problem (BAP) is studied to minimize the total weighted flow time. Different from previous studies on continuous BAP, an efficient method is proposed to address the problem to identify the possible locations for next vessel in the Time-space diagram. Then two versions of Greedy Randomized Adaptive Search Procedure (GRASP) are developed to search for near optimal solutions. Both small and large scale numerical experiments are tested to examine the effectiveness of the proposed GRASPs by comparison with CPLEX and stochastic beam search, respectively.
Transportation Research Part E Logistics and Transportation Review 46(6):1017-1029. · 1.65 Impact Factor
