Efficient Heuristics for the Dynamic Berth Allocation Problem in Discrete Berthing Locations
Efficient Heuristics for the Dynamic Berth Allocation Problem in Discrete Berthing Locations
复制标题
DOI：
10.9749/jin.126.221
复制
发表时间：
2012-03
期刊：
影响因子：
--
通讯作者：
Yukiko Yamakawa;A. Imai;E. Nishimura
中科院分区：
文献类型：
--
作者：
Yukiko Yamakawa;A. Imai;E. Nishimura
海运集装箱码头是集装箱在海与陆之间、深海与短海之间进行海上中转的转接设施。码头的整体效率高度依赖于码头所承担的复杂和不同的搬运任务的强化操作。最重要的操作问题之一是泊位分配调度(或泊位分配问题)，因为不正确的泊位调度迫使船舶停泊在远离集装箱的地方，以便在一个堆场内处理。这种非生产性的服务情况永远不能通过任何适当的操作努力来克服，而对于其他处理任务，作者提出了启发式算法，该算法利用拉格朗日松弛的次梯度优化技术来实现，以解决离散演讲者动态泊位分配问题的原始问题。本文对启发式算法进行了改进，引入了一种在次梯度技术的整个迭代过程中寻找更好的可行解的新方法。
Marine container terminal is a switching facility of containers between sea and Iand as well as between deepsea and shortsea for sea transiportation legs. The overall terminal eenciency highly depends on harmenized operations of complicated and difierent handling tasks being undertaken at the terminal. One of the most important operational issues is the berth allocation schecluling (or berth aliocation problem), becagse an improper berth schedule forces ships to be berthed far from their containers to be handled in a yard. Such an unproductive servjce situation is never able to be overcome by any proper operational efforts fbr other handling tasks, The authors developed heuristics that were implemented using a subgradient optimization technique with a Lagrangian relaxation to the original problem for the dynamic berth allocation problem in discrete lecations. This study improves the heuristics by introducing a new procedure to find a better feasible solution in the entire iterative process of subgradient technique.