Modeling and Solving the Simultaneous Berth and Quay Crane Scheduling in Container Terminals

Please enable javascript in your browser.

Nayebi Nodoushan, Amin | 2016

637 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 48904 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Salmasi, Naser
Abstract:
The most important sources in container terminals are berth and quay cranes. The main purpose in the container terminals is reducing delay times of vessels. This will be obtained with planning of terminal sources. This research addresses simultaneous berth and quay crane scheduling problem. A mixed integer linear mathematical model is proposed to minimize sum of completion time of vessels. Since the proposed research problem is NP-hard, two methahuristic algorithms based on Tabu Search (TS) and Particle Swarm Optimization (PSO) are presented to heuristically solve the problem. After parameter tuning, PSO and TS algorithms are compared with experimental design methods. The results indicate that TS algorithm is better than PSO algorithm. In the last experiment, to evaluate the performance of algorithms, they are compared with optimal solutions obtained by mathematical model in the small size instances. The results show that algorithms find optimal solution in most instances
Keywords:
Mathematical Modeling ; Berth Allocation ; Particles Swarm Optimization (PSO) ; Tabu Search Algorithm ; Quays Crane (QC)Scheduling ; Container Port

No TOC