The efficiency of yard operations is critical to the overall productivity of a container terminal because the yard serves as the interface between the landside and waterside operations.Most container terminals use yar...The efficiency of yard operations is critical to the overall productivity of a container terminal because the yard serves as the interface between the landside and waterside operations.Most container terminals use yard cranes to transfer containers between the yard and trucks(both external and internal).To facilitate vessel operations,an efficient work schedule for the yard cranes is necessary given varying work volumes among yard blocks with different planning periods.This paper investigated an agent-based approach to assign and relocate yard cranes among yard blocks based on the forecasted work volumes.The goal of our study is to reduce the work volume that remains incomplete at the end of a planning period.We offered several preference functions for yard cranes and blocks which are modeled as agents.These preference functions are designed to find effective schedules for yard cranes.In addition,we examined various rules for the initial assignment of yard cranes to blocks.Our analysis demonstrated that our model can effectively and efficiently reduce the percentage of incomplete work volume for any real-world sized problem.展开更多
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.展开更多
文摘The efficiency of yard operations is critical to the overall productivity of a container terminal because the yard serves as the interface between the landside and waterside operations.Most container terminals use yard cranes to transfer containers between the yard and trucks(both external and internal).To facilitate vessel operations,an efficient work schedule for the yard cranes is necessary given varying work volumes among yard blocks with different planning periods.This paper investigated an agent-based approach to assign and relocate yard cranes among yard blocks based on the forecasted work volumes.The goal of our study is to reduce the work volume that remains incomplete at the end of a planning period.We offered several preference functions for yard cranes and blocks which are modeled as agents.These preference functions are designed to find effective schedules for yard cranes.In addition,we examined various rules for the initial assignment of yard cranes to blocks.Our analysis demonstrated that our model can effectively and efficiently reduce the percentage of incomplete work volume for any real-world sized problem.
基金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.
