Please use this identifier to cite or link to this item:
|Title:||Efficient planning of berth allocation for container terminals in Asia||Authors:||Imai, A.
|Issue Date:||Mar-1997||Citation:||Imai, 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.||Abstract:||Berth 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.||Source Title:||Journal of Advanced Transportation||URI:||http://scholarbank.nus.edu.sg/handle/10635/65517||ISSN:||01976729|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.