Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/123733
Title: DISPATCHING AND CONFLICT-FREE ROUTING OF VEHICLES IN NEW CONCEPTUAL AUTOMATED CONTAINER TERMINALS
Authors: XU YANHUA
Keywords: Automated container terminals, FB-ACT, GRID-ACT, HFG-ACT, vehicle dispatching, conflict-free routing
Issue Date: 14-Aug-2015
Citation: XU YANHUA (2015-08-14). DISPATCHING AND CONFLICT-FREE ROUTING OF VEHICLES IN NEW CONCEPTUAL AUTOMATED CONTAINER TERMINALS. ScholarBank@NUS Repository.
Abstract: THIS DISSERTATION ADDRESSES THE VEHICLE DISPATCHING AND CONFLICT-FREE ROUTING PROBLEMS IN TWO AUTOMATED CONTAINER TERMINAL CONCEPTS. ONE IS CALLED FRAME BRIDGE BASED AUTOMATED CONTAINER TERMINAL (FB-ACT) AND THE OTHER IS CALLED GOODS RETRIEVAL AND INVENTORY DISTRIBUTION BASED AUTOMATED CONTAINER TERMINAL (GRID-ACT). AS THE SIZE OF REALISTIC PROBLEM IS LARGE WHICH REQUIRES VERY HIGH COMPUTATIONAL AND MEMORY REQUIREMENT, WE DEVELOP A TREE STRUCTURE ALGORITHM WHICH IS ANALOGOUS TO FILTERED BEAM SEARCH ALGORITHM AS THE OVERALL FRAMEWORK TO SOLVE THE DISPATCHING AND ROUTING PROBLEMS. BASED ON THE STRUCTURE OF THE PROBLEMS, WE PROPOSE DIFFERENT NOVEL SOLUTION METHODS AND EMBED THEM INTO THE ANALOGOUS FILTERED BEAM SEARCH ALGORITHM. IN THE FB-ACT SYSTEM, THE FIRST STAGE METHOD ESTIMATES THE RESULTS BY A HEURISTIC METHOD WHICH DETERMINES THE TASK SEQUENCE BASED ON PSEUDO DELAYS. THE SECOND STAGE METHOD OBTAINS THE OPTIMAL RESULTS BY SOLVING THE MIP MODEL WHOSE SCALE IS GREATLY REDUCED WHEN THE
URI: http://scholarbank.nus.edu.sg/handle/10635/123733
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
XuYH.pdf3.45 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

60
checked on Nov 16, 2018

Download(s)

14
checked on Nov 16, 2018

Google ScholarTM

Check


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