Abstract
Container terminal operators have practical and clear requirements on improving operational efficiency and service level to address running challenges. The resource allocation and collaborative scheduling of quayside berth and storage yard are vital issues in the optimization of container terminal handling systems (CTHSs). The allocation of berth in quayside and blocks on storage yard directly affects the running efficiency of CTHS. Consequently, we focus on the berth and yard collaborative allocation for import and export synchronous operations (BYCA-IESOs) and propose the BYCA-IESO research model based on synchronous or asynchronous integrated scheduling strategy by computational logistics. The BYCA-IESO model is a mixed integer quadratic programming model to minimize multiple time consumption of calling liners and the total horizontal transferring distances of yard trailers at container terminals. Furthermore, we design other two allocation policies for comparison on the BYCA-IESO, which are both multistage scheduling strategy profiles. CPLEX 20.1.0 is applied to implement and solve the model and tactics of BYCA-IESO. Accordingly, the feasibility, validity, and relative merits of the models and strategies are obtained and verified by analyzing and comparing multiple numerical experimental results.
Highlights
While developing the running plan by a fixed or flexible cycle, the operator needs to determine where the vessel is planned to moor and where the concomitant containers are expected to be stored. e quayside berth allocation and the yard bay allotment both influence the turnaround time and the hatch hours of calling liners
In view of the current research situations and ongoing practical requirements, we focus on the BYCAIESO at container terminals by computational logistics. e mixed integer quadratic programming (MIQP) models for BYCA-IESO are proposed to optimize the integrated scheduling of berth and yard simultaneously. e fundamental principles and internal mechanisms are transferred, customized, and targeted purposefully from computer science and engineering to BYCA-IESO within the conceptual framework of computational logistics
We propose two other different scheduling strategies for comparison based on the following MIQP models. us, there are mainly four kinds of berth and yard collaborative allocation scheduling strategies in this paper. e first two kinds are the main models based on integrated scheduling strategy that are BYIS-SDTTand BYIS-ADTT. e latter two scheduling strategies are for comparisons with the first two strategies based on staged scheduling strategy
Summary
Μ1it1hl: binary variables, 1 if vessel i occupies the block hl of the import heavy container storage yard at time t, and 0 otherwise. Υ1it2hq: binary variables, 1 if vessel i occupies the block hq of the export heavy container storage yard at time t, and 0 otherwise. We propose a MIQP model based on the integrated scheduling of berth and yard resources for the operations of import and export containers simultaneously, which are just about BYIS-SDTT and BYISADTT. E optimization goals of the four tactics are all same that are just about the weighted sum of the total time consumption of calling liners and the total horizontal transferring distances of YTs. For one thing, whether the BYIS-SDTT or the BYISADTT both take integrated scheduling of berth allocation and yard assignment into account. All four scheduling strategies provide different planning emphasis and scheduling paradigm for BYCA-IESO from the synergy service of processor cache and main memory by the abstraction and automation of computational logistics
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
