集装箱码头泊位分配外文文献翻译.docxVIP

集装箱码头泊位分配外文文献翻译 文献出处：Bierwirth, Christian, and Frank Meisel. \follow-up survey of berth allocation and quay crane scheduling problems in container terminals.\European Journal of Operational Research (2021). 原文 A follow-up survey of berth allocation and quay crane scheduling problems in container terminals Bierwirth；Christian；Meisel. Berth allocation problems Scope and classification scheme In berth allocation problems, we are given a berth layout together with a set of vessels that have to be served within a planning horizon. The vessels must be moored within the boundaries of the quay and cannot occupy the same quay space at a time. In the basic optimization problem, berthing positions and berthing times have to be assigned to all vessels, such that a given objective function is optimized. A variety of optimization models for berth allocation have been proposed in the literature to capture real features of practical problems. In Bierwirth and Meisel (2021), we have proposed a scheme for classifying such models according to four attributes, namely a spatial attribute, a temporal attribute, a handling time attribute, and the performance measure addressed in the optimization. The values each attribute can take are listed in Fig. 1 2.1.1. Spatial attribute This attribute concerns the berth layout, which is either a discrete layout (disc), a continuous layout (cont), or a hybrid layout (hybr). In case of disc, the quay is partitioned into berths and only one vessel can be served at each single berth at a time. In case of cont, vessels can berth at arbitrary positions within the boundaries of the quay. Finally, in case hybr, the quay is partitioned into berths, but vessels may share a berth or one vessel may occupy more than one berth. A particular form of a hybrid berth is an indented berth where large vessels can be served from two oppositely located berths. The spatial attribute is extended by item draft, if the BAP-approach a