Different Routes for Conifer- and Sinapaldehyde and Higher Saccharification upon Deficiency in the Dehydrogenase CAD1
Not Available
Van Acker, Rebecca↗
SEARCH · Search NASA
Results for “ROUTING”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Facile one-step high-temperature spray pyrolysis route toward metal carbide nanopowders
Not provided.
Materials Science↗
Bringing minimal routing back to HPC through silicon photonics: a study of "flexfly" architectures with the structural simulation toolkit (SST)
Abstract not provided.
Wilke, Jeremiah↗
Electrically coupling complex oxides to semiconductors: A route to novel material functionalities
Complex oxides and semiconductors exhibit distinct yet complementary properties owing to their respective ionic and covalent natures. By electrically coupling complex oxides to traditional semiconductors within epitaxial heterostructures, enhanced or novel functionalities beyond those of the constituent materials can potentially be realized. Essential to electrically coupling complex oxides to semiconductors is control of the physical structure of the epitaxially grown oxide, as well as the electronic structure of the interface. In this paper, we discuss how composition of the perovskite A- and B-site cations can be manipulated to control the physical and electronic structure of semiconductor—complex oxide heterostructures. Two prototypical heterostructures, Ba 1-x Sr x TiO 3 /Ge and SrZr x Ti 1-x O 3 /Ge, will be discussed. In the case of Ba 1-x Sr x TiO 3 /Ge, we discuss how strain can be engineered through A-site composition to enable the re-orientable ferroelectric polarization of the former to be coupled to carriers in the semiconductor. In the case of SrZr x Ti 1-x O 3 /Ge we discuss how B-site composition can be exploited to control the band offset at the interface. Finally, analogous to heterojunctions between compound semiconducting materials, control of band offsets, i.e., band-gap engineering, provides a pathway to electrically couple complex oxides to semiconductors to realize a host of functionalities.
36 MATERIALS SCIENCE↗
Subject Matter Expert Evaluation of Multi-Flight Common Route Advisories
Traffic flow management seeks to balance the demand for National Airspace System (NAS) flight resources, such as airspace and airports, with the available supply. When forecasted weather blocks nominal air traffic routes, traffic managers must re-route affected flights for weather avoidance. Depending on the nature and scope of the weather, traffic managers may use pre-coordinated re-routes such as Playbook Routes or Coded Departure Routes, or may design ad hoc local re-routes. The routes of affected flights are modified accordingly. These weather avoidance routes will, of course, be less efficient than the nominal routes due to increased flight time and fuel burn. In current traffic management operations, the transition into a weather avoidance re-routing initiative is typically implemented more aggressively than the transition out of that initiative after the weather has dissipated or moved away. For example, strategic large-scale Playbook re-routes are sometimes left in place (as initially implemented) for many hours before being lifted entirely when the weather dissipates. There is an opportunity to periodically modify the re-routing plan as weather evolves, thereby attenuating its adverse impact on flight time and fuel consumption; this is called delay recovery. Multi-Flight Common Routes (MFCR) is a NASA-developed operational concept and associated decision support tool for delay recovery, designed to assist traffic managers to efficiently update weather avoidance traffic routes after the original re-routes have become stale due to subsequent evolution of the convective weather system. MFCR groups multiple flights to reduce the number of advisories that the traffic manager needs to evaluate, and also merges these flights on a common route segment to provide an orderly flow of re-routed traffic. The advisory is presented to the appropriate traffic manager who evaluates it and has the option to modify it using MFCRs graphical user interface. If the traffic manager finds the advisory to be operationally appropriate, he or she would coordinate with the Area Supervisor(s) of the sectors that currently control the flights in the advisory. When the traffic manager accepts the MFCR advisory via the user interface, the corresponding flight plan amendments would be sent to the displays of the appropriate sector controllers, using the Airborne Re-Routing (ABRR) capability which is scheduled for nationwide operation in 2017. The sector controllers would then offer this time-saving route modification to the pilots of the affected flights via datalink (or voice), and implement the corresponding flight plan amendment if the pilots accept it. MFCR is implemented as an application in the software environment of the Future Air traffic management Concepts Evaluation Tool (FACET). This paper focuses on an initial subject matter expert (SME) evaluation of MFCR. The evaluation covers MFCRs operational concept, algorithm, and user interface.
Human-in-the-loop Evaluation↗
Subject Matter Expert Evaluation of Multi-Flight Common Route Advisories
Traffic flow management seeks to balance the demand for National Airspace System (NAS) flight resources, such as airspace and airports, with the available supply. When forecasted weather blocks nominal air traffic routes, traffic managers must re-route affected flights for weather avoidance. Depending on the nature and scope of the weather, traffic managers may use pre-coordinated re-routes such as Playbook Routes or Coded Departure Routes, or may design ad hoc local re-routes. The routes of affected flights are modified accordingly. These weather avoidance routes will, of course, be less efficient than the nominal routes due to increased flight time and fuel burn. In current traffic management operations, the transition into a weather avoidance re-routing initiative is typically implemented more aggressively than the transition out of that initiative after the weather has dissipated or moved away. For example, strategic large-scale Playbook re-routes are sometimes left in place (as initially implemented) for many hours before being lifted entirely when the weather dissipates. There is an opportunity to periodically modify the re-routing plan as weather evolves, thereby attenuating its adverse impact on flight time and fuel consumption; this is called delay recovery. Multi-Flight Common Routes (MFCR) is a NASA-developed operational concept and associated decision support tool for delay recovery, designed to assist traffic managers to efficiently update weather avoidance traffic routes after the original re-routes have become stale due to subsequent evolution of the convective weather system. MFCR groups multiple flights to reduce the number of advisories that the traffic manager needs to evaluate, and also merges these flights on a common route segment to provide an orderly flow of re-routed traffic. The advisory is presented to the appropriate traffic manager who evaluates it and has the option to modify it using MFCRs graphical user interface. If the traffic manager finds the advisory to be operationally appropriate, he or she would coordinate with the Area Supervisor(s) of the sectors that currently control the flights in the advisory. When the traffic manager accepts the MFCR advisory via the user interface, the corresponding flight plan amendments would be sent to the displays of the appropriate sector controllers, using the Airborne Re-Routing (ABRR) capability which is scheduled for nationwide operation in 2017. The sector controllers would then offer this time-saving route modification to the pilots of the affected flights via datalink (or voice), and implement the corresponding flight plan amendment if the pilots accept it. MFCR is implemented as an application in the software environment of the Future Air traffic management Concepts Evaluation Tool (FACET). This paper focuses on an initial subject matter expert (SME) evaluation of MFCR. The evaluation covers MFCRs operational concept, algorithm, and user interface.
Traffic flow management↗
Factors Influencing the Evaluation of Spent Fuel Rail Routes - 19010
The U.S. Department of Energy (DOE) is considering use of rail transport for future shipments of commercial spent nuclear fuel (SNF) from where it currently resides to storage or disposal facilities. Rail carriers transporting in commerce certain quantities of 'rail security sensitive materials,' including SNF, face a regulatory requirement from the U.S. Department of Transportation to perform route risk assessments on an annual basis. In performing these assessments, each affected rail carrier must take into consideration twenty-seven different route factors, and document its rationale for selecting preferred and alternative routes on the basis of the safety and security risk analysis results. The major freight rail carriers operating in the U.S. have invested in the development of a proprietary tool, for rail carrier use only, to assist them in making route selections. This tool utilizes operations data input by each affected rail carrier in conjunction with geographic information systems (GIS) data to represent proximate risk factors, to be integrated and assigned to individual points and segments on the railroad network. Separate safety and security risk values are generated for each rail route under consideration. These values are then placed on an equivalent scoring basis and summed together to allow direct comparison between different route options and to rank order each route in terms of its relative attractiveness. Each affected rail carrier files an annual report for evaluation by the Federal Railroad Administration (FRA) that documents its route risk assessment approach and analysis results. DOE has developed its own decision-support tool, Stakeholder Tool for Assessing Radioactive Transportation (START), which is capable of generating and analyzing routing options for transporting SNF by rail in addition to other freight modes. To better understand how affected rail carriers are likely to route SNF shipments in accordance with regulatory requirements and those route factors likely to be most influential in impacting DoE's evaluation of alternative SNF rail routes, a study was undertaken by DOE with the following objectives: - Review the shipment routes that have been historically used by rail carriers to move high hazard materials, including SNF; - Identify the physical, operational and proximate characteristics (attributes) associated with the rail segments that comprise these routes; - Evaluate the relationships between these attributes; - Make suggestions for how to streamline the factors used in DoE's rail route evaluations; - Contrast these relationships with how the factors are used by the rail carriers in applying their tool This paper describes the study approach, analysis results, and implications for rail route selection methodology. Differences between this evaluation and railroad industry information about rail route assessments are also discussed. (authors)
12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
Constraint-Based Routing Models for the Transport of Radioactive Materials
The Department of Energy (DOE) has a historic programmatic interest in the safe and secure routing, tracking, and transportation risk analysis of radiological materials in the United States. In order to address these program goals, DOE has funded the development of several tools and related systems designed to provide insight to planners and other professionals handling radioactive materials shipments. These systems include the WebTRAGIS (Transportation Routing Analysis Geographic Information System) platform. WebTRAGIS is a browser-based routing application developed at Oak Ridge National Laboratory (ORNL) focused primarily on the safe transport of spent nuclear fuel from US nuclear reactors via railway, highway, or waterway. It is also used for the transport planning of low-level radiological waste to depositories such as the Waste Isolation Pilot Plant (WIPP) facility. One particular feature of WebTRAGIS is its coupling with high-resolution population data from ORNL s LandScan project. This allows users to obtain highly accurate population count and density information for use in route planning and risk analysis. To perform the routing and risk analysis WebTRAGIS incorporates a basic routing model methodology, with the additional application of various constraints designed to mimic US Department of Transportation (DOT), DOE, and Nuclear Regulatory Commission (NRC) regulations. Aside from the routing models available in WebTRAGIS, the system relies on detailed or specialized modal networks for the route solutions. These include a highly detailed network model of the US railroad system, the inland and coastal waterways, and a specialized highway network that focuses on the US interstate system and the designated hazardous materials and Highway Route Controlled Quantity (HRCQ) -designated roadways. The route constraints in WebTRAGIS rely upon a series of attributes assigned to the various components of the different modal networks. Routes are determined via a constrained shortest-path Dijkstra algorithm that has an assigned impedance factor. The route constraints modify the various impedance weights to bias or prefer particular network characteristics as desired by the user. Both the basic route model and the constrained impedance function calculations are determined by a series of network characteristics and shipment types. The study examines solutions under various constraints modeled by WebTRAGIS including possible routes from select shut-down reactor sites in the US to specific locations in the US. For purposes of illustration, the designated destinations are Oak Ridge National Laboratory in Tennessee and the Savannah River Site in South Carolina. To the degree that routes express sameness or variety under constraints serves to illustrate either a) the determinism of particular transport modes by either configuration or regulatory compliance, and/or b) the variety of constrained routes that are regulation compliant but may not be operationally feasible.
11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem
Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.
Montoya, Justin Vincent↗
Contact Graph Routing
Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.
Burleigh, Scott C.↗
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension
In this work, we consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2 ) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.
97 MATHEMATICS AND COMPUTING↗
Computationally-Efficient Minimum-Time Aircraft Routes in the Presence of Winds
A computationally efficient algorithm for minimizing the flight time of an aircraft in a variable wind field has been invented. The algorithm, referred to as Neighboring Optimal Wind Routing (NOWR), is based upon neighboring-optimal-control (NOC) concepts and achieves minimum-time paths by adjusting aircraft heading according to wind conditions at an arbitrary number of wind measurement points along the flight route. The NOWR algorithm may either be used in a fast-time mode to compute minimum- time routes prior to flight, or may be used in a feedback mode to adjust aircraft heading in real-time. By traveling minimum-time routes instead of direct great-circle (direct) routes, flights across the United States can save an average of about 7 minutes, and as much as one hour of flight time during periods of strong jet-stream winds. The neighboring optimal routes computed via the NOWR technique have been shown to be within 1.5 percent of the absolute minimum-time routes for flights across the continental United States. On a typical 450-MHz Sun Ultra workstation, the NOWR algorithm produces complete minimum-time routes in less than 40 milliseconds. This corresponds to a rate of 25 optimal routes per second. The closest comparable optimization technique runs approximately 10 times slower. Airlines currently use various trial-and-error search techniques to determine which of a set of commonly traveled routes will minimize flight time. These algorithms are too computationally expensive for use in real-time systems, or in systems where many optimal routes need to be computed in a short amount of time. Instead of operating in real-time, airlines will typically plan a trajectory several hours in advance using wind forecasts. If winds change significantly from forecasts, the resulting flights will no longer be minimum-time. The need for a computationally efficient wind-optimal routing algorithm is even greater in the case of new air-traffic-control automation concepts. For air-traffic-control automation, thousands of wind-optimal routes may need to be computed and checked for conflicts in just a few minutes. These factors motivated the need for a more efficient wind-optimal routing algorithm.
Jardin, Matthew R.↗
Properties of Air Traffic Conflicts for Free and Structured Routing
This paper analyzes the properties of air traffic conflicts in a future free routing system against those in the current structured routing system. Simulation of en route air traffic operations (above 18,000 ft) over the contiguous United States for a 24-hour period, constructed with initial conditions from actual air traffic data, were conducted using the Future ATM Concepts Evaluation Tool (FACET). Free routes were modeled as great circle (direct) routes from origin to destination, and structured routes were derived from actual flight plans along the current system of air routes. The conflict properties analyzed in this study include: (1) Total number of conflicts; (2) Distributions of key conflict parameters; and, (3) Categorization of conflicts into independent conflicts and two types of interacting conflicts. Preliminary results (for Denver Center traffic) indicate that conflict properties in a free routing system are different from those in the current structured routing system. In particular, a free routing system has significantly fewer conflicts, involving a correspondingly smaller number of aircraft, compared to the current structured routing system. Additionally, the conflict parameter distributions indicate that free routing conflicts are less intrusive than structured routing conflicts, and would therefore require small trajectory deviations for resolution.
Bilimoria, Karl D.↗
Economic Analysis of On-Route Fast Charging for Battery Electric Buses: Case Study in Utah
Battery electric buses (BEBs) are increasingly being embraced by transit agencies as an energy-efficient and emission-free alternative to bus fleets. However, because of the limitations of battery technology, BEBs suffer from limited driving range, great battery cost, and time-consuming charging processes. On-route fast charging technology is gaining popularity as a remedy, reducing battery cost, extending driving range, and reducing charging time. With on-route fast charging, BEBs are as capable as their diesel counterparts in relation to range and operating time. However, transit agencies may have the following concerns about on-route fast charging: 1) on-route fast charging stations require massive capital costs; 2) on-route fast charging may lead to high electricity power demand charges; and 3) charging during peak hours may increase electricity energy charges. This study conducts a quantitative economic analysis of on-route fast charging for BEBs, thereby providing some guidelines for transit agencies. An integrated optimization model is first proposed to determine battery size, charger type, and recharging schedule for a general BEB route. Based on the model, an economic analysis of on-route fast charging is then performed on 10 real-world bus routes and a simplified general bus route with different parameters. The results demonstrate that given the current prices of on-route fast charging stations and batteries, it is always beneficial to install on-route fast charging stations for BEBs. A sensitivity analysis is also conducted to show the impact of potential price reductions of batteries.
Engineering↗
An Evaluation of Controller and Pilot Performance, Workload and Acceptability under a NextGen Concept for Dynamic Weather Adapted Arrival Routing
In todays terminal operations, controller workload increases and throughput decreases when fixed standard terminal arrival routes (STARs) are impacted by storms. To circumvent this operational constraint, Prete, Krozel, Mitchell, Kim and Zou (2008) proposed to use automation to dynamically adapt arrival and departure routing based on weather predictions. The present study examined this proposal in the context of a NextGen trajectory-based operation concept, focusing on the acceptability and its effect on the controllers ability to manage traffic flows. Six controllers and twelve transport pilots participated in a human-in-the-loop simulation of arrival operations into Louisville International Airport with interval management requirements. Three types of routing structures were used: Static STARs (similar to current routing, which require the trajectories of individual aircraft to be modified to avoid the weather), Dynamic routing (automated adaptive routing around weather), and Dynamic Adjusted routing (automated adaptive routing around weather with aircraft entry time adjusted to account for differences in route length). Spacing Responsibility, whether responsibility for interval management resided with the controllers (as today), or resided with the pilot (who used a flight deck based automated spacing algorithm), was also manipulated. Dynamic routing as a whole was rated superior to static routing, especially by pilots, both in terms of workload reduction and flight path safety. A downside of using dynamic routing was that the paths flown in the dynamic conditions tended to be somewhat longer than the paths flown in the static condition.
Johnson, Walter W.↗
Identification of Robust Terminal-Area Routes in Convective Weather
Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Traffic flow management algorithms require reliable forecasts of route blockage to schedule and route traffic. This paper demonstrates how raw convective weather forecasts, which provide deterministic predictions of the vertically integrated liquid (the precipitation content in a column of airspace) can be translated into probabilistic forecasts of whether or not a terminal area route will be blocked. Given a flight route through the terminal area, we apply techniques from machine learning to determine the likelihood that the route will be open in actual weather. The likelihood is then used to optimize terminalarea operations by dynamically moving arrival and departure routes to maximize the expected capacity of the terminal area. Experiments using real weather scenarios on stormy days show that our algorithms recommend that a terminal-area route be modified 30% of the time, opening up 13% more available routes that were forecast to be blocked during these scenarios. The error rate is low, with only 5% of cases corresponding to a modified route being blocked in reality, whereas the original route is in fact open. In addition, for routes predicted to be open with probability 0.95 or greater by our method, 96% of these routes (on average over time horizon) are indeed open in the weather that materializes
Pfeil, Diana Michalek↗
Multi-objective Eco-Routing Model Development and Evaluation for Battery Electric Vehicles.
This paper develops a multi-objective eco-routing algorithm (combined eco- and travel time-optimum routing) for battery electric vehicles (BEVs) and internal combustion engine vehicles (ICEVs) and investigates the network-wide impacts of the proposed multi-objective Nash optimum (user equilibrium) traffic assignment on a large-scale network. Eco-routing is a technique that finds the most energy efficient route. ICEV and BEV energy consumption patterns are significantly different with regard to their sensitivity to driving cycles. Unlike ICEVs, BEVs are more energy efficient on low-speed arterial trips compared to highway trips. Different energy consumption patterns require different eco-routing strategies for ICEVs and BEVs. This study found that single objective eco-routing could significantly reduce the energy consumption of BEVs but also significantly increase their average travel time. Consequently, the study developed a multi-objective routing model (eco- and travel time-routing) to improve both energy and travel time measures. The model introduced a link cost function that uses the specification of the value of time and the cost of fuel/energy. The simulation study found that multi-objective routing could reduce the BEV energy consumption by 13.5%, 14.2%, 12.9%, and 10.7%, as well as ICEV fuel consumption by 0.1%, 4.3%, 3.4%, and 10.6% for “not congested, “slightly congested,” “moderately congested,” and “highly congested” conditions, respectively. The study also found that multi-objective user equilibrium routing reduced the average vehicle travel time by up to 10.1% compared to the standard user equilibrium traffic assignment for highly congested conditions, producing a solution closer to the system optimum traffic assignment. The results indicate that the proposed multi-objective eco-routing strategy can reduce vehicle fuel/energy consumption effectively with minimum impacts on travel times for both BEVs and ICEVs.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Estimating Public Dose Along Hypothetical Spent Nuclear Fuel Transportation Routes
In the future, it will be necessary to transport large quantities of spent nuclear fuel (SNF) from nuclear power plant sites to an interim storage facility (ISF) or a repository when such a facility is available. Because it is impossible to shield all of the radiation from this material, the general public will receive a very small, but quantifiable, dose from this transportation campaign. This paper describes the estimated collective effective radiation dose to the public due to SNF shipments under routine conditions and compares the estimated dose figures to the natural background radiation dose. To determine the estimated collective effective dose to the public, this analysis uses the US Department of Energy's (DOE) Stakeholder Tool for Assessing Radioactive Transportation (START), a geographic information system (GIS) routing tool, and a set of unit dose factors (UDFs) which were developed to calculate the estimated dose to the public along transportation routes. The estimated doses of radiation to which the public would be exposed during shipments of SNF is expected to be a consideration, along with many other factors, when making routing decisions. In all cases studied in this paper, estimated doses to the public will be orders of magnitude lower than the natural background radiation dose and will meet all US federal regulatory requirements for radiation dose/exposure to members of the public. The sample routes analyzed in this paper are expected to be representative of future SNF shipment routes in terms of length and mode of transportation, although they do not represent actual routes or destinations. This paper considers four routes from two shutdown reactor sites to two destinations. It must be noted that the specified origin sites are not necessarily the first sites under consideration for a de-inventory process. Further, the destination sites reviewed in this report are only to illustrate estimated dose figures along different routes and should not be taken as potential sites for an ISF or repository. For illustrative purposes only, the shortest distance rail route was found between each origin and destination point, and the collective effective dose to the public from the SNF cask was estimated along each route. This paper is not intended to make recommendations for routing decisions, but rather is intended to inform further discussion about the transportation of SNF and other radioactive materials.
12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗