Integrated optimization on yard crane scheduling and vehicle positioning at container yards. (June 2020)

• Record Type: Journal Article
• Authors: Zhou, Chenhao; Lee, Byung Kwon; Li, Haobin
• Is Part Of: Transportation research. Volume 138(2020)
• Publication Date: 2020-06
• Subjects: Container yard -- Chebyshev movement -- Yard crane scheduling -- Vehicle position -- Integrated optimization; Logistics -- Periodicals; Transportation -- Periodicals; 388.011
• DOI: 10.1016/j.tre.2020.101966
• Languages: English
• ISSNs: 1366-5545

Abstract

Highlights: Simultaneous determination of yard crane schedule and vehicle parking positions. Propositions for determining optimal vehicle parking positions. A two-stage heuristic algorithm is developed and examined its outperformance. Fast convergence of the proposed algorithm contributes to computational competency. Abstract: A container yard is a storage facility that allows handling resources to improve operational efficiency by facilitating container flows at a container terminal. The container yard system consists of a set of storage blocks with yard cranes performing stacking and unstacking operations for containers to be transported by vehicles. High operational efficiency can be achieved by managing and coordinating the handling operations of yard cranes and vehicles (e.g., the yard crane scheduling, vehicle job dispatching, and coordinating handshakes between yard cranes and vehicles). This study proposes an integrated optimization approach for simultaneously determining the yard crane schedules and the vehicle parking positions under the Chebyshev movement allowing for the simultaneous movement of gantry and trolley of the yard crane. A mixed-integer programming model is formulated to optimize the problem, and the two-stage heuristic algorithm is developed to solve the problem efficiently. Several propositions are also provided to search the optimal boundary of vehicle parking slots for pairs of jobs. Numerical experiments are conducted to show the outperformance of the proposed heuristic algorithm compared to the well-known rule-based heuristics.