Minimizing specific energy consumption using digital twins
Explore the source record for details and available documents.
Ghorbani, Pooria [University of California, Irvine↗
SEARCH · Engineering Papers
Results for “Minimization”
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.
Minimizing Auxiliary Heat Use for Cold Climate Operation of Air Source Heat Pumps: Preprint
This paper investigates the auxiliary heat use for air-source heat pumps (ASHPs) operating in cold climates. Twelve variable-capacity, central ducted ASHPs installed in single-family homes in cold climate regions (eleven in the northwest United States and one in a Denver suburb) were monitored for an entire winter season to collect data at cold temperatures. The methodology employed airside and power measurements that were taken every five seconds, to calculate the heat pump’s capacity, coefficient of performance (COP), and auxiliary heat energy consumption. This paper provides insights into the practical implications of auxiliary heat utilization in centrally ducted ASHPs and suggests opportunities to mitigate the usage of auxiliary heat, improving overall system efficiency during cold climate operation.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Minimizing specific energy consumption using digital twins
Explore the source record for details and available documents.
Melin, Alexander [ORNL] (ORCID:0000000271208154)↗
Annual Summary/Waste Minimization Report Calendar Year 2025
Explore the source record for details and available documents.
Simper, Karlita L. [Nevada National Security Site/↗
On complexity of trellis structure of linear block codes
The trellis structure of linear block codes (LBCs) is discussed. The state and branch complexities of a trellis diagram (TD) for a LBC is investigated. The TD with the minimum number of states is said to be minimal. The branch complexity of a minimal TD for a LBC is expressed in terms of the dimensions of specific subcodes of the given code. Then upper and lower bounds are derived on the number of states of a minimal TD for a LBC, and it is shown that a cyclic (or shortened cyclic) code is the worst in terms of the state complexity among the LBCs of the same length and dimension. Furthermore, it is shown that the structural complexity of a minimal TD for a LBC depends on the order of its bit positions. This fact suggests that an appropriate permutation of the bit positions of a code may result in an equivalent code with a much simpler minimal TD. Boolean polynomial representation of codewords of a LBC is also considered. This representation helps in study of the trellis structure of the code. Boolean polynomial representation of a code is applied to construct its minimal TD. Particularly, the construction of minimal trellises for Reed-Muller codes and the extended and permuted binary primitive BCH codes which contain Reed-Muller as subcodes is emphasized. Finally, the structural complexity of minimal trellises for the extended and permuted, and double-error-correcting BCH codes is analyzed and presented. It is shown that these codes have relatively simple trellis structure and hence can be decoded with the Viterbi decoding algorithm.
Lin, Shu↗
Optimal Design of Functionally Graded Metallic Foam Insulations
The focus of our work has been on developing an insight into the physics that govern the optimum design of thermal insulation for use in thermal protection systems of launch vehicle. Of particular interest was to obtain optimality criteria for designing foam insulations that have density (or porosity) distributions through the thickness for optimum thermal performance. We investigate the optimum design of functionally graded thermal insulation for steady state heat transfer through the foam. We showed that the heat transfer in the foam has competing modes, of radiation and conduction. The problem assumed a fixed inside temperature of 400 K and varied the aerodynamic surface heating on the outside surface from 0.2 to 1.0 MW/sq m. The thermal insulation develops a high temperature gradient through the thickness. Investigation of the model developed for heat conduction in foams showed that at high temperatures (as on outside wall) intracellular radiation dominates the heat transfer in the foam. Minimizing radiation requires reducing the pore size, which increases the density of the foam. At low temperatures (as on the inside wall), intracellular conduction (of the metal and air) dominates the heat transfer. Minimizing conduction requires increasing the pore size. This indicated that for every temperature there was an optimum value of density that minimized the heat transfer coefficient. Two optimization studies were performed. One was to minimize the heat transmitted though a fixed thickness insulation by varying density profiles. The second was to obtain the minimum mass insulation for specified thickness. Analytical optimality criteria were derived for the cases considered. The optimality condition for minimum heat transfer required that at each temperature we find the density that minimizes the heat transfer coefficient. Once a relationship between the optimum heat transfer coefficient and the temperature was found, the design problem reduced to the solution of a simple nonlinear differential equation. Preliminary results of this work were presented at the American Society of Composites meeting, and the final version was submitted for publication in the AIAA Journal. In addition to minimizing the transmitted heat, we investigated the optimum design for minimum weight given an acceptable level of heat transmission through the insulation. The optimality criterion developed was different from that obtained for minimizing beat transfer coefficient. For minimum mass design, we had to find for a given temperature the optimum density, which minimized the logarithmic derivative of the insulation thermal conductivity with respect to its density. The logarithmic derivative is defined as the ratio of relative change in the dependent response (thermal conductivity) to the relative change in the independent variable (density). The results have been documented as a conference paper that will be presented at the upcoming AIAA.
Haftka, Raphael T.↗
ORNL_AISD_NiPt
This dataset describes the nickel-platinum (NiPt) solid solution binary alloy, where the two constituent elements nickel (Ni) and platinum (Pt) are randomly placed on the face centered cubic (FCC) crystal structure, with the lattice constant of 3.840 angstroms. The dataset comprises data for three different sizes of the crystal structure: 256 atoms, 864 atoms, and 2,048 atoms, each of which contains 1900 configurations. For each size of the crystal structure, the data set was generated for concentrations ranging from 0at% of Pt to 100at% of Pt in the NiPt binary system, with increasing the concentration of Pt in the system every 5at%. For each one of the chemical compositions, 100 random configurations were generated, each with a different random seed. Each of the output files contains the mass, type, atomic coordinates, energy per atom, and forces in x, y, and z directions respectively. For each atomic configuration, the output was collected every 150 steps during the minimization stage and every 1000 steps during the replica exchange stage. Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) [1], which is a molecular dynamics code, was used to generate data for NiPt alloy. The simulation used the interatomic potential for NiPt binary system MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001 [3] from the OpenKIM library (Open Knowledgebase of Interatomic Models) [2]. This potential was developed based on the second nearest-neighbor modified embedded-atom method (2NN MEAM). The simulation process begins with the generation of the random NiPt structure and follows with the short minimization and replica exchange simulation. The minimization procedure adjusts atomic coordinates and performs energy minimization, which typically leads to a local potential energy minimum. The method used for the minimization was the conjugate gradient algorithm. A short replica exchange (parallel tempering) simulation involves four replicas (ensembles) of a system and follows the minimization stage. Multiple snapshots of the configuration were collected during the minimization and replica exchange stages. NiPt alloy is interesting due to its magnetic and charge transfer properties [4]. The data is provided in three compressed zipped folders: atoms256.zip, atoms864.zip, atoms2048.zip Each zipped folder contains the data that describes crystals of size 256 atoms, 864 atoms, and 2,048 atoms respectively. Each one of the three zipped folders contains the data structured in the following way: -Ni_ground_state.cfg --> atomic configuration for the pure nickel -Pt_ground_state.cfg --> atomic configuration for the pure platinum -Pt#_filtered --> folders containing atomic configurations for #at% concentration of platinum. The folder contains 100 atomic configurations, each saved in a subfolder. Each subfolder named config* is associated with a specific atomic configuration. Each of these subfolders contains files with .cfg format, corresponding to outputs for each atomic configuration The total number of atomic configurations contained in atoms256.zip is 65,046. The total number of atomic configurations contained in atoms864.zip is 63,936. The total number of atomic configurations contained in atoms2048.zip is 61,997. The total number of atomic configurations spanned by the entire dataset is 190,979. References [1] https://www.lammps.org/ [2] https://openkim.org/ [3] https://openkim.org/id/MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001 [4] El-Gendy, Ahmed A. and Hampel, Silke and Büccchner, Bernd and Klingeler, Rüdiger, Tuneable magnetic properties of carbon-shielded NiPt-nanoalloys, RSC Adv., volume 6, issue 57, pages 52427-52433, 2016, The Royal Society of Chemistry, doi:10.1039/C6RA05910D
36 MATERIALS SCIENCE↗
ORNL_AISD_NiPt_108atoms
This dataset describes the nickel-platinum (NiPt) solid solution binary alloy, where the two constituent elements nickel (Ni) and platinum (Pt) are randomly placed on the face centered cubic (FCC) crystal structure, with the lattice constant of 3.840 angstroms. The dataset comprises data for crystal structures with 108 atoms with 1,900 configurations. The data set was generated for concentrations ranging from 0at% of Pt to 100at% of Pt in the NiPt binary system, with increasing the concentration of Pt in the system every 5at%. For each one of the chemical compositions, 100 random configurations were generated, each with a different random seed. Each of the output files contains the mass, type, atomic coordinates, energy per atom, and forces in x, y, and z directions respectively. For each atomic configuration, the output was collected every 150 steps during the minimization stage and every 1000 steps during the replica exchange stage. Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) [1], which is a molecular dynamics code, was used to generate data for NiPt alloy. The simulation used the interatomic potential for NiPt binary system 'MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001' [3] from the OpenKIM library (Open Knowledgebase of Interatomic Models) [2]. This potential was developed based on the second nearest-neighbor modified embedded-atom method (2NN MEAM). The simulation process begins with the generation of the random NiPt structure and follows with the short minimization and replica exchange simulation. The minimization procedure adjusts atomic coordinates and performs energy minimization, which typically leads to a local potential energy minimum. The method used for the minimization was the conjugate gradient algorithm. A short replica exchange (parallel tempering) simulation involves four replicas (ensembles) of a system and follows the minimization stage. Multiple snapshots of the configuration were collected during the minimization and replica exchange stages. NiPt alloy is interesting due to its magnetic and charge transfer properties [4]. The data is provided in a compressed zipped folders atoms108.zip. The zipped folder contains the data structured in the following way: - Ni_ground_state.cfg --> atomic configuration for the pure nickel - Pt_ground_state.cfg --> atomic configuration for the pure platinum - Pt#_filtered --> folders containing atomic configurations for #at% concentration of platinum. The folder contains 100 atomic configurations, each saved in a subfolder - Each subfolder named config* is associated with a specific atomic configuration. Each of these subfolders contains files with .cfg format, corresponding to outputs for each atomic configuration The total number of atomic configurations contained in atoms108.zip is 66,132. This dataset is an extension to the dataset ORNL_AISD_NiPt [5] that has been previously released with crystal structures of 256 atoms, 864 atoms, and 2,048 atoms, with the same methodology for data collection. References [1] https://www.lammps.org/ [2] https://openkim.org/ [3] https://openkim.org/id/MEAM_LAMMPS_KimSeolJi_2017_PtNi__MO_020840179467_001 [4] El-Gendy, Ahmed A. and Hampel, Silke and Büchner, Bernd and Klingeler, Rüdiger, Tuneable magnetic properties of carbon-shielded NiPt-nanoalloys, RSC Adv., volume 6, issue 57, pages 52427-52433, 2016, The Royal Society of Chemistry, doi:10.1039/C6RA05910D [5] M. Karabin, M. Lupo Pasini, and M. Eisenbach. ORNL_AISD_NiPt. United States: N. p., 2023. Web. doi:10.13139/OLCF/1958172.
36 MATERIALS SCIENCE↗
An Improved Approach to the Predictability & Reliability of the Onset of Turbulence With Shocks
The construction of numerical schemes for (a) stable and accurate simulation of turbulence with strong shocks, and for (b) obtaining correct propagation speed of discontinuities in the presence of stiff source terms share one important ingredient – minimization of numerical dissipation while maintaining numerical stability. The dual requirements to achieve both numerical stability and minimal numerical dissipation are often conflicting since existing shock capturing schemes were designed mainly to be robust for rapidly developed turbulence-free flows and for shock waves without stiff source term. For the past two decades, Yee and collaborators have focused on an improved understanding of the nonlinear behavior of different high order shock-capturing methods. It was found that even very high order methods without proper nonlinear stability and numerical dissipation control can either numerically smear the onset of turbulence due to excess numerical dissipation, or induce (onset) numerical turbulence that is not physical turbulence due to lack of proper numerical dissipation to improve nonlinear stability for long time integration. Our approach is to combine (I) and (II) below for obtaining the physically correct onset of turbulence with shocks, including problems with stiff source terms: (I) Nonlinear dynamics is utilized to complement the traditional linearized stability theory (Yee & Sweby, Yee et al., Griffiths et al., Lafon & Yee, Yee, Wang et al., Kotov et al. 1990- 2015) in order to (i) Minimize numerically induced false transition to turbulence, (ii) Minimize numerical instability due to long time integration of turbulent flows, (iii) Minimize numerically induced standing wave solutions, and (iv) Minimize wrong propagation of speed of discontinuities due to the presence of stiff source terms. (II) Our recently developed physical preserving (structural preserving) high order methods with improved nonlinear stability & accuracy that are essential in minimizing spurious numerics are used.
HECC↗
Controlled workplace charging of electric vehicles: The impact of rate schedules on transformer aging
To accelerate adoption of non-residential charging for electric vehicles, sites must maximize utilization of existing electrical infrastructure. In this study we model electric vehicle charging at a workplace using real charging data and evaluate the lifetime of the site’s transformer as the number of charging stations is incrementally increased. We implement and compare a range of control schemes for workplace charging including minimizing the peak load, capping the total load, minimizing bills under different rate structures with time-of-use energy costs and demand charges, and directly minimizing the transformer’s aging. These are compared by the number of vehicles they allow the transformer to support, the transformer’s health, and the operator’s electricity bill. We draw a connection between minimizing the peak load and improving the transformer’s health. We observe that minimizing the electricity bill is the best scheme by both criteria when the bill includes a demand charge; in our experiment it allowed the infrastructure to support over 67% more cars than under uncontrolled charging. To protect the transformer we recommend that demand charges or capacity management be applied to parking lots of charging electric vehicles with high infrastructure utilization, and operators schedule charging to minimize their electricity bills.
24 POWER TRANSMISSION AND DISTRIBUTION↗
tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions
The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Advanced Permanent Magnet Generator Topologies Using Multimaterial Shape Optimization and 3D Printing: Preprint
A vast majority of utility-scale wind turbine generators in the United States are dependent on foreign- sourced rare-earth permanent magnets that are vulnerable to supply chain uncertainties. Many small wind original equipment manufacturers are motivated to pursue continuous improvements to the generator design to lower the material and production costs and improve performance by lowering cogging torque and increasing the efficiency. Traditional design and manufacturing offer limited opportunities. In this work, we demonstrate advanced design approaches for a 15-kW baseline wind turbine generator by making use of recent progress in three-dimensional (3D) printing of polymer- bonded magnets and, electrical and structural steel. We explore three methods of magnet parametrization using Bezier curves resulting in symmetric, asymmetric and multimaterial magnet designs. We employ a multiphysics approach combining parametric computer-aided design modeling, finite- element analysis and targeted sampling to identify novel designs with more opportunities for reducing rare-earth material, improving efficiency and minimizing cogging torque. The results show that asymmetric-pole design and multimaterial-pole designs offer a greater opportunity to minimize rare-earth magnet materials by up to 35% with similar performance as the baseline generator, suggesting newer opportunities with design freedom beyond traditional limits of symmetry and as allowed by 3D printing.
Bezier curves↗
The trellis complexity of convolutional codes
It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm. It has gradually become apparent that linear block codes also have a natural, though not in general a regular, 'minimal' trellis structure, which allows them to be decoded with a Viterbi-like algorithm. In both cases, the complexity of the Viterbi decoding algorithm can be accurately estimated by the number of trellis edges per encoded bit. It would, therefore, appear that we are in a good position to make a fair comparison of the Viterbi decoding complexity of block and convolutional codes. Unfortunately, however, this comparison is somewhat muddled by the fact that some convolutional codes, the punctured convolutional codes, are known to have trellis representations that are significantly less complex than the conventional trellis. In other words, the conventional trellis representation for a convolutional code may not be the minimal trellis representation. Thus, ironically, at present we seem to know more about the minimal trellis representation for block than for convolutional codes. In this article, we provide a remedy, by developing a theory of minimal trellises for convolutional codes. (A similar theory has recently been given by Sidorenko and Zyablov). This allows us to make a direct performance-complexity comparison for block and convolutional codes. A by-product of our work is an algorithm for choosing, from among all generator matrices for a given convolutional code, what we call a trellis-minimal generator matrix, from which the minimal trellis for the code can be directly constructed. Another by-product is that, in the new theory, punctured convolutional codes no longer appear as a special class, but simply as high-rate convolutional codes whose trellis complexity is unexpectedly small.
Mceliece, R. J.↗
Optimized System Identification
In system identification, one usually cares most about finding a model whose outputs are as close as possible to the true system outputs when the same input is applied to both. However, most system identification algorithms do not minimize this output error. Often they minimize model equation error instead, as in typical least-squares fits using a finite-difference model, and it is seen here that this distinction is significant. Here, we develop a set of system identification algorithms that minimize output error for multi-input/multi-output and multi-input/single-output systems. This is done with sequential quadratic programming iterations on the nonlinear least-squares problems, with an eigendecomposition to handle indefinite second partials. This optimization minimizes a nonlinear function of many variables, and hence can converge to local minima. To handle this problem, we start the iterations from the OKID (Observer/Kalman Identification) algorithm result. Not only has OKID proved very effective in practice, it minimizes an output error of an observer which has the property that as the data set gets large, it converges to minimizing the criterion of interest here. Hence, it is a particularly good starting point for the nonlinear iterations here. Examples show that the methods developed here eliminate the bias that is often observed using any system identification methods of either over-estimating or under-estimating the damping of vibration modes in lightly damped structures.
Juang, Jer-Nan↗
Quadratic Optimization in the Problems of Active Control of Sound
We analyze the problem of suppressing the unwanted component of a time-harmonic acoustic field (noise) on a predetermined region of interest. The suppression is rendered by active means, i.e., by introducing the additional acoustic sources called controls that generate the appropriate anti-sound. Previously, we have obtained general solutions for active controls in both continuous and discrete formulations of the problem. We have also obtained optimal solutions that minimize the overall absolute acoustic source strength of active control sources. These optimal solutions happen to be particular layers of monopoles on the perimeter of the protected region. Mathematically, minimization of acoustic source strength is equivalent to minimization in the sense of L(sub 1). By contrast. in the current paper we formulate and study optimization problems that involve quadratic functions of merit. Specifically, we minimize the L(sub 2) norm of the control sources, and we consider both the unconstrained and constrained minimization. The unconstrained L(sub 2) minimization is certainly the easiest problem to address numerically. On the other hand, the constrained approach allows one to analyze sophisticated geometries. In a special case, we call compare our finite-difference optimal solutions to the continuous optimal solutions obtained previously using a semi-analytic technique. We also show that the optima obtained in the sense of L(sub 2) differ drastically from those obtained in the sense of L(sub 1).
Loncaric, J.↗
Biased Randomized Algorithm for Fast Model-Based Diagnosis
A biased randomized algorithm has been developed to enable the rapid computational solution of a propositional- satisfiability (SAT) problem equivalent to a diagnosis problem. The closest competing methods of automated diagnosis are described in the preceding article "Fast Algorithms for Model-Based Diagnosis" and "Two Methods of Efficient Solution of the Hitting-Set Problem" (NPO-30584), which appears elsewhere in this issue. It is necessary to recapitulate some of the information from the cited articles as a prerequisite to a description of the present method. As used here, "diagnosis" signifies, more precisely, a type of model-based diagnosis in which one explores any logical inconsistencies between the observed and expected behaviors of an engineering system. The function of each component and the interconnections among all the components of the engineering system are represented as a logical system. Hence, the expected behavior of the engineering system is represented as a set of logical consequences. Faulty components lead to inconsistency between the observed and expected behaviors of the system, represented by logical inconsistencies. Diagnosis - the task of finding the faulty components - reduces to finding the components, the abnormalities of which could explain all the logical inconsistencies. One seeks a minimal set of faulty components (denoted a minimal diagnosis), because the trivial solution, in which all components are deemed to be faulty, always explains all inconsistencies. In the methods of the cited articles, the minimal-diagnosis problem is treated as equivalent to a minimal-hitting-set problem, which is translated from a combinatorial to a computational problem by mapping it onto the Boolean-satisfiability and integer-programming problems. The integer-programming approach taken in one of the prior methods is complete (in the sense that it is guaranteed to find a solution if one exists) and slow and yields a lower bound on the size of the minimal diagnosis. In contrast, the present approach is incomplete and fast and yields an upper bound on the size of the minimal diagnosis.
Williams, Colin↗
Gradient flow based phase-field modeling using separable neural networks
Allen–Cahn equation is a reaction–diffusion equation and is widely used for modeling phase separation. Machine learning methods for solving the Allen–Cahn equation in its strong form suffer from inaccuracies in collocation techniques, errors in computing higher-order spatial derivatives, and the large system size required by the space–time approach. To overcome these challenges, we propose solving the gradient flow of the Ginzburg–Landau free energy functional, which is equivalent to the Allen–Cahn equation, thereby avoiding the second-order spatial derivatives associated with the Allen–Cahn equation. A minimizing movement scheme is employed to solve the gradient flow problem, eliminating the complexities of a space–time approach. We utilize a separable neural network that efficiently represents the phase field through low-rank tensor decomposition. As we use the minimizing movement scheme to numerically solve the gradient flow problem, we thus, refer to the proposed method as the Separable Deep Minimizing Movement (SDMM) method. The evaluation of the functional in the minimizing movement scheme using the Gauss quadrature technique bypasses the inaccuracies associated with collocation techniques traditionally used to solve partial differential equations. A hyperbolic tangent transformation is introduced on the phase field prior to the evaluation of the functional to ensure that it remains strictly bounded within the values of the two phases. For this transformation, theoretical guarantee for energy stability of the minimizing movement scheme is established. Our results suggest that this transformation helps to improve the accuracy and efficiency significantly. The proposed method resolves the challenges faced by state-of-the-art machine learning techniques, outperforming them in both accuracy and efficiency. It is also the first machine learning method to achieve an order of magnitude speed improvement over the finite element method. In addition to its formulation and computational implementation, several case studies illustrate the applicability of the proposed method.
42 ENGINEERING↗
Optimal Operation of PV Sources in DC Grids for Improving Technical, Economical, and Environmental Conditions by Using Vortex Search Algorithm and a Matrix Hourly Power Flow
This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times.
14 SOLAR ENERGY↗