Optimal Allocation of Ships to Quay Length in Container Ports

Due to the continuously increasing container trade, many terminals are presently operating at orclose to capacity. an efficient terminal is one that facilitates the quick transshipment ofcontainers to and from ships. in this sake, this paper addresses the ship assignments problem ata maritime container terminal, where ships are normally assigned to specific quay cranes untilthe work is finished. the paper’s target is to develop a new continues berth allocationproblem (cbap) in the form of a mixed integer nonlinear programming to achieve the bestservice time in a container terminal. for illustrating the accuracy of proposed model (pm), imaiet. al. 's model (im) (transport res b, 39 (2005) 199–221) was applied and a wide varietyof computational test examples were conducted. the results of demonstrated that the presentedbapc reduces the number of nonlinear variables (constraints) and generates substantial savingsin the cpu time.