摘要
Arranging the retrieving sequence and making the operational plans for gantry cranes to enhance port efficiency have become vital issues for the container terminals. In this paper, the problem of retrieving containers from a yard in a given sequence is discussed as an important part of the ship-loading process. This problem is divided into three categories according to its optimization complexity, i.e., the retrieval problem of a crane with a single spreader(ACSS), the retrieval problem of a crane with multiple spreaders(ACMS), and the retrieval problem of multiple cranes with a single spreader(MCSS). Firstly, heuristic algorithms are proposed to develop a retrieving sequence for ACSS to reduce the operational time. Then, optimizing the assignment to multiple spreaders is conducted by exchanging the movements of the obtained retrieving sequence. Finally, the movements are further assigned to two cranes and integrated with the MCSS retrieval problem mentioned above.The numerical experiments show the effectiveness and practicability of the heuristic algorithms.
Arranging the retrieving sequence and making the operational plans for gantry cranes to enhance port efficiency have become vital issues for the container terminals. In this paper, the problem of retrieving containers from a yard in a given sequence is discussed as an important part of the ship-loading process. This problem is divided into three categories according to its optimization complexity, i.e., the retrieval problem of a crane with a single spreader （ACSS）, the retrieval problem of a crane with multiple spreaders （ACMS）, and the retrieval problem of multiple cranes with a single spreader （MCSS）. Firstly, heuristic algorithms are proposed to develop a retrieving sequence for ACSS to reduce the operational time. Then, optimizing the assignment to multiple spreaders is conducted by exchanging the movements of the obtained retrieving sequence. Finally, the movements are further assigned to two cranes and integrated with the MCSS retrieval problem mentioned above. The numerical experiments show the effectiveness and practicability of the heuristic algorithms.
基金
the National Natural Science Foundation of China(No.71172108)
the Doctoral Program Foundation of Institutions of Higher Education of China(Nos.20122125110009 and 20132125120009)
the Dalian Science and Technology Project(No.2012A17GX125)
