skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Routing of radioactive shipments in networks with time-varying costs and curfews

Abstract

This research examines routing of radioactive shipments in highway networks with time-dependent travel times and population densities. A time-dependent least-cost path (TDLCP) algorithm that uses a label-correcting approach is adapted to include curfews and waiting at nodes. A method is developed to estimate time-dependent population densities, which are required to estimate risk associated with the use of a particular highway link at a particular time. The TDLCP algorithm is implemented for example networks and used to examine policy questions related to radioactive shipments. It is observed that when only Interstate highway facilities are used to transport these materials, a shipment must go through many cities and has difficulty avoiding all of them during their rush hour periods. Decreases in risk, increased departure time flexibility, and modest increases in travel times are observed when primary and/or secondary roads are included in the network. Based on the results of the example implementation, the suitability of the TDLCP algorithm for strategic nuclear material and general radioactive material shipments is demonstrated.

Authors:
;  [1]
+ Show Author Affiliations
  1. Univ. of Texas, Austin, TX (United States). Dept. of Civil Engineering
Publication Date:
Research Org.:
Amarillo National Resource Center for Plutonium, TX (United States)
Sponsoring Org.:
USDOE, Washington, DC (United States); USDOE Office of Fissile Materials Disposition, Washington, DC (United States)
OSTI Identifier:
291124
Report Number(s):
ANRCP-1998-11
ON: DE99000896; BR: DP0401065;GA0101012; TRN: 99:002333
DOE Contract Number:
FC04-95AL85832
Resource Type:
Technical Report
Resource Relation:
Other Information: PBD: Sep 1998
Country of Publication:
United States
Language:
English
Subject:
05 NUCLEAR FUELS; RADIOACTIVE MATERIALS; ROUTING; ROAD TRANSPORT; ALGORITHMS; T CODES; TIME DEPENDENCE

Citation Formats

Bowler, L.A., and Mahmassani, H.S. Routing of radioactive shipments in networks with time-varying costs and curfews. United States: N. p., 1998. Web. doi:10.2172/291124.
Copy to clipboard
Bowler, L.A., & Mahmassani, H.S. Routing of radioactive shipments in networks with time-varying costs and curfews. United States. doi:10.2172/291124.
Copy to clipboard
Bowler, L.A., and Mahmassani, H.S. Tue . "Routing of radioactive shipments in networks with time-varying costs and curfews". United States. doi:10.2172/291124. https://www.osti.gov/servlets/purl/291124.
Copy to clipboard
@article{osti_291124,
title = {Routing of radioactive shipments in networks with time-varying costs and curfews},
author = {Bowler, L.A. and Mahmassani, H.S.},
abstractNote = {This research examines routing of radioactive shipments in highway networks with time-dependent travel times and population densities. A time-dependent least-cost path (TDLCP) algorithm that uses a label-correcting approach is adapted to include curfews and waiting at nodes. A method is developed to estimate time-dependent population densities, which are required to estimate risk associated with the use of a particular highway link at a particular time. The TDLCP algorithm is implemented for example networks and used to examine policy questions related to radioactive shipments. It is observed that when only Interstate highway facilities are used to transport these materials, a shipment must go through many cities and has difficulty avoiding all of them during their rush hour periods. Decreases in risk, increased departure time flexibility, and modest increases in travel times are observed when primary and/or secondary roads are included in the network. Based on the results of the example implementation, the suitability of the TDLCP algorithm for strategic nuclear material and general radioactive material shipments is demonstrated.},
doi = {10.2172/291124},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Sep 01 00:00:00 EDT 1998},
month = {Tue Sep 01 00:00:00 EDT 1998}
}
Copy to clipboard
Technical Report:
View Technical Report (7.83 MB)
DOI:  10.2172/291124
Save / Share:
Export Metadata
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.

  • ; ;
    This report is concerned with the selection of routes in a network along which to transport hazardous substances, taking into consideration several key factors pertaining to the cost of transport and the risk of population exposure in the event of an accident. Furthermore, the fact that travel time and the risk measures are not constant over time is explicitly recognized in the routing decisions. Existing approaches typically assume static conditions, possibly resulting in inefficient route selection and unnecessary risk exposure. The report described the application of recent advances in network analysis methodologies to the problem of routing hazardous substances. Severalmore » specific problem formulations are presented, reflecting different degrees of risk aversion on the part of the decision-maker, as well as different possible operational scenarios. All procedures explicitly consider travel times and travel costs (including risk measures) to be stochastic time-varying quantities. The procedures include both exact algorithms, which may require extensive computational effort in some situations, as well as more efficient heuristics that may not guarantee a Pareto-optimal solution. All procedures are systematically illustrated for an example application using the Texas highway network, for both normal and incident condition scenarios. The application illustrates the trade-offs between the information obtained in the solution and computational efficiency, and highlights the benefits of incorporating these procedures in a decision-support system for hazardous substance shipment routing decisions.« less

  • ;

  • ;
    The authors consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins tomore » a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e. in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms` computational performance as well as the properties of the solution.« less

  • ;
    The majority of current societal and economic needs world-wide are met by the existing networked, civil infrastructure. Because the cost of managing such infrastructure is high and increases with time, risk-informed decision making is essential for those with management responsibilities for these systems. To address such concerns, a methodology that accounts for new information, deterioration, component models, component importance, group importance, network reliability, hierarchical structure organization, and efficiency concerns has been developed. This methodology analyzes the use of new information through the lens of adaptive Importance Sampling for structural reliability problems. Deterioration, multi-scale bridge models, and time-variant component importance aremore » investigated for a specific network. Furthermore, both bridge and pipeline networks are studied for group and component importance, as well as for hierarchical structures in the context of specific networks. Efficiency is the primary driver throughout this study. With this risk-informed approach, those responsible for management can address deteriorating infrastructure networks in an organized manner.« less

  • The report is an analysis of the possibilities for using rate structure innovations to help improve the economic efficiency and equity of the performance of the electric utility industry. It focuses on two such innovations: the use of marginal cost concepts in the ratemaking process; and the introduction of time-varying rates.