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:
-
- 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.
Bowler, L A, & Mahmassani, H S. Routing of radioactive shipments in networks with time-varying costs and curfews. United States. https://doi.org/10.2172/291124
Bowler, L A, and Mahmassani, H S. 1998.
"Routing of radioactive shipments in networks with time-varying costs and curfews". United States. https://doi.org/10.2172/291124. https://www.osti.gov/servlets/purl/291124.
@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},
url = {https://www.osti.gov/biblio/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}
}