Please use this identifier to cite or link to this item:
|Title:||Models and new methods for the quayside operations in port container terminals.|
|Keywords:||Berth Allocation, Quay Crane, Scheduling, Integration, Models and Algorithms, Port Container Terminal|
|Citation:||CHEN JIANGHANG (2011-06-30). Models and new methods for the quayside operations in port container terminals.. ScholarBank@NUS Repository.|
|Abstract:||The swift pace of globalization has significantly increased the demand for containerized maritime transport services. Under the atmosphere, the competition among port container terminals has become acute and such drives the managers in port container terminals to pursue seamless flows of containers through terminals while to keep the operational costs as low as possible. To this end, operations research methods have received considerable importance for the operations management in port container terminals. From the angle of operations research and management science, this thesis aims to design models and devise the corresponding solving methods for the quayside operations in port container terminals. This enables port managers to come up with viable and cost-effective scheduling plans for quayside operation problem in a rapid manner. "
" The mathematical models introduced in this thesis have well covered each key component of the quayside operation problem, i.e., berth allocation problem, quay crane assignment problem, and quay crane scheduling problem. There are two highlights in this thesis with regarding to the aimed modeling issue: 1) the technology updates and innovative implementations occurred in the field have been reflected. For instance, the quay crane scheduling problem has been extended to the environment of indented berth, which is a noble idea to increase the ship-to-shore interface aiming to tackle the challenge raised by the emergence of more and more mega-containerships. 2) the integration issues to synchronize the decision-making processes for each key component of the quayside operation problem has been stressed. In this thesis, integrated models (including both discrete-berth and continuous-berth versions) to embrace all the information flow within the system of the quayside operation have been developed. On the other hand, in the perspective of solving approaches and algorithms, a spectrum of methods to handle the proposed models has been devised. This thesis not only contains the meta-heuristics and approximation algorithms which are developed to generate sub-optimal solutions for the hard-to-solved problems, but also introduces and tailors some of the excellent methods proposed in the field of operation research and computer science to obtain exact solutions. Taking the berth allocation problem as an example, the devised Greedy Randomized Adaptive Search Procedure (GRASP) outperforms the state-of-the-art algorithms appeared in the literature. Additionally, the GRASP algorithm possesses more flexibility than other methods, making it much easier to incorporate the decision rules of port managers into the planning procedure. Moreover, in the path to solve the integrated models for the quayside operation problem, after identifying the special properties of the problems at hand, the exact methods like Combinatorial Benders' Cuts algorithm and Local Branching method have been developed and tested to be promising methods for the complex problems through a series of comprehensive numerical experiments. In summary, the research presented in this thesis provides new insights of modeling the quayside operation problem in port container terminals and introduces a set of potent tools to handle the challenging issues rising from this field.|
|Appears in Collections:||Ph.D Theses (Open)|
Show full item record
Files in This Item:
|ChenCJH.pdf||2.59 MB||Adobe PDF|
checked on Dec 8, 2018
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.