Storage space allocation in container terminals

Container terminals are essential intermodal interfaces in the global transportation network. Efficient container handling at terminals is important in reducing transportation costs and keeping shipping schedules. In this paper, we study the storage space allocation problem in the storage yards of terminals. This problem is related to all the resources in terminal operations, including quay cranes, yard cranes, storage space, and internal trucks. We solve the problem using a rolling-horizon approach. For each planning horizon, the problem is decomposed into two levels and each level is formulated as a mathematical programming model. At the first level, the total number of containers to be placed in each storage block in each time period of the planning horizon is set to balance two types of workloads among blocks. The second level determines the number of containers associated with each vessel that constitutes the total number of containers in each block in each period, in order to minimize the total distance to transport the containers between their storage blocks and the vessel berthing locations. Numerical runs show that with short computation time the method significantly reduces the workload imbalance in the yard, avoiding possible bottlenecks in terminal operations.     

Cranes scheduling in frame bridges based automated container terminals

This paper investigates crane scheduling problems for a new type of automated container terminal system, which is based on multi-storey frame bridges. For the new design concept, this paper studies how to schedule two types of cranes, i.e., quay cranes and bridge cranes that transfer containers between different storeys. The schedules of these two types of cranes impact the operation efficiency of the terminal system. Mathematical models are proposed for the two scheduling problems. Meta-heuristics are developed to solve them. Numerical experiments are conducted to validate the effectiveness of the proposed models and the efficiency of the proposed solution method.     

Multi-period yard template planning in container terminals

This paper is about yard management in container ports. As a tactical level decision-making tool in a port, a yard template determines the assignment of spaces (subblocks) in a yard for arriving vessels, which visit the port periodically. The objective of yard template planning is to minimize the transportation cost of moving containers around the yard. To handle yard template planning, a mixed integer programming model is proposed that also takes into account traffic congestion in the yard. A further complication is that the cycle time of the vessels' periodicities is not uniform and varies among them, perhaps being one week, ten days, or two weeks, etc. However, this multiple cycle time of the periodicities of vessel arrival patterns, which complicates the yard template decision, is also considered in the model. Moreover, a local branching based solution method and a Particle Swarm Optimization based solution method are developed for solving the model. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 24% of the transportation costs of yard trucks when compared with the commonly used First-Come-First-Served decision rule. Moreover, the proposed solution methods can not only solve the proposed model within a reasonable time, but also obtain near-optimal results with about 0.1–2% relative gap.     

Dynamic blocking for railyards: Part I. Homogeneous traffic

This paper and its companion present a study of railroad classification yard strategies that allow for blocks of destinations to be assigned to classification tracks in different ways, depending on the time of day, week or month. With the same number of tracks, more classifications can be handled by this method. The paper examines homogeneous traffic; that is, traffic patterns where all blocks have the same amount of traffic, where cars for all blocks depart equally frequently from the yard and where the overall traffic flow does not change with time. The results represent the beginning of a better understanding of yard operations, which should be useful for designing new yards, planning expansions of existing ones and evaluating the impact of changes (planned and unplanned) on traffic patterns. The paper concentrates on two sorting strategies: sorting by train (perhaps the most commonly used strategy in the United States today), and triangular sorting. For both strategies, formulas are given for the minimum number of tracks, number of switches and for the total space requirements. For triangular sorting, the yard delay and total space depend on the time chosen between reswitches. These two measures of performance can be reduced if one is willing to accept a sorting effort slightly higher than minimum. The trade-off can be explored numerically. For sorting by train, yard delay and total space are not significantly affected by the sorting method; there is no such trade-off. It appears that sorting by train results in less work, delay and space requirements than triangular sorting, at least in most instances when either could be used. Triangular sorting, however, can be used when there are not enough tracks to allow sorting by train.     

A comparison of different container sorting systems in modern rail-rail transshipment yards

Rail-rail transshipment yards act as central hub nodes within a railway network and enable a rapid consolidation of containers between different freight trains. To avoid an excessive movement of gantry cranes when transferring a container from one train to another, modern yards apply sorting systems where shuttle cars move containers horizontally along the spread of the yard. This paper compares four elementary sorting systems. Specifically, we compare rubber-tired and rail-mounted shuttles and differentiate whether a pure shuttle system or a lift & shuttle system is applied. In pure shuttle systems, a shuttle receives a container from a crane and transports it towards the destination crane, where it serves as a storage device until being unloaded. A lift & shuttle system applies shuttles with an integrated lifting platform, so that they are able to autonomously store and receive containers from a separate storage rack. Both alternatives exist in rubber-tired and rail-mounted versions. As the shuttles are the main driver of the investment costs, we compare the required fleet size for timely supplying given gantry crane schedules within all four systems. For this purpose, we derive suited scheduling procedures. This way, decision support for yard managers having to identify a suited sorting system and to layout a new terminal is provided.     

Development of a representative urban driving cycle construction methodology for electric vehicles: A case study in Xi’an

This paper develops a systematic and practical construction methodology of a representative urban driving cycle for electric vehicles, taking Xi’an as a case study. The methodology tackles four major tasks: test route selection, vehicle operation data collection, data processing, and driving cycle construction. A qualitative and quantitative comprehensive analysis method is proposed based on a sampling survey and an analytic hierarchy process to design test routes. A hybrid method using a chase car and on-board measurement techniques is employed to collect data. For data processing, the principal component analysis algorithm is used to reduce the dimensions of motion characteristic parameters, and the K-means and support vector machine hybrid algorithm is used to classify the driving segments. The proposed driving cycle construction method is based on the Markov and Monte Carlo simulation method. In this study, relative error, performance value, and speed-acceleration probability distribution are used as decision criteria for selecting the most representative driving cycle. Finally, characteristic parameters, driving range, and energy consumption are compared under different driving cycles.     

Sequencing twin automated stacking cranes in a block at automated container terminal

In the considered automated container terminal (ACT) that is designed for Shanghai Yangsha Terminal, two automated stacking cranes (ASCs) are configured for each block and they interact with automated lifting vehicles (ALVs) at the two ends of a block individually. To increase the capacity, container yards with multiple rows of blocks perpendicular to the terminal’s shoreline are considered. To utilize the yard spaces, the twin ASCs are devised to share the same tracks installed at the two sides of a block, while interferences between the ASCs challenge the routing and sequencing operations. To isolate the control and simplify the coordination of the two ASCs, the interference between ASCs is formulated by analyzing the minimal temporal intervals between any two tasks. Three models are then established to sequence the container handling tasks under the minimization of the makespan. An exact algorithm and a genetic algorithm are designed to solve the problem. Numerical experiments show that the algorithms are competitive comparing to on-the-shelf solvers. Practical implications are investigated based on the formulations and experimental results. The managerial implications and technological aspects of applying the formulations and algorithms to practical situations to real-world ACTs are discussed.     

An efficient sequencing model for humping in a rail yard

A computer model for sequencing trains into the rail yard humping process is presented. The algorithm, named HSS, consists of two main components: a screening technique and a detailed cost minimization procedure for the humping and assembly phases. The screening technique reduces the number of likely candidates for priority humping from a large number of available inbound trains in the receiving yard. The model establishes an efficient hump sequence by promoting both compatibility between inbound trains and departure trains as well as operator service priorities. Dynamic programming is used to minimize overall rail yard throughout costs for a given interval of operation. The screening technique is illustrated with the use of two simple examples. In addition, an example pilot study illustrates the sequencing of eight real trains at the CN Taschereau Rail Yard in Montreal according to the following three methods of operation: FIFO, current operation, and the proposed HSS model. Comparison of these pilot results indicates that the HSS model is very promising.     

The container retrieval problem with respect to relocation

The demand for container terminal yards is growing significantly faster than the supply of available land; therefore, containers are typically stacked high to better utilize the land space in container yards. However, in the process of container retrieval, non-productive reshuffling may be required to relocate the containers that are stacked on top of the target container. Container retrieval is directly related to the operational efficiency of terminals. Because the industry has become increasingly competitive, it has become critical to introduce a systematic approach to retrieving containers. In this study, we develop a heuristic that can generate feasible working plans for rail-mounted gantry cranes (RMGC) in container yards to minimize the number of container movements while taking the RMGC working time into consideration. The methodology takes into consideration the case that containers are grouped in terms of their retrieval order. Multi-lift RMGC models also are studied. Comprehensive numerical experiments reveal that the method runs faster than other methods published in the literature by several orders of magnitude; additionally, our method is able to solve instances larger than practical use. The number of movements approaches a theoretical lower bound, and the numerical results clearly demonstrate the tradeoff between the number of movements and the working time, and provide useful insights for yard planning.     

Scheduling of Intelligent and Autonomous Vehicles under pairing/unpairing collaboration strategy in container terminals

A new class of Intelligent and Autonomous Vehicles (IAVs) has been designed in the framework of Intelligent Transportation for Dynamic Environment (InTraDE) project funded by European Union. This type of vehicles is technologically superior to the existing Automated Guided Vehicles (AGVs), in many respects. They offer more flexibility and intelligence in maneuvering within confined spaces where the logistic operations take place. This includes the ability of pairing/unpairing enabling a pair of 1-TEU (20-foot Equivalent Unit) IAVs dynamically to join, transport containers of any size between 1-TEU and 1-FFE (40-foot Equivalent) and disjoin again. Deploying IAVs helps port operators to remain efficient in coping with the ever increasing volume of container traffic at ports and eliminate the need for deploying more 40-ft transporters in the very confined area of ports. In order to accommodate this new feature of IAVs, we review and extend one of the existing mixed integer programming models of AGV scheduling in order to minimize the makespan of operations for transporting a set of containers of different sizes between quay cranes and yard cranes. In particular, we study the case of Dublin Ferryport Terminal. In order to deal with the complexity of the scheduling model, we develop a Lagrangian relaxation-based decomposition approach equipped with a variable fixing procedure and a primal heuristics to obtain high-quality solution of instances of the problem.     

Railroad classification yard throughput: The case of multistage triangular sorting

Procedures for improving the efficiency of classification yard operations are studied in this paper. Multistage sorting strategies make efficient use of land and tracks. Equations are derived giving the service time per car and space requirements of three multistage sorting strategies: the sorting-by-block, the sorting-by-train, and the triangular sorting strategies. Exact service time formulas are given for the first two strategies, and an approximation is given for the last strategy. The approximation, when compared with exact calculations, proved to be quite robust. Errors were on the order of one percent. Sensitivity analysis showed that the formulas are accurate when assumptions used in the approximations are not satisfied. A surprising finding was that the triangular sorting strategy, which allows many more classifications on a given set of tracks than the other two, does not require significantly greater service time in flat yards. Presently, the triangular strategy is not widely used in the U.S., in preference for the sorting-by-block strategy.     

Bi-objective optimization for the container terminal integrated planning

In this paper, we study the joint optimization of the tactical berth allocation and the tactical yard allocation in container terminals, which typically consist of berth side and yard side operations. The studied two objectives are: (i) the minimization of the violation of the vessels’ expected turnaround time windows with the purpose of meeting the timetables published by shipping liners, and (ii) the minimization of the total yard transportation distance with the aim to lower terminal operational cost. We propose a bi-objective integer program which can comprehensively address the import, export and transshipment tasks in port daily practice. Traditionally, a container transshipment task is performed as a couple of import and export tasks, called indirect-transshipment mode, in which the transit container are needed to be temporally stored in the yard. As the way of transferring containers directly from the incoming vessel to the outgoing vessel, called direct-transshipment mode, has potential to save yard storage resources, the proposed model also incorporates both indirect- and direct-transshipment modes. To produce Pareto solutions efficiently, we devise heuristic approaches. Numerical experiments have been conducted to demonstrate the efficiency of the approaches.     

The benefits of a monitoring strategy for firms subject to the Emissions Trading System

This study tests the impact of Internal and External Environmental Management on performance in firms subject to the European Union’s Emissions Trading System (ETS). A conceptual model is drawn up based on the existing literature, and tested on a large sample of Italian firms. The unit of analysis is single firms subject to the ETS that are involved in Green Supply Chain Management (GSCM). The ETS mechanism has been shown to be marginally beneficial for some firms while supply chain relationships are also influenced by such system. Firms need to identify suitable practices to boost the effectiveness of their environmental strategies. We propose the implementation of a monitoring strategy as a useful practice for firms to be environmentally and economically better off. Our results show that firms subject to the ETS should rely on their own (internal) Environmental Management alone for improving environmental performance, as collaboration with suppliers only has a positive impact on economic performance. However, implementation of a monitoring strategy allows a firm subject to the ETS to partially offset the inefficiency created by the system. We show that environmental collaboration does not become more effective when a monitoring practice is put in place.     

Optimizing train operational plan in an urban rail corridor based on the maximum headway function

The train operational plan (TOP) plays a crucial role in the efficient and effective operation of an urban rail system. We optimize the train operational plan in a special network layout, an urban rail corridor with one terminal yard, by decomposing it into two sub-problems, i.e., the train departure profile optimization and the rolling stock circulation optimization. The first sub-problem synthetically optimizes frequency setting, timetabling and the rolling stock circulation at the terminal without a yard. The maximum headway function is generated to ensure the service of the train operational plan without considering travel demand, then we present a model to minimize the number of train trips, and design a heuristic algorithm to maximize the train headway. On the basis of a given timetable, the rolling stock circulation optimization only involves the terminal with a yard. We propose a model to minimize the number of trains and yard–station runs, and an algorithm to find the optimal assignment of train-trip pair connections is designed. The computational complexities of the two algorithms are both linear. Finally, a real case study shows that the train operational plan developed by our approach enables a better match of train headway and travel demand, and reduces the operational cost while satisfying the requirement of the level of service.     

Modeling of yard congestion and optimization of yard template in container ports

As a tactical-level plan, a yard template determines the assignment of spaces in a container port yard for arriving vessels. This paper investigates the concept of yard congestion quantitatively in the context of yard truck interruptions, and develops a combination of probabilistic and physics-based models for truck interruptions. The above work enables us to exactly evaluate the expected link travel time, which then acts as the basis for proposing a mixed-integer programming model that minimizes the total expected travel time of moving containers around the yard. A Squeaky Wheel Optimization based meta-heuristic is developed to solve the model. Experiments are also conducted to validate the effectiveness of the model and the solution method.     

On the existence of pricing strategies in the discrete time heterogeneous single bottleneck model

In this paper, we study the pricing strategies in the discrete time single bottleneck model with general heterogeneous commuters. We first prove that in the system optimal assignment, the queue time must be zero for all the departures. Based on this result, the system optimal problem is formulated as a linear program. The solution existence and uniqueness are discussed. Applying linear programming duality, we then prove that the optimal dual variable values provide an optimal toll with which the system optimal solution is also an equilibrium solution. Extensive computational results are reported to demonstrate the insights gained from the formulations in this paper. These results confirm that a system optimal equilibrium can be found using the proposed approach.     

Cycle Network Planning: Towards a Holistic Approach Using Temporal Topology

ABSTRACT

Current cycle-network planning (CNP) at the local level tends to be dominated by a subjective-pragmatic approach in which it is only possible to consider a limited number of route alignment possibilities and development-sequencing scenarios. Although this method may produce acceptable results, it may also be true that the final design could be improved – and the construction efficiency could be enhanced – by a more comprehensive review of the available options in relation to the objectives of the intervention. Such objectives may include accident reduction, modal shift in favour of cycling, health benefits or strategic expansion of a network. This article presents work undertaken to demonstrate a holistic approach to CNP, based on a logically defined spatio-temporal model and allowing some semi-automated multiobjective optimization of network designs in a GIS-based decision-support system. The model is introduced briefly before a case study applying this model to development of a cycle network in a small town in northeast England is described. The results obtained from this case study and the implications of this research for cycle network planners are discussed.     

Life cycle assessment of High Speed Rail in China

China has built the world’s largest High Speed Rail (HSR) network. Its environmental impacts have been examined by the means of life cycle assessment (LCA) which describes the whole picture of the HSR system instead of single stages, with a case study for the high-speed railway that links Beijing and Shanghai. The research employs the China-specific life cycle inventory database Chinese Core Life Cycle Database (CLCD). Vehicle operation dominates most impact categories, while vehicle manufacturing/maintenance/disposal and infrastructure construction contribute mostly to mineral consumption (43% and 38%) and organic compounds in water (54% for infrastructure construction). Several scenarios are developed to explore effects of changes in HSR development, utilization, electricity mix, and infrastructure planning and construction. Suggestions are provided for improving the life cycle environmental performance of China’s HSR systems.     

Considering various ALINEA ramp metering strategies for crash risk mitigation on freeways under congested regime

This study evaluates the expected benefits of using the ALINEA ramp metering algorithm as a method for real-time safety improvement on an urban freeway. The objective of this research is to use ramp metering to produce a significant decrease in the risk of crashes on the freeway while avoiding any significant adverse effects on operation. This is achieved by simulating the freeway during the congested period in micro-simulation and testing various ramp metering configurations to determine which provides the best results. Statistical measures developed for the same stretch of freeway using loop detector data are used to quantify the risk of crashes as well as the benefits in each of the alternative strategies. The study concludes that there are significant benefits in metering multiple ramps when the feedback ramp metering algorithm is implemented at multiple locations. It was found that increasing the number of metered on-ramps produces increasing safety benefits. Also, a shorter cycle length for each of the meters and a higher critical occupancy value leads to better results.     

Optimal design and benefits of a short turning strategy for a bus corridor

We develop a short turning model using demand information from station to station within a single bus line-single period setting, aimed at increasing the service frequency on the more loaded sections to deal with spatial concentration of demand considering both operators’ and users’ costs. We find analytical expressions for optimal values of the design variables, namely frequencies (inside and outside the short cycle), capacity of vehicles and the position of the short turn limit stations. These expressions are used to analyze the influence of different parameters in the final solution. The design variables and the corresponding cost components for operators and users (waiting and in-vehicle times) are compared against an optimized normal operation scheme (single frequency). Applications on actual transit corridors exhibiting different demand profiles are conducted, calculating the optimal values for the design variables and the resulting benefits for each case. Results show the typical demand configurations that are better served using a short turn strategy.