This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special at...This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special attention to the loading and discharging precedence relationships between containers in the quay crane operations.A Mixed Integer Program（MIP） model is constructed,and a two-stage heuristic algorithm is proposed.In the first stage an Ant Colony Optimization（ACO） algorithm is employed to generate the yard location assignment for discharging containers.In the second stage,the integration of the yard truck scheduling and the quay crane scheduling is a flexible job shop problem,and an efficient greedy algorithm and a local search algorithm are proposed. Extensive numerical experiments are conducted to test the performance of the proposed algorithms.展开更多
Quay crane and yard truck scheduling are two important subproblems in container terminal opera- tions which have been studied separately in previous research, This paper proposes a new problem for the integrated quay ...Quay crane and yard truck scheduling are two important subproblems in container terminal opera- tions 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.展开更多
基金supported by the National Nature Science Foundation of China under grant no.71102011
文摘This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special attention to the loading and discharging precedence relationships between containers in the quay crane operations.A Mixed Integer Program（MIP） model is constructed,and a two-stage heuristic algorithm is proposed.In the first stage an Ant Colony Optimization（ACO） algorithm is employed to generate the yard location assignment for discharging containers.In the second stage,the integration of the yard truck scheduling and the quay crane scheduling is a flexible job shop problem,and an efficient greedy algorithm and a local search algorithm are proposed. Extensive numerical experiments are conducted to test the performance of the proposed algorithms.
文摘Quay crane and yard truck scheduling are two important subproblems in container terminal opera- tions 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.
