Dynamic discrete berth allocation in container terminals under four performance measures
Field | Value | Language |
dc.contributor.author | Teye, Collins | |
dc.contributor.author | Bell, Michael | |
dc.date.accessioned | 2018-11-23 | |
dc.date.available | 2018-11-23 | |
dc.date.issued | 2016-06-01 | |
dc.identifier.issn | ISSN 1832-570X | |
dc.identifier.uri | http://hdl.handle.net/2123/19529 | |
dc.description.abstract | In this paper we develop new models for the dynamic discrete berth allocation problem under four performance measures (PM). The models allow for both dynamic berth availability and dynamic arrival of vessels within the planning time horizon. The new formulation allows the four models to be compared in terms of both model complexities and solutions. The models were implemented using CPLEX. The paper also proposed four heuristics under one framework for solving large instances of the problem. The study shows that the choice of PM to optimise is very crucial as different optimised PMs lead to different degrees of satisfactions or terminal efficiency. | en_AU |
dc.relation.ispartofseries | ITLS-WP-16-12 | en_AU |
dc.subject | Containers terminals, Discrete Dynamic Berth Allocation, Container vessels, Performance Measures | en_AU |
dc.title | Dynamic discrete berth allocation in container terminals under four performance measures | en_AU |
dc.type | Working Paper | en_AU |
dc.contributor.department | ITLS | en_AU |
Associated file/s
Associated collections