Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “rolling horizon”

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 NTRSDate not supplied

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

This research focuses on the strategic deconfliction of unmanned aircraft systems (UAS) in an urban package delivery environment with two depots and multiple drop-off locations. Since the formulated mixed-integer nonlinear programming (MINLP) problem is non-deterministic polynomial-time (NP) hard, a heuristic algorithm called "rolling horizon with k-position search (KPS)" is used to compute the departure sequence and scheduled time of departure (STD) of each UAS at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. The simulation studies show that an increase in the value of k (local neighborhood search) in the KPS reduces the average ground delay at the cost of an increase in the computation time for a given number of UAS, size of the rolling horizon window, and number of depots involved in the local neighborhood search. The studies also show that for a given rolling horizon window, the computation time increases exponentially with an increase in the total number of UAS flights when serial processing the local neighborhood search of KPS (with k > 1) and drops by an order of magnitude upon performing the local neighborhood search of KPS using parallel processing instead of serial processing. The computation time drops with the reduction in air traffic complexity of a scenario for a given number of flights, k (local neighborhood search), and rolling horizon window.

UTM↗
NASA NTRSDate not supplied

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗
DOE OSTI2021

Improving Resilience of Bus Bunching Holding Strategy through a Rolling Horizon Approach

Providing public transportation with quality service is critical to attracting more passengers to the system. However, high-demand routes are prone to the so-called bus bunching -- a tendency of buses to group as a consequence of variations in travel times and demands. Bus holding is applied to overcome this effect. In this study, we present a novel method for bus holding in which the control law is based only on the buses' position using a computationally efficient rolling horizon approach. The method uses similar inputs as linear control approaches while not increasing significantly the computational time. However, the method overcomes key a weakness of the linear control approach thanks to the explicit constraint handling that always ensures the control action effectiveness. Simulation experiments in a validation case and a model-specific for a bus rapid transit line in Curitiba, Brazil showed a reduced holding time and improved resilience, delivering more than 20% reduction in delay time accounting for the on-board and station delays.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

Optimizing district energy systems by integrating Borehole Thermal Energy Storage Using a Mixed-Integer Linear Programming g-function framework with a Multi-Timescale Rolling Horizon method

Shallow geothermal has gained increasing attention in recent years; however, a reliable framework for its accurate incorporation into large-scale energy system optimization remains lacking. This study proposes a Mixed-Integer Linear Programming (MILP) framework combined with the g-function approach to integrate Borehole Thermal Energy Storage (BTES) technology into energy system optimization. Validation against a Modelica-based reservoir network simulation demonstrates that the proposed framework effectively captures the ground thermal response under varying energy loads and accurately estimates the borefield energy supply. To enhance scalability, a Rolling Horizon with Multi-Timescale (RH-MTS) method is further introduced, reducing computational time by 73 % for the 1-year optimization model with only minor loss of optimality. The framework is demonstrated through the case study of the UC Berkeley campus. Results indicate that BTES is a cost-effective and low-carbon solution: two borefields comprising 382 boreholes can meet 8.0 % and 6.6 % of the total campus heating and cooling demand, respectively, at an average energy rate of 0.70–0.77 USD/kWh and carbon intensity of 0.54 kg-CO2/kWh. Short-term analysis reveals a 35%–65% decline in BTES energy flow after 3–6 months of continuous heating/cooling operation, while long-term simulation shows that annual energy production of BTES can vary by up to 12.0 % after four years before stabilizing. Overall, this study develops a novel optimization framework that couples physics-based g-function method with MILP optimization framework, thereby advancing methodological development for shallow-geothermal integration and providing actionable guidance for BTES deployment in district-energy systems.

Yang, Jiahui↗
DOE OSTI2023

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗
DOE OSTI2020

Reducing the computational burden of a microgrid energy management system

As renewable technology advances and decreases in cost, microgrids are becoming an appealing means of distributed generation both for isolated communities and integrated with existing electrical grid systems. Due to their small size, however, microgrids may have financial limitations which preclude them from using commercial software to optimize control of their assets. Open-source optimization solvers are a viable alternative, but increase computation time. This work expands on a rolling horizon optimization framework for economic dispatch within an existing residential microgrid located in Hoover, Alabama. The microgrid has an open-source solver requirement and a need for quick solution time on a rolling horizon as opposed to a day-ahead commitment. We present a method of reducing integer variables by relaxation which completes two goals: reduction in computation time for real-time operations, and reduction in daily operational cost for the microgrid. Seasonal data for load and photovoltaic (PV) power was also collected from the microgrid to facilitate simulation testing. Computation time was successfully reduced using multiple variations of the relaxation method, while obtaining solution quality with operational cost similar to or better than the original model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Multi-Commodity Traffic Signal Control and Routing With Connected Vehicles

We report a real-time traffic management policy that integrates traffic signal control and multi-commodity routing of connected vehicles in networks with multiple destinations is developed. The proposed policy is based on a multi-commodity formulation of the store-and-forward model and assumes all vehicles are able to exchange information with the infrastructure. Vehicles share information about their current location and final destination. Based on this information, the strategy determines both optimized signal timings at every intersection and vehicle-specific routing information at every link of the network. The control actions, i.e., signal times and routing information, are updated at every cycle and delivered by a finite horizon optimal control problem cast into a rolling horizon framework. The underlying optimization problem is convex, and thus the method is suitable for real-time operation in large networks. The method is validated via a micro-simulation study in networks with up to twenty intersections and, in all simulations, outperforms a real-time traffic-responsive signal control strategy that is based on a single-commodity store-and-forward model. The scalable computation effort for increasing network sizes and prediction horizon confirms the computational efficiency of the method.

42 ENGINEERING↗
DOE OSTI2022

Dispatch optimization of a concentrating solar power system under uncertain solar irradiance and energy prices

The integration of thermal energy storage into a concentrating solar power system allows for mitigating some of the risk associated with uncertain solar irradiance and uncertain energy prices. We solve a 48 h dispatch optimization model with continually updated conditional point forecasts of both direct normal irradiance (DNI) and electricity prices with a rolling-horizon scheme at hourly resolution over the course of a year. Joint, conditional forecasts for DNI and prices are formed using an autoregressive moving-average time series model with exogenous weather predictors. We guide dispatch using a mixed-integer programming model, but in order to evaluate performance we use the System Advisor Model (SAM) of the National Renewable Energy Laboratory. SAM is a techno-economic simulation model that accounts for plant thermodynamics with higher fidelity. Our conditional DNI forecasts improve annual revenue by 4%–12% over using historical forecasts based on data from previous years. Conditional price forecasts improve annual revenue by 6%–19% in the real-time market over analogous historical forecasts. Updating these forecasts every six hours, rather than every 24 h, further improves annual revenue by 5%–6%. Here, we also investigate a method that values terminal inventory in our dispatch optimization model, again when used in a rolling-horizon scheme.

14 SOLAR ENERGY↗
DOE OSTI2022

Integrated charging infrastructure planning and charging scheduling for battery electric bus systems

We report studies on the electric bus system planning problem have typically focused exclusively on either the deployment of charging infrastructure or the scheduling of charging events; few have examined the impact of charging facility deployment on charging activities. Considering the interdependence of system design and operational strategies, this study proposes a two-phase optimization framework for charging infrastructure planning and charging scheduling for battery electric bus systems. An integrated optimization model is first developed to simultaneously optimize charger deployment, on-board battery capacity, and charging schedules. A charging scheduling model is further proposed and a rolling horizon approach is utilized in the second phase to optimize the real-time charging scheduling of electric buses. Compared to existing electric bus system planning methods, the proposed integrated model can reduce the total system cost by 19.5%. In addition, compared to uncontrolled charging, the proposed rolling horizon-based charging strategy can reduce the total charging cost by 68.3%.

25 ENERGY STORAGE↗
DOE OSTI2020

Real-time Ridesharing for Transportation Hubs with Demand and Supply Uncertainty

Transportation hubs in major cities generate a significant amount of trips by taxis and for-hail vehicles (FHV), with many of the trips sharing similar destinations. This suggests promising opportunities to leverage the collective travel needs with dedicated ridesharing solutions to reduce the externalities of excessive traffic at transportation hubs. In this study, we develop a novel dynamic ridesharing approach to serve trips from the transportation hub by considering (1) demand (new passengers) and supply (newly available vehicles) in the near future and (2) the uncertainty of future predictions. Our approach consists of two stages. In the first stage, we develop a data structure called hub mobility tree to generate potential combinations of shareable trips as candidate schedules efficiently. Then the generated schedules are used in the second stage to formulate the stochastic hub-based ridesharing problem (SHRP), which is a stochastic integer programming problem with the objective to maximize the total expected ridesharing profit over time. Due to the prohibitive number of shareable trips, we then approximately solve SHRP by the sample average approximate method (SAA), and a dual Lagrangian technique is implemented to further improve the scalability of the solution approach. We demonstrate the performances of the proposed method by simulating the ridesharing service at JFK airport using NYC taxi and FHV data. The results indicate that the proposed method outperforms the myopic ridesharing (maximize profit for a single time step) and the rolling horizon method with point estimation of future demand and supply.

dynamic ridesharing↗
DOE OSTI2022

A scalable planning framework of energy storage systems under frequency dynamics constraints

As the penetration of renewables increases in power systems, the declining system inertia can cause frequency stability issues. Battery energy storage systems (BESSs) respond fast and therefore can relieve the low inertia difficulty but need to be appropriately sized considering the associated cost. This paper presents a novel stochastic optimization model for economically planning BESS capacity while considering the spatial–temporal correlation of wind generation and generator outages under frequency stability constraints, which include the rate-of-change of frequency (RoCoF), frequency nadir (FN), and quasi-steady-state (QSS) frequency. A set of new FN constraints that can be easily linearized is developed. To account for renewable uncertainties, a realistic uncertainty modeling approach, Random Field, is adopted to generate wind generation scenarios by considering both spatial and temporal evolutions of wind speed profiles. The ESS sizing is formulated as a mixed-integer linear programming problem and solved by using a scalable decomposition-and-coordination approach, Surrogate Absolute Value Lagrangian Relaxation (SAVLR). To further improve the scalability and reduce computational burdens, a rolling-horizon-based update is developed and incorporated into SAVLR for providing a practical solution to the long-term planning of very large-scale power systems. Finally, a modified IEEE 118-bus system and the Polish system are used to validate the effectiveness and scalability of the model and solution methodology.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Tri-level hybrid interval-stochastic optimal scheduling for flexible residential loads under GAN-assisted multiple uncertainties

Various building loads, such as heating, ventilation, and air conditioners (HVACs), electric water heaters (EWHs), and electric vehicles (EVs), can introduce opportunities for improving the flexibility of electricity consumption while satisfying the needs of building owners as well as benefiting the resilience of distribution system. To utilize such flexibility, a tri-level distribution market framework is established, including residential consumers, load aggregators (LAs), and the distribution system operator (DSO). In this work, the uncertainties from all three levels are considered. The random consumption behavior at the consumer level is modeled as a Gaussian noise that is also aggregated and transmitted to the LA level. The weather temperature in the LA level is forecasted as an interval, and the photovoltaic (PV) power in the market-clearing level is modeled by a set of power scenarios generated by Generative Adversarial Networks (GANs). Then, a hybrid interval-stochastic programming is proposed to transform the uncertain problems in the first two levels into deterministic ones. For real-time implementations, a rolling horizon optimization (RHO) scheme is employed to continuously optimize the power consumption based on the latest operating information. Finally, case studies on a modified IEEE 69-bus system validate the effectiveness of the proposed uncertainty modeling strategies and the RHO scheme.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Modular supply chain optimization considering demand uncertainty to manage risk

Supply chain under demand uncertainty has been a challenging problem due to increased competition and market volatility in modern markets. Flexibility in planning decisions makes modular manufacturing a promising way to address this problem. We report the problem of multiperiod process and supply chain network design is considered under demand uncertainty. A mixed integer two-stage stochastic programming problem is formulated with integer variables indicating the process design and continuous variables to represent the material flow in the supply chain. The problem is solved using a rolling horizon approach. Benders decomposition is used to reduce the computational complexity of the optimization problem. To promote risk-averse decisions, a downside risk measure is incorporated in the model. The results demonstrate the several advantages of modular designs in meeting product demands. A pareto-optimal curve for minimizing the objectives of expected cost and downside risk is obtained.

42 ENGINEERING↗
DOE OSTI2022

Combining Simulation and Optimization to Derive Operating Policies for a Concentrating Solar Power Plant

Optimizing short-term decisions over a rolling horizon and/or using deterministic penalties to capture system stochasticity can lead to myopic policies that fail to consider unplanned events and their long-term adverse effects. We present a methodology that integrates an off-line optimization model with a simulation procedure to determine the profitability of different operating strategies; specifically, the latter is used to generate additional constraints for the former when failures occur according to system component operating lifetimes that (i) are subject to exogenous uncertainty, and (ii) may degrade more quickly under specific operating conditions. We use the feedback provided by the simulation model in a parametric analysis to obtain penalties that can be used in short-term operations scheduling to maximize the long-term revenues obtained by the optimization model. We apply this research to a concentrating solar power plant; our results show that the methodology can be used to choose an operating policy that balances maximizing profit while accounting for maintenance costs. Integrating the optimization model with a simulation procedure reveals that aggressive prices for cycling yield about 55% fewer startups and 30% fewer failures compared to using a more typical start-up operating strategy, and can save hundreds of thousands to millions of dollars in repair costs over the lifetime of the plant.

concentrating solar power↗
DOE OSTI2023

The value of concentrating solar power in ancillary services markets

Ancillary services, such as spinning reserves, can provide grid reliability and contribute to profitability of an energy resource. We exercise an existing dispatch optimization model to estimate the profitability of a concentrating solar power plant by incorporating the sale of spinning reserves in the ancillary service market using the National Renewable Energy Laboratory's System Advisor Model to simulate operations within a 72-h rolling horizon framework. Assuming a price-taker approach with day-ahead energy and spinning reserve prices from both the California Independent System Operator and the Electricity Reliability Council of Texas, we find that selling spinning reserves in addition to electric energy increases plant profitability by up to 7% with perfect knowledge of day-ahead pricing and solar resource availability. Here, this finding suggests that spinning reserve markets provide significant value streams to concentrating solar power plants that can leverage thermal energy storage to offer reliable production in the short-to-medium term.

14 SOLAR ENERGY↗
DOE OSTI2025

Networked Microgrid Topology Reconfiguration to Promote Fairness in Proactive Load Shedding

Increasing occurrences of natural disasters and grid emergency events consistently challenge the safe and reliable operations of power systems. During such emergency situations, system operators may proactively shed load to mitigate risks. However, uncoordinated implementation of load shedding may disrupt electricity supply and even lead to cascading failures. Meanwhile, it is crucial to address potential biases affecting different customers when executing load shedding. This paper addresses the dynamic topology reconfiguration problem for networked microgrids with distributed energy resources under emergency conditions. Specifically, we propose a novel rolling-horizon optimization model that integrates fairness-aware constraints into the networked microgrid topology reconfiguration. Unlike existing approaches that focus solely on efficiency or apply fairness considerations in static settings, our method explicitly incorporates temporal fairness constraints to restrict repeated or excessive load curtailment for load blocks. Moreover, the fairness-aware constraints are specifically developed for the context of dynamic networked microgrid topology reconfiguration, and are designed to be convex or amenable to linear reformulations, which offers a more tractable alternative to traditional models with non-convex formulations. Numerical studies on a modified IEEE 13-bus system and a larger-sized SMART-DS networked microgrid system demonstrate the performance of the proposed algorithm towards more fairness-aware networked microgrid topology reconfiguration decision-making.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Energy and mobility impacts of connected autonomous vehicles with co-optimization of speed and powertrain on mixed vehicle platoons

Intersections are known to be traffic bottlenecks where a significant amount of energy consumption could be caused due to deceleration/acceleration in the presence of red signals. With an increased level of connectivity and automation of intelligent transportation systems, connected autonomous vehicles (CAVs) are expected to be able to proactively adjust their driving strategies subject to constraints imposed by the predicted future traffic. As a result, many potential benefits can be achieved, such as improved energy efficiency, enhanced traffic safety, among many others. Notably, the way CAVs are controlled affects the following legacy vehicles (LVs) due to complex traffic dynamics. Here, we are particularly interested in studying the energy and mobility impact of CAVs with an improved traffic prediction method on mixed vehicle platoons at various market penetration rates. Leveraging traffic prediction, CAVs are controlled with co-optimization of their speed and gear position. Specifically, a traffic prediction framework in a rolling horizon fashion is employed based upon a modified Payne–Whitham (PW) model capable of handling mixed traffic consisting of CAVs and LVs. The prediction error of the modified PW model is reduced by 53.62% compared to that of the standard PW model under test scenarios. According to the predicted traffic conditions, speed and gear position of CAVs are co-optimized with the primary goal of minimizing energy consumption when driving on a signalized arterial. The energy benefits achieved by CAVs and the impact of CAVs on LVs behind are studied comprehensively for mixed vehicle platoons. The lead LV follows a real-world speed profile collected on TH-55 in Minnesota. Numerical results show that energy benefits achieved by the vehicle platoon range from 2% to 16%, and a 1% to 5% reduction in travel time for LVs behind CAVs is also observed, at different penetration rates of CAVs in various traffic scenarios. Furthermore, it is observed that CAVs using the proposed eco-driving approach appear to have a positive impact on the LVs behind in terms of energy consumption, regardless of the driving styles of the LVs ahead.

33 ADVANCED PROPULSION SYSTEMS↗