The Simultaneous Berth and Quay Crane Scheduling

Please enable javascript in your browser.

Zokaei Nikoo, Maryam | 2012

748 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 44039 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Salmasi, Naser
Abstract:
This study addresses the simultaneous berth and quay crane (QC) scheduling problem in a container terminal. The berths are considered as a continuous area and the vessels arrive dynamically. QCs are allowed to move to other vessels before completing the process on an assigned vessel.The objective function is determined based on the practical applications of the problem. It deals with minimization of sum of the completion time of vessels. In this research, a mathematical model has been developed for the research problem. According to NP-hardness of the research problem, two meta heuristic algorithms based on Tabu Search are proposed. To solve the problem, these methods have two layers with different policies in searching neighborhoods. Computational experiment shows that the algorithms are able to provide good quality solutions for problems in real world sizes
Keywords:
Tabu Search Algorithm ; Container Terminal ; Scheduling ; Optimization ; Container Transportation ; Berth Allocation ; Quays Crane (QC)Scheduling ; Container Port

No TOC