The dynamic berth allocation problem for a container port

Akio Imai, Etsuko Nishimura and Stratos Papadimitriou

Transportation Research Part B: Methodological, 2001, vol. 35, issue 4, 401-417

Abstract: This paper addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-effectiveness in Japan's ports. The berth allocation to calling ships is a key factor for efficient public berthing. However, it is not calculated in polynomially-bounded time. To obtain a good solution with considerably small computational effort, we developed a heuristic procedure based on the Lagrangian relaxation of the original problem. We conducted a large amount of computational experiments which showed that the proposed algorithm is adaptable to real world applications.

Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (96)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191-2615(99)00057-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:35:y:2001:i:4:p:401-417

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().