Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

At least 163 records · Page 9

PDPTW-DB: MILP-Based Offline Route Planning for PDPTW with Driver Breaks

The Pickup and Delivery Problem with Time Windows (PDPTW) involves optimizing routes for vehicles to meet pickup and delivery requests within specific time constraints, a challenge commonly faced in logistics and transportation. Microtransit, a flexible and demand-responsive service using smaller vehicles within defined zones, can be effectively modeled as a PDPTW. Yet, the need for driver breaks—a key human constraint—is frequently overlooked in PDPTW solutions, despite being necessary for regulatory compliance. This study presents a novel mixed-integer linear programming formulation for the Pickup and Delivery Problem with Time Windows and Driver Breaks (PDPTW-DB). To the best of our knowledge this formulation is the first to consider mandatory periodic driver breaks within optimized Microtransit routes. The proposed model incorporates regulatory compliant break scheduling directly within the vehicle routing optimization framework. By considering driver break requirements as an integral component of the optimization process, rather than as a post-processing step, the model enables the generation of routes that respect hours of service regulations while minimizing operational costs. This integrated approach facilitates the generation of schedules that are operationally efficient and prioritize driver welfare through driver breaks. We work with a public transit agency from the southern USA, and highlight the specific nuances of driver break optimization, and present a Pickup and Delivery Problem with Time Windows formulation for optimizing Microtransit operations and scheduling driver breaks. We validate our approach using real-world data from the transit agency. Our results validate our formulation in producing cost-effective, and regulation-compliant solutions.

Applied Computing, Transportation↗

Route-Specific Passage Proportions and Survival Rates for Fish Passing through John Day Dam, The Dalles Dam, and Bonneville Dam in 2010 and 2011

This report fulfills a request of the U.S. Army Engineer District, Portland, Oregon, to produce an interim report of estimates of route-specific fish passage proportions and survival rates for lower Columbia River dams in 2010 and 2011. The estimates are needed to update the Compass Model for the Columbia River Treaty and the new Biological Opinion before detail technical reports are published in late 2012. This report tabulates route-specific fish-passage proportions and survival rates for steelhead and Chinook salmon smolts passing through various sampled routes at John Day Dam, The Dalles Dam, and Bonneville Dam in 2010 and 2011. Results were compiled from analyses of data acquired in spring 2010 and 2011 studies that were specifically designed to estimate dam-passage and forebay-to-tailrace survival rates, travel time metrics, and spill passage efficiency, as stipulated by the 2008 Federal Columbia River Power System Biological Opinion and the Columbia Basin Fish Accords. The study designs allowed for estimation of route-specific fish passage proportions and survival rates as well as estimation of forebay-passage survival, all of which are summarized herein.

13 HYDRO ENERGY↗

WebTRAGIS: Transportation Routing Analysis Geographic System User’s Manual

The Web-Based Transportation Routing Analysis Geographic Information System (WebTRAGIS) model is a geographic information system tool for modeling transportation routing. WebTRAGIS is deployed as a browser-based application interface, and the routing engine is located on a server at Oak Ridge National Laboratory (ORNL). WebTRAGIS offers users numerous options for route calculation using uniquely value-added network databases for highway, rail, and waterway infrastructures in the continental United States. The model also provides reporting information on population densities for all transportation segments using the LandScan USA population distribution data model.

42 ENGINEERING↗

Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection

In a multiple processor computing apparatus, directional routing restrictions and a logical channel construct permit fault tolerant, deadlock-free routing. Processor allocation can be performed by creating a linear ordering of the processors based on routing rules used for routing communications between the processors. The linear ordering can assume a loop configuration, and bin-packing is applied to this loop configuration. The interconnection of the processors can be conceptualized as a generally rectangular 3-dimensional grid, and the MC allocation algorithm is applied with respect to the 3-dimensional grid.

97 MATHEMATICS AND COMPUTING↗

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by employing bandwidth shells at areas of overutilization

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a final destination. The default routing strategy is altered responsive to detection of overutilization of a particular path of one or more links, and at least some traffic is re-routed by distributing the traffic among multiple paths (which may include the default path). An alternative path may require a greater number of link traversals to reach the destination node.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

Chen, Dong↗

Verification and Validation of START: A Spent Nuclear Fuel Routing and Decision Support Tool

The Stakeholder Tool for Assessing Radioactive Transportation (START) is a web-based geospatial decision-support tool being developed by the US Department of Energy’s Office of Integrated Waste Management (IWM) to support federal interim storage for spent nuclear fuel (SNF) and associated transportation. START provides many functions for the IWM program including: serving as a communications tool for conveying geospatial data and information, an options analysis tool for exploring potential transport modes and routes for transporting SNF from nuclear power plants to future federal interim storage facilities, an emergency response planning tool for Tribes and States to identify training needs along potential SNF transport corridors, an environmental analysis tool for estimating potential radiation dose exposure from incident-free and incident-case SNF transport conditions, and a systems analysis support tool providing route-related inputs for system throughput analysis. As part of the START development process, a verification and validation (V&V) effort is being undertaken. In the initial V&V phase, several outputs of the START tool were checked such as the total distance, population and population densities within the buffer zone, and incident free dose. The V&V process is fluid as it will be utilized after each version change to ensure that the core functionalities of the tool are maintained and the results are consistent with the previous versions. Efforts have also been put into developing scripts to aid in the process of automating certain sections of the V&V work. As some of the V&V efforts use Environmental Systems Research Institute’s (ESRI) tools upon which the START framework is built, the START data were compared against outputs from tools like Quantum Geographic Information System (QGIS) for buffer zone populations and route lengths to ensure independence of the V&V process. Good agreement was observed between the START results and the independent V&V studies with the majority of the differences falling between 1% and 5% for populations within the buffer zone and route distance. This presentation describes the development and design of the START tool, V&V methods employed for various metrics of interest and their respective results, and future plans.

START, transportation, GIS, V&V↗

Fort Erie Case Study - Transition from Fixed-Route to On-Demand Transit

Rural and smaller-sized communities in North America face unique mobility challenges due to their low population density, lower public transit spending per capita compared to major cities, and a high reliance on private vehicles. In recent years, communities such as Fort Erie, Ontario, have restructured or advanced their public transit systems using on-demand services. Fort Erie is a relatively sparsely populated region of 32,901 residents, spread across a land area of 166 square kilometers (64 square miles), for an average population density of 193 residents per square kilometer (500 per square mile). In October 2021, the town implemented a mobility-on-demand system integrated with smartphone software to replace its fixed-route community bus system, which consisted of four buses with three routes, each with a roughly 1-hour, one-way loop. The new service utilizes a fleet of six minivans, two of which are retrofitted with wheelchair-accessible ramps. The system may require that a passenger requesting a standard van walk up to 400 meters (a quarter mile) to their pickup location to optimize vehicle routing while providing origin-to-destination service. The on-demand system proved effective in providing service, eclipsing pre-pandemic ridership by 40%, decreasing greenhouse gas emissions per ride by 63%, and decreasing the cost to the town per ride by 29%. This report documents both the previous system and the new system in terms of routes, ridership, costs, fuel, and other notable system parameters. This work is part of an ongoing series of case studies on providing small communities with on-demand, right-sized vehicle service coupled with a smartphone application.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗

Secure eco-routing with databases under homomorphic encryption

A method for generating energy-optimized travel routes for a motor vehicle includes one or more of the following: receiving an origin destination (OD) of the motor vehicle and an encrypted energy consumption database of the motor vehicle; generating N candidate routes for the OD; evaluating encrypted energy consumption over a route using an encrypted energy consumption database; applying at least one of homomorphic addition function or homomorphic multiplication function to the encrypted energy consumption data; and returning N candidate routes and their encrypted energy consumption to a client.

Hegde, Bharatkumar↗

Routing Options for Transporting Commercial Spent Nuclear Fuel in the Continental United States - 17504

The U.S. Department of Energy (DOE) has a goal to develop solutions for the long-term, sustainable management of the nation's spent nuclear fuel and high-level radioactive waste. The DOE is planning for an integrated waste management system to transport, store, and dispose of spent nuclear fuel and high-level radioactive waste from commercial electricity generation, as well national defense activities. The DOE Office of Nuclear Energy (DOE-NE), Office of Spent Fuel and Waste Disposition's (SFWD) Integrated Waste Management (IWM) program is applying integrated waste management system analysis, system engineering, and decision analysis principles to inform future decisions regarding potential future nuclear waste management system architectures. Integrated waste management system architecture analyses are being conducted to support the future deployment of a comprehensive system for managing nuclear waste that considers all aspects of the back-end of the nuclear fuel cycle (transportation, storage, and disposal). One aspect of a potential future nuclear waste management system is transportation of spent nuclear fuel from the fleet of commercial nuclear reactors to destinations where waste management facilities, such as an interim storage facility, would be located. Example rail transportation routes from commercial nuclear reactor sites to various locations in the continental U.S. - chosen as hypothetical locations for future waste management system facilities - were evaluated in 2014 using DOE's GIS-based Stakeholder Tool for Assessing Radioactive Transportation (START). The objective of that evaluation was to identify and parameterize generic transportation routes for use in integrated waste management system analyses, the associated uncertainty in these selections, and the uncertainty associated with different transportation route selection criteria. The analysis presented herein considers rail transportation routes from commercial nuclear reactor sites to hypothetical destinations within the continental U.S. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Intelligent network slicing and policy-based routing engine

One or more aspects of the present disclosure are directed to network optimization solutions provided as software agents (applications) executed on network nodes in a heterogenous multi-vendor environment to provide cross-layer network optimization and ensure availability of network resources to meet associated Quality of Experience (QoE) and Quality of Service (QoS). In one aspect, a network slicing engine is configured to receive at least one request from at least one network endpoint for access to the heterogeneous multi-vendor network for data transmission; receive information on state of operation of a plurality of communication links between the plurality of nodes; determine a set of data transmission routes for the request; assign a network slice for serving the request; determine, from the set of data transmission routes, an end-to-end route for the network slice; and send network traffic associated with the request using the network slice and over the end-to-end route.

Mody, Apurva N.↗

Class network routing

Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

97 MATHEMATICS AND COMPUTING↗

Connectivity-enhanced route selection and adaptive control for the Chevrolet Volt

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3%, respectively. Furthermore, these represent substantial opportunities considering that they only require software adjustments to implement.

30 DIRECT ENERGY CONVERSION↗

Connectivity-Enhanced Route Selection and Adaptive Control for the Chevrolet Volt: Preprint

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3% respectively. These represent substantial opportunities considering that they only require software adjustments to implement.

33 ADVANCED PROPULSION SYSTEMS↗