Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals. (20th November 2017)

• Record Type: Journal Article
• Authors: Zeng, Ming; Cheng, Wenming; Guo, Peng
• Other Names: Torregrosa J. R. Academic Editor.
• Is Part Of: Discrete dynamics in nature and society. Volume 2017(2017)
• Publication Date: 2017-11-20
• Subjects: System analysis -- Periodicals; Dynamics -- Periodicals; Chaotic behavior in systems -- Periodicals; Differentiable dynamical systems -- Periodicals; 003.05
• DOI: 10.1155/2017/9025482
• Languages: English
• ISSNs: 1026-0226

Abstract

Abstract : The gantry crane scheduling and storage space allocation problem in the main containers yard of railway container terminal is studied. A mixed integer programming model which comprehensively considers the handling procedures, noncrossing constraints, the safety margin and traveling time of gantry cranes, and the storage modes in the main area is formulated. A metaheuristic named backtracking search algorithm (BSA) is then improved to solve this intractable problem. A series of computational experiments are carried out to evaluate the performance of the proposed algorithm under some randomly generated cases based on the practical operation conditions. The results show that the proposed algorithm can gain the near-optimal solutions within a reasonable computation time.