Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “planning scheduling 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 91 records · Page 5

ALTRIOS - Advanced Locomotive Technology and Rail Infrastructure Optimization System

The Advanced Locomotive Technology and Rail Infrastructure Optimization System (ALTRIOS) is a unique, fully integrated, open-source software tool to evaluate strategies for deploying advanced locomotive technologies and associated infrastructure for cost-effective decarbonization. ALTRIOS simulates energy conversion and storage dynamics, locomotive and train dynamics, meet-pass planning (detailed train timetabling), and freight-demand-driven train scheduling in a Pareto optimization. Because new locomotives represent a significant long-term capital investment and new technologies must be thoroughly demonstrated before deployment, this tool provides guidance on the risk/reward tradeoffs of different technology rollout strategies. An open, integrated simulation tool will be invaluable for identifying future research needs and making decisions on technology development, routes, and train selection. ALTRIOS development is a collaboration between NREL, the University of Illinois Urbana-Champaign (UIUC) RailTEC, Southwest Research Institute (SwRI), and BNSF.

ADVANCED PROPULSION SYSTEMS,MATHEMATICS AND COMPUT↗

Mission Activity Planning for Humans and Robots on the Moon

A series of studies is conducted to develop a systematic approach to optimizing, both in terms of the distribution and scheduling of tasks, scenarios in which astronauts and robots accomplish a group of activities on the Moon, given an objective function (OF) and specific resources and constraints. An automated planning tool is developed as a key element of this optimization system.

task allocation↗

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Rios, Joseph Lucio↗

Improving the Operations of the Earth Observing One Mission via Automated Mission Planning

We describe the modeling and reasoning about operations constraints in an automated mission planning system for an earth observing satellite - EO-1. We first discuss the large number of elements that can be naturally represented in an expressive planning and scheduling framework. We then describe a number of constraints that challenge the current state of the art in automated planning systems and discuss how we modeled these constraints as well as discuss tradeoffs in representation versus efficiency. Finally we describe the challenges in efficiently generating operations plans for this mission. These discussions involve lessons learned from an operations model that has been in use since Fall 2004 (called R4) as well as a newer more accurate operations model operational since June 2009 (called R5). We present analysis of the R5 software documenting a significant (greater than 50%) increase in the number of weekly observations scheduled by the EO-1 mission. We also show that the R5 mission planning system produces schedules within 15% of an upper bound on optimal schedules. This operational enhancement has created value of millions of dollars US over the projected remaining lifetime of the EO-1 mission.

Chien, Steve A.↗

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗

Science Planning for Multi-Spacecraft Coordinated Observations

Fulfilling the promise of an era of great observatories, NASA now has more than three space-based astronomical telescopes operating in different wavebands. This situation provides astronomers with a unique opportunity to simultaneously observe with multiple observatories. Yet scheduling multiple observatories simultaneously is highly inefficient when compared to single observatory observations. Thus, programs using multiple observatories are limited not due to scientific restrictions, but due to operational inefficiencies. Each year, a number of proposals are accepted by a space-based observatory for conduction of astronomical observations and gathering of science data for the study of galactic events. Since each space-based observatory uses a set of instruments designed to operate in specific energy regions, most such studies are conducted by submitting observation proposals to multiple observatories, with requests to coordinate among themselves. To assure that the proposed observations can be scheduled, each observatory's staff has to check that the observations are valid and meet all the constraints for their own observatory; in addition, they have to verify that the observations satisfy the constraints of the other observatories. Thus, coordinated observations require painstaking manual collaboration among the observatory staff at each observatory. In order to exploit new paradigms for observatory operation, the Goddard Space Flight Center's Advanced Architectures and Automation Branch has developed a prototype tool called the Visual Observation Layout Tool (VOLT). The main objective of VOLT is to provide a visual tool to automate the science planning of coordinated observations for multiple spacecraft, as well as to increase the scheduling probability of observations. However, VOLT is also useful for single observatory planning to optimize observatory control. Three space-based missions are interested in using VOLT (the Hubble Space Telescope, the Chandra X-Ray Observatory, and the Far Ultraviolet Spectroscopic Explorer). The VOLT team members have collaborated with these missions to gather requirements and obtain feedback on their mission planning processes. VOLT has been developed as a cross-platform Java client application for use by scientists and observatory science planning staff to visualize scheduling options and constraints. It also supports a lightweight graphical user interface for remote viewing via a Web front end. Additionally, it uniquely supports the ability to interact with multiple, diverse scheduling packages in order to determine windows of opportunity for observations and visually portray the constraints of each observation request. VOLT enables science data capture scenarios which are currently either impossible, or which require extensive time and manpower to coordinate amongst multiple observatories. it supports early detection of planning conflicts by generating coordinated solutions based on observatory schedulability and constraints. The project development approach has included frequent prototype demonstrations to our interested missions to obtain feedback after each release of the software. We will present an overview of our lessons learned in infusing the VOLT tool into the operations of the missions we have collaborated with and a brief demonstration of the software.

Maks, Lori↗

Hierarchical Management of Distributed Energy Resources Using Chance-Constrained OPF and Extremum Seeking Control: Preprint

Distributed energy resources (DERs) are becoming an important part of distribution systems because of their economic and environmental benefits. Although their inherent intermittency and volatility introduce uncertainties into the system, they have potential to provide controllability to the system under proper coordination. In this paper, we propose a hierarchical control algorithm for distribution systems with DERs so that they have controllability similar to that of a generator bus. The upper level scheduler solves a chance-constrained optimal power flow (OPF) problem to plan the operation of the DERs based on forecasts, and the lower level distributed DER controllers leverage the extremum seeking approach to deliver the planned power at the feeder head. The proposed algorithm is tested on a modified IEEE 13-node feeder, demonstrating its effectiveness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hierarchical Management of Distributed Energy Resources Using Chance-Constrained OPF and Extremum Seeking Control

Distributed energy resources (DERs) are becoming an important part of distribution systems, because of their economic and environmental benefits. Although their inherent intermittency and volatility introduce uncertainties into the electric power system, they have the potential to provide controllability to the system under proper coordination. In this paper, we propose a hierarchical control algorithm for distribution systems with DERs so that they have controllability similar to a generator bus. The upper level scheduler solves a chance-constrained optimal power flow (OPF) problem to plan the operation of the DERs based on forecasts, and the lower level distributed DER controllers leverage the extremum seeking approach to deliver the planned power at the feeder head. The proposed algorithm is tested on a modified IEEE 13-node feeder, demonstrating its effectiveness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

TU-H-CAMPUS-JeP3-01: Towards Robust Adaptive Radiation Therapy Strategies

Purpose: To set up a framework combining robust treatment planning with adaptive reoptimization in order to maintain high treatment quality, to respond to interfractional variations and to identify those patients who will benefit the most from an adaptive fractionation schedule. Methods: We propose adaptive strategies based on stochastic minimax optimization for a series of simulated treatments on a one-dimensional patient phantom. The plan should be able to handle anticipated systematic and random errors and is applied during the first fractions. Information on the individual geometric variations is gathered at each fraction. At scheduled fractions, the impact of the measured errors on the delivered dose distribution is evaluated. For a patient that receives a dose that does not satisfy specified plan quality criteria, the plan is reoptimized based on these individual measurements using one of three different adaptive strategies. The reoptimized plan is then applied during future fractions until a new scheduled adaptation becomes necessary. In the first adaptive strategy the measured systematic and random error scenarios and their assigned probabilities are updated to guide the robust reoptimization. The focus of the second strategy lies on variation of the fraction of the worst scenarios taken into account during robust reoptimization. In the third strategy the uncertainty margins around the target are recalculated with the measured errors. Results: By studying the effect of the three adaptive strategies combined with various adaptation schedules on the same patient population, the group which benefits from adaptation is identified together with the most suitable strategy and schedule. Preliminary computational results indicate when and how best to adapt for the three different strategies. Conclusion: A workflow is presented that provides robust adaptation of the treatment plan throughout the course of treatment and useful measures to identify patients in need for an adaptive treatment strategy.

60 APPLIED LIFE SCIENCES↗

Design and architecture of the Mars relay network planning and analysis framework

In this paper we describe the design and architecture of the Mars Network planning and analysis framework that supports generation and validation of efficient planning and scheduling strategy. The goals are to minimize the transmitting time, minimize the delaying time, and/or maximize the network throughputs. The proposed framework would require (1) a client-server architecture to support interactive, batch, WEB, and distributed analysis and planning applications for the relay network analysis scheme, (2) a high-fidelity modeling and simulation environment that expresses link capabilities between spacecraft to spacecraft and spacecraft to Earth stations as time-varying resources, and spacecraft activities, link priority, Solar System dynamic events, the laws of orbital mechanics, and other limiting factors as spacecraft power and thermal constraints, (3) an optimization methodology that casts the resource and constraint models into a standard linear and nonlinear constrained optimization problem that lends itself to commercial off-the-shelf (COTS)planning and scheduling algorithms.

Mars relay network planning analysis↗

Mission planning for the Lidar in Space Technology Experiment

Developing a mission planning system for a Space Shuttle mission is a complex procedure. Several months of preparation are required to develop a plan that optimizes science return during the short operations time frame. Further complicating the scenario is the necessity to schedule around crew activities and other payloads which share Orbiter resources. SpaceTec, Inc. developed the mission planning system for the Lidar In Space Technology Experiment, or LITE, which flew on Space Shuttle mission STS-64 in September of 1994. SpaceTec used a combination of off-th-shelf and in-house developed software to analyze various mission scenarios both premission and real-time during the flight. From this analysis, SpaceTec developed a comprehensive mission plan that met the mission objectives.

Redifer, Matthew E.↗

The CPAT Domain Model - How CPAT "Thinks" from an Analyst Perspective

To help effectively plan the management and modernization of its large and diverse fleet of vehicles, the Program Executive Office Ground Combat Systems (PEO GCS) commissioned the development of a large-scale portfolio planning optimization tool. This software, the Capability Portfolio Analysis Tool (CPAT), creates a detailed schedule that optimally prioritizes the modernization or replacement of vehicles within the fleet - respecting numerous business rules associated with fleet structure, budgets, industrial base, research and testing, etc., while maximizing overall fleet performance through time. This report contains a description of the organizational fleet structure and a thorough explanation of the business rules that the CPAT formulation follows involving performance, scheduling, production, and budgets.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Runway Operations Planning: A Two-Stage Solution Methodology

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.

Anagnostakis, Ioannis↗

Efficiency Benefits Using the Terminal Area Precision Scheduling and Spacing System

NASA has developed a capability for terminal area precision scheduling and spacing (TAPSS) to increase the use of fuel-efficient arrival procedures during periods of traffic congestion at a high-density airport. Sustained use of fuel-efficient procedures throughout the entire arrival phase of flight reduces overall fuel burn, greenhouse gas emissions and noise pollution. The TAPSS system is a 4D trajectory-based strategic planning and control tool that computes schedules and sequences for arrivals to facilitate optimal profile descents. This paper focuses on quantifying the efficiency benefits associated with using the TAPSS system, measured by reduction of level segments during aircraft descent and flight distance and time savings. The TAPSS system was tested in a series of human-in-the-loop simulations and compared to current procedures. Compared to the current use of the TMA system, simulation results indicate a reduction of total level segment distance by 50% and flight distance and time savings by 7% in the arrival portion of flight (~200 nm from the airport). The TAPSS system resulted in aircraft maintaining continuous descent operations longer and with more precision, both achieved under heavy traffic demand levels.

Thipphavong, Jane↗

MARS: Malleable Actor-Critic Reinforcement Learning Scheduler

In this paper, we introduce MARS, a new scheduling system for HPC-cloud infrastructures based on a cost-aware, flexible reinforcement learning approach, which serves as an intermediate layer for next generation HPC-cloud resource manager. MARS ensembles the pre-trained models from heuristic workloads and decides on the most cost-effective strategy for optimization. A whole workflow application would be split into several optimizable dependent sub-tasks, then based on the pre- defined resource management plan, a reward will be generated after executing a scheduled task. Lastly, MARS updates the Deep Neural Network (DNN) model based on the reward. MARS is designed to optimize the existing models through reinforcement mechanisms. MARS adapts to the dynamics of workflow applications, selects the most cost-effective scheduling solution among pre-built scheduling strategies (backfilling, SJF, etc.) and self- learning deep neural network model at run-time. We evaluate MARS with different real-world workflow traces. MARS can achieve 5%-60% increased performance compare to state-of-the- art approaches.

Baheri, Betis↗

A Comparison of Probabilistic and Deterministic Campaign Analysis for Human Space Exploration

Human space exploration is by its very nature an uncertain endeavor. Vehicle reliability, technology development risk, budgetary uncertainty, and launch uncertainty all contribute to stochasticity in an exploration scenario. However, traditional strategic analysis has been done in a deterministic manner, analyzing and optimizing the performance of a series of planned missions. History has shown that exploration scenarios rarely follow such a planned schedule. This paper describes a methodology to integrate deterministic and probabilistic analysis of scenarios in support of human space exploration. Probabilistic strategic analysis is used to simulate "possible" scenario outcomes, based upon the likelihood of occurrence of certain events and a set of pre-determined contingency rules. The results of the probabilistic analysis are compared to the nominal results from the deterministic analysis to evaluate the robustness of the scenario to adverse events and to test and optimize contingency planning.

Merrill, R. Gabe↗

A simulation‐based integrated virtual testbed for dynamic optimization in smart manufacturing systems

Abstract In a manufacturing system, production control‐related decision‐making activities occur at different levels. At the process level, one of the main control activities is to tune the parameters of individual manufacturing equipment. At the system level, the main activity is to coordinate production resources and to route parts to appropriate workstations based on their processing requirement, priority indices, and control policy. At the factory level, the goal is to plan and schedule the processing of parts at different operations for the entire system in order to optimize certain objectives. Note that the results of such activities at different levels are closely coupled and affect the overall performance of the manufacturing system as a whole. Therefore, it is important to systematically integrate these control and optimization activities into one unified platform to ensure the goal of each individual activity is aligned with the overall performance of the system. In this paper, we develop a simulation‐based virtual testbed that implements dynamic optimization, automatic information exchange, and decision‐making from the process‐level, system‐level, and factory‐level of a manufacturing system into an integrated computation environment. This is demonstrated by connecting a Python‐based numerical computation program, discrete‐event simulation software (Simul8), and an optimization solver (CPLEX) via a third‐party master program. The application of this simulation‐based virtual testbed is illustrated by a case study in a machining shop.

Sun, Yuting↗

A Stochastic Scheduler for Integrated Arrival, Departure and Surface Operations in Los Angeles

In terminal airspace, integrating arrivals, departures, and surface operations with competing resources provides the potential of improving operational efficiency by removing barriers between different operations. This work develops a centralized stochastic scheduler for operations in a terminal area including airborne and surface operations using Non-dominated sorting genetic algorithm and Monte Carlo simulations. The scheduler handles completing resources between different flows, such as runway allocations, runway crossing, departure fixes, and other interaction way points between arrivals and departures. Meanwhile, the scheduler also takes time-varied uncertainties into account when optimizing schedules. The scheduler is run sequentially to identify the best and robust schedule for the next planning window. Resulting schedules decide the routes, speed or delays, and runway assignments with separation constraints at mergingdiverging waypoints in the air and crossing and separations on runways. The Los Angels terminal area was used as an example. The implementation of this stochastic scheduler for integrated arrival, departure and surface operations is completed. And several preliminary runs are finished for over 1,200 flights in LAX in a typical day. Sensitivity studies on various planning window sizes are presented, which shows that trade-off exits between planning window size and achievable minimum delay. Preliminary results on runway usage are also presented in this abstract. Because arrivals on the outer runways have to be followed by crossings on the inner runways, algorithmic runway allocation prefers inner runways for arrivals and outer runways for departures. More results will be presented in the final paper. And current terminal arrival and departure procedures based on first-come-first-serve procedure will also be set up and used as a baseline for comparison.

integrated scheduler↗