J Shanghai Jiaotong Univ Sci

Journal of shanghai Jiaotong University (Science) ›› 2014, Vol. 19 ›› Issue (3): 337-345.doi: 10.1007/s12204-014-1507-5

Previous Articles     Next Articles

Operations Scheduling for Rail Mounted Gantry Cranes in a Container Terminal Yard

Operations Scheduling for Rail Mounted Gantry Cranes in a Container Terminal Yard

BIAN Zhan1 (边展), LI Na1 (李娜), LI Xiang-jun2 (李向军), JIN Zhi-hong1* (靳志宏)   

  1. (1. Transport Management College, Dalian Maritime University, Dalian 116026, Liaoning, China; 2. Information Engineering College, Dalian Ocean University, Dalian 116023, Liaoning, China)
  2. (1. Transport Management College, Dalian Maritime University, Dalian 116026, Liaoning, China; 2. Information Engineering College, Dalian Ocean University, Dalian 116023, Liaoning, China)
  • Online:2014-06-30 Published:2014-07-15
  • Contact: JIN Zhi-hong(靳志宏) E-mail: jinzhihong@dlmu.edu.cn

Abstract: 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.

Key words: rail mounted gantry cranes| operations scheduling| retrieving sequence| heuristic rules

摘要： 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.

关键词: rail mounted gantry cranes| operations scheduling| retrieving sequence| heuristic rules

CLC Number: