A tabu search algorithm to solve the integrated planning of container on an inter-terminal network connected with a hinterland rail network

Transport demand for containers has been increasing for decades, which places pressure on road transport. As a result, rail transport is stimulated to provide better intermodal freight transport services. This paper investigates mathematical models for the planning of container movements in a port area, integrating the inter-terminal transport of containers (ITT, within the port area) with the rail freight formation and transport process (towards the hinterland). An integer linear programming model is used to formulate the container transport across operations at container terminals, the network interconnecting them, railway yards and the railway networks towards the hinterland. A tabu search algorithm is proposed to solve the problem. The practical applicability of the algorithm is tested in a realistic infrastructure case and different demand scenarios. Our results show the degree by which internal (ITT) and external (hinterland) transport processes interact, and the potential for improvement of overall operations when the integrated optimization proposed is used. Instead, if the planning of containers in the ITT system is optimized as a stand-alone problem, the railway terminals may suffer from longer delay times or additional train cancellations. When planning the transport of 4060 TEU containers within one day, the benefits of the ITT planning without considering railway operations account for 17% ITT cost reduction but 93% railway operational cost growth, while the benefits of integrating ITT and railway account for a reduction of 20% in ITT cost and 44% in railway operational costs.     

A bi-level model for single-line rail timetable design with consideration of demand and capacity

This paper proposes a bi-level model to solve the timetable design problem for an urban rail line. The upper level model aims at determining the headways between trains to minimize total passenger cost, which includes not only the usual perceived travel time cost, but also penalties during travel. With the headways given by the upper level model, passengers’ arrival times at their origin stops are determined by the lower level model, in which the cost-minimizing behavior of each passenger is taken into account. To make the model more realistic, explicit capacity constraints of individual trains are considered. With these constraints, passengers cannot board a full train, but wait in queues for the next coming train. A two-stage genetic algorithm incorporating the method of successive averages is introduced to solve the bi-level model. Two hypothetical examples and a real world case are employed to evaluate the effectiveness of the proposed bi-level model and algorithm. Results show that the bi-level model performs well in reducing total passenger cost, especially in reducing waiting time cost and penalties. And the section loading-rates of trains in the optimized timetable are more balanced than the even-headway timetable. The sensitivity analyses show that passenger’s desired arrival time interval at destination and crowding penalty factor have a high influence on the optimal solution. And with the dispersing of passengers' desired arrival time intervals or the increase of crowding penalty factor, the section loading-rates of trains become more balanced.     

A reliability-based assignment method for railway networks with heterogeneous passengers

Travel reliability can play an important role in shaping travelers’ route choice behavior. This paper develops a railway passenger assignment method to capture the reliability-based route choices, where the trains can have stochastic delays. The overall travel reliability has two components: the travel time reliability (of trains) and the associated transfer reliability (of connections). In this context, mean-and-variance-based effective travel cost is adopted to model passengers’ evaluation of different travel options in the railway network. Moreover, passengers are heterogeneous as they may evaluate the effective travel cost differently, and they may have different requirements for the successful transfer probability (if transfers are involved in the trip). The determination of travel time reliability (of trains) is based on the travel delay distribution, and the successful transfer probability is calculated based on the delay probabilities of two trains in the transfer process. An algorithm has been designed for solving the model, and numerical examples are presented to test and illustrate the model.     

基于遗传算法的地面常规公交与城市轨道交通接驳研究

为了研究地面常规公交与城市轨道接驳问题,构建了基于乘客交通出行时间最短优化模型,采用遗传算法进行求解,并通过具体案例进行了模型验证。结果表明建立的优化模型及遗传算法适用于接驳问题。     

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.     

New routes on old railways: increasing rail’s mode share within the constraints of the existing railway network

This paper describes an integrated methodology for identifying potential ‘quick wins’ for mode shift from road to passenger rail transport. Firstly, a procedure for analysing rail’s relative competitiveness in the market for passenger transport between large urban areas is developed and then applied to a UK case study. The purpose of such analysis is to allow the identification of flows where rail is currently relatively uncompetitive (in terms of journey time in particular) and to assess the reasons for this poor performance, so that the issues which suppress rail use may be addressed. In parallel, a framework, methodology and tool for the assessment of existing and potential capacity (trains, seats, TEUs, etc.) is developed for both passenger and freight traffic, to identify and address network constraints. An illustrative example of the use of these demand and capacity assessment tools is then presented, with the tools used to identify and evaluate flows where rail demand is suppressed by poor service quality and where spare capacity exists which would allow the passenger rail service to be improved without requiring significant investments in infrastructure. The effects of such improvements on demand are predicted, and the cost implications of operating such additional services are discussed. The analysis suggests that there may be significant potential for increasing rail’s mode share by providing additional inter-urban services where rail currently offers an inferior service.     

Measuring reliability of transportation networks using snapshots of movements in the network – An analytical and empirical study

In this paper we introduce an analytical framework based on discrete Likelihood Maximization techniques that provides estimates of operational level data of Queuing models and Transportation networks based on snapshots of data on movements of commodities in a network. We apply our methodology to detailed data on movements of containers imported from S.E. Asian ports to marine ports on the west coast of Canada, unloaded at these ports, moved to rail cars, and transported by rail to destinations in U.S. and Canada. We show how one can estimate operational level parameters such as the number of servers at the ports, schedules of departure and capacity of trains, and even speed of trains based on only snapshots of container movements in the network. Subsequently, we were able to calibrate the entire inter-continental transportation network, were able to identify the sources of variability in the network and were able to measure the reliability of the network to shocks.     

Designing personal rapid transit (PRT) networks

This paper presents a heuristic method for designing a PRT network. Because the PRT system operating characteristics and performance measures differ widely from those of conventional transit technologies, an algorithm for the PRT network design problem (NDP) is derived by using concepts from some current NDP algorithms. We minimize the sum of passenger travel time cost, construction cost, vehicle cost and operational costs, subject to an available budget of guideway, a maximum number of vehicles and given link capacities. Starting with a well-connected initial network, the algorithm eliminates and adds links iteratively as it searches for a near-optimal solution. If this solution satisfies the budget constraint, it is considered to be acceptable. Otherwise, additional links are deleted until a feasible near-optimal solution is obtained. The link elimination phase of the algorithm only considers half of the links at a time which greatly decreases computing time. None of the links in an acceptable solution will be overloaded.     

Optimal speed detector density for the network with travel time information

In the expressway network, detectors are installed on the links for detecting the travel time information while the predicted travel time can be provided by the route guidance system (RGS). The speed detector density can be determined to influence flow distributions in such a way that the precision of the travel time information and the social cost of the speed detectors are optimized, provided that each driver chooses the minimum perceived travel time path in response to the predicted travel time information. In this paper, a bilevel programming model is proposed for the network with travel time information provided by the RGS. The lower-level problem is a probit-based traffic assignment model, while the upper-level problem is to determine the speed detector density that minimizes the measured travel time error variance as well as the social cost of the speed detectors. The sensitivity analysis based algorithm is proposed for the bilevel programming problem. Numerical examples are provided to illustrate the applications of the proposed model and of the solution algorithm.     

Joint optimization of a rail transit line and its feeder bus system

A model is developed for jointly optimizing the characteristics of a rail transit route and its associated feeder bus routes in an urban corridor. The corridor demand characteristics are specified with irregular discrete distributions which can realistically represent geographic variations. The total cost (supplier plus user cost) of the integrated bus and rail network is minimized with an efficient iterative method that successively substitutes variable values obtained through classical analytic optimization. The optimized variables include rail line length, rail station spacings, bus headways, bus stop spacings, and bus route spacing. Computer programs are designed for optimization and sensitivity analysis. The sensitivity of the transit service characteristics to various travel time and cost parameters is discussed. Numerical examples are presented for integrated transit systems in which the rail and bus schedules may be coordinated.     

基于客户满意度的货运动车组开行方案研究

高铁货运逐渐兴起,本文对货运动车组开行方案优化进行了研究。针对高铁运输安全、快捷、运输成本较低等特性,提出以货运动车组及客货混编动车组为主,客运动车组捎带运输为补充的开行模式,结合运输需求、线路通过能力等限条件,以运输成本最小和货主满意度最大为目标,建立多目标综合优化模型,运用线性加权组合法,以lingo软件为依托进行求解。通过算例给出具体开行方案,并对同一运输区间各种运输方式的单位成本及用时进行对比分析。结果表明,相对于传统运输方式,高铁货运综合运输成本较低,用时更短,能够兼顾运输企业与货主的双重要求;所建模型优化效果明显,可为未来货运动车组的开行提供参考。     

The variation in the value of travel-time savings and the dilemma of high-speed rail in China

This paper examines the variation in the value of travel-time savings (VTTS), a fundamental element determining the market demand for high-speed rail. Following a review of time allocation theories, a time allocation model for general travel behavior is proposed as a further elaboration of Evans’ (1972) activities analysis. There are relationships among activities that can be expressed using a linear inequality to show the constraints on the arrangement of activities. This model indicates that two or more activities can be simultaneously rearranged to improve time management, which may be a source of variation in VTTS. This time allocation model can explain why large-scale high-speed rail construction in China faces significant market risks and a high likelihood of economic loss. Data from a new ticket sales and booking system for railway passengers indicate that passengers prefer conventional overnight sleeper trains, rather than high-speed trains, for long-distance travel, which supports the analysis of the time allocation model.     

Transport network criticality metrics: a comparative analysis and a guideline for selection

ABSTRACT

Transport network criticality analysis aims at ranking transport infrastructure elements based on their contribution to the performance of the overall infrastructure network. Despite the wide variety of transport network criticality metrics, little guidance is available on selecting metrics that are fit for the specific purpose of a study. To address this gap, this study reviews, evaluates and compares seventeen criticality metrics. First, we conceptually evaluate these metrics in terms of the functionality of the transport system that the metrics try to represent (either maintaining connectivity, reducing travel cost, or improving accessibility), the underlying ethical principles (either utilitarianism or egalitarianism), and the spatial aggregation considered by the metrics (either network-wide or localised). Next, we empirically compare the metrics by calculating them for eight transport networks. We define the empirical similarity between two metrics as the degree to which they yield similar rankings of infrastructure elements. Pairs of metrics that have high empirical similarity highlight the same set of transport infrastructure elements as critical. We find that empirical similarity is partly dependent on the network’s topology. We also observe that metrics that are conceptually similar do not necessarily have high empirical similarity. Based on the insights from the conceptual and empirical comparison, we propose a five-step guideline for transport authorities and analysts to identify the set of criticality metrics to use which best aligns with the nature of their policy questions.     

On activity-based network design problems

This paper examines network design where OD demand is not known a priori, but is the subject of responses in household or user itinerary choices to infrastructure improvements. Using simple examples, we show that falsely assuming that household itineraries are not elastic can result in a lack in understanding of certain phenomena; e.g., increasing traffic even without increasing economic activity due to relaxing of space–time prism constraints, or worsening of utility despite infrastructure investments in cases where household objectives may conflict. An activity-based network design problem is proposed using the location routing problem (LRP) as inspiration. The bilevel formulation includes an upper level network design and shortest path problem while the lower level includes a set of disaggregate household itinerary optimization problems, posed as household activity pattern problem (HAPP) (or in the case with location choice, as generalized HAPP) models. As a bilevel problem with an NP-hard lower level problem, there is no algorithm for solving the model exactly. Simple numerical examples show optimality gaps of as much as 5% for a decomposition heuristic algorithm derived from the LRP. A large numerical case study based on Southern California data and setting suggest that even if infrastructure investments do not result in major changes in link investment decisions compared to a conventional model, the results provide much higher resolution temporal OD information to a decision maker. Whereas a conventional model would output the best set of links to invest given an assumed OD matrix, the proposed model can output the same best set of links, the same daily OD matrix, and a detailed temporal distribution of activity participation and travel from which changes in peak period OD patterns can be observed.     

Designing an integrated distribution system for catering services for high-speed railways: A three-echelon location routing model with tight time windows and time deadlines

An emerging task in catering services for high-speed railways (CSHR) is to design a distribution system for the delivery of high-quality perishable food products to trains in need. This paper proposes a novel model for integrating location decision making with daily rail catering operations, which are affected by various aspects of rail planning, to meet time-sensitive passenger demands. A three-echelon location routing problem with time windows and time budget constraints (3E-LRPTWTBC) is thus proposed toward formulating this integrated distribution system design problem. This model attempts to determine the capacities/locations of distribution centers and to optimize the number of meals delivered to stations. The model also attempts to generate a schedule for refrigerated cars traveling from distribution centers to rail stations for train loading whereby meals can be catered to trains within tight time windows and sold before a specified time deadline. By relaxing the time-window constraints, a relaxation model that can be solved using an off-the-shelf mixed integer programming (MIP) solver is obtained to provide a lower bound on the 3E-LRPTWTBC. A hybrid cross entropy algorithm (HCEA) is proposed to solve the 3E-LRPTWTBC. A small-scale case study is implemented, which reveals a 9.3% gap between the solution obtained using the HCEA and that obtained using the relaxation model (RM). A comparative analysis of the HCEA and an exhaustive enumeration algorithm indicates that the HCEA shows good performance in terms of computation time. Finally, a case study considering 156 trains on the Beijing-Shanghai high-speed corridor and a large-scale case study considering 1130 trains on the Chinese railway network are addressed in a comprehensive study to demonstrate the applicability of the proposed models and algorithm.     

Long-term planning for ring-radial urban rail transit networks

Extensive work exists on regular rail network planning. However, few studies exist on the planning and design of ring-radial rail transit systems. With more ring transit lines being planned and built in Asia, Europe and the America's, a detailed study on ring transit lines is timely. An analytical model to find the optimal number of radial lines in a city for any demand distribution is first introduced. Secondly, passenger route choice for different rail networks is analyzed, for a many-to-many Origin-Destination (OD) demand distribution, based on a total travel time cost per passenger basis. The routes considered are: (1) radial lines only; (2) ring line only or radial lines and ring line combined; or (3) direct access to a destination without using the rail system. Mathematica and Matlab are used to code the route choice model. A cost-benefit optimization model to identify the feasibility and optimality of a ring line is proposed. Unlike simulations and agent-based models, this model is shown to be easily transferable to many ring-radial transit networks. The City of Calgary is used as an example to illustrate the applicability of each model. The existing urban rail network and trip distribution are major influencing factors in judging the feasibility and optimal location of the ring line. This study shows the potential net benefit of introducing a ring line by assessing changes in passengers’ costs. The changes in passenger cost parameters, such as ride cost and access cost, are shown to greatly influence the feasibility of a ring line.     

Prediction of arrival times of freight traffic on US railroads using support vector regression

Variability of travel times on the United States freight rail network is high due to large network demands relative to infrastructure capacity, especially when traffic is heterogeneous. Variable runtimes pose significant operational challenges if the nature of runtime variability is not predictable. To address this issue, this article proposes a data-driven approach to predict estimated times of arrival (ETAs) of individual freight trains, based on the properties of the train, the properties of the network, and the properties of potentially conflicting traffic on the network. The ETA prediction problem from an origin to a destination is posed as a machine learning regression problem and solved using support vector regression trained and cross validated on over two years of detailed historical data for a 140 mile section of track located primarily in Tennessee, USA. The article presents the data used in this problem and details on feature engineering and construction for predictions made across the full route. It also highlights findings on the dominant sources of runtime variability and the most predictive factors for ETA. Improvement results for ETA exceed 21% over a baseline prediction method at some locations and average 14% across the study area.     

Disruption risk management in railroad networks: An optimization-based methodology and a case study

We propose an optimization-based methodology for recovery from random disruptions in service legs and train services in a railroad network. A network optimization model is solved for each service leg to evaluate a number of what-if scenarios. The solutions of these optimization problems are then used in a predictive model to identify the critical disruption factors and accordingly design a suitable mitigation strategy. A mitigation strategy, such as adding flexible or redundant capacity in the network, is an action that is deliberately taken by management in order to hedge against the cost and impact of disruption if it occurs. It is important that managers consider the trade-offs between the cost of mitigation strategy and the expected cost of disruption. The proposed methodology is applied to a case study built using the realistic infrastructure of a railroad network in the mid-west United States. The resulting analysis underscores the importance of accepting a slight increase in pre-disruption transportation costs, which in turn will enhance network resiliency by building dis-similar paths for train services, and by installing alternative links around critical service legs.     

Automated shunting of rail container wagons in ports and terminal areas

The development of intermodal container transport is hampered in part by the cost associated with the shunting of trains in marshalling yards, inland and port railway terminals. Many new technologies have been developed in the past decade, but have still not been applied because of high capital investment costs, lack of sufficient market demand and uncertain rates of return. The key for increasing the competitiveness of intermodal container transport by rail is the operation of heavy haul container trains between port and inland railway terminals more frequently with fast, flexible and automatic transhipment, shunting and coupling of container wagons. The operation of self-driven railcars equipped with automatic centre coupling on terminal tracks, which can also be train-hauled on conventional hinterland railway lines, would enable a reduction of shunting and transhipment time and costs in intermodal container terminals by more than 30%.     

Standardization of capacity unit for headway-based rail capacity analysis

Determining the required capacity upgrades to accommodate future demand is a critical process in assisting public and private financing of capacity investments. Conventional railway systems usually operate multiple types of trains on the same track. These different types of trains can exert substantially different capacity impact, and can cause serious operational conflicts. In the past, rail line capacity is commonly defined as the maximum number of trains that can be operated on a section of track within a given time period. However, a specific unit (trains/hr or trains/day) does not reflect the heterogeneity of train types. According to the concept of base train equivalents (BTE) and base train unit (BTU), this study developed headway-based models to determine BTE for transforming different train types into a standard unit (i.e., BTU). An approximate method for lines with three and more types of trains was also proposed to compute BTEs for non-base trains. Results from the case studies demonstrate that this method enables the standardization of rail capacity unit, facilitates assessment of the impact from heterogeneous trains, and allows comparison and evaluation of the capacity measurements from different lines and systems.