Quay crane scheduling with draft and trim constraints

详细信息    查看全文

• 作者：Lingxiao Wu ; Weimin Ma ; ^{mawm@tongji.edu.cn}
• 关键词：Container terminals ; Quay crane scheduling ; Draft and trim constraints ; Branch and bound ; Genetic algorithm
• 刊名：Transportation Research Part E: Logistics and Transportation Review
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：97
• 期：Complete
• 页码：38-68
• 全文大小：1544 K
• 卷排序：97

文摘

We study the quay crane scheduling problem with draft and trim constraints. We present a MIP formulation which incorporates the draft and trim constraints in a novel and effective way. We propose a branch and bound method and a hybrid genetic algorithm to solve the problem with different sizes. Computational experiments show that our solution methods are effective and efficient.