Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Route optimization”

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

Route Optimization for Energy Efficient Airport Shuttle Operations - A Case Study from Dallas Fort Worth International Airport

Air travel and requisite surface traffic supporting passenger arrival/departure constitutes a significant portion of travel and emissions in cities with large airports. An airport trip can segment into three parts namely: i) travel from a location in the city to the airport; ii) travel from a parking lot or rental car center to the terminal (i.e., within the airport premises), and iii) travel inside the terminal. Depending on the airport access mode all or a part of these legs comprise a traveler’s journey to the airport. The priority of airport ground transport management teams is to provide passengers with a seamless travel experience within the airport, so it is understandable that within airport shuttle routes might not be optimized for minimizing energy consumption. Solutions that meet the dual objective of reducing energy consumption from airport shuttle operations without compromising on passenger travel experience are key to improving system efficiency. There is currently a dearth of research and tools that can inform airports in making such decisions. Addressing this need, this research effort puts forth an optimization model that generates optimal shuttle routes for a given set of constraints, and a discrete-event simulator that evaluates the optimal solutions in a stochastic environment to understand the tradeoffs between passenger wait times, and within airport shuttle energy consumption. The proposed set of tools are tested in the context of optimizing airport shuttles routes within the Dallas Fort Worth International Airport (DFW). In addition to shuttle spatial positioning, and passenger demand information, high-fidelity vehicle data was collected using data loggers installed on DFW shuttles. Results show that 20% energy reduction in shuttle operations is possible with a modest two-minute increase in average passenger wait times. The tools developed in this research effort are designed to be generalizable and can help optimize shuttle operations planning at any major airport.

air travel↗

Reducing AI RAG Hallucination by Optimizing Routing Techniques

Large Language Models (LLMs), such as ChatGPT, tend to “hallucinate”, meaning they confidently generate false information. Retrieval Augmented Generation (RAG) attempts to diminish hallucination by providing context to the LLM from data stores (indexes) containing relevant information. The LLM uses this context to formulate its response. RAG systems can still suffer from hallucination because of bad embeddings or ineffective routing. For example, a router will often return context from an irrelevant index, resulting in a hallucinated answer. In this study, we aim to minimize the frequency of routing hallucinations by optimizing Index Summary Routing.

97 MATHEMATICS AND COMPUTING↗

Online Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit

We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.

Chen, Xiaowei↗

Investigating a Renewable-Resource-Targeting Mobile Aquaculture System Using Route Optimization Based on Optimal Foraging Theory

Aquaculture systems require careful consideration of location, which determines water conditions, pollution impacts, and hazardous conditions. Mobility may be able to address these factors while also supporting the targeting of renewable energy sources such as wind, wave, and solar power throughout the year. In this paper, a purpose-built mobile aquaculture ship is identified and modeled with a combination of renewable energy harvesting capabilities as a case study with the objective of assessing the potential benefits of targeting high renewable energy potentials to power aquaculture operations. A route optimization algorithm is created and tuned to simulate the mobility of the aquaculture platform and cost-basis comparisons are made to a stationary system. The small spatial variability in renewable energy potential when combining multiple resources significantly limits the benefits of a mobile, renewable-targeting aquaculture system. On the other hand, the consistent energy harvest from a blend of renewable energy types (13 kW installed wind capacity, 661 m 2 installed solar, and 1 m characteristic width wave-energy converter) suggests that the potential benefits of a mobile platform for offshore aquaculture (mitigation of environmental and social concerns, any potential positive impact on yields, hazard avoidance, etc.) can likely be pursued without significant increases in energy harvester costs.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Near-optimal routing of noisy quantum states

Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.

Sadlier III, Ronald↗

Route-Optimized Energy Management of Connected and Automated Multi-Mode Plug-In Hybrid Electric Vehicle Using Dynamic Programming

This paper presents a methodology to optimize the blending of charge-depleting (CD) and charge-sustaining (CS) modes in a multi-mode plug-in hybrid electric vehicle (PHEV) that reduces overall energy consumption when the selected route cannot be completely driven in all-electric mode. The PHEV used in this investigation is the second-generation Chevrolet Volt and as many as four instrumented vehicles were utilized simultaneously on road to acquire validation data. The optimization method used is dynamic programming (DP) paired with a reduced-order powertrain model to enable onboard embedded controller compatibility and computational efficiency in optimally blending CD, CS modes over the entire drive route. The objective of the optimizer is to enable future Connected and Automated Vehicles (CAVs) to best utilize onboard energy for minimum overall energy consumption based on speed and elevation profile information from Intelligent Transportation Systems (ITS), Internet of Things (IoT), High-definition Mapping, and onboard sensing technologies. Emphasis is placed on runtime minimization to quickly react and plan an optimal mode scheme in highly dynamic road conditions with minimal computational resources. On-road performance of the optimizer paired with automated CD and CS mode selection is evaluated on a fleet of four instrumented Chevrolet Volts in a variety of driving scenarios. Here, the results indicate variable energy savings depending on the drive route and initial battery SOC with potential ranging between 2 to 12% and less than 7 seconds initial optimization for a 24-mile drive cycle.

33 ADVANCED PROPULSION SYSTEMS↗

Investigation of optimal route to fabricate submicron-sized Sm{sub 2}Fe{sub 17} particles with reduction-diffusion method

Submicron-sized Sm{sub 2}Fe{sub 17} powder samples were fabricated by a non-pulverizing process through reduction-diffusion of precursors prepared by a wet-chemical technique. Three precursors having different morphologies, which were micron-sized porous Sm-Fe oxide-impregnated iron nitrate, acicular goethite impregnated-samarium nitrate, and a conventional Sm-Fe coprecipitate, were prepared and subjected to hydrogen reduction and reduction-diffusion treatment to clarify whether these precursors could be convert to Sm{sub 2}Fe{sub 17} without impurity phases and which precursor is the most attractive for producing submicron-sized Sm{sub 2}Fe{sub 17} powder. As a result, all three precursors were successfully converted to Sm{sub 2}Fe{sub 17} powders without impurity phases, and the synthesis route using iron-oxide particle-impregnated samarium oxide was revealed to have the greatest potential among the three routes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

AI-powered municipal solid waste management: a comprehensive review from generation to utilization

The accumulation of municipal solid waste (MSW) continues to rise due to burgeoning population, rapid global urbanization and economic growth, intensifying ecological concerns associated with landfills and greenhouse gas (GHG) emissions. Over the past 2 decades, global waste generation has surged by 50%, with one-third remaining uncollected and about 70% sent to landfills. This review examines the critical role of integrating emerging technologies, such as advanced sensors and artificial intelligence (AI), into end-to-end MSW management to alleviate landfill burdens. The suitability of various AI tools for different stages of MSW management is assessed, alongside the deployment of advanced sensors including hyperspectral cameras, computer vision systems, and internet of things (IoT) devices for material identification. Applications of genetic algorithms and reinforcement learning for optimizing collection routes, reducing costs, and lowering emissions are highlighted. Life cycle assessment (LCA) across all stages of MSW management is also reviewed, along with future trends in leveraging generative AI, natural language processing (NLP), and agent-based AI systems to analyze waste generation patterns and public sentiment. Efficient collection and handling can be enhanced through route optimization with geographic information systems and real-time bin-level monitoring. Furthermore, sensor-embedded, real-time object detection systems paired with robotics enable material characterization and automated sorting, thereby lowering costs and diverting waste from landfills into value-added products for diverse industrial sectors including packaging, chemicals, textiles, metals and glass, transportation, and electronics industries. Without intervention, global waste is projected to reach 4.54 billion tons by 2050, contributing direct economic costs of $\$$400 billion and roughly 2.38 billion tons of CO 2 -equivalent emissions annually. This review demonstrates how AI-driven, end-to-end solutions for MSW management can mitigate economic and environmental challenges, while directly supporting the United Nations Sustainable Development (UNDP) goals related to innovation and infrastructure (SDG 9), sustainable cities (SDG 11), responsible consumption and production (SDG 12), and climate action (SDG 13).

09 BIOMASS FUELS↗

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Optimal assignment for the single-household shared autonomous vehicle problem

Autonomous vehicles have the potential to transform the way people are transported. While driverless technology may mean fewer vehicles are required to transport people to and from their daily activities, such changes may result in increased congestion or total miles traveled. In this study, we solve the single-household shared autonomous vehicle problem to identify cost-optimal routings of vehicles throughout the day. Such a tool will be useful for consumers seeking to minimize cost and for regulators seeking to understand and predict how people may behave in different scenarios. Here, we provide a thorough literature review and construct a mixed-integer linear program to minimize the daily travel cost of a household attending a given set of activities. Since solution time is a determinant for applicability of such a model, we present the model in a component-wise fashion. This approach allows us to understand which features most affect the problem complexity and solution time. We note that modeling carpooling is the feature that most increases time to find an optimal solution, and we therefore propose a novel modeling technique for carpooling two people. We illustrate the performance of our model by comparing it with other models from the literature and note that our model can solve significantly larger problem instances and in a time that is short enough to facilitate real-time scheduling. We also highlight the utility of our model for regulators, who can use it to analyze quickly produced optimal routes under different cost/tax scenarios.

33 ADVANCED PROPULSION SYSTEMS↗

Route to optimal generation of soft X-ray high harmonics with synthesized two-color laser pulses

High harmonics extending to X-rays have been generated from gases by intense lasers. To establish these coherent broadband radiations as an all-purpose tabletop light source for general applications in science and technology, new methods are needed to overcome the present low conversion efficiencies. Here we show that the conversion efficiency may be drastically increased with an optimized two-color pulse. By employing an optimally synthesized 2-mm mid-infrared laser and a small amount of its third harmonic, we show that harmonic yields from sub- to few-keV energy can be increased typically by ten-fold over the optimized single-color one. By combining with favorable phase-matching and together with the emerging high-repetition MHz mid-infrared lasers, we anticipate efficiency of harmonic yields can be increased by four to five orders in the near future, thus paving the way for employing high harmonics as useful broadband tabletop light sources from the extreme ultraviolet to the X-rays, as well as providing new tools for interrogating ultrafast dynamics of matter at attosecond timescales.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transportation Modeling and Global Health

A patient in the United States has been diagnosed with Ebola. Fear and panic kicks in across the country, and hospitals are inundated with hundreds of people, some infected with the highly contagious disease and others not. Blood tests are needed for positive diagnoses, but the diagnostic labs are overwhelmed with blood samples to test, and staff are overworked and stressed. Infected people need to be quarantined and treated, but it's hard to find rooms to quarantine so many patients. Sick people who need triage and regular care for other emergencies are afraid to go to hospitals for fear of Ebola, which has a 50% fatality rate. And since hospitals are so overwhelmed, sick people often stay home, infecting heathy people around them; the U.S. is now in the grips a full-blown Ebola outbreak. Sandia's high-performance computers simulated such a nightmare scenario recently, and with good reason. An Ebola outbreak in the United States could be devastating if hospitals are not prepared. When an Ebola outbreak in West Africa became a global concern in 2014, health advisers were alarmed at the length of time it took to properly diagnose infected people. In rural areas in Liberia, for example, blood samples from ailing people would be sent to a laboratory for testing, but the closest lab was hundreds of miles away through difficult and sometimes impassable roads. In more urban areas, blood samples would be sent to nearby labs, but those labs were often already overburdened by the sheer volume of samples to test. Staff at some treatment centers were unaware that a lab a little farther away might have the capacity to take in more samples. Meanwhile, undiagnosed infected people were unknowingly spreading the disease to many others around them, worsening the outbreak. The U.S. Defense Threat Reduction Agency (DTRA) and Centers for Disease Control and Prevention (CDC) posed a serious question: how do we improve blood-sample transportation routes in Liberia to ensure that samples taken from ill people are tested as quickly as possible, ensuring a proper diagnosis and faster treatment? Sandia scientists, already experts in transportation modeling for nuclear materials, quickly swarmed on this problem. The Sandia Ebola response team immediately set out to collect data from the region using available maps and local information, and transformed the raw data to GIS maps. Then, applying Sandia transportation routing algorithms, the team identified the optimal routes to get blood samples to the best laboratory for testing, even if that lab was not geographically the closest. The models also showed the best possible locations for mobile diagnostic laboratories that would better support the very rural regions that were most affected by the Ebola outbreak.

59 BASIC BIOLOGICAL SCIENCES↗