Berth allocation planning in the public berth system by genetic algorithms

By E. Nishimura, A. Imai, S. Papadimitriou. European Journal of Operational Research, 2001

322 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Models and Tabu Search Heuristics for the Berth-Allocation Problem (2005, background): “Nishimura et al. (2001) have presented a non-linear integer program and a genetic algorithm based on a different representation of the spatial dimension in which the quay is a collection of segments and up to two ships can share the same segment at the same time if their lengths are compatible with…”
A scheduling method for Berth and Quay cranes (2003, methodology): “Also, Nishimura et al. [ 10 ] suggested genetic algorithms to solve the problem suggested by Imai et al. [5] with a small computational effort.”
Container terminal operation and operations research - a classification and literature review (2004, background): “[146] focus on the problem of dynamic berth assignment to ships in the public berth system (not especially container ports; it is emphasized that these systems and, therefore, the shown results ‘may not be suitable for most container ports of major countries’).”