Decision support systems and automated planning have become essential for the effective management of seaport container terminals. Due to ever-increasing levels of maritime traffic and freight transportation, terminals are expected to facilitate their intra-yard operations while respecting tighter vessel schedules. Employed models must therefore be capable of providing berth allocation decisions which are not only efficient, but also physically realizable. The present paper addresses the continuous Berth Allocation problem with Specific Quay Crane Assignments, with the aim being to minimize container transshipment distances within the terminal yard. An integrated mathematical formulation is presented which considers various real-world properties such as limited crane ranges and quay discontinuity. Based on this formulation, we also introduce a fast local search-based heuristic, capable of accommodating both fixed and flexible departure time settings. The proposed heuristic is evaluated upon a set of instances which cover a wide range of diverse layout specifications and the solutions are compared against those obtained by a state-of-the-art commercial solver. Experimental results confirm the effectiveness of the heuristic and demonstrate how significantly improved schedules can be obtained when flexible departures are permitted.

决策支持系统和自动计划对于有效管理港口集装箱码头至关重要。由于海上运输和货运水平的不断提高，预计码头将在遵守更严格的船期的同时，促进其场内作业。因此，使用的模型必须能够提供泊位分配决策，该决策不仅有效，而且在物理上可以实现。本文针对特定码头起重机分配问题解决连续泊位分配问题，目的是最大程度地减少码头堆场内的集装箱转运距离。提出了一种综合的数学公式，该公式考虑了各种现实世界的属性，例如有限的起重机范围和码头不连续性。根据此公式，我们还介绍了一种基于本地快速搜索的启发式方法，能够同时适应固定和灵活的出发时间设置。建议的启发式方法是在一系列实例中进行评估的，这些实例涵盖了广泛的各种布局规格，并且将解决方案与由最新的商业求解器获得的解决方案进行了比较。实验结果证实了启发式方法的有效性，并证明了在允许灵活离开时如何显着改善时间表。