The simultaneous berth and quay crane allocation problem
The simultaneous berth and quay crane allocation problem
复制标题
DOI：
10.1016/j.tre.2007.03.003
复制
发表时间：
2008-09
影响因子：
10.6
通讯作者：
A. Imai;Hsieh Chen;E. Nishimura;Stratos Papadimitriou
中科院分区：
文献类型：
--
作者：
A. Imai;Hsieh Chen;E. Nishimura;Stratos Papadimitriou
本文讨论了多用户集装箱码头的高效泊位和起重机分配调度。首先，我们介绍同时泊位和起重机分配问题的公式。接下来，通过采用遗传算法，我们开发了一种启发式方法来找到问题的近似解决方案。染色体的适应度值是通过跨泊位的起重机转移调度获得的，该适应度值是由基于染色体定义的泊位分配问题解的基于最大流量问题的算法确定的。数值实验结果表明，所提出的启发式方法适用于解决这一困难但重要的终端操作问题。
This paper addresses efficient berth and crane allocation scheduling at a multi-user container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.