Search NASA⌕ Search

SEARCH · Search NASA

Results for “Integer 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 739 records · Page 41

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↗

Systematic Process Intensification involving Zeotropic Distillation

Distillation is commonly used for separating homogeneous fluid mixtures. While it is based on a simple thermally driven vapor-liquid equilibrium phenomenon at the two-phase region, different variants of distillation systems exist. These include simple distillation, dividing wall columns, pressure swing distillation, thermally coupled distillation and reactive distillation. Complex separation may also involve multiple distillation in a sequence to achieve the desired products. These sequences can be constructed as direct sequence, indirect sequence or thermally coupled columns. Even when a sequence is fixed, each column in the sequence can have a plethora of design alternatives to consider. All these make the design and intensification of distillation systems a challenging task. The large number of plausible design alternatives increases the combinatorial complexity for screening. Although significant efforts have been made in the past, we still lack a method for systematic identification of novel pathways for process intensification of distillation system. This is due to the lack of a generalized representation of all plausible alternatives in a single modeling and optimization framework. In this work, we first present a general representation of thermally driven vapor-equilibrium phenomenon using abstract building blocks. Specifically, each tray in a distillation column is represented by a liquid block and a vapor block with a shared semi-restricted boundary representing the interface. The arrangement of these building blocks in a two-dimensional grid gives rise to all plausible variants of distillation systems. These systems range from simple distillation, dividing wall columns to task-integrated columns. This enables us to systematically identify both classic and out-of-the-box intensified designs at the column and flowsheet levels. The overall distillation-based separation process synthesis problem is formulated as a single mixed-integer nonlinear programming (MINLP) model. In conclusion, the proposed approach is applied to multi-component zeotropic systems to show the capability of identifying promising intensified alternatives.

42 ENGINEERING↗

A Stochastic Charging Station Deployment Model for Electrified Taxi Fleets in Coupled Urban Transportation and Power Distribution Networks

Metropolitansworldwide are increasingly adopting electric taxis (ET) to address concerns about transportation-related emissions. However, the widespread deployment of electric taxis presents challenges in terms of increased electricity demand and changing demand profiles. This transition impacts both the urban transportation network (TN) and the electricity power distribution network (PDN), highlighting the interdependence between these two systems. Here, in this paper, we propose a two-stage stochastic programming planning model that aims to optimize both the TN and PDN, enabling efficient deployment of charging stations and grid upgrades. Our model seeks to strike a balance between meeting ET drivers' charging preferences, minimizing the costs associated with infrastructure deployment and grid expansion, and harmonizing the coordination between the TN and PDN. Additionally, we explore the potential benefits of utilizing an autonomous ET fleet to enhance overall system performance.

33 ADVANCED PROPULSION SYSTEMS↗

A modified priority list-based MILP method for solving large-scale unit commitment problems

This paper studies the typical pattern of unit commitment (UC) results in terms of generator’s cost and capacity. A method is then proposed to combine a modified priority list technique with mixed integer linear programming (MILP) for UC problem. The proposed method consists of two steps. At the first step, a portion of generators are predetermined to be online or offline within a look-ahead period (e.g., a week), based on the demand curve and generator priority order. For the generators whose on/off status is predetermined, at the second step, the corresponding binary variables are removed from the UC MILP problem over the operational planning horizon (e.g., 24 hours). With a number of binary variables removed, the resulted problem can be solved much faster using the off-the-shelf MILP solvers, based on the branch-and-bound algorithm. In the modified priority list method, scale factors are designed to adjust the tradeoff between solution speed and level of optimality. It is found that the proposed method can significantly speed up the UC problem with minor compromise in optimality by selecting appropriate scale factors.

Ke, Xinda↗

EXTRACTING PERIODIC TRANSIT SIGNALS FROM NOISY LIGHT CURVES USING FOURIER SERIES

We present a simple and powerful method for extracting transit signals associated with a known transiting planet from noisy light curves. Assuming the orbital period of the planet is known and the signal is periodic, we illustrate that systematic noise can be removed in Fourier space at all frequencies by only using data within a fixed time frame with a width equal to an integer number of orbital periods. This results in a reconstruction of the full transit signal, which on average is unbiased despite no prior knowledge of either the noise or the transit signal itself being used in the analysis. The method therefore has clear advantages over standard phase folding, which normally requires external input such as nearby stars or noise models for removing systematic components. In addition, we can extract the full orbital transit signal (360°) simultaneously, and Kepler-like data can be analyzed in just a few seconds. We illustrate the performance of our method by applying it to a dataset composed of light curves from Kepler with a fake injected signal emulating a planet with rings. For extracting periodic transit signals, our presented method is in general the optimal and least biased estimator and could therefore lead the way toward the first detections of, e.g., planet rings and exo-trojan asteroids.

79 ASTRONOMY AND ASTROPHYSICS↗

Assessing the Reliability Benefits of Energy Storage as a Transmission Asset

Utilizing energy storage solutions to reduce the need for traditional transmission investments has been recognized by system planners and supported by federal policies in recent years. This work demonstrates the need for detailed reliability assessment for quantitative comparison of the reliability benefits of energy storage and traditional transmission investments. First, a mixed-integer linear programming expansion planning model considering candidate transmission lines and storage technologies is solved to find the least-cost investment decisions. Next, operations under the resulting system configuration are simulated in a probabilistic reliability assessment which accounts for weather-dependent forced outages. The outcome of this work, when applied to TPPs, is to further equalize the consideration of energy storage compared to traditional transmission assets by capturing the value of storage for system reliability.

co-optimization↗

Piecewise polyhedral formulations for a multilinear term

Herein, we present a mixed-integer linear programming (MILP) formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using its convex-hull representation. Based on the PPR’s solution, we also present a MILP formulation whose solutions are feasible for nonconvex, multilinear equations. We then present computational results showing the effectiveness of proposed formulations on standard benchmark nonlinear programs (NLPs) with multilinear terms and compare with a traditional formulation that is built using recursive bilinear groupings of multilinear terms.

42 ENGINEERING↗

fPINNs: Fractional Physics-Informed Neural Networks

Physics-informed neural networks (PINNs), introduced, are effective in solving integer-order partial differential equations (PDEs) based on scattered and noisy data. PINNs employ standard feedforward neural networks (NNs) with the PDEs explicitly encoded into the NN using automatic differentiation, while the sum of the mean-squared PDE residuals and the mean-squared error in initial-boundary conditions is minimized with respect to the NN parameters. Here we extend PINNs to fractional PINNs (fPINNs) to solve space-time fractional advection-diffusion equations (fractional ADEs), and we study systematically their convergence, hence explaining both fPINNs and PINNs for the first time. Specifically, we demonstrate their accuracy and effectiveness in solving multidimensional forward and inverse problems with forcing terms whose values are only known at randomly scattered spatio-temporal coordinates (black-box (BB) forcing terms). A novel element of the fPINNs is the hybrid approach that we introduce for constructing the residual in the loss function using both automatic differentiation for the integer-order operators and numerical discretization for the fractional operators. This approach bypasses the difficulties stemming from the fact that automatic differentiation is not applicable to fractional operators because the standard chain rule in integer calculus is not valid in fractional calculus. To discretize the fractional operators, we employ the Grünwald--Letnikov (GL) formula in one-dimensional fractional ADEs and the vector GL formula in conjunction with the directional fractional Laplacian in two- and three-dimensional fractional ADEs. We first consider the one-dimensional fractional Poisson equation and compare the convergence of the fPINNs against the finite difference method (FDM). We present the solution convergence using both the mean L 2 error as well as the standard deviation due to sensitivity to NN parameter initializations. Using different GL formulas we observe first-, second-, and third-order convergence rates for small size training sets but the error saturates for larger training sets. We explain these results by analyzing the four sources of numerical errors due to discretization, sampling, NN approximation, and optimization. The total error decays monotonically (below 10 –5 for a third-order GL formula) but it saturates beyond that point due to the optimization error. We also analyze the relative balance between discretization and sampling errors and observe that the sampling size and the number of discretization points (auxiliary points) should be comparable to achieve the highest accuracy. As we increase the depth of the NN up to certain value, the mean error decreases and the standard deviation increases, whereas the width has essentially no effect unless its value is either too small or too large. We next consider time-dependent fractional ADEs and compare white-box (WB) and BB forcing. We observe that for the WB forcing, our results are similar to the aforementioned cases; however, for the BB forcing fPINNs outperform FDM. Subsequently, we consider multidimensional time-, space-, and space-time-fractional ADEs using the directional fractional Laplacian and we observe relative errors of 10 –3 ~ 10 –4 . Lastly, we solve several inverse problems in one, two, and three dimensions to identify the fractional orders, diffusion coefficients, and transport velocities and obtain accurate results given proper initializations even in the presence of significant noise.

97 MATHEMATICS AND COMPUTING↗

Exploring Integer Sum Reduction using Atomics on Intel CPU

Atomic functions are useful in updating a shared variable by multiple threads, barrier synchronizations, constructing complex data structures, and building high-level frameworks. In this paper, we focus on the evaluation and analysis of integer sum reduction, a common data parallel primitive. We convert the sequential reduction into parallel OpenCL implementations on the CPU. We also develop three micro kernels, which allow us to understand the relationships between the kernel performance and the operations involved in reduction. The results of the micro kernels show that increasing the work-group size linearly can linearly improve the kernel performance. There is a sweet spot in the relationship between the work-group size and barrier synchronization overhead. The performance of the atomics over local memory are not sensitive to the work-group size. The sum reduction kernel with vectorized memory accesses can improve the performance of the baseline kernel for a wide range of work-group sizes. However, the vectorization efficiency shrinks with the growing work-group size. We also find that the vendor’s default OpenCL kernel optimization does not improve the kernel performance. On average, disabling the optimization can reduce the execution time of the kernel with vectorized memory accesses by 15%. We attribute the performance drop to the fact that the default kernel optimizations instantiate a large number of atomics over global memory when implicitly vectorizing the kernel computation.

atomics↗

Efficient and Collision-Free Anticipative Cruise Control in Randomly Mixed Strings

Connected intelligent vehicle following can improve safety and efficiency compared to today's road transport, but real traffic in the near future will not provide an ideal setting for its deployment. Unconnected human-driven vehicles will follow variable behavior patterns that combine with differences in dynamic capability to create heterogeneous scenarios. In this paper, connected automated vehicles employ model predictive control for following in traffic that may include both heavy and passenger vehicles at quasi-random positions. Adding further realism, some quasi-randomly mixed vehicles are completely unconnected and equipped with the reactive intelligent driver model using pseudorandom parameters. A mixed-integer quadratic programming formulation adapts the predictive algorithm to diverse powertrain operating point constraints. The preceding vehicle's control input is estimated from velocity and brake light observations and used to probabilistically generate a preview for the ego vehicle. Here, a terminal constraint designed using particle kinematics prevents collisions due to shortsightedness. Results are simulated at various heavy and predictive vehicle concentrations in the presence of packet loss. Linear fuel economy improvements between 1.4% and 1.9% per 10% increase in predictive vehicle penetration rate are shown.

33 ADVANCED PROPULSION SYSTEMS↗

Water Security Toolkit User Manual Version 1.2.

The Water Security Toolkit (WST) is a suite of open source software tools that can be used by water utilities to create response strategies to reduce the impact of contamination in a water distribution network . WST includes hydraulic and water quality modeling software , optimizati on methodologies , and visualization tools to identify: (1) sensor locations to detect contamination, (2) locations in the network in which the contamination was introduced, (3) hydrants to remove contaminated water from the distribution system, (4) locations in the network to inject decontamination agents to inactivate, remove, or destroy contaminants, (5) locations in the network to take grab sample s to help identify the source of contamination and (6) valves to close in order to isolate contaminate d areas of the network. This user manual describes the different components of WST , along w ith examples and case studies. License Notice The Water Security Toolkit (WST) v.1.2 Copyright c 2012 Sandia Corporation. Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive license for use of this work by or on behalf of the U.S. government. This software is distributed under the Revised BSD License (see below). In addition, WST leverages a variety of third-party software packages, which have separate licensing policies: Acro Revised BSD License argparse Python Software Foundation License Boost Boost Software License Coopr Revised BSD License Coverage BSD License Distribute Python Software Foundation License / Zope Public License EPANET Public Domain EPANET-ERD Revised BSD License EPANET-MSX GNU Lesser General Public License (LGPL) v.3 gcovr Revised BSD License GRASP AT&T Commercial License for noncommercial use; includes randomsample and sideconstraints executable files LZMA SDK Public Domain nose GNU Lesser General Public License (LGPL) v.2.1 ordereddict MIT License pip MIT License PLY BSD License PyEPANET Revised BSD License Pyro MIT License PyUtilib Revised BSD License PyYAML MIT License runpy2 Python Software Foundation License setuptools Python Software Foundation License / Zope Public License six MIT License TinyXML zlib License unittest2 BSD License Utilib Revised BSD License virtualenv MIT License Vol Common Public License vpykit Revised BSD License Additionally, some precompiled WST binary distributions might bundle other third-party executables files: Coliny Revised BSD License (part of Acro project) Dakota GNU Lesser General Public License (LGPL) v.2.1 PICO Revised BSD License (part of Acro project) i Revised BSD License Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Sandia National Laboratories nor Sandia Corporation nor the names of its con- tributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IM- PLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUD- ING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ii Acknowledgements This work was supported by the U.S. Environmental Protection Agency through its Office of Research and Development (Interagency Agreement # DW8992192801). The material in this document has been subject to technical and policy review by the U.S. EPA, and approved for publication. The views expressed by individual authors, however, are their own, and do not necessarily reflect those of the U.S. Environmental Protection Agency. Mention of trade names, products, or services does not convey official U.S. EPA approval, endorsement, or recommendation. The Water Security Toolkit is an extension of the Threat Ensemble Vulnerability Assessment-Sensor Place- ment Optimization Tool (TEVA-SPOT), which was also developed with funding from the U.S. Environ- mental Protection Agency through its Office of Research and Development (Interagency Agreement # DW8992192801). The authors acknowledge the following individuals for their contributions to the devel- opment of TEVA-SPOT: Jonathan Berry (Sandia National Laboratories), Erik Boman (Sandia National Laboratories), Lee Ann Riesen (Sandia National Laboratories), James Uber (University of Cincinnati), and Jean-Paul Watson (Sandia National Laboratories). iii Acronyms ATUS American Time-Use Survey BLAS Basic linear algebra sub-routines CFU Colony-forming unit CVAR Conditional value at risk CWS Contamination warning system EA Evolutionary algorithm EDS Event detection system EPA U.S. Environmental Protection Agency EC Extent of Contamination ERD EPANET results database file GLPK GNU Linear Programming Kit GRASP Greedy randomized adaptive sampling process HEX Hexadecimal HTML HyperText markup language INP EPANET input file LP Linear program MC Mass consumed MILP Mixed integer linear program MIP Mixed integer program MSX Multi-species extension for EPANET NFD Number of failed detections NS Number of sensors NZD Non-zero demand PD Population dosed PE Population exposed PK Population killed TAI Threat assessment input file TCE Tailed-conditioned expectation TD Time to detection TEC Timed extent of contamination TEVA Threat ensemble vulnerability assessment TSB Tryptic soy broth TSG Threat scenario generation file TSI Threat simulation input file VAR Value at risk VC Volume consumed WST Water Security Toolkit YML YAML configuration file format for WST iv Symbols Notation Definition Example { , } set brackets { 1,2,3 } means a set containing the values 1,2, and 3. [?] is an element of s [?] S means that s is an element of the set S . [?] for all s = 1 [?] s [?] S means that the statement s = 1 is true for all s in set S . P summation P n i =1 s i means s 1 + s 2 + * * * + s n . \ set minus S \ T means the set that contains all those elements of S that are not in set T . %7C given %7C is used to define conditional probability. P ( s %7C t ) means the prob- ability of s occurring given that t occurs. %7C ... %7C cardinality Cardinality of a set is the number of elements of the set. If set S = { 2,4,6 } , then %7C S %7C = 3. v

Klise, Katherine A.↗

LONG-TIMESCALE BEHAVIOR OF THE BLAZHKO EFFECT FROM RECTIFIED KEPLER DATA

In order to benefit from the four year unprecedented precision of the Kepler data, we extracted light curves from the pixel photometric data of the Kepler space telescope for 15 Blazhko RR Lyrae stars. To collect all the flux from a given target as accurately as possible, we defined tailor-made apertures for each star and quarter. In some cases, the aperture finding process yielded sub-optimal results, because some flux have been lost even if the aperture contains all available pixels around the star. This fact stresses the importance of those methods that rely on the whole light curve instead of focusing on the extrema (O – C diagrams and other amplitude independent methods). We carried out detailed Fourier analysis of the light curves and the amplitude independent O – C diagram. We found 12 (80%) multiperiodically modulated stars in our sample. This ratio is much higher than previously found. Resonant coupling between radial modes, a recent theory for explaining the Blazhko effect, allows single, multiperiodic, or even chaotic modulations. Among the stars with two modulations, we found three stars (V355 Lyr, V366 Lyr, and V450 Lyr) where one of the periods dominates in amplitude modulation, but the other period has a larger frequency modulation amplitude. The ratio between the primary and secondary modulation periods is almost always very close to the ratios of small integer numbers. It may indicate the effect of undiscovered resonances. Furthermore, we detected the excitation of the second radial overtone mode f {sub 2} for three stars where this feature was formerly unknown. Our data set comprises the longest continuous, most precise observations of Blazhko RR Lyrae stars ever published. These data are made publicly available and will be unrivaled for years to come.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic Microgrid Scheduling With Chance‐Constrained Resilience Consideration

Traditionally, it is assumed that microgrids transition seamlessly from grid‐connected operation to islanded mode in the event of sudden main grid outages. In reality, the islanding process, especially unintentional islanding, is rarely seamless. Instead, it is subject to voltage and frequency fluctuations caused by the instantaneous disconnection of the point of common coupling (PCC) switch, variations in loads and renewable generation output and even the protection tripping of distributed energy resources (DERs). To mitigate these fluctuations and facilitate a smooth islanding process, we propose a stochastic microgrid scheduling model that incorporates chance‐constrained resilience measures. Specifically, the resilience measure is defined as the probability of successful islanding (PSI), that is, the probability that a microgrid can mitigate the generation‐demand imbalance caused by the disconnection of the PCC switch, variations in load and renewable generation and DER tripping. This measure is modelled using chance constraints. Unlike existing reliability and resilience indices, which typically neglect the possibility of microgrid/DER failure under extreme events and assume their survival while primarily focussing on reducing impact duration or magnitude, the proposed PSI‐based framework explicitly addresses microgrid and DER survival during the islanding transition. The formulated nonlinear chance constraints are approximated using a multiinterval approach and equivalently represented as a mixed‐integer linear programming (MILP) formulation. Case study results validate the proposed method, showing that the PSI estimation error is reduced to less than 8%, compared to approximately 28% with existing methods. Various sensitivity analyses on the DER tripping rate and PSI settings were performed to validate the robustness of the proposed method. In particular, the necessity of accounting for DER tripping in the PSI calculation was demonstrated.

chance constrained optimization↗

An interregional optimization approach for time series aggregation in continent-scale electricity system models

Modeling electric power systems with high shares of weather-dependent resources requires tradeoffs between temporal, spatial, and operational resolution. Many studies perform time series aggregation using clustering algorithms to reduce the temporal dimension, but when modeling continent-scale electricity systems that are large enough to contain multiple independent weather systems, this approach requires large numbers of representative periods to minimize errors in regional wind and solar capacity factors. Here, a new optimization-based approach for representative period selection and weighting is introduced that minimizes regional errors in average renewable capacity factors and electricity demand. The method delivers higher regional fidelity with fewer representative periods than alternative clustering methods when applied to wind, solar, and demand profiles for the contiguous United States. When representative periods are selected from multiple weather years, the optimized method reproduces regional averages with lower error than a complete 365-day time series from any single weather year. The method identifies only representative (as opposed to outlying) periods but can be combined with an iterative "stress period" identification approach to guide efficient decision-making considering both average and high-risk weather conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ORBITAL MOTION OF HR 8799 b, c, d USING HUBBLE SPACE TELESCOPE DATA FROM 1998: CONSTRAINTS ON INCLINATION, ECCENTRICITY, AND STABILITY

HR 8799 is currently the only multiple-planet system that has been detected with direct imaging, with four giant planets of masses 7-10 M{sub Jup} orbiting at large separations (15-68 AU) from this young late A star. Orbital motion provides insight into the stability and possible formation mechanisms of this planetary system. Dynamical studies can also provide constraints on the planets' masses, which help calibrate evolutionary models, yet measuring the orbital motion is a very difficult task because the long-period orbits (50-500 yr) require long time baselines and high-precision astrometry. This paper studies the three planets HR 8799b, c, and d in the archival data set of HR 8799 obtained with the Hubble Space Telescope (HST) NICMOS coronagraph in 1998. The detection of all three planets is made possible by a careful optimization of the Locally Optimized Combination of Images algorithm, and we used a statistical analysis of a large number of reduced images. This work confirms previous astrometry for planet b and presents new detections and astrometry for planets c and d. These HST images provide a ten-year baseline with the discovery images from 2008, and therefore offer a unique opportunity to constrain their orbital motion now. Recent dynamical studies of this system show the existence of a few possible stable solutions involving mean motion resonances (MMRs), where the interaction between c and d plays a major role. We study the compatibility of a few of these stable scenarios (1d:1c, 1d:2c, or 1d:2c:4d) with the new astrometric data from HST. In the hypothesis of a 1d:2c:4b MMR our best orbit fit is close to the stable solution previously identified for a three-planet system and involves low eccentricity for planet d (e{sub d} = 0.10) and moderate inclination of the system (i = 28.0 deg), assuming a coplanar system, circular orbits for b and c, and exact resonance with integer period ratios. Under these assumptions, we can place strong constraints on the inclination of the system (27.3-31.4 deg) and on the eccentricity for d e{sub d} < 0.46. Our results are robust to small departures from exact integer period ratios and consistent with previously published results based on dynamical studies for a three-planet system prior to the discovery of the fourth planet.

79 ASTRONOMY AND ASTROPHYSICS↗

OPERATIONAL TOPOLOGY ESTIMATION OF THREE PHASE UNBALANCED POWER DISTRIBUTION SYSTEMS WITH OUTAGES

Distribution grid, in general, is constructionally loopy but a radially operated network. Opening and closing of suitable tie-switches allows transition from one radial topology to another. Tie-switches ensure reliability and provide restoration paths when faults (outages) occur. The estimation of the system's current operational topology is a precursor to implementing any optimal control actions (during normal operation) or restorative actions (during outage condition). The existing literature in topology detection suffers with several limitations including: (1) computationally intensive nonlinear formulations that are not scalable for large distribution systems, (2) methods requiring exhaustive search for the correct topology by enumerating the complete topological search space, and (3) approaches requiring large volumes of time-series measurements and are not applicable for estimating continuously changing operational topology. Furthermore, the existing literature on distribution grid topology estimation cannot be extended to estimate the operational topology during outage conditions. For operational topology estimation during outages, our objective is to estimate both energized radial feeder and the outaged sections. Starting with a radial topology, these methods identify outaged feeder sections and hence, are inapplicable when the current radial operational topology is not known. In this work, we present a mathematical programming approach to estimate the operational topology of a three-phase unbalanced power distribution system under both outage and normal operating conditions. The aforementioned limitations of existing literature were countered by modeling the problem as a mixed-integer linear programming (MILP) problem which minimizes the errors in available measurements while satisfying the power flow and structural constraints of the system. Specically, a minimum weighted least absolute value estimator is proposed that uses the instantaneous line flow measurements, historical/ forecasted load data, and ping measurements from a limited set of smart meters and solves an MILP to identify the operational topology based on a linearized three-phase unbalanced power flow model. The proposed approach is tested on IEEE 123-bus feeder and 1069 bus multi-feeder test system and the numerical results prove the applicability of the proposed method to large three phase unbalanced grids with high errors in measurements. It is observed that the approach performs well even at high percentages of measurement errors.

GANDLURU NAGA, ANANDINI↗

Bi-objective approaches for home healthcare medical team planning and scheduling problem

In this paper, we study the medical team planning and scheduling in home healthcare within a weekly horizon, including the planning of nursing visits and the daily traveling route scheduling. Two objectives are considered: the first one is to minimize the total operation cost of the healthcare agency and the second one is to maximize the patient satisfaction. The problem is formulated as a mixed integer program, to seek for a trade-off between two objectives, with the characteristics of the patient requirements including nursing types, nursing frequency and service length considered. Medical team types, available service days and overwork penalty are also respected in the model. Then an ϵ-constraint method is adopted to obtain exact non-dominated solutions. To address large-scale problem instances, three heuristic approaches are developed to generate approximate Pareto fronts in a reasonable time. The set of non-dominated solutions are valuable for decision-making. Computational experiments are conducted and the results demonstrate the efficiency of the approaches.

97 MATHEMATICS AND COMPUTING↗

HykSort: a new variant of hypercube quicksort on distributed memory architectures. In: ICS '13 Proceedings of the 27th international ACM conference on International conference on supercomputing

In this paper, we present HykSort, an optimized comparison sort for distributed memory architectures that attains more than 2× improvement over bitonic sort and samplesort. The algorithm is based on the hypercube quicksort, but instead of a binary recursion, we perform a k-way recursion in which the pivots are selected accurately with an iterative parallel select algorithm. The single-node sort is performed using a vectorized and multithreaded merge sort. The advantages of HykSort are lower communication costs, better load balancing, and avoidance of O(p)-collective communication primitives. We also present a staged communication samplesort, which is more robust than the original samplesort for large core counts. We conduct an experimental study in which we compare hypercube sort, bitonic sort, the original samplesort, the staged samplesort, and HykSort. We report weak and strong scaling results and study the effect of the grain size. It turns out that no single algorithm performs best and a hybridization strategy is necessary. As a highlight of our study, on our largest experiment on 262,144 AMD cores of the CRAY XK7 "Titan" platform at the Oak Ridge National Laboratory we sorted 8 trillion 32-bit integer keys in 37 seconds achieving 0.9TB/s effective throughput.

Sundar, Hari↗