Paper Info
Title
A two stage yard crane workload partitioning and job sequencing algorithm for container terminals
Abstract
We propose a new YC workload partitioning scheme which employs dynamic data driven simulations to conduct what-if experiments in container terminals. Both the optimal partition of the workload in a row of yard blocks and the optimal dispatching sequences for individual YCs are achieved. The practical consideration of the safety constraints is included. A dynamic programming (DP) approach is used to avoid re-computation. An efficient two stage workload partition algorithm (TSWP) is proposed which successfully reduces the number of full what-if simulations while maintaining solution optimality. An effective lower bound (LB) generator with adjustable LB accuracy is designed in supporting the TSWP algorithm. Experimental results show that the TSWP algorithm outperforms the pure DP approach in all tested scenarios and takes less than 1 part per thousand computational time of the DP approach.
Year
DOI
Venue
2010
10.1145/1774088.1774583
SAC
Keywords
Field
DocType
optimal partition,stage workload partition algorithm,adjustable lb accuracy,pure dp approach,dp approach,stage yard crane workload,dynamic data,new yc workload,full what-if simulation,dynamic programming,container terminal,tswp algorithm,optimization,lower bound,parts per thousand
Partition problem,Dynamic programming,Upper and lower bounds,Computer science,Workload,Algorithm,Safety constraints,Yard,Dynamic data,Partition (number theory)
Conference
Citations 
PageRank 
References 
2
0.39
8
Authors
2
Name
Order
Citations
PageRank
Xi Guo1595.95
Shell Ying Huang216119.52