1、中文 2300字 ,1600单词， 8700英文字符 出处： Bierwirth C, Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminalsJ. European Journal of Operational Research, 2010, 202(202):615-627. 原文 A follow-up survey of berth allocation and quay crane scheduling problems in container t
2、erminals 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 a
3、nd 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 t
4、o capture real features of practical problems. In Bierwirth and Meisel (2010), 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. T
5、he 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 se
6、rved 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 additionally considers a ve
