TY - JOUR ID - 4016 TI - Optimal Allocation of Ships to Quay Length in Container Ports JO - Journal of Industrial and Systems Engineering JA - JISE LA - en SN - 1735-8272 AU - Javanshir, H. AU - Seyed-Alizadeh Ganji, S.R. AD - Dep. of Industrial Engineering, Islamic Azad University, South Tehran Branch, Iran AD - Dep. of Transportation Engineering, Islamic Azad University, Science and Research Branch, Iran Y1 - 2010 PY - 2010 VL - 3 IS - 4 SP - 275 EP - 290 KW - Optimal transportation KW - Continues Berth allocation Problem (CBAP) KW - mixed integer nonlinear programming DO - N2 - Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is finished. The paper’s target is to develop a new Continues Berth Allocation Problem (CBAP) in the form of a mixed integer nonlinear programming to achieve the best service time in a container terminal. For illustrating the accuracy of Proposed model (PM), Imai et. al. 's model (IM) (TRANSPORT RES B, 39 (2005) 199–221) was applied and a wide variety of computational test examples were conducted. The results of demonstrated that the presented BAPC reduces the number of nonlinear variables (constraints) and generates substantial savings in the CPU time. UR - https://www.jise.ir/article_4016.html L1 - https://www.jise.ir/article_4016_27c7a41be0ba5ebd5a231fd4ff7792af.pdf ER -