Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/247300
Title: DYNAMIC DECISION MAKING IN AN AUTOMATED CONTAINER YARD BLOCK VIA OPTIMIZATION-EMBEDDED DISCRETE-EVENT-SIMULATION
Authors: JEAN-BAPTISTE CLAUDE GABRIEL BERERD
ORCID iD:   orcid.org/0009-0009-9522-6515
Keywords: Automated container terminal, Storage space allocation, Yard crane scheduling, Optimization, Discrete-event simulation
Issue Date: 23-Aug-2023
Citation: JEAN-BAPTISTE CLAUDE GABRIEL BERERD (2023-08-23). DYNAMIC DECISION MAKING IN AN AUTOMATED CONTAINER YARD BLOCK VIA OPTIMIZATION-EMBEDDED DISCRETE-EVENT-SIMULATION. ScholarBank@NUS Repository.
Abstract: This thesis introduces an optimization-embedded discrete-event simulation framework for dynamic decision making in an automated container terminal's yard block. This work aims at addressing two major problems in yard block operations, namely the Container Storage Location Assignment Problem and the Yard Crane Job Scheduling Problem. The first is concerned with the allocation of storage space for inbound containers, while the second aims at finding the optimal sequencing of the yard crane's storage and retrieval requests. An innovative top-down approach to a hybrid modelling formalism is adopted to provide a discrete-event simulation model of yard crane operations. This model is used to compare operational strategies addressing the storage allocation and job scheduling problems. In particular, an optimization model is embedded in the simulation model to perform dynamic scheduling. A rolling horizon heuristic is used reduce computing time. Finally, insights on the relative performance of operational strategies and optimization-embedded simulation are given.
URI: https://scholarbank.nus.edu.sg/handle/10635/247300
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
BererdJBCG.pdf6.1 MBAdobe PDF

OPEN

NoneView/Download

Google ScholarTM

Check


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