期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 156, 期 3, 页码 752-768出版社
ELSEVIER
DOI: 10.1016/S0377-2217(03)00133-4
关键词
scheduling; branch and bound; transportation; container terminal; combinatorial optimization
This paper discusses the problem of scheduling quay cranes (QCs), the most important equipment in port terminals. A mixed-integer programming model, which considers various constraints related to the operation of QCs, was formulated. This study proposes a branch and bound (B & B) method to obtain the optimal solution of the QC scheduling problem and a heuristic search algorithm, called greedy randomized adaptive search procedure (GRASP), to overcome the computational difficulty of the B & B method. The performance of GRASP is compared with that of the B & B method. (C) 2003 Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据