 An integrated storage space and berth allocation problem in a container terminalNima Safaei, Mohammad Bazzazi and Pooria Assadi International Journal of Mathematics in Operational Research, 2010, vol. 2, issue 6, 674-693 Abstract: In this paper, an integrated storage space allocation and berth assignment problem is proposed for the import containers in a container terminal. This problem is adopted from a real-world situation, in which the type of container affects the decision-making process for the storage space allocation problem (SSAP). A two-level approach is proposed to solve this problem. The SSAP and the berth assignment problem are formulated as mathematical programming models in two consecutive levels. In the first level, the import containers are allocated to the storage blocks in order to minimise the storage/retrieval times of the containers. The vessels are then allocated to the berth locations in the second level according to the results obtained from the first level in order to minimise the total distance travelled by container handling equipments between the storage blocks and the vessel berth locations. The performance of the extended model is examined and verified by a number of numerical examples. Keywords: container terminals; container types; SSAP; storage space allocation problem; berth allocation; mixed integer programming; MIP; decision making; storage-retrieval time; container handling equipment. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:2:y:2010:i:6:p:674-693 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.