A toll-based bi-level programming approach to managing hazardous materials shipments over an intermodal transportation network

This research proposes a bi-level bi-objective model to regulate the usage of rail intermodal terminals for hazardous materials (hazmat) shipments, where government imposes tolls to deter carriers from using certain terminals. The complexity of the resulting mathematical program motivates the development of a hybrid speed-constrained multi-objective particle swarm optimization algorithm, which is then integrated with CPLEX, to solve the model. Through a real problem instance based on the intermodal service chain of Norfolk Southern in US, the toll-setting model is examined and further compared with a regular network design approach, in which certain terminals are closed to hazmat containers. The computational results show that the toll-setting policy is more practical and efficient, and the two models can be combined as a two-stage strategy in long-term hazmat transportation regulations. Additional managerial insights are derived for different stakeholders.     

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 bilevel flow model for hazmat transportation network design

In this work we consider the following hazmat transportation network design problem. A given set of hazmat shipments has to be shipped over a road transportation network in order to transport a given amount of hazardous materials from specific origin points to specific destination points, and we assume there are regional and local government authorities that want to regulate the hazmat transportations by imposing restrictions on the amount of hazmat traffic over the network links. In particular, the regional authority aims to minimize the total transport risk induced over the entire region in which the transportation network is embedded, while local authorities want the risk over their local jurisdictions to be the lowest possible, forcing the regional authority to assure also risk equity. We provide a linear bilevel programming formulation for this hazmat transportation network design problem that takes into account both total risk minimization and risk equity. We transform the bilevel model into a single-level mixed integer linear program by replacing the second level (follower) problem by its KKT conditions and by linearizing the complementary constraints, and then we solve the MIP problem with a commercial optimization solver. The optimal solution may not be stable, and we provide an approach for testing its stability and for evaluating the range of its solution values when it is not stable. Moreover, since the bilevel model is difficult to be solved optimally and its optimal solution may not be stable, we provide a heuristic algorithm for the bilevel model able to always find a stable solution. The proposed bilevel model and heuristic algorithm are experimented on real scenarios of an Italian regional network.     

Spatial decision support system for hazardous material truck routing

Shipping hazardous material (hazmat) places the public at risk. People who live or work near roads commonly traveled by hazmat trucks endure the greatest risk. Careful selection of roads used for a hazmat shipment can reduce the population at risk. On the other hand, a least time route will often consist of urban interstate, thus placing many people in harms way. Route selection is therefore the process of resolving the conflict between population at risk and efficiency considerations. To assist in resolving this conflict, a working spatial decision support system (SDSS) called Hazmat Path is developed. The proposed hazmat routing SDSS overcomes three significant challenges, namely handling a realistic network, offering sophisticated route generating heuristics and functioning on a desktop personal computer. The paper discusses creative approaches to data manipulation, data and solution visualization, user interfaces, and optimization heuristics implemented in Hazmat Path to meet these challenges.     

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.     

A bi-objective bi-level signal control policy for transport of hazardous materials in urban road networks

A bi-objective bi-level signal control optimization for hazardous material (hazmat) transport is considered to assess trade-offs between travel cost and environment impacts such as public risk exposure. A least maxi-sum risk model with explicit signal delay is presented to determine generalized travel cost for hazmat carriers. Since the bi-level signal control problem is generally a non-convex program, a bundle method using generalized gradients is proposed. A bounding strategy is developed to stabilize solutions of the bi-level program and reduce relative gaps between iterations. Numerical comparisons are made with other risk-averse models. The results indicate that the proposed bi-objective bi-level model becomes even amiable to signal control policy makers since provides flexible solutions whilst is acceptable to carriers since takes account of travel delay at signal-controlled junctions. Moreover, the trade-offs between public risk and generalized travel costs are empirically investigated among different risk models with a variety of weights. As a result, the proposed model consistently exhibits highly considerable advantage on mitigation of public risk whilst incurred less cost loss as compared to other alternatives.     

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.     

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.     

Comparing rail fuel efficiency with truck and waterway

This paper presents a railroad energy efficiency model used to estimate the fuel economies for classes of trains transporting various commodities. Comparable procedures are used to estimate truck and waterway fuel consumption. The results show that coal unit trains are 4.5–5.0 times more energy efficient than movements in the largest trucks allowed in the eastern and western regions of the US, unit grain train movements in the central US are 4.6 times more fuel efficient, soda ash unit train and non-unit train shipments are 4.9 and 3.2 times more efficient, and ethanol unit train and non-unit train movements are 4.8 and 3.0 times more efficient. In terms of barge traffic, coal unit train and non-unit train are 1.3 and 0.9 times as energy efficient in the eastern US, grain unit train and non-unit train movements are 1.7 and 1.0 times more efficient from Minneapolis to the Gulf of Mexico, and grain unit train and non-unit train movements are 1.0 and 0.7 times more fuel efficient from the Upper Ohio River to the Gulf of Mexico.     

Railroad noise: economic valuation and policy

In developed countries noise annoyance is an important source of environmental concern. Research on noise annoyance caused by railroad traffic is relatively underdeveloped. Here, a causal chain model is presented in which railroad traffic density, noise emission, noise immission and noise annoyance are causally related. Noise level, habituation and railroad usage are determinant factors. Noise annoyance causes social and economic costs, such as property value depreciation. Policy measures, aimed at reducing social and economic costs, are incorporated in various stages of the causal model. These measures can be subdivided into noise regulation and direct prevention measures. Stricter threshold values lead to higher total costs, but may lower social costs per capita. Economic feasibility of policy measures is usually analyzed by means of a cost-benefit case study. Methods of analysis used are diverse and ad hoc. Therefore, results of different case studies are not easily compared in terms of research synthesis.     

A heuristic for the train pathing and timetabling problem

In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. These important tasks were traditionally done manually, but there is an increasing move toward automated software based on mathematical models and algorithms. Most published models in the literature either focus on train timetabling only, or are too complicated to solve when facing large instances. In this paper, we present an optimization heuristic that includes both train pathing and train timetabling, and has the ability to solve real-sized instances. This heuristic allows the operation time of trains to depend on the assigned track, and also lets the minimum headway between the trains to depend on the trains’ relative status. It generates an initial solution with a simple rule, and then uses a four-step process to derive the solution iteratively. Each iteration starts by altering the order the trains travel between stations, then it assigns the services to the tracks in the stations with a binary integer program, determines the order they pass through the stations with a linear program, and uses another linear program to produce a timetable. After these four steps, the heuristic accepts or rejects the new solution according to a Threshold Accepting rule. By decomposing the original complex problem into four parts, and by attacking each part with simpler neighborhood-search processes or mathematical programs, the heuristic is able to solve realistic instances. When tested with two real-world examples, one from a 159.3 km, 29-station railroad that offers 44 daily services, and another from a 345 km, eight-station high-speed rail with 128 services, the heuristic obtained timetables that are at least as good as real schedules.     

Train design and routing optimization for evaluating criticality of freight railroad infrastructures

Freight transportation by railroads is an integral part of the U.S. economy. Identifying critical rail infrastructures can help stakeholders prioritize protection initiatives or add necessary redundancy to maximize rail network resiliency. The criticality of an infrastructure element, link or yard, is based on the increased cost (delay) incurred when that element is disrupted. An event of disruption can cause heavy congestion so that the capacity at links and yards should be considered when freight is re-routed. This paper proposes an optimization model for making-up and routing of trains in a disruptive situation to minimize the system-wide total cost, including classification time at yards and travel time along links. Train design optimization seeks to determine the optimal number of trains, their routes, and associated blocks, subject to various capacity and operational constraints at rail links and yards. An iterative heuristic algorithm is proposed to attack the computational burden for real-world networks. The solution algorithm considers the impact of volume on travel time in a congested or near-congested network. The proposed heuristics provide quality solutions with high speed, demonstrated by numerical experiments for small instances. A case study is conducted for the network of a major U.S. Class-I railroad based on publicly available data. The paper provides maps showing the criticality of infrastructure in the study area from the viewpoint of strategic planning.     

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.     

Regulating hazardous materials transportation by dual toll pricing

We investigate dual-toll setting as a policy tool to mitigate the risk of hazardous material (hazmat) shipment in road networks. We formulate the dual-toll problem as a bi-level program wherein the upper level aims at minimizing the risk, and the lower level explores the user equilibrium decision of the regular vehicles and hazmat carriers given the toll. When the upper level objective is to minimize the risk and all links are tollable, we decompose the formulation into first-stage and second-stage, and suggest a computational method to solve each stage. Our two-stage solution methodology guarantees nonnegative valid dual tolls regardless of the solution accuracy of the first-stage problem. We also consider a general dual-toll setting problem where the regulator rather wishes to minimize a combination of risk and the paid tolls and/or some links are untollable. To solve this truly bilevel problem, we provide heuristic algorithms that decompose the problem into subproblems each being solved by a line search. Case studies based on the Sioux Falls network illustrate the insights on the dual-toll policies.     

Enhancing intelligent agent collaboration for flow optimization of railroad traffic

Intelligent agents have successfully solved the train pathing problem on a small portion of railroad network [Tsen, 1995, Ph.D. Thesis, Carnegie Mellon University, USA]. As the railroad network grows, it is imperative that the agents collaborate to operate as efficiently as possible. In this paper, the authors demonstrate a collaboration protocol based on a conditional measure of agent effectiveness. Because agent effectiveness is not directly measurable, a suitable metric for agent effectiveness is introduced. Where typically agents run with uniform frequency, the collaboration protocol schedules the agents with a frequency proportional to their expected effectiveness. This protocol introduced a 10-fold improvement in the agent efficiency when tested with a simulation program on a portion of the Burlington Northern railroad.     

Stationary ultracapacitors storage device for improving energy saving and voltage profile of light transportation networks

The installation of stationary ultracapacitor storage devices, as widely recognized, allows the recovery of the braking energy for increasing the energy efficiency as well as a better pantograph voltage profile. In the paper a new methodological mean is proposed for determining the fundamental characteristics of this kind of storage device, characterized by high power density, interfaced with the railroad by a bidirectional dc-dc converter. More specifically, the parameters of the storage system can be determined by employing an optimization technique which in a quite general way is able to take contemporaneously into account several aspects in an integrated manner. Some considerations are performed for properly taking into account the stochastic aspects of the design procedure. Numerical simulations with respect to a case study are presented, pointing out the potentiality of the tailored technique. Experimental results are also reported, with reference to an electromechanical simulator, in order to put in evidence the effectiveness and the actual implementation of the proposed optimization technique.     

Comparison of external costs of rail and truck freight transportation

In this article we estimate external costs for four representative types of freight trains. For each type of freight train, we estimate three general types of external costs and compare them with the private costs experienced by railroad companies. The general types of external costs include: accidents (fatalities, injuries, and property damage); emissions (air pollution and greenhouse gases); and noise. Resulting private and external costs are compared with those of freight trucking, estimated in an earlier article. Rail external costs are 0.24 cent to 0.25 cent (US) per ton-mile, well less than the 1.11 cent for freight trucking, but external costs for rail generally constitute a larger amount relative to private costs, 9.3–22.6%, than is the case for trucking, 13.2%.     

Environmental justice and hazmat transport: A spatial analysis in southern California

This paper explores whether the risk of a toxic release during transport is greater in poor and minority neighborhoods using a combination of mapping and statistical methods. Cluster analysis is used to examine the density of facilities and transport spill events as well as test for the spatial covariance between facilities and spills. Strong clustering of transport spills is evident, as well as clustering between factory sites and transport spills. A spatial model demonstrates raised rates of transport spills surrounding clusters of toxic firms. Most spills in Los Angeles occurred within 2 km of an intermodal facility. The last step of the analysis compares risk and facility clustering between neighborhoods and socio-economic groups, finding that hazmat spills during transport disproportionately occur in Latino neighborhoods in Los Angeles. The results clarify the spatial distribution of risk and nuisance from freight in urban landscapes.     

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.     

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.