Explore the vast range of titles available.

Purpose: Hub location problems have been utilized in various applications including rail transportation network planning, where hub serves as a key transit point within the network. In this paper, we focus on determining the optimal location for a rail transportation hub, where cost and service are trade-off.Design/methodology/approach: The problem is formulated as a multi-objective programming model with the objectives of minimizing total transportation costs and minimizing maximum travel time. A case study of rail transportation network hub planning in Thailand is presented. Given the complexity and large scale of the real-world case study, we develop and compare the Multi-Objective Tabu Search (MOTS) and Non-Dominated Sorting Genetic Algorithm II (NSGA-II) to solve the problem.Findings: The proposed algorithms yield efficient performance in terms of computational time and solution quality. Performance comparison is further analyzed to see the difference in both algorithms.Originality/value: The results offer valuable managerial insights for decision-makers in rail transportation hub network design.

This paper evaluates the robustness of a railway network with respect to operational delays. It assumes that trains in the network operate on fixed routes and with reference to a timetable. A stochastic delay propagation model is proposed for identifying primary (externally imposed) delays and for computing the resultant secondary (knock-on) delays. Delay probability distributions are computed for each train at each station on its journey, using timetable and infrastructure data for identifying potential station resource conflicts with other trains. The delay predictions are used to evaluate schedule robustness using two newly proposed metrics. Individual robustness measures the ability of trains to limit the adverse effects of their own primary delays. On the other hand, collective robustness measures the ability of the network as a whole, to limit the knock-on effects of primary delays imposed on a small fraction of trains. The two metrics provide stochastic guarantees on the punctuality of trains when the published schedule is put in operation. The applicability of the proposed methodology is validated using empirical data from a portion of the Indian Railways network, containing more than 38,000 train arrival/departure records. While a railway network is used as a case study, the same ideas can be applied to any scheduled transportation network.

It is particularly important to develop efficient air–rail intermodal path planning methods for making full use of the advantages of air–rail intermodal networks and providing passengers with richer and more reasonable travel options. A Time-Expanded Graph (TEG) is used to model the timetable information of public transportation providing a theoretical basis for public transportation path planning. However, if the TEG includes a large amount of data such as train stations, airports, train and air schedules, the network scale will become very large, making path planning extremely time-consuming. This study proposes an XGBoost-based heuristic path planning algorithm (XGB-HPPA) for large scale air–rail intermodal networks, which use the XGBoost model to predict transfer stations before path planning, and quickly eliminate unreasonable transfer edges by adding a heuristic factor, reducing the network scale, thus accelerating the computation speed. Comparative results indicate that XGB-HPPA can markedly enhance computational speed within large-scale networks, while obtaining as many valid solutions as possible and approximating the optimal solution.

Existing research concentrates on analyzing the propagation and recovery of complex network risk or failure under a single model, which makes it difficult to effectively deal with the chain reaction. Concerning the recovery delay caused by the risk–failure interactions, this paper proposes a model for the propagation and recovery of risk–failure interactions. This model not only considers the network risk–failure interactive propagation mechanism but also introduces the load-balancing strategy and repair mechanism. The study quantifies the impact of the station on network resilience after different attack modes. In addition, the resilience metrics based on the station failure are established to accurately represent the resilience evolution of the network during propagation and recovery. Finally, focusing on the Belt and Road transportation network, we explore the evolution of network resilience under the variation of failure station repair time, station risk state recovery rate, and hub station allocation parameters. The simulation results showed that the model reduced the resilience loss through resilience recovery and accelerated the network back to normal in the face of attacks, shortening the station repair time and increasing the station risk recovery rate significantly improved the overall resilience level of the network, and increasing the proportion of hub station balancing based on the residual capacity effectively improved the minimum resilience of the sea–rail intermodal transportation network.

The problem of assigning locomotives and cars to trains is a complex task for most railways. In this paper, we propose a multicommodity network flow-based model for assigning locomotives and cars to trains in the context of passenger transportation. The model has a convenient structure that facilitates the introduction of maintenance constraints, car switching penalties, and substitution possibilities. The large integer programming formulation is solved by a branch-and-bound method that relaxes some of the integrality constraints. At each node of the tree, a mixed-integer problem is solved by a Benders decomposition approach in which the LP relaxations of multicommodity network flow problems are optimized either by the simplex algorithm or by Dantzig-Wolfe decomposition. Some computational refinements, such as the generation of Pareto-optimal cuts, are proposed to improve the performance of the algorithm. Computational experiments performed on two sets of data from a railroad show that the approach can be used to produce optimal solutions to complex problems.

Transportation network companies (TNCs), such as Uber and Lyft, have been hypothesized to both complement and compete with public transit. Existing research on the topic is limited by a lack of detailed data on the timing and location of TNC trips. This study overcomes that limitation by using data scraped from the Application Programming Interfaces of two TNCs, combined with Automated Passenger Count data on transit use and other supporting data. Using a panel data model of the change in bus ridership in San Francisco between 2010 and 2015, and confirming the result with a separate time-series model, we find that TNCs are responsible for a net ridership decline of about 10%, offsetting net gains from other factors such as service increases and population growth. We do not find a statistically significant effect on light rail ridership. Cities and transit agencies should recognize the transit-competitive nature of TNCs as they plan, regulate and operate their transportation systems.

Much of the literature in recent years has examined the vulnerability of transportation networks. To identify appropriate and operational measures of nodal centrality using connectivity in the case of heavy rail systems, this paper presents a set of comprehensive measures in the form of a Degree of Nodal Connection (DNC) index. The DNC index facilitates a reevaluation of nodal criticality among distinct types of transfer stations in heavy rail networks that present a number of multiple lines between stations. Specifically, a new classification of transfer stations—mandatory transfer, non-mandatory transfer, and end transfer—and a new measure for linkages—link degree and total link degree—introduces the characteristics of heavy rail networks when we accurately expose the vulnerability of a node. The concept of partial node failure is also introduced and compare the results of complete node failure scenarios. Four local and global indicators of network vulnerability are derived from the DNC index to assess the vulnerability of major heavy rail networks in the United States. Results indicate that the proposed DNC indexes can inform decision makers or network planners as they explore and compare the resilience of multi-hubs and multi-line networks in a comprehensive but accurate manner regardless of their network sizes.

This paper deals with modelling the dynamic resilience of rail passenger transport networks affected by large-scale disruptive events whose impacts deteriorate the networks’ planned infrastructural, operational, economic, and social-economic performances represented by the selected indicators. The indicators of infrastructural performances refer to the physical and operational conditions of the networks’ lines and stations, and supportive facilities and equipment. Those of the operational performances include transport services scheduled along particular routes, their seating capacity, and corresponding transport work/capacity. The indicators of economic performances include the costs of cancelled and long-delayed transport services imposed on the main actors/stakeholder involved—the rail operator(s) and users/passengers. The indicators of social-economic performances reflect the compromised accessibility and consequent prevention of the user/passenger trips and their contribution to the local/regional/national Gross Domestic Product. Modeling resulted in developing a methodology including two sets of analytical models for: (1) assessing the dynamic resilience of a given rail network, i.e., before, during, and after the impacts of disruptive event(s); and (2) estimation of the indicators of particular performances as the figures-of-merit for assessing the network’s resilience under the given conditions. As such, the methodology could be used for estimating the resilience of different topologies of rail passenger networks affected by past, current, and future disruptive events, the latest according to the “what-if” scenario approach and after introducing the appropriate assumptions. The methodology has been applied to a past case—the Japanese Shinkansen HSR network affected by a large-scale disruptive event—the Great East Japan Earthquake on 11 March 2011.

With growing dependence of many cities on urban mass transit, even limited disruptions of public transportation networks can lead to widespread confusion and significant productivity losses. A need exists for systematic approaches to developing efficient responses to minimize such negative impacts. We present an optimization-based approach that responds to degradations of urban transit rail networks by introducing smartly designed bus bridging services that take into consideration commuter travel demand at the time of the disruption. The approach consists of three fundamental steps, namely, (1) a column generation procedure to dynamically generate demand-responsive candidate bus routes, (2) a path-based multicommodity network flow model to identify the most effective combination of these candidate bus routes, and (3) another optimization-based procedure to determine simultaneously the optimal allocation of available vehicle resources among the selected routes and corresponding headways. The approach is applied to two case studies defined using actual data. The results show that the proposed approach can be carried out efficiently and that adding nonintuitive bus routes to the standard bus bridging services can significantly reduce the average travel delay. Moreover, the approach distributes delay more equitably. Many realistic operating constraints can also be handled.

The widespread adoption of smartphones followed by an emergence of transportation network companies (TNC) have influenced the way individuals travel. The authors use the 2017 National Household Travel Survey to explore socioeconomic, frequency of use, and spatial characteristics associated with TNC users. The results indicate that TNC riders tend to be younger, earn higher incomes, have higher levels of education, and are more likely to reside in urban areas compared to the aggregate United States population. Of the TNC users, 60% hailed a ride three times or less in the previous month, indicating that TNC services are primarily used for special occasions. TNC users use public transit at higher rates and own fewer vehicles compared to the aggregate United States population. In fact, the TNC user population reported similar frequencies of use for both TNC services and public transit during the previous month. Approximately 40% of TNC users reside in regions with population densities greater than 10, 000 persons per square mile compared to only 15% for non-TNC users. Lastly, reported use of public transit for TNC users living in large cities (> 1 million) with access to heavy rail was almost three times greater when compared to similar sized cities without heavy rail. The average monthly frequency of TNC use was also elevated when heavy rail was present.