Please use this identifier to cite or link to this item:
Title: A framework for generating efficient yard plans for marine container terminals
Keywords: yard plan strategy, yard plan template, optimisation under uncertainty, nimble optimisation, mixed-integer programming, heuristic algorithms
Issue Date: 27-Jul-2011
Source: KU LIANG PING (2011-07-27). A framework for generating efficient yard plans for marine container terminals. ScholarBank@NUS Repository.
Abstract: The quality of yard plan determines the container terminal?s performance. As vessels arrival schedule repeats on a weekly basis, a generic yard plan template problem can be formulated. As the run time to solve the problem is essential, we propose using an MIP and LSA-HC heuristic to solve for the case with non-dedicated and dedicated strategies, respectively. We show that they are able to run in reasonable amount of time. Uncertainty in the vessel arrival schedule greatly impact the quality of yard plan. Instead of having a robust plan, a nimble yard plan template that allows ease of change when uncertainty is revealed is proposed. We show that a nimble solution followed by a recovery algorithm after the uncertainty reveals greatly improve the quality of the yard plan. A novel nimble optimisation framework is also presented and is shown to be a generalisation of a few other related works.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
KULP.pdf4.79 MBAdobe PDF



Page view(s)

checked on Dec 11, 2017


checked on Dec 11, 2017

Google ScholarTM


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