Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/65517
DC FieldValue
dc.titleEfficient planning of berth allocation for container terminals in Asia
dc.contributor.authorImai, A.
dc.contributor.authorNagaiwa, K.
dc.contributor.authorTat, C.W.
dc.date.accessioned2014-06-17T08:17:39Z
dc.date.available2014-06-17T08:17:39Z
dc.date.issued1997-03
dc.identifier.citationImai, A., Nagaiwa, K., Tat, C.W. (1997-03). Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31 (1) : 75-94. ScholarBank@NUS Repository.
dc.identifier.issn01976729
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/65517
dc.description.abstractBerth allocation is essential for efficient terminal utilization in container ports, especially those in Asia. This paper is concerned with a berth allocation problem(BAP) that minimizes the sum of port staying times of ships and that minimizes dissatisfaction of the ships in terms of the berthing order. In general there exist trade-offs between these objectives. An algorithm is presented to identify noninferior solutions to the BAP. The algorithm is demonstrated with some sample problems and the results indicate the importance of the problem in efficient terminal utilization.
dc.sourceScopus
dc.subjectBerth Allocation
dc.subjectContainer Terminal
dc.subjectMultiobjective Approach
dc.typeArticle
dc.contributor.departmentCIVIL ENGINEERING
dc.description.sourcetitleJournal of Advanced Transportation
dc.description.volume31
dc.description.issue1
dc.description.page75-94
dc.description.codenJATRD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

150
checked on Feb 2, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.