作者: Chuqian Zhang , Yat-wah Wan , Jiyin Liu , Richard J. Linn
DOI: 10.1016/S0191-2615(01)00017-0
关键词:
摘要: Storage yards at container terminals serve as temporary buffers for inbound and outbound containers. Rubber tyred gantry cranes (RTGCs) are the most frequently used equipment in handling. The efficiency of yard operations heavily depends on productivity these RTGCs. As workload distribution changes over time, dynamic deployment RTGCs among storage blocks (container stacking areas) is an important issue terminal management. This paper addresses crane problem. Given forecasted each block period a day, objective to find times routes movements so that total delayed minimized. problem formulated mixed integer programming (MIP) model solved by Lagrangean relaxation. To improve performance this approach, we augment relaxation adding additional constraints modify solution procedure accordingly. Computational experiments show modified method generates excellent solutions short time.