Search NASA⌕ Search

SEARCH · Search NASA

Results for “fleet scheduling”

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 37 records · Page 2

Joint Optimization Scheme for the Planning and Operations of Shared Autonomous Electric Vehicle Fleets Serving Mobility on Demand

As the transportation sector undergoes three major transformations—electrification, shared/on-demand mobility, and automation—there are new challenges to analyzing the impacts of these trends on both the transportation system and the power sector. Most models that analyze the requirements of fleets of shared autonomous electric vehicles (SAEVs) operate at the scale of an urban region, or smaller. A quadratically constrained, quadratic programming problem is formulated, designed to model the requirements of SAEVs at a national scale. The size of the SAEV fleet, the necessary charging infrastructure, the fleet charging schedule, and the dispatch required to serve demand for trips in a region are treated as decision variables. By minimizing both the amortized cost of the fleet and chargers as well as the operational costs of charging, it is possible to explore the coupled interactions between system design and operation. To apply the model at a national scale, key complications about fleet operations are simplified; but a detailed agent-based regional simulation model to parameterize those simplifications is leveraged. Preliminary results are presented, finding that all mobility in the United States (U.S.) currently served by 276 million personally owned vehicles could be served by 12.5 million SAEVs at a cost of $\$ 0.27$/vehicle-mile or $ 0.18/passenger-mile. In conclusion, the energy requirements for this fleet would be 1142 GWh/day (8.5% of 2017 U.S. electricity demand) and the peak charging load 76.7 GW (11% of U.S. power peak). Several model sensitivities are explored, and it is found that sharing is a key factor in the analysis.

33 ADVANCED PROPULSION SYSTEMS↗

Scheduling Earth Observing Satellites with Evolutionary Algorithms

We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitness. To test the hypothesis we have developed a representative set of problems, produced optimization software (in Java) to solve them, and run experiments comparing techniques. This paper presents initial results of a comparison of several evolutionary and other optimization techniques; namely the genetic algorithm, simulated annealing, squeaky wheel optimization, and stochastic hill climbing. We also compare separate satellite vs. integrated scheduling of a two satellite constellation. While the results are not definitive, tests to date suggest that simulated annealing is the best search technique and integrated scheduling is superior.

Globus, Al↗

Optimization of a Mixed Fleet of Aerial Drones for Medical Supplies: A Case Study of Blood Delivery Logistics

Aerial drones have emerged as an innovative solution for faster transportation of time-sensitive items (e.g., emergency medical supplies), potentially reducing the transmission of contagious diseases and enhancing healthcare availability through contactless autonomous delivery. We study fleet sizing and efficient scheduling of a mixed fleet of drones for delivering time-sensitive medical items having distinct release and due times to minimize the required fleet size and fleet composition, the required number of additional batteries, and the total energy consumption. We continuously track the remaining battery energy of drones to determine the optimal timing for battery replacement, rather than replacing the battery at each node. Using actual drone flight test data, we employed a machine learning (ML) method to estimate the energy consumption of different drone types during flight segments for different operating parameters. We present a novel mixed-integer programming model to efficiently formulate the problem that integrates the estimated energy consumption functions from ML. We propose a new greedy heuristic (GH) algorithm and a customized genetic algorithm (GA) for solving large-scale instances of this problem faster. Results demonstrate that the GH algorithm is substantially faster than the accelerated CPLEX and the GA, while sacrificing the solution quality by a small amount. Results based on an actual blood sample delivery case study from Pendleton, Oregon, United States, show that using a mixed fleet of drones reduces the total cost and total energy consumption up to 18.18% and 28.7%, respectively, compared to using a homogeneous fleet.

29 - ENERGY PLANNING, POLICY AND ECONOMY↗

Distributionally Robust Building Load Control to Compensate Fluctuations in Solar Power Generation

This paper investigates the use of a collection of dispatchable heating, ventilation and air conditioning (HVAC) systems to absorb low-frequency fluctuations in renewable energy sources, especially in solar photo-voltaic (PV) generation. Given the uncertain and time-varying nature of solar PV generation, its probability distribution is difficult to be estimated perfectly, which poses a challenging problem of how to optimally schedule a fleet of HVAC loads to consume as much as local PV generation. We formulate a distributionally robust chance-constrained (DRCC) model to ensure that PV generation is consumed with a desired probability for a family of probability distributions, termed as an ambiguity set, built upon mean and covariance information. We benchmark the DRCC model with a deterministic optimization model and a stochastic programming model in a one-day simulation. We show that the DRCC model achieves constantly good performance to consume most PV generation even in the case with the presence of probability distribution ambiguity.

Zhang, Yiling↗

Estimation of Airline Benefits from Avionics Upgrade under Preferential Merge Re-sequence Scheduling

Modernization of the airline fleet avionics is essential to fully enable future technologies and procedures for increasing national airspace system capacity. However in the current national airspace system, system-wide benefits gained by avionics upgrade are not fully directed to aircraft/airlines that upgrade, resulting in slow fleet modernization rate. Preferential merge re-sequence scheduling is a best-equipped-best-served concept designed to incentivize avionics upgrade among airlines by allowing aircraft with new avionics (high-equipped) to be re-sequenced ahead of aircraft without the upgrades (low-equipped) at enroute merge waypoints. The goal of this study is to investigate the potential benefits gained or lost by airlines under a high or low-equipped fleet scenario if preferential merge resequence scheduling is implemented.

air traffic management↗

Real time operation of high-capacity electric vehicle ridesharing fleets

We study the feasibility of using electric vehicles in online, high-capacity ridepooling systems. Prior work has shown that online algorithms perform well for centrally-controlled, high-capacity ridepool systems. First, we propose a mixed integer linear program to expand past algorithms on ridepooling to electric vehicle fleets with the objective of scheduling vehicle charging to maintain sufficient fleet sizes at various times of day. Then we show a faster, scalable algorithm with similar performance that is practical for full-scale systems. Furthermore, our contributions reinforce the importance of having knowledge and estimates of future demand even when operating in the online setting.

33 ADVANCED PROPULSION SYSTEMS↗

A Scalable Approach to Minimize Charging Costs for Electric Bus Fleets

Incorporating battery electric buses into bus fleets faces three primary challenges: a BEB’s extended refuel time, the cost of charging, both by the consumer and the power provider, and large compute demands for planning methods. When BEBs charge, the additional demands on the grid may exceed hardware limitations, so power providers divide a consumer’s energy needs into separate meters even though doing so is expensive for both power providers and consumers. Prior work has developed a number of strategies for computing charge schedules for bus fleets; however, prior work has not worked to reduce costs by aggregating meters. Additionally, because many works use mixed integer linear programs, their compute needs make planning for commercial-sized bus fleets intractable. This work presents a multi-program approach to computing charge plans for electric bus fleets. The proposed method solves a series of subproblems where the solution to the charge problem becomes more refined with each problem, moving closer to the optimal schedule. The results demonstrate how runtimes are reduced by using intermediate subproblems to refine the bus charge solution so that the proposed method can be applied to large bus fleets of 100+ buses. Not only will we demonstrate that runtimes scale linearly with the number of buses but we will also show how the proposed method scales to large bus fleets of over 100 buses while managing the monthly cost of energy.

Mortensen, Daniel (ORCID:0000000276494452)↗

EVs@Scale Next-Gen Profiles - Fleet Utilization 2023

As U.S. fleet operators begin transitioning to electric vehicles (EVs), critical questions arise regarding how to manage this shift without disrupting fleet operations or placing undue stress on the electric grid. A major challenge for fleets is maintaining effective operational schedules while accommodating charging requirements, particularly with high-power charging (HPC) infrastructure, which presents grid stability concerns for utilities. Proposed solutions such as charging substations, megawatt charging systems (MCS), and smart charge management systems (SCMS) offer potential pathways forward, but their effectiveness depends on alignment with real-world fleet behavior and operational constraints. This report investigates the charging and utilization behavior of EV and EVSE fleets actively employing HPC technologies by conducting detailed case study analyses based on telematics data. A suite of predefined metrics—covering charging, routing, and other operational behaviors—is developed to evaluate the impact of fleet activities on grid infrastructure and identify opportunities for optimization. Results highlight variations in charging behavior across fleets, such as weekday versus weekend usage, diurnal charging trends, and the role of operational predictability in enabling SCMS effectiveness. While SCMS can help lower costs and improve energy efficiency for fleets with stable schedules, they may be insufficient for fleets with highly variable or long-haul operations, which may require more robust solutions like MCS. Visualization of aggregated hourly energy metrics reveals that while fleet behaviors are diverse, there are common temporal patterns that could inform infrastructure planning and energy management. These insights emphasize the need for fleet-specific charging strategies that minimize grid impact while supporting reliable fleet operations. Additionally, the report underscores the broader economic stakes of electrification, particularly in high-value markets such as freight, where misaligned transitions could stall EV adoption. By examining current EV and EVSE fleet deployments using predetermined standardized metrics, this study offers a foundation for developing technologies and operational frameworks that support scalable, grid-compatible electrification across a variety of fleet types while establishing a baseline understanding of operational behaviors. In doing so, we aim to ensure that future charging solutions reflect actual fleet needs and grid constraints—an essential step toward maintaining operational continuity and achieving a successful transition to electric fleet operations.

Charging↗

Scheduled Civil Aircraft Emission Inventories for 1999: Database Development and Analysis

This report describes the development of a three-dimensional database of aircraft fuel burn and emissions (NO(x), CO, and hydrocarbons) for the scheduled commercial aircraft fleet for each month of 1999. Global totals of emissions and fuel burn for 1999 are compared to global totals from 1992 and 2015 databases. 1999 fuel burn, departure and distance totals for selected airlines are compared to data reported on DOT Form 41 to evaluate the accuracy of the calculations. DOT Form T-100 data were used to determine typical payloads for freighter aircraft and this information was used to model freighter aircraft more accurately by using more realistic payloads. Differences in the calculation methodology used to create the 1999 fuel burn and emissions database from the methodology used in previous work are described and evaluated.

Sutkus, Donald J., Jr.↗

Best of Both Worlds: Integrating Slurm with Kubernetes in a Kubernetes Native Way

We present K-Foundry, a framework that enables the integration of Simple Linux Utility for Resource Management (SLURM) with Kubernetes (K8s) via a Kubernetes-like Control Plane (KCP). Our implementation seamlessly enables a unified communication and scheduling layer for a fleet of multiple diverse computing platforms. While SLURM and K8s traditionally support distinct scheduling models, they have recently started aligning their objectives by moving towards a more converged execution environment.

Beltre, Angel Manuel↗

Urban-Scale Control of School Bus Fleet Charging and Discharging Strategies Using Single and Multi-Stage Optimization

This paper presents a dual-strategy approach to optimizing charging and discharging schedules for school bus fleets, using the limited charging infrastructure effectively. We aim to ensure that each bus is fully charged for daily operations and aids in grid stability during peak demand. The first strategy utilizes linear programming to schedule overnight charging at available station sockets and strategic discharging during peak periods, efficiently coordinating limited resources. The second strategy employs metaheuristic techniques for continuous optimization, focusing on precise power requirements and offering greater flexibility than the linear model.

Selim, Alaa↗

ADDS-EVS: An agent-based deployment decision-support system for electric vehicle services

Rapid and sustainable development of the electric vehicle (EV) industry places the requirement for the plan of EV deployment. For public EV, existing models mainly focus on the charging facility design and fail to capture the multi-modal scenarios. In this work, we develop an agent-based decision-support system for multi-modal electric transits to locate the optimal combinations of key parameters, including the fleet size, the transit schedule, the charging facility design, and the routing strategy. We demonstrate the utilities of our system by simulating public EV services deployed to serve travel needs related to a transportation hub in New York City. To support the decision of the fleet size, we summarize system-level performances including the total satisfied demand, passengers' waiting time, vehicle idling time. The spatial and temporal patterns are extracted to serve a deeper understanding of system dynamics and service quality. Finally, we investigate the interaction between the fleet size design and the routing strategy. The results suggest a necessity of integrating the operation strategies into the planning phase.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Design of Safe Separation Bounds for Temporally Deconflicted Trajectories Under Bounded Uncertainties

This paper explores the derivation of safe separation bounds for a heterogeneous group of~$n$ Uncrewed Aerial Systems (UAS) that are assigned temporally deconflicted trajectories. Compared to spatially deconflicted trajectories, temporal deconfliction can lead to higher traffic capacities and a more efficient use of the available airspace. One challenge with this type of deconfliction is that collisions can occur if some cooperating UAS are behind or ahead of schedule. To overcome this risk, this paper derives a lower bound on the safety distance between two heterogeneous UAS in the presence of bounded uncertainties. This safety distance can be leveraged to inform trajectory generation algorithms. The proposed bound establishes a rigorous safety margin when the fleet deviates from the planned trajectories, both temporally and spatially. For its derivation the paper assumes the UAS implement a distributed coordination algorithm that allows the fleet to maintain their schedules synchronized within a bounded temporal error, and a path-following algorithm that lets the vehicles track a target that moves along the planned trajectory with a bounded spatial error.

autonomy↗

Tug ground operations - An approach to early identification of operational impacts

An approach to early identification of operational requirements is discussed together with an assessment of the impact of these requirements on the development and acquisition phase of a program. The approach is applied to the Space Tug program. Some of the more salient results of the Tug Fleet and Ground Operations Schedules and Controls study performed under a NASA/Marshall Space Flight Center contract are provided. Ground-processing requirements and flows are presented, including a summary of facility requirements, timelines, activities and options/contingency-provision recommendations. Programmatic recommendations resulting from the study are presented in areas of payload integration, activation requirements, fleet utilization, fleet sizing, costs, and WTR delta requirement for the Tug.

Best, J. L.↗

A Comparison of Techniques for Scheduling Earth-Observing Satellites

Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.

Globus, Al↗

A comparison of price-taker and production cost models for determining system value, revenue, and scheduling of concentrating solar power plants

Concentrating solar power (CSP) plants convert solar energy into electricity and can be coupled with low-cost thermal energy storage to provide a dispatchable renewable resource. Maximizing the economic benefits of CSP systems requires deliberate selection of the timing of thermal energy dispatch to coincide with high-price or high-value periods. The performance and value of CSP systems have traditionally been evaluated using two distinct approaches: (1) production cost models (PCMs), which optimize commitment and dispatch schedules for an entire fleet of generators to minimize the cost of satisfying electricity demand; and (2) price-taker (PT) models, which optimize dispatch of the CSP system against historical or forecasted electricity prices to maximize revenue available to the CSP operator. The PCM approach is, in principle, superior because of the ability to capture system-level details such as transmission pathways and associated constraints, and feedback between CSP dispatch schedules and operation of other generators. The computationally simpler PT technique cannot explicitly address these concerns, but the comparative reduction in solution time is attractive for sensitivity analysis and rigorous optimization of CSP plant design and operation. In this work, we directly compare the dispatch profiles, net revenue, and operational value of CSP systems using implementations of each technique to assess how closely the solutions from the PT technique can approach those from the PCM for a specific market scenario. The PT implementation produced characteristically similar dispatch profiles as the PCM for both a large solar-multiple configuration and a small solar-multiple peaking configuration, while requiring only 1% of the computational time of the PCM. In addition, dispatching the CSP plant according to the self-scheduled PT solution - as opposed to the system-optimized PCM solution - only reduced the total CSP operational value by 1-5%, with consistent trends across CSP configurations and locations. This analysis validates the ability of the PT approach to substantially capture the economic benefits of CSP systems when pricing profiles are available, and indicates that the PT approach is suitable for initial design and optimization of CSP technologies.

14 SOLAR ENERGY↗

Towards Net Zero: Modeling Approach to the Right-Sized Facilities

As the concentration of greenhouse gases (GHGs) in the atmosphere increases, the concerns about carbon emissions are growing. Several net-zero initiatives are taking place around the globe to achieve a balance between the GHGs put into the atmosphere and those taken out. While most efforts present a sectorized approach, this paper describes the importance of integrating information across different sectors for effective modeling of carbon emissions and holistic reduction opportunity analysis. Using the Idaho National Laboratory (INL) campus as a test case, this work provides a web-based tool for INL stakeholders to use when engaging in strategic planning to achieve carbon emissions reduction. This net-zero engineering support tool (NEST) uses historical data as foundational information for applying the modeling framework. Prediction of CO 2 emissions throughout project completion integrates various approaches and schedules aimed at energy conservation, fleet decarbonization, and other GHG reduction activities. Using NEST, stakeholders can visualize carbon emissions, electricity consumption, and costs for decision making when planning the pathway for reaching carbon net zero. The INL’s initiative to transition into an EV fleet was used to demonstrate the developed framework and the advantages of using NEST. It was shown that electrifying different fossil-fueled campus vehicles before 2030 with aggressive replacement schedules require high annual capital expenditure (CAPEX), which may not be available. The tool allows decision makers to test different replacement schedules and prioritize those that yield CAPEX below a certain threshold while meeting target milestones. While the demonstration focused on vehicle electrification, the developed framework lays the foundation for further quantitative analysis of other GHG reduction activities.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗