共 15 条
Scheduling co-operating stacking cranes with predetermined container sequences
被引:37
作者:
Briskorn, Dirk
[1
]
Angeloudis, Panagiotis
[2
]
机构:
[1] Berg Univ Wuppertal, Lehrstuhl Prod & Logist, Rainer Gruenter Str 21, D-42119 Wuppertal, Germany
[2] Univ London Imperial Coll Sci Technol & Med, Port Operat Res & Technol Ctr, Dept Civil & Environm Engn, London SW7 2AZ, England
基金:
英国工程与自然科学研究理事会;
关键词:
Automated stacking cranes;
Scheduling;
Container terminals;
Efficient algorithm;
Shortest path representation;
OPERATIONS-RESEARCH;
YARD CRANE;
ALGORITHM;
TERMINALS;
SYSTEMS;
MODEL;
D O I:
10.1016/j.dam.2015.07.042
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
With the proliferation of multi-gantry automated stacking cranes, the already difficult crane scheduling problem in container terminals has become even more challenging. In this paper we present an efficient algorithm that can solve a sub-problem that arises in this context, namely the prioritization of crane gantry movements once transportation tasks have been assigned. We tackle this problem for both, twin crane setting and crossover crane setting, and develop graphical models and strongly polynomial algorithms accordingly. A series of experiments is carried out where it is shown that the method can produce optimum solutions with exceptionally small run times. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:70 / 85
页数:16
相关论文