Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “vehicle 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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Interfaces For Planning Vehicle Routes

A system for producing vehicle routes such as aircraft flight plans in the presence of weather and other hazards defines static and moving hazards with polygons drawn on a display containing graphic hazard regions. Different hazard types and intensities are displayed differently. Both lateral and vertical geographic depictions are displayed, and hazards can be displayed temporally as well. Users input information and thresholds for hazards.

Thea Lynn Feyereisen↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
DOE OSTI2024

A real-time energy and cost efficient vehicle route assignment neural recommender system

Here, this paper presents a neural network recommender system algorithm for assigning vehicles to routes based on energy and cost criteria. In this work, we applied this new approach to efficiently identify the most cost-effective medium and heavy duty truck (MDHDT) powertrain technology, from a total cost of ownership (TCO) perspective, for given trips. We employ a machine learning based approach to efficiently estimate the energy consumption of various candidate vehicles over given routes, defined as sequences of links (road segments), with little information known about internal dynamics, i.e. using high level macroscopic route information. A complete recommendation logic is then developed to allow for real-time optimum assignment for each route, subject to the operational constraints of the fleet. We show how this framework can be used to (1) efficiently provide a single trip recommendation with a top-k vehicles star ranking system, and (2) engage in more general assignment problems where n vehicles need to be deployed over m (m ≤ n) trips. This new assignment system has been deployed and integrated into the POLARIS. Transportation System Simulation Tool for use in research conducted by the Department of Energy's Systems and Modeling for Accelerated Research in Transportation (SMART) Mobility Consortium (SMART, 2024).

Energy consumption↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Monte Carlo Tree Search Approach

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗
NASA NTRSDate not supplied

Enhanced UAS Availability via Vehicle to Vehicle Routing Scaled Experiments

The safe integration of modern unmanned aerial systems into the national airspace requires the ability to be able to confirm that the vehicles are working as planned. This means the availability of the vehicle and latency of the communication is critical. These requirements, along with a complex and multifaceted environment as well as the unmanned air traffic management framework, present a unique optimization problem. In this paper, we articulate our envisioned problem space and create a scaled-down version to test the functional feasibility of utilizing the vehicle to vehicle communication as a secondary communication assurance mechanism. We present our framework, experimental approach, and some lessons learned through the process.

Nicholas B Cramer↗
NASA NTRS2019

The Value of Near Real-Time Earth Observations for Improved Flood Disaster Response

Information is a critical resource in disaster response scenarios. Data regarding the geographic extent, severity, and socioeconomic impacts of a disaster event can help guide emergency responders and relief operations, particularly when delivered within hours of data acquisition. Information from remote observations provides a valuable tool for assessing conditions "on the ground" more quickly and efficiently. Here, we evaluate the social value of a near real-time flood impact system using a disaster response case study, and quantify the Value of Information (VOI) of satellite-based observations for rapid response using a hypothetical flooding disaster in Bangkok, Thailand. MODIS imagery from NASA's Land, Atmosphere Near real-time Capability for EOS (LANCE) system is used to produce operational estimates of inundation depths and economic damages.These rapid Earth observations are coupled with a decision-analytical model to inform decisions on emergency vehicle routing. Emergency response times from vehicles routed using flood damage data are compared with baseline routes without the benefit of advance information on road conditions. Our results illustrate how the application of near real-time Earth observations can improve the response time and reduce potential encounters with flood hazards when compared with baseline routing strategies. Results indicate a potential significant economic benefit (i.e.,millions of dollars) from applying near real-time Earth observations for improved flood disaster response and management.

emergency response↗
DOE OSTI2024

Electric vehicle supply equipment location and capacity allocation for fixed-route networks

Electric vehicle (EV) supply equipment location and allocation (EVSELCA) problems for freight vehicles are becoming more important because of the trending electrification shift. Some previous works address EV charger location and vehicle routing problems simultaneously by generating vehicle routes from scratch. Although such routes can be efficient, introducing new routes may violate practical constraints, such as drive schedules, and satisfying electrification requirements can require dramatically altering existing routes. To address the challenges in the prevailing adoption scheme, we approach the problem from a fixed -route perspective. We develop a mixed -integer linear program, a clustering approach, and a metaheuristic solution method using a genetic algorithm (GA) to solve the EVSELCA problem. The clustering approach simplifies the problem by grouping customers into clusters, while the GA generates solutions that are shown to be nearly optimal for small problem cases. A case study examines how charger costs, energy costs, the value of time (VOT), and battery capacity impact the cost of the EVSELCA. Charger equipment costs were found to be the most significant component in the objective function, leading to a substantial reduction in cost when decreased. VOT costs exhibited a significant decrease with rising energy costs. Further, an increase in VOT resulted in a notable rise in the number of fast chargers. Longer EV ranges decrease total costs up to a certain point, beyond which the decrease in total costs is negligible.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Route Energy Prediction (RouteE) Powertrain Validation Report

The National Renewable Energy Laboratory's flagship package in the RouteE suite, RouteE-Powertrain, is a mesoscopic energy model that predicts vehicle energy consumption given discrete attributes that describe each segment or link in a vehicle's path on a road network. High-frequency, physics-based, powertrain simulators, such as NREL's FASTSim, are well-suited to model vehicle energy consumption when real driving data and a detailed understanding of the vehicle powertrain specifications are available. However, there are a variety of situations in the past, present (real-time), and future where high-frequency driving data and/or vehicle information may not be available, but reliable energy consumption is still desired, such as energy-aware vehicle routing. These are the ideal applications for RouteE-Powertrain. The suite of RouteE tools also includes RouteE-Compass, which is an eco-routing software that incorporates energy consumption into network routing algorithms, and RouteE-Mobile, which is a prototype smartphone navigation app to demonstrate the integrated capabilities of the RouteE suite for real-world eco-routing. The focus of this validation report is to share key metrics about the data sets and models behind RouteE-Powertrain. The set of RouteE-Powertrain models discussed in this report are made available through the RouteE web API through the NREL Developer Network.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS2017

Predicted Weather Display and Decision Support Interface for Flight Deck

A system and method for providing visual depictions of a predictive weather forecast for in-route vehicle trajectory planning. The method includes displaying weather information on a graphical display, displaying vehicle position information on the graphical display, selecting a predictive interval, displaying predictive weather information for the predictive interval on the graphical display, and displaying predictive vehicle position information for the predictive interval on the graphical display, such that the predictive vehicle position information is displayed relative to the predictive weather information, for in-route trajectory planning.

Johnson, Walter W.↗
DOE OSTI2023

NREL On-Demand Transit Research and Fort Erie Case Study

On-demand systems have increased in popularity in recent years, especially in rural and smaller-sized communities. This presentation provides a brief introduction to NREL's on-demand mobility research and an in-depth case study of the town of Fort Erie, Ontario. 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 presentation 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.

emerging technology↗
DOE OSTI2024

Deploying Mobility-On-Demand for All by Optimizing Paratransit Services

While on-demand ride-sharing services have become popular in recent years, traditional on-demand transit services cannot be used by everyone, e.g., people who use wheelchairs. Paratransit services, operated by public transit agencies, are a critical infrastructure that offers door-to-door transportation assistance for individuals who face challenges in using standard transit routes. However, with declining ridership and mounting financial pressure, public transit agencies in the USA struggle to operate existing services. We collaborate with a public transit agency from the southern USA, highlight the specific nuances of paratransit optimization, and present a vehicle routing problem formulation for optimizing paratransit. We validate our approach using real-world data from the transit agency, present results from an actual pilot deployment of the proposed approach in the city, and show how the proposed approach comprehensively outperforms existing approaches used by the transit agency. To the best of our knowledge, this work presents one of the first examples of using open-source algorithmic approaches for paratransit optimization.

Pavia, Sophie↗
DOE OSTI2024

Using Mobile Charging Drones to Mitigate Battery Disruptions of Electric Vehicles on Highways

Our research explores innovative solutions to address the challenge of battery disruptions in electric vehicles (EVs) on highways. We propose a centralized fleet ownership model where a company manages a fleet of Mobile Charging Drones (MCDs) guided by a k-VRP (Vehicle Routing Problem) framework. This model is designed to tackle a multi-objective optimization issue with three primary goals: reduction of the overall operating costs, decrease in the cumulative waiting time, and minimization of the combined operating costs and waiting times. This approach extends beyond the usual VRP constraints, encompassing specific limitations for both MCDs and disrupted EVs (DEVs). Additionally, our study delves into the concept of decentralized fleet ownership through the lens of crowdsourcing. Preliminary numerical analyses indicate that the capital cost of MCDs is a significant factor on the charging service, and the system performance is sensitive to DEV owner's value of time (VOT) when VOTs are relatively low.

battery disruption↗
NASA NTRS1999

SOFIA's Choice: Automating the Scheduling of Airborne Observations

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.

Frank, Jeremy↗
NASA NTRS2006

Haughton-Mars Project Expedition 2005

The 2005 expedition to the Haughton-Mars Project (HMP) research station on Devon Island was part of a NASA-funded project on Space Logistics. A team of nine r&searchers from MIT went to the Canadian Arctic to participate in the annual I-IMP field campaign from July 8 to August 12, 2005. We investigated the applicability of the HMP research station as an analogue for planetary macro- and micro-logistics to the Moon and Mars, and began collecting data for modeling purposes. We also tested new technologies and procedures to enhance the ability of humans and robots to jointly explore remote environments. The expedition had four main objectives. We briefly summarize our key findings in each of these areas. 1. Classes of Supply: First, we wanted to understand what supply items existed at the HMP research station in support of planetary science and exploration research at and around the Haughton Crater. We also wanted to quantify the total amount of imported mass at HMP and compare this with predictions from existing parametric lunar base demand models. 2. Macro-Logistics Transportation Network: Our second objective was to understand the nodes, transportation routes, vehicles, capacities and crew and cargo mass flow rates required to support the HMP logistics network. 3. Agent and Asset Tracking: Since the current inventory management system on ISS relies heavily on barcodes and manual tracking, we wanted to test new automated technologies and procedures such as radio frequency identification RFID) to support exploration logistics. 4. Micro-Logistics (EVA): Finally, we wanted to understand the micro-logistical requirements of conducting both short (<1 day) and long traverses in the Mars-analog terrain on Devon Island. Micro-logistics involves the movement of surface vehicles, people and supplies from base to various exploration sites over short distances (<100 km).

deWeck, Olivier↗
NASA NTRS2019

Analysis of Interactions Between Urban Air Mobility (UAM) Operations and Conventional Traffic in Urban Areas: Traffic Alert and Collision Avoidance System (TCAS) Study for UAM Operations

This paper presents results on potential interaction effects from UAM (Urban Air Mobility) operations integrated into current operational scenarios by evaluating if/where/how Traffic alert and Collision Avoidance System (TCAS) alerts are triggered on-board commercial aircraft. A range of operational scenarios are evaluated with combinations of UAM vehicle route, speed, altitude, and direction along the DFW (Dallas-Fort Worth) "spine route." The effect of UAM altitude uncertainty on the above is also explored. The analysis was done for both South flow and North flow configurations of DFW. When UAM operations are deterministic, no TCAS RAs (Resolution Advisories) are issued. However, UAM altitude uncertainties point out geographic areas of concern with the associated severity of interactions.

Airspace↗