Tactical berth and yard template design at container transshipment terminals: A column generation based approach

Quay-side berthing congestion is an emerging challenging issue that arises in busy container transshipment terminals and calls for effective management of terminal operations. This paper tackles the berthing congestion problem by introducing a proactive management strategy from the terminal’s perspective that adjusts the calling schedule of feeder vessels in such a way that the quay-side workload distribution in the temporal dimension can be balanced. Such a schedule template design problem is considered simultaneously with another two tactical level decision problems, berth template design (i.e., determining preferred berthing positions for vessels) and yard template design (i.e., allocating storage yard space to transshipment flows). This highly integrated problem is formulated as a set covering model. Heuristic methods based on column generation are developed to obtain near-optimal solutions in an efficient way. Computational experiments on real-world sized test instances demonstrate the efficiency and effectiveness of the proposed approach.     

Terminal and yard allocation problem for a container transshipment hub with multiple terminals

This paper presents an integer programming model for the terminal and yard allocation problem in a large container transshipment hub with multiple terminals. The model integrates two decisions: terminal allocation for vessels and yard allocation for transshipment container movements within a terminal as well as between terminals. The objective function aims to minimize the total inter-terminal and intra-terminal handling costs generated by transshipment flows. To solve the problem, we develop a 2-level heuristic algorithm to obtain high quality solutions in an efficient way. Computational experiments show the effectiveness of the proposed approach.     

Optimal space for storage yard considering yard inventory forecasts and terminal performance

This paper presents a method for forecasting the yard inventory of container terminals over an extended period, and addresses an integrated yard planning problem for determining the optimal storage space utilization by considering the yard congestion effect on terminal performance. A formulation based on random variables and probabilistic functions was developed, which allows prediction of the storage space requirement without requiring fully-integrated simulation models. Then, an integrated cost objective function was defined. Numerical experiments were performed to illustrate how the forecasting model works and to support decision-making on yard planning and design for both inbound and outbound/transshipment areas.     

A hybrid parallel genetic algorithm for yard crane scheduling

This paper aims at postulating a novel strategy in terms of yard crane scheduling. In this study, a dynamic scheduling model using objective programming for yard cranes is initially developed based on rolling-horizon approach. To resolve the NP-complete problem regarding the yard crane scheduling, a hybrid algorithm, which employs heuristic rules and parallel genetic algorithm (PGA), is then employed. Then a simulation model is developed for evaluating this approach. Finally, numerical experiments on a specific container terminal yard are used for system illustration. Computational results suggest that the proposed method is able to solve the problem efficiently.     

编组站调车场线群的调整运用模型

为了提高编组站调车场线路的有效利用率,借鉴到发线合理运用及调车场线路固定使用方法的有关研究成果,定义了调车场线群、线域的概念,建立了以股道占用、调车线最高集结车辆数、解体时间区间与编组时间区间冲突和总车流量为约束条件,以出发列车集结占用线路数量、调车线集结车流去向的分散度和调车线的空闲车数为目标函数的调车场线群调整运用模型,并结合编组站配流模型生成的配流方案及列车的解编顺序方案,给出了模型的解决思路。     

Storage pricing strategies for import container terminals under stochastic conditions

This paper presents a model for determining the optimal storage pricing schedule for import containers. A generic schedule which is characterized by a flat rate and a storage time charge is adopted. The model considers analytically the stochastic behavior of the storage yard, as input/output flows are random variables, and includes the migration to an off-dock warehouse. Two objective functions are proposed: maximizing terminal operator profits and minimizing total integrated cost of the system. Some numerical experiments are provided and a sensitivity analysis is performed to investigate the effect of main variables and approaches on the optimal solution.     

Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy

In this work, a joint planning problem for berth and yard allocation in transshipment terminals is addressed. Multi-cluster stacking strategy is proposed to split each transshipment flow into a number of container clusters and then stack each cluster in different yard blocks. A mixed integer quadratic programming model is formulated to minimize the total distance of exchanging containers between mother vessels and feeders, and the workload imbalance among yard blocks. A novel three-stage heuristic solution approach is developed and extensive numerical experiments are conducted to show the effectiveness of the proposed approach and the benefit of the multi-cluster strategy.     

A heuristic algorithm for yard truck scheduling and storage allocation problems

The yard truck scheduling and the storage allocation are two important decision problems affecting the efficiency of container terminal operations. This paper proposes a novel approach that integrates these two problems into a whole. The objective is to minimize the weighted sum of total delay of requests and the total travel time of yard trucks. Due to the intractability of the proposed problem, a hybrid insertion algorithm is designed for effective problem solutions. Computational experiments are conducted to examine the key factors of the problem and the performance of the proposed heuristic algorithm.     

Modeling the mixed storage strategy for quay crane double cycling in container terminals

A mixed storage strategy was proposed to improve the efficiency of yard operations and horizontal transportation to corporate with quay crane double cycling. The effects of the mixed storage strategy on terminal operations, including truck travel distance, yard crane operations and the number of required trucks, were analyzed. An approach based on cycle-time models, the queuing theory was proposed to evaluate the performances from long-term run. Results show using the mixed storage strategy, the truck travel distance can be decreased and the number of required trucks and yard crane’s operation time can be reduced by 16% and 26% respectively.     

编组站提钩自动化智能识别设计

为了提升编组站解编效率与现场作业安全性,进一步提高编组站作业自动化技术水平,针对解编自动化技术瓶颈,提出一种基于深度学习的编组站提钩自动化智能识别设计方案。阐述编组站提钩自动化智能识别的设计需求,从位置信息获取、作业过程监控、图像数据采集、信息数据处理等环节研究图像信息处理方法,重点研究智能识别流程,利用深度卷积神经网络模型与算法研究图像特征值提取与图像匹配识别技术实现方案。经验证,智能识别方案在试验中的平均可靠度达99.37%,为编组站解编自动化提供了一种有效技术手段。     

Optimizing the block size in container yards

A block is the basic unit of storage space in container terminals. This study proposes two methods for optimizing the block size, by considering the throughput requirements of yard cranes (YCs) and the block storage requirements. To estimate the YC performance, cycle-time models of various handling operations of YCs are analytically derived. Two types of container yards are examined: those with blocks that are laid out parallel to the quay and those laid out vertical to the quay.     

德国柏林中央客运站铁路车场设置及作业方式研究

德国柏林中央客运站集高速铁路、普速铁路、城市快轨和地铁于一体,日接发列车1300多列,是欧洲铁路网中重要的客运枢纽。柏林铁路枢纽的东西线和南北线在该站交汇,东西线方向设有2个独立的铁路车场,南北线方向设有1个共用的铁路车场,3个铁路车场均为贯通式布置。为提高车站接发车能力,该站主要办理通过列车,兼有部分始发终到列车。每个车场设置各有特点,列车作业组织紧凑有序,到发线利用率高。柏林站车场设置及作业方式可以作为大型铁路枢纽车站设计与作业组织的典型案例。     

Models and algorithms for multi-crane oriented scheduling method in container terminals

“Multi-crane oriented” is a scheduling method that yard trailers can be shared by different quay cranes. In this paper, two models for this problem are developed. The first one is a model for an inter-ship-based sharing method. In this model, yard trailers can be shared by quay cranes of different ships. To solve the model, a two-phase Tabu search algorithm is designed. The second one is a model for a ship-based sharing method. In this model, yard trailers can only be shared by quay cranes of the same ship. Q-learning algorithm is designed to solve the model. Numerical tests show that the “multi-crane oriented” method can decrease the yard trailers’ travel distance, reduce the disequilibrium of different working lines, and thus improve the operation efficiency in container terminals.     

Space allocating strategies for improving import yard performance at marine terminals

This paper focuses on the organization of the import storage yard at container port terminals. Three new stacking strategies are introduced which take into account the containers’ arrival and departure rates and the storage yard characteristics. A mathematical model based on probabilistic distribution functions is developed to estimate the number of rehandles required to manage an import container yard. The model is applied to the three proposed stacking strategies. Results show that the optimal strategy depends on stacking height and the relationship between vessel headway and container dwell time.     

Container storage and transshipment marine terminals

This study addresses the storage arrangement of transshipment containers on a container yard, in order to carry out efficiently the ship handling operations at a terminal where mega-containerships call. An optimization model is specified to investigate the flow of containers from the mega-containership to feeder ships using intermediate storage at the yard. A heuristic based on the lagrangian relaxation is formulated. The quality of the heuristic approach is tested in a number of experiments. In the experiments, various situations are analyzed with respect to mega-containership arrival rates, some strategies for stack arrangements and terminal layouts.     

Effect of block width and storage yard layout on marine container terminal performance

Block widths ranging from two to fifteen rows in a marine container terminal are evaluated by a fully-integrated, discrete event simulation model. Experiments consider dozens of yard configurations and four container terminal settings that are designed to reproduce the microscopic, stochastic, real-time environment at a multiple-berth facility. Results show that the quay crane rate is concave with respect to block width when the yard storage capacity and amount of yard equipment is constant. The optimal block width ranges from 6 to 12 rows depending on the amount of equipment deployed and the size, shape, and throughput of the terminal.     

客运专线预制梁场选址综合评价决策模型研究与应用

分析影响客运专线预制梁场选址的因素，建立客运专线预制梁场选址综合评价指标体系及决策评价模型，利用层次分析法AHP确定各评价指标权重，并结合客运专线预制梁场场址方案决策案例，对该模型进行应用分析。     

The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods

This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders’ decomposition, are developed for problem solution; namely, the general Benders’ cut-based method and the combinatorial Benders’ cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods.     

青岛铁路枢纽车流组织优化研究

青岛铁路枢纽是全国的重要铁路枢纽之一,车流组织优化有助于充分发挥青岛铁路枢纽运输能力,提高铁路枢纽作业效率。在阐述青岛铁路枢纽现状的基础上,分析青岛铁路枢纽车流、主要车站车流和车流径路。针对青岛铁路枢纽折角车流、疏港车流、蓝村西站车流、中欧班列车流组织,提出相应的折角车流组织优化方案、疏港车流组织优化方案、蓝村西站车流组织优化方案、中欧班列车流组织优化方案等,加快提升青岛铁路枢纽的运输能力,切实提高车流组织水平。     

西安南环城际铁路建设方案研究

促进关中城市群城际铁路建设,实现城际铁路与国有铁路互联互通,可以提升西安对外交通枢纽的地位。在阐述西安南环城际铁路的基础上,为实现西安铁路枢纽内城际客运系统的布局合理,提出西安南环城际铁路沿城市规划边缘方案(方案Ⅰ)、沿西部大道—航天大道方案(方案Ⅱ) 2个引入方案,推荐采用方案Ⅰ。在此基础上研究引入西安东站方案,推荐采用引入西安东站西渝高速场方案,实现西安南环城际铁路与西安铁路枢纽高速铁路的互联互通。