Strategic allocation and energy management of BESS for the provision of ancillary services in active distribution networks

The increased penetration of renewables has prompted the integration of battery energy storage systems (BESSs) in active distribution networks. The BESS not only act as backup power supply but also provides various ancillary services with extra degree of flexibility to distribution networks by changing its' role as generation and load. In this study, a new optimization framework is developed to optimally allocate the intense wind power generation units and BESSs considering its ancillary services in distribution systems. The BESSs are strategically allocated at two sites in coordination with the renewable generating source. One is installed at grid substation to participate in central ancillary services whereas; second will be used to participate in distributed ancillary services. The objective is to minimize the cost of annual energy loss while performing various ancillary services in distribution network. The proposed optimization framework is implemented on a real-life 108-bus Indian distribution system for different cases and solved using genetic algorithm. The comparison of simulation results show that the proposed optimization framework provides more energy loss reduction, improved system voltage and power factor at higher penetration of wind power generation units as compared to the cases in which ancillary services are not considered in planning

Tilt Integral Derivative Controller Optimized by Battle Royale Optimization for Wind Generator Connected to Grid

Globally the countries are focusing on reducing the carbon footprint leading to a greater effort for electrical energy generation by renewable energy sources, particularly wind. The wind turbines are invariably using doubly fed asynchronous generator. In this paper a controller has been designed for a doubly fed induction motor. The proposed Tilt Integral Derivate controller for was compared with commonly used PI, PID controllers. Several optimization algorithms were used for tuning of controllers and the best one was selected for each type of controller. The controller has been optimized using battlefield optimization. It had been compared with proportional integral controller, fractional order proportional integral derivative controller. Other controllers were optimized using meta heuristic algorithms. The controller enhanced the system response in terms of settling time, rise time and other parameters. The Tilt controller gave the overall superior performance in terms of parameters like rise time, settling time, settling minimum, peak, and peak time. The results were obtained using MATLAB. This paper discusses operation of doubly fed induction motor operation and optimization methods

Text Summarization Technique for Punjabi Language Using Neural Networks

In the contemporary world, utilization of digital content has risen exponentially. For example, newspaper and web articles, status updates, advertisements etc. have become an integral part of our daily routine. Thus, there is a need to build an automated system to summarize such large documents of text in order to save time and effort. Although, there are summarizers for languages such as English since the work has started in the 1950s and at present has led it up to a matured stage but there are several languages that still need special attention such as Punjabi language. The Punjabi language is highly rich in morphological structure as compared to English and other foreign languages. In this work, we provide three phase extractive summarization methodology using neural networks. It induces compendious summary of Punjabi single text document. The methodology incorporates pre-processing phase that cleans the text; processing phase that extracts statistical and linguistic features; and classification phase. The classification based neural network applies an activation function- sigmoid and weighted error reduction-gradient descent optimization to generate the resultant output summary. The proposed summarization system is applied over monolingual Punjabi text corpus from Indian languages corpora initiative phase-II. The precision, recall and F-measure are achieved as 90.0%, 89.28% an 89.65% respectively which is reasonably good in comparison to the performance of other existing Indian languages" summarizers.This research is partially funded by the Ministry of Economy, Industry and Competitiveness, Spain (CSO2017-86747-R)

Deep Cellular Recurrent Neural Architecture for Efficient Multidimensional Time-Series Data Processing

Efficient processing of time series data is a fundamental yet challenging problem in pattern recognition. Though recent developments in machine learning and deep learning have enabled remarkable improvements in processing large scale datasets in many application domains, most are designed and regulated to handle inputs that are static in time. Many real-world data, such as in biomedical, surveillance and security, financial, manufacturing and engineering applications, are rarely static in time, and demand models able to recognize patterns in both space and time. Current machine learning (ML) and deep learning (DL) models adapted for time series processing tend to grow in complexity and size to accommodate the additional dimensionality of time. Specifically, the biologically inspired learning based models known as artificial neural networks that have shown extraordinary success in pattern recognition, tend to grow prohibitively large and cumbersome in the presence of large scale multi-dimensional time series biomedical data such as EEG. Consequently, this work aims to develop representative ML and DL models for robust and efficient large scale time series processing. First, we design a novel ML pipeline with efficient feature engineering to process a large scale multi-channel scalp EEG dataset for automated detection of epileptic seizures. With the use of a sophisticated yet computationally efficient time-frequency analysis technique known as harmonic wavelet packet transform and an efficient self-similarity computation based on fractal dimension, we achieve state-of-the-art performance for automated seizure detection in EEG data. Subsequently, we investigate the development of a novel efficient deep recurrent learning model for large scale time series processing. For this, we first study the functionality and training of a biologically inspired neural network architecture known as cellular simultaneous recurrent neural network (CSRN). We obtain a generalization of this network for multiple topological image processing tasks and investigate the learning efficacy of the complex cellular architecture using several state-of-the-art training methods. Finally, we develop a novel deep cellular recurrent neural network (CDRNN) architecture based on the biologically inspired distributed processing used in CSRN for processing time series data. The proposed DCRNN leverages the cellular recurrent architecture to promote extensive weight sharing and efficient, individualized, synchronous processing of multi-source time series data. Experiments on a large scale multi-channel scalp EEG, and a machine fault detection dataset show that the proposed DCRNN offers state-of-the-art recognition performance while using substantially fewer trainable recurrent units

Residential Demand Side Management model, optimization and future perspective: A review

The residential load sector plays a vital role in terms of its impact on overall power balance, stability, and efficient power management. However, the load dynamics of the energy demand of residential users are always nonlinear, uncontrollable, and inelastic concerning power grid regulation and management. The integration of distributed generations (DGs) and advancement of information and communication technology (ICT) even though handles the related issues and challenges up to some extent, till the flexibility, energy management and scheduling with better planning are necessary for the residential sector to achieve better grid stability and efficiency. To address these issues, it is indispensable to analyze the demand-side management (DSM) for the complex residential sector considering various operational constraints, objectives, identifying various factors that affect better planning, scheduling, and management, to project the key features of various approaches and possible future research directions. This review has been done based on the related literature to focus on modeling, optimization methods, major objectives, system operation constraints, dominating factors impacting overall system operation, and possible solutions enhancing residential DSM operation. Gaps in future research and possible prospects have been discussed briefly to give a proper insight into the current implementation of DSM. This extensive review of residential DSM will help all the researchers in this area to innovate better energy management strategies and reduce the effect of system uncertainties, variations, and constraints

Optimal Coordination of Directional Overcurrent Relays Using Hybrid Firefly–Genetic Algorithm

© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY), https://creativecommons.org/licenses/by/4.0/The application of directional overcurrent relays (DOCRs) plays an important role in protecting power systems and ensuring their safe, reliable, and efficient operation. However, coordinating DOCRs involves solving a highly constrained and nonlinear optimization problem. The primary objective of optimization is to minimize the total operating time of DOCRs by determining the optimal values for decision variables such as the time multiplier setting (TMS) and plug setting (PS). This article presents an efficient hybrid optimization algorithm that combines the modified firefly algorithm and genetic algorithm to achieve improved solutions. First, this study modifies the firefly algorithm to obtain a global solution by updating the firefly’s brightness and to prevent the distance between the individual fireflies from being too far. Additionally, the randomized movements are controlled to produce a high convergence rate. Second, the optimization problem is solved using the genetic algorithm. Finally, the solution obtained from the modified firefly algorithm is used as the initial population for the genetic algorithm. The proposed algorithms have been tested on the IEEE 3-bus, 8-bus, 9-bus and 15-bus networks. The results indicate the effectiveness and superiority of the proposed algorithms in minimizing the total operating time of DOCRs compared with other optimization methods presented in the literature.Peer reviewe

Nature-inspired algorithms for solving some hard numerical problems

Optimisation is a branch of mathematics that was developed to find the optimal solutions, among all the possible ones, for a given problem. Applications of optimisation techniques are currently employed in engineering, computing, and industrial problems. Therefore, optimisation is a very active research area, leading to the publication of a large number of methods to solve specific problems to its optimality. This dissertation focuses on the adaptation of two nature inspired algorithms that, based on optimisation techniques, are able to compute approximations for zeros of polynomials and roots of non-linear equations and systems of non-linear equations. Although many iterative methods for finding all the roots of a given function already exist, they usually require: (a) repeated deflations, that can lead to very inaccurate results due to the problem of accumulating rounding errors, (b) good initial approximations to the roots for the algorithm converge, or (c) the computation of first or second order derivatives, which besides being computationally intensive, it is not always possible. The drawbacks previously mentioned served as motivation for the use of Particle Swarm Optimisation (PSO) and Artificial Neural Networks (ANNs) for root-finding, since they are known, respectively, for their ability to explore high-dimensional spaces (not requiring good initial approximations) and for their capability to model complex problems. Besides that, both methods do not need repeated deflations, nor derivative information. The algorithms were described throughout this document and tested using a test suite of hard numerical problems in science and engineering. Results, in turn, were compared with several results available on the literature and with the well-known Durand–Kerner method, depicting that both algorithms are effective to solve the numerical problems considered.A Optimização é um ramo da matemática desenvolvido para encontrar as soluções óptimas, de entre todas as possíveis, para um determinado problema. Actualmente, são várias as técnicas de optimização aplicadas a problemas de engenharia, de informática e da indústria. Dada a grande panóplia de aplicações, existem inúmeros trabalhos publicados que propõem métodos para resolver, de forma óptima, problemas específicos. Esta dissertação foca-se na adaptação de dois algoritmos inspirados na natureza que, tendo como base técnicas de optimização, são capazes de calcular aproximações para zeros de polinómios e raízes de equações não lineares e sistemas de equações não lineares. Embora já existam muitos métodos iterativos para encontrar todas as raízes ou zeros de uma função, eles usualmente exigem: (a) deflações repetidas, que podem levar a resultados muito inexactos, devido ao problema da acumulação de erros de arredondamento a cada iteração; (b) boas aproximações iniciais para as raízes para o algoritmo convergir, ou (c) o cálculo de derivadas de primeira ou de segunda ordem que, além de ser computacionalmente intensivo, para muitas funções é impossível de se calcular. Estas desvantagens motivaram o uso da Optimização por Enxame de Partículas (PSO) e de Redes Neurais Artificiais (RNAs) para o cálculo de raízes. Estas técnicas são conhecidas, respectivamente, pela sua capacidade de explorar espaços de dimensão superior (não exigindo boas aproximações iniciais) e pela sua capacidade de modelar problemas complexos. Além disto, tais técnicas não necessitam de deflações repetidas, nem do cálculo de derivadas. Ao longo deste documento, os algoritmos são descritos e testados, usando um conjunto de problemas numéricos com aplicações nas ciências e na engenharia. Os resultados foram comparados com outros disponíveis na literatura e com o método de Durand–Kerner, e sugerem que ambos os algoritmos são capazes de resolver os problemas numéricos considerados

A review of networked microgrid protection: Architectures, challenges, solutions, and future trends

The design and selection of advanced protection schemes have become essential for the reliable and secure operation of networked microgrids. Various protection schemes that allow the correct operation of microgrids have been proposed for individual systems in different topologies and connections. Nevertheless, the protection schemes for networked microgrids are still in development, and further research is required to design and operate advanced protection in interconnected systems. The interconnection of these microgrids in different nodes with various interconnection technologies increases the fault occurrence and complicates the protection operation. This paper aims to point out the challenges in developing protection for networked microgrids, potential solutions, and research areas that need to be addressed for their development. First, this article presents a systematic analysis of the different microgrid clusters proposed since 2016, including several architectures of networked microgrids, operation modes, components, and utilization of renewable sources, which have not been widely explored in previous review papers. Second, the paper presents a discussion on the protection systems currently available for microgrid clusters, current challenges, and solutions that have been proposed for these systems. Finally, it discusses the trend of protection schemes in networked microgrids and presents some conclusions related to implementation

Component-wise analysis of metaheuristic algorithms for novel fuzzy-meta classifier

Metaheuristic research has proposed promising results in science, business, and engineering problems. But, mostly high-level analysis is performed on metaheuristic performances. This leaves several critical questions unanswered due to black-box issue that does not reveal why certain metaheuristic algorithms performed better on some problems and not on others. To address the significant gap between theory and practice in metaheuristic research, this study proposed in-depth analysis approach using component-view of metaheuristic algorithms and diversity measurement for determining exploration and exploitation abilities. This research selected three commonly used swarm-based metaheuristic algorithms – Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), and Cuckoo Search (CS) – to perform component-wise analysis. As a result, the study able to address premature convergence problem in PSO, poor exploitation in ABC, and imbalanced exploration and exploitation issue in CS. The proposed improved PSO (iPSO), improved ABC (iABC), and improved CS (iCS) outperformed standard algorithms and variants from existing literature, as well as, Grey Wolf Optimization (GWO) and Animal Migration Optimization (AMO) on ten numerical optimization problems with varying modalities. The proposed iPSO, iABC, and iCS were then employed on proposed novel Fuzzy-Meta Classifier (FMC) which offered highly reduced model complexity and high accuracy as compared to Adaptive Neuro-Fuzzy Inference System (ANFIS). The proposed three-layer FMC produced efficient rules that generated nearly 100% accuracies on ten different classification datasets, with significantly reduced number of trainable parameters and number of nodes in the network architecture, as compared to ANFIS