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 109 records · Page 6

Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities—Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI—and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Empirical Study of Effect of Dynamic Travel Time Information on Driver Route Choice Behavior

The objective of this paper is to study the effect of travel time information on day-to-day driver route choice behavior. A real-world experimental study is designed to have participants repeatedly choose between two alternative routes for five origin-destination pairs over multiple days after providing them with dynamically updated travel time information (average travel time and travel time variability). The results demonstrate that historical travel time information enhances behavioral rationality by 10% on average and reduces inertial tendencies to increase risk seeking in the gain domain. Furthermore, expected travel time information is demonstrated to be more effective than travel time variability information in enhancing rational behavior when drivers have limited experiences. After drivers gain sufficient knowledge of routes, however, the difference in behavior associated with the two information types becomes insignificant. The results also demonstrate that, when drivers lack experience, the faster less reliable route is more attractive than the slower more reliable route. However, with cumulative experiences, drivers become more willing to take the more reliable route given that they are reluctant to become risk seekers once experience is gained. Furthermore, the effect of information on driver behavior differs significantly by participant and trip, which is, to a large extent, dependent on personal traits and trip characteristics.

99 GENERAL AND MISCELLANEOUS↗

Automating Risk Assessments of Hazardous Material Shipments for Transportation Routes and Mode Selection

The METEOR project at Idaho National Laboratory (INL) successfully addresses the difficult problem in risk assessment analyses of combining the results from bounding deterministic simulation results with probabilistic (Monte Carlo) risk assessment techniques. This paper describes a software suite designed to perform sensitivity and cost/benefit analyses on selected transportation routes and vehicles to minimize risk associated with the shipment of hazardous materials. METEOR uses Monte Carlo techniques to estimate the probability of an accidental release of a hazardous substance along a proposed transportation route. A METEOR user selects the mode of transportation, origin and destination points, and charts the route using interactive graphics. Inputs to METEOR (many selections built in) include crash rates for the specific aircraft, soil/rock type and population densities over the proposed route, and bounding limits for potential accident types (velocity, temperature, etc.). New vehicle, materials, and location data are added when available. If the risk estimates are unacceptable, the risks associated with alternate transportation modes or routes can be quickly evaluated and compared. Systematic optimizing methods will provide the user with the route and vehicle selection identified with the lowest risk of hazardous material release. The effects of a selected range of potential accidents such as vehicle impact, fire, fuel explosions, excessive containment pressure, flooding, etc. are evaluated primarily using hydrocodes capable of accurately simulating the material response of critical containment components. Bounding conditions that represent credible accidents (i.e; for an impact event, velocity, orientations, and soil conditions) are used as input parameters to the hydrocode models yielding correlation functions relating accident parameters to component damage. The Monte Carlo algorithms use random number generators to make selections at the various decision points such as; crash, location, etc. For each pass through the routines, when a crash is randomly selected, crash parameters are then used to determine if failure has occurred using either external look up tables, correlations functions from deterministic calculations, or built in data libraries. The effectiveness of the software was recently demonstrated in safety analyses of the transportation of radioisotope systems for the US Dept. of Energy. These methods are readily adaptable to estimating risks associated with a variety of hazardous shipments such as spent nuclear fuel, explosives, and chemicals.

42 ENGINEERING↗

Transfissural Route Used for Preoperative Localization of Small Pulmonary Lesions with a Short Hook Wire and Suture System

PurposeWe retrospectively evaluated the results of the transfissural route for preoperative localization with a short hook wire and suture system for video-assisted thoracoscopic surgery (VATS).MethodsEleven patients with 11 tumors underwent CT-guided transfissural placement of a hook wire before VATS. This route was selected for all patients, because the distance between the tumor and interlobar fissure was much shorter than the required distance traversed using the conventional approach. Complications were evaluated using the National Cancer Institute Common Terminology Criteria for Adverse Events Version 4.0.ResultsThe hook wire was successfully placed using the transfissural route in all but one case. Of these ten successful placements, two tumors needed a second puncture for optimal placement, because the CT scan showed that the first hook wire was not properly placed in the lung. In one patient, we did not attempt replacement after the first placement was incorrect. In ten successful procedures, the mean distance traversed in the parenchyma of the unaffected lung lobe was 27.9 mm. The distance between the pleura and placed hook wire was significantly shorter than the estimated distance between the pleura and hook wire using the conventional route (mean 16.3 vs. 40.9 mm; P = 0.0002). Grade 1 adverse events occurred (11 pneumothoraxes and 4 pulmonary hemorrhages). No grade 2 or higher adverse event was observed.ConclusionsThe transfissural route used for preoperative localization before VATS is useful for selected patients because this route may allow for more limited lung parenchyma resection.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Synthesis of graphene platelets by chemical and electrochemical route

Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH{sub 4} was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide.

36 MATERIALS SCIENCE↗

Improving River Routing Using a Differentiable Muskingum‐Cunge Model and Physics‐Informed Machine Learning

Recently, rainfall-runoff simulations in small headwater basins have been improved by methodological advances such as deep neural networks (NNs) and hybrid physics-NN models—particularly, a genre called differentiable modeling that intermingles NNs with physics to learn relationships between variables. However, hydrologic routing simulations, necessary for simulating floods in stem rivers downstream of large heterogeneous basins, had not yet benefited from these advances and it was unclear if the routing process could be improved via coupled NNs. We present a novel differentiable routing method (δMC-Juniata-hydroDL2) that mimics the classical Muskingum-Cunge routing model over a river network but embeds an NN to infer parameterizations for Manning's roughness (n) and channel geometries from raw reach-scale attributes like catchment areas and sinuosity. The NN was trained solely on downstream hydrographs. Synthetic experiments show that while the channel geometry parameter was unidentifiable, n can be identified with moderate precision. With real-world data, the trained differentiable routing model produced more accurate long-term routing results for both the training gage and untrained inner gages for larger subbasins (>2,000 km2) than either a machine learning model assuming homogeneity, or simply using the sum of runoff from subbasins. The n parameterization trained on short periods gave high performance in other periods, despite significant errors in runoff inputs. The learned n pattern was consistent with literature expectations, demonstrating the framework's potential for knowledge discovery, but the absolute values can vary depending on training periods. The trained n parameterization can be coupled with traditional models to improve national-scale hydrologic flood simulations.

54 ENVIRONMENTAL SCIENCES↗

Effect of process route on powder three-dimensional-printing of metal powders

The purpose of this study is to investigate the effect of two unique processing routes (solvent jetting (SJ) and binder jetting (BJ)), on the green density of printed stainless steel 316L (SS316L) and Nickel (Ni) powders. In the SJ processing route, a solvent is jetted unto the powder/binder mixture to selectively activate the binder, layer by layer. In the BJ processing route, a solution of the binder mixture is jetted onto the powder bed to selectively bind powder particles. The effects of printing parameters such as layer height, roller speed, shaker speed and nozzle temperature on the green density of printed components are investigated and compared for both processing routes. Results show that layer height and nozzle temperature affect the relative density of the printed compact for both processing routes. Slightly higher relative densities were achieved via the SJ route, with the overall highest relative density being 42.7% at 100 µ m layer height and 70% nozzle temperature for the SS316L components and 43.7% at 150 µ m layer height and 90% nozzle temperature for the Ni components, respectively. Results also show an increase in the final sintered relative density with an increase in green (printed) relative density of the solvent jetted SS316L components, with the highest relative density being 87.2%. The paper studies the influence of printing parameters on the green density of printed SS316L and Ni samples in an unprecedented effort to provide a comparative understanding of the process-property relationships in BJ and SJ of SS316L and Ni components to the additive manufacturing research community.

Engineering↗

PC-RPL: Joint Control of Routing Topology and Transmission Power in Real Low-Power and Lossy Networks

We present PC-RPL , a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through actual design, implementation, and experiments that a multihop wireless network can achieve better throughput and routing stability when transmission power and routing topology are “jointly and adaptively” controlled. Our experiments show that the predominant “fixed and uniform” transmission power strategy with “link quality and hop distance”–based routing topology construction (i.e., RPL) loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, named PC-RPL , on top of the standard RPL routing protocol for hidden terminal mitigation and load balancing. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses by approximately sevenfold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% improvement for the worst-case node by successfully alleviating both hidden terminal and load imbalance problems.

Computer Science↗

Factors Affecting Route Selection and Survival of Steelhead Kelts at Snake River Dams in 2012 and 2013

In 2012 and 2013, Pacific Northwest National Laboratory (PNNL) conducted a study that summarized the passage route proportions and route-specific survival rates of steelhead kelts that passed through Federal Columbia River Power System (FCRPS) dams. To accomplish this, a total of 811 steelhead kelts were tagged with Juvenile Salmon Acoustic Telemetry System (JSATS) transmitters. Acoustic receivers, both autonomous and cabled, were deployed throughout the FCRPS to monitor the downstream movements of tagged kelts. Kelts were also tagged with passive integrated transponder tags to monitor passage through juvenile bypass systems (JBS) and detect returning fish. The current study evaluated data collected in 2012 and 2013 to identify environmental, temporal, operational, individual, and behavioral variables that were related to forebay residence time, route of passage, and survival of steelhead kelts at FCRPS dams on the Snake River. Multiple approaches, including 3-D tracking, bivariate and multivariable regression modeling, and decision tree analyses were used to identify the environmental, temporal, operational, individual, and behavioral variables that had the greatest effect on forebay residence time, route of passage, and route-specific and overall dam passage survival probabilities for tagged kelts at Lower Granite (LGR), Little Goose (LGS), and Lower Monumental (LMN) dams. In general, kelt behavior and discharge appeared to work independently to affect forebay residence times. Kelt behavior, primarily approach location, migration depth, and “searching” activities in the forebay, was found to have the greatest influence on their route of passage. The condition of kelts was the single most important factor affecting their survival. The information gathered in this study may be used by dam operators and fisheries managers to identify potential management actions to improve in-river survival of kelts or collection methods for kelt reconditioning programs to aid the recovery of Snake River steelhead populations.

13 HYDRO ENERGY↗

Zone routing in a torus network

A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

97 MATHEMATICS AND COMPUTING↗

The Balanced Billing Cycle Vehicle Routing Problem

Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. We discuss the performance of our procedure on a real-world data set.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dynamic traffic routing in a network with adaptive signal control

In real traffic networks, travellers’ route choice is affected by traffic control strategies. In this work, we capture the interaction between travellers’ route choice and traffic signal control in a coherent framework. For travellers’ route choice, a VANET (Vehicular Ad hoc NETwork) is considered, where travellers have access to the real-time traffic information through V2V/V2I (Vehicle to Vehicle/Vehicle to Infrastructure) infrastructures and make route choice decisions at each intersection using hyper-path trees. We test our algorithm and control strategy by simulation in OmNet++ (A network communication simulator) and SUMO (Simulation of Urban MObility) under several scenarios. The simulation results show that with the proposed dynamic routing, the overall travel cost significantly decreases. Lastly, it is also shown that the proposed adaptive signal control reduces the average delay effectively, as well as reduces the fluctuation of the average speed within the whole network.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Flow Routing on the Unstructured Voronoi Meshes in Earth System Modeling

Flow routing is a fundamental process of Earth System Models' (ESMs) river component. Traditional flow routing models rely on Cartesian rectangular meshes, which exhibit limitations, particularly when coupled with unstructured mesh-based ocean components. They also lack the support for regionally refined models. While previous studies have highlighted the potential benefits of unstructured meshes for flow routing, their widespread application and comprehensive evaluation within ESMs remain limited. This study extends the river component of the Energy Exascale Earth System Model to unstructured Voronoi meshes. We evaluated the model's performance in simulating river discharge and water depth across three watersheds spanning the Arctic, temperate, and tropical regions. The results show that while providing several benefits, unstructured mesh-based flow routing can achieve comparable performance to structured mesh-based routing, and their difference is often less than 10%. Although the unstructured mesh-based method could address several existing limitations, this research also shows that additional improvements in the numerical method are needed to fully exploit the advantages of unstructured mesh for hydrologic and ESMs.

54 ENVIRONMENTAL SCIENCES↗

Capacitated arc routing problem and its extensions in waste collection

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TPR: Traffic Pattern-based Adaptive Routing for Dragonfly Networks

The Cray Cascade architecture uses Dragonfly as its interconnect topology and employs a globally adaptive routing scheme called UGAL. UGAL directs traffic based on link loads but may make inappropriate adaptive routing decisions in various situations, which degrades its performance. Here in this work, we propose traffic pattern-based adaptive routing (TPR) for Dragonfly that improves UGAL by incorporating a traffic pattern-based adaptation mechanism. The idea is to explicitly use the link usage statistics that are collected in performance counters to infer the traffic pattern, and to take the inferred traffic pattern plus link loads into consideration when making adaptive routing decisions. Furthermore, our performance evaluation results on a diverse set of traffic conditions indicate that by incorporating the traffic pattern-based adaptation mechanism, TPR is much more effective in making adaptive routing decisions and achieves significant lower latency under low load and higher throughput under high load than its underlying UGAL.

97 MATHEMATICS AND COMPUTING↗

A Physically Based Runoff Routing Model for Land Surface and Earth System Models

A new physically based runoff routing model, called the Model for Scale Adaptive River Transport (MOSART), has been developed to be applicable across local, regional, and global scales. Within each spatial unit, surface runoff is first routed across hillslopes and then discharged along with subsurface runoff into a ‘‘tributary subnetwork’’ before entering the main channel. The spatial units are thus linked via routing through the main channel network, which is constructed in a scale-consistent way across different spatial resolutions. All model parameters are physically based, and only a small subset requires calibration.MOSART has been applied to the Columbia River basin at 1/ 168, 1/ 88, 1/ 48, and 1/ 28 spatial resolutions and was evaluated using naturalized or observed streamflow at a number of gauge stations. MOSART is compared to two other routing models widely used with land surface models, the River Transport Model (RTM) in the Community Land Model (CLM) and the Lohmann routing model, included as a postprocessor in the Variable Infiltration Capacity (VIC) model package, yielding consistent performance at multiple resolutions. MOSART is further evaluated using the channel velocities derived from field measurements or a hydraulic model at various locations and is shown to be capable of producing the seasonal variation and magnitude of channel velocities reasonably well at different resolutions. Moreover, the impacts of spatial resolution on model simulations are systematically examined at local and regional scales. Finally, the limitations ofMOSART and future directions for improvements are discussed.

runoff routing, scale adaptive↗

The Consistent Vehicle Routing Problem

In the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same drivers visit the same customers at roughly the same time on each day that the customers need service. These service requirements, together with traditional constraints on vehicle capacity and route length, define a variant of the classical capacitated vehicle routing problem, which we call the consistent VRP (ConVRP). In this paper, we formulate the problem as a mixed-integer program and develop an algorithm to solve the ConVRP that is based on the record-to-record travel algorithm. We compare the performance of our algorithm to the optimal mixed-integer program solutions for a set of small problems and then apply our algorithm to five simulated data sets with 1,000 customers and a real-world data set with more than 3,700 customers. We provide a technique for generating ConVRP benchmark problems from vehicle routing problem instances given in the literature and provide our solutions to these instances. The solutions produced by our algorithm on all problems do a very good job of meeting customer service objectives with routes that have a low total travel time.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

City-Wide Eco-Routing Navigation Considering Vehicular Communication Impacts

Intelligent Transportation Systems (ITSs) utilize Vehicular Ad-hoc Networks (VANETs) to collect, disseminate, and share data with the Traffic Management Center (TMC) and different actuators. Consequently, packet drop and delay in VANETs can significantly impact ITS performance. Feedback-based eco-routing (FB-ECO) is a promising ITS technology, which is expected to reduce vehicle fuel/energy consumption and pollutant emissions by routing drivers through the most environmentally friendly routes. To compute these routes, the FB-ECO utilizes VANET communication to update link costs in real-time, based on the experiences of other vehicles in the system. In this paper, we study the impact of vehicular communication on FB-ECO navigation performance in a large-scale real network with realistic calibrated traffic demand data. We conduct this study at different market penetration rates and different congestion levels. We start by conducting a sensitivity analysis of the market penetration rate on the FB-ECO system performance, and its network-wide impacts considering ideal communication. Subsequently, we study the impact of the communication network on system performance for different market penetration levels, considering the communication system. The results demonstrate that, for market penetration levels less than 30%, the eco-routing system performs adequately in both the ideal and realistic communication scenarios. It also shows that, for realistic communication, increasing the market penetration rate results in a network-wide degradation of the system performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗