A Value-at-Risk (VAR) approach to routing rail hazmat shipments

Hazardous materials (hazmat) accidents are rare though the consequences could be disastrous. Given the possibility of low probability – high consequence event, a risk-averse routing hazmat shipment is necessary. We propose a value-at-risk (VaR) approach to route rail hazmat shipments, using the best train configuration, over a given railroad network with limited number of train services such that the transport risk as measured by VaR is minimized. Freight train derailment reports of the Federal Railroad Administration were analyzed to develop expressions that would incorporate characteristics of railroad accidents, and then to estimate the different inputs. The proposed methodology was used to study several problem instances generated using the realistic network of a railroad operator, and to demonstrate that it is possible to develop different routes for shipments depending on the risk preference of the decision maker.     

A threshold model of social contagion process for evacuation decision making

Individual evacuation decisions are often characterized by the influence of one’s social network. In this paper a threshold model of social contagion, originally proposed in the network science literature, is presented to characterize this social influence in the evacuation decision making process. Initiated by a single agent, the condition of a cascade when a portion of the population decides to evacuate has been derived from the model. Simulation models are also developed to investigate the effects of community mixing patterns and the initial seed on cascade propagation and the effect of previous time-steps considered by the agents and the strength of ties on average cascade size. Insights related to social influence include the significant role of mixing patterns among communities in the network and the role of the initial seed on cascade propagation. Specifically, faster propagation of warning is observed in community networks with greater inter-community connections.     

Development of a differential route share model for railroad freight traffic

This paper summarizes work undertaken towards development and calibration of a model to predict the distribution of rail freight traffic among competing routes. The model is designed for use in analyzing the traffic effects of changes in the level-of-service on selected rail lines. The model predicts route shares based on the overall network configuration of each railroad participating in a given market. The model selects feasible routes, discards those routes which appear to be too circuitous or costly, and then assigns traffic to the remaining routes in accordance with several network characteristics. It is designed to be sensitive to level-of-service changes, and to simulate the response of shippers and railroads to a competitive environment. A multiple route-finding algorithm was used to find possible routes based on the number of railroads operating at the originating and terminating end of a market. Multiple routes were determined and matched with observed traffic flows from the ICC One-Percent Waybill Sample. Physical network characteristics for each route, including distance, junction frequency, and “impedance,” were calculated from the network model and were correlated with the traffic share observed on each route in the market. A two-stage model was developed to find feasible routes from the set of possible routes and to allocate traffic to feasible routes based on levels-of-service. The model was calibrated on 9,793 routes from 1,199 markets with twenty or more carloads from the 1977 One-Percent Carload Waybill Sample. Model calibration supported the hypothesis that network route characteristics did indeed influence shipper choice of route, and that a normative model could be used to assess relative attractiveness of routes under various railroad corporate ownership restructuring scenarios.     

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.     

The relationship between property values and railroad proximity: a study based on hedonic prices and real estate brokers' appraisals

We study the relationship between the price of residential property value and proximity to railroads in Oslo, by two different methods, namely a) through a hedonic price study where the statistical relationship between property prices and railroad proximity is estimated, and b) through a multi-attribute utility investigation of real estate agents' evaluation of such a relationship. We find in both cases that there are strong effects of proximity to railroad lines on property prices, at distances less than 100 meters from the lines. In the statistical study log-linear relationships fit the data best, and our estimates indicate that a doubling of the distance from the railroad line, within a 100 meter bound, increases the property price by about 10%. With real estate agents only a linear relationship is probed. This yields an increase in the price of an average relevant housing unit by about 182,000 NOK, due to a increase in the distance to a railroad track from 20 to 100 meters. The equivalent figure from the statistical study is in the range 120–150,000 NOK. The two figures are thus of the same magnitude.     

The European freight railway system as a hub-and-spoke network

This paper addresses a hub-and-spoke network problem for railroad freight, where a central planner is to find transport routes, frequency of service, length of trains to be used, and transportation volume. Hub-and-spoke networks, often found in air freight, have not been favoured by railways in the past. Such a structure could be profitable, however, if there exist concentrated freight flows on some service links. We formulate a linear integer programming model whose objective function includes not only the typical operational cost, but also cost due to the transit time spent by freight in the network. We then develop heuristic algorithms to solve large scale instances occurring in rail freight systems in France plus Italy; Germany; and a 10-country European network. By assuming that every node is equipped with consolidation capability, we let the final solution naturally reveal potential hub locations, the impact of several of which is studied by sensitivity analysis.     

Integrating mobile agent technology with multi-agent systems for distributed traffic detection and management systems

Agent technology is rapidly emerging as a powerful computing paradigm to cope with the complexity in dynamic distributed systems, such as traffic control and management systems. However, while a number of agent-based traffic control and management systems have been proposed and the multi-agent systems have been studied, to the best of our knowledge, the mobile agent technology has not been applied to this field. In this paper, we propose to integrate mobile agent technology with multi-agent systems to enhance the ability of the traffic management systems to deal with the uncertainty in a dynamic environment. In particular, we have developed an IEEE FIPA compliant mobile agent system called Mobile-C and designed an agent-based real-time traffic detection and management system (ABRTTDMS). The system based on Mobile-C takes advantages of both stationary agents and mobile agents. The use of mobile agents allows ABRTTDMS dynamically deploying new control algorithms and operations to respond unforeseen events and conditions. Mobility also reduces incident response time and data transmission over the network. The simulation of using mobile agents for dynamic algorithm and operation deployment demonstrates that mobile agent approach offers great flexibility in managing dynamics in complex systems.     

Integrated operations planning and revenue management for rail freight transportation

In the rail industry, profit maximization relies heavily on the integration of logistics activities with an improved management of revenues. The operational policies chosen by the carrier have an important impact on the network yield and thus on global profitability. This paper bridges the gap between railroad operations planning and revenue management. We propose a new bilevel mathematical formulation which encompasses pricing decisions and network planning policies such as car blocking and routing as well as train make-up and scheduling. An exact solution approach based on a mixed integer formulation adapted to the problem structure is presented, and computational results are reported on randomly generated instances.     

Dynamic blocking for railyards: Part II. Heterogeneous traffic

Traffic through a railroad yard is said to be heterogeneous if all the destinations are not served with the same frequency. This paper presents a study of railroad yards when traffic is heterogeneous and stationary, that is, without rush hour (or rush day) phenomena. Destinations (blocks) are grouped into categories that are served with the same frequency. The number of blocks and the frequency corresponding to each class are the only traffic characteristics that need to be known to analyze a given yard. With this information it is easy to determine the minimum number of tracks needed, and the number of switches per car; a numerical example is provided. The minimum number of required tracks is always larger than that for homogeneous traffic, but under the right conditions, the number of switches can be smaller. An approximation for large numbers of blocks is used to isolate the traffic factors that make the number of switches either large or small.     

A dynamic behavioural traffic assignment model with strategic agents

Foresee traffic conditions and demand is a major issue nowadays that is very often approached using simulation tools. The aim of this work is to propose an innovative strategy to tackle such problem, relying on the presentation and analysis of a behavioural dynamic traffic assignment.The proposal relies on the assumption that travellers take routing policies rather than paths, leading us to introduce the possibility for each simulated agent to apply, in real time, a strategy allowing him to possibly re-route his path depending on the perceived local traffic conditions, jam and/or time already spent in his journey.The re-routing process allows the agents to directly react to any change in the road network. For the sake of simplicity, the agents’ strategy is modelled with a simple neural network whose parameters are determined during a preliminary training stage. The inputs of such neural network read the local information about the route network and the output gives the action to undertake: stay on the same path or modify it. As the agents use only local information, the overall network topology does not really matter, thus the strategy is able to cope with large and not previously explored networks.Numerical experiments are performed on various scenarios containing different proportions of trained strategic agents, agents with random strategies and non strategic agents, to test the robustness and adaptability to new environments and varying network conditions. The methodology is also compared against existing approaches and real world data. The outcome of the experiments suggest that this work-in-progress already produces encouraging results in terms of accuracy and computational efficiency. This indicates that the proposed approach has the potential to provide better tools to investigate and forecast drivers’ choice behaviours. Eventually these tools can improve the delivery and efficiency of traffic information to the drivers.     

Fuzzy modeling approach to the rail freight car inventory problem

Techniques to improve freight car fleet use are of considerable interest to the railroad industry. In this paper, we present a fuzzy inventory control approach applied to the sizing of empty cars on a rail network. We address the problem of deciding the optimal inventory level and the optimal ordering quantity for a rail freight car fleet system in which demand and travel time are uncertain variables represented as triangular fuzzy numbers. Based on the fuzzy economic order quantity (EOQ) formula, a modified fuzzy EOQ model is set up and the optimal policy is developed using the signed distance method to defuzzify the fuzzy total cost. Computational results made for the Serbian rail network case verify the proposed model as well as the efficiency of the approach.     

A multi-objective train scheduling model and solution

This paper develops a multi-objective optimization model for the passenger train-scheduling problem on a railroad network which includes single and multiple tracks, as well as multiple platforms with different train capacities. In this study, lowering the fuel consumption cost is the measure of satisfaction of the railway company and shortening the total passenger-time is being regarded as the passenger satisfaction criterion. The solution of the problem consists of two steps. First the Pareto frontier is determined using the -constraint method, and second, based on the obtained Pareto frontier detailed multi-objective optimization is performed using the distance-based method with three types of distances. Numerical examples are given to illustrate the model and solution methodology.     

Hedonic versus homogeneous output specifications of railroad technology: Belgian railroads 1950–1986

The purpose of this paper is twofold. First, using data on Belgian railroad operations, we provide the first application of hedonic output aggregation to the railroad industry. Second, we compare the traditional homogeneous output approach with the use of these hedonic aggregates and carefully evaluate differences in estimates of input substitution possibilities, returns to scale, and productivity growth. It is found that ignoring the role of operating characteristics in cost analyses implies substantial bias in estimates of railroad technology.     

Probabilistic analysis of the release of liquefied natural gas (LNG) tenders due to freight-train derailments

Liquefied natural gas (LNG) has emerged as a possible alternative fuel for freight railroads in the United States, due to the availability of cheap domestic natural gas and continued pursuit of environmental and energy sustainability. A safety concern regarding the deployment of LNG-powered trains is the risk of breaching the LNG tender car (a special type of hazardous materials car that stores fuel for adjacent locomotives) in a train accident. When a train is derailed, an LNG tender car might be derailed or damaged, causing a release and possible fire. This paper describes the first study that focuses on modeling the probability of an LNG tender car release incident due to a freight train derailment on a mainline. The model accounts for a number of factors such as FRA track class, method of operation, annual traffic density level, train length, the point of derailment, accident speed, the position(s) of the LNG tender(s) in a train, and LNG tender car design. The model can be applied to any specified route or network with LNG-fueled trains. The implementation of the model can be undertaken by the railroad industry to develop proactive risk management solutions when using LNG as an alternative railroad fuel.     

Optimal fueling strategies for locomotive fleets in railroad networks

Railroad companies spend billions of dollars each year to purchase fuel for thousands of locomotives across the railroad network. Each fuel station charges a site-dependent fuel price, and the railroad companies must pay an additional flat contracting fee in order to use it. This paper presents a linear mixed-integer mathematical model that integrates not only fuel station location decisions but also locomotive fueling schedule decisions. The proposed model helps railroads decide which fuel stations to contract, and how each locomotive should purchase fuel along its predetermined shipment path, such that no locomotive runs out of fuel while the summation of fuel purchasing costs, shipment delay costs (due to fueling), and contracting charges is minimized. A Lagrangian relaxation framework is proposed to decompose the problem into fueling schedule and facility location selection sub-problems. A network shortest path formulation of the fueling schedule sub-problem is developed to obtain an exact optimal solution to the fueling schedule sub-problem. The proposed framework is applied to a large-scale empirical case and is shown to effectively reduce system costs.     

A regional railroad network optimization model for coal transportation

A regional railroad network is presented to evaluate the system's response to increased coal traffic. An optimal, multimodal, coal-shipping pattern is developed for the study region to minimize total costs and to efficiently use the existing network. A two-stage, general model allocates resources among demands and then assigns flows to the network according to efficiency criteria. The model is sufficiently general to permit modification for specific needs, assumptions and data. Government agencies and industries can apply the model in resource allocation decisions and transportation policy analysis.     

Bottleneck congestion pricing and modal split: Redistribution of toll revenue

The paper examines the question of the redistribution of toll revenue as seen in a bottleneck congestion model. Our objective is to analyse the impact of this redistribution on total cost and on modal split between railroad and road. Following Tabuchi’s two-mode model (Tabuchi, T., 1993. Bottleneck congestion and modal split. Journal of Urban Economics 34, 414-431.), we integrate a redistribution of toll revenue towards public transport into our study. In this context, we investigate two kinds of road toll regimes: a fine toll and a uniform toll. We will consider two types of railroad fare: when it is set equal to the marginal cost and when it is set equal to average cost. These models allow us to show that toll policy to be more efficient as long as toll revenue is directed towards public transport when the railroad fare is equal to average cost.     

Management's role in U.S. rail passenger decline, 1920–1941

Opinions vary as to whether the decline of American railroad passenger service can be attributed primarily to consumer choice or partly to structural impedances to the supply. Results are reported from testing the hypothesis that railroad management supplied service inappropriate in the new motor era: that management catered to a small, high-priced market, whereas it should have catered to a mass, low-priced market. An aggregate demand model with non-linear elasticity characteristics is estimated on railroad traffic between a sample of American cities for 1933. The model is sensitive to speed, fare and headway variables under the control of railroad management and reveals that there was a unique fare for a service of a given speed that maximized gross revenues. The observed fare for most of the 187 cases in the study was near or below the optimal fare, showing that rail managers judged their markets well, at least in the short run.     

Multiagent architectures for intelligent traffic management systems

This paper reports our experiences with agent-based architectures for intelligent traffic management systems. We describe and compare integrated TRYS and TRYS autonomous agents, two multiagent systems that perform decision support for real-time traffic management in the urban motorway network around Barcelona. Both systems draw upon traffic management agents that use similar knowledge-based reasoning techniques in order to deal with local traffic problems. Still, the former achieves agent coordination based on a traditional centralized mechanism, while in the latter coordination emerges upon the lateral interaction of autonomous traffic management agents. We evaluate the potentials and drawbacks of both multiagent architectures for the domain, and develop some conclusions respecting the general applicability of multiagent architectures for intelligent traffic management.     

Modeling the interaction between buses,passengers and cars on a bus route using a multi-agent system

This paper models part of a public transport network (PTN), specifically, a bus route, as a small-size multi-agent system (MAS). The proposed approach is applied to a case study considering a ‘real world’ bus line within the PTN in Auckland, New Zealand. The MAS-based analysis uses modeling and simulation to examine the characteristics of the observed system – autonomous agents interacting with one another – under different scenarios, considering bus capacity and frequency of service for existing and projected public transport (PT) demand. A simulation model of a bus route is developed, calibrated and validated. Several results are attained, such as when the PT passenger load is not close to bus capacity, this load has no effect on average passenger waiting time at bus stops. The model proposed can be useful to practitioners as a tool to model the interaction between buses and other agents.