Heuristics for quay crane scheduling at indented berth |
| |
Authors: | Jiang Hang Chen Der-Horng Lee Jin Xin Cao |
| |
Institution: | aDepartment of Civil Engineering, National University of Singapore, Singapore;bDepartment of Transportation Engineering, Inner Mongolia University, China |
| |
Abstract: | This paper discusses the quay crane scheduling problem at indented berth, an extension to the current quay crane scheduling problem in the field of container terminal operation. A mixed integer programming model by considering the unique features of the quay crane scheduling problem at indented berth is formulated. For solution, decomposition heuristic framework is developed and enhanced by Tabu search. To evaluate the performance of the proposed heuristic framework, a comprehensive numerical test is carried out and its results show the good quality of the proposed heuristic framework. |
| |
Keywords: | Quay crane scheduling Indented berth Heuristics |
本文献已被 ScienceDirect 等数据库收录! |