A novel approach for coordinated design of TCSC controller and PSS for improving dynamic stability in power systems

The purpose of this article is to present a novel strategy for the coordinated design of the Thyristor Controlled Series Compensator (TCSC) controller and the Power System Stabilizer (PSS). A time domain objective function that is based on an optimization problem has been defined. This objective function takes into account not only the influence that disturbances have on the mechanical power, but also, and this is more accurately the case, the impact that disturbances have on the reference voltage. When the objective function is minimized, potential disturbances are quickly mitigated, and the deviation of the speed of the generator's rotor is limited; as a result, the system's stability is ultimately improved. Particle Swarm Optimization (PSO) and the Shuffled Frog Leaping Algorithm are both components of a composite strategy that is utilized in the process of determining the optimal controller parameters. (SFLA). An independent controller design as well as a collaborative controller design utilizing PSS and TCSC are developed, which enables a direct evaluation of the functions performed by each. The presentation of the eigenvalue analysis and the findings of the nonlinear simulation can help to provide a better understanding of the efficacy of the outcomes. The findings indicate that the coordinated design is able to successfully damp low-frequency oscillations that are caused by a variety of disturbances, such as changes in the mechanical power input and the setting of the reference voltage, and significantly enhance system stability in power systems that are connected weekly

Resource allocation technique for powerline network using a modified shuffled frog-leaping algorithm

Resource allocation (RA) techniques should be made efficient and optimized in order to enhance the QoS (power & bit, capacity, scalability) of high-speed networking data applications. This research attempts to further increase the efficiency towards near-optimal performance. RA’s problem involves assignment of subcarriers, power and bit amounts for each user efficiently. Several studies conducted by the Federal Communication Commission have proven that conventional RA approaches are becoming insufficient for rapid demand in networking resulted in spectrum underutilization, low capacity and convergence, also low performance of bit error rate, delay of channel feedback, weak scalability as well as computational complexity make real-time solutions intractable. Mainly due to sophisticated, restrictive constraints, multi-objectives, unfairness, channel noise, also unrealistic when assume perfect channel state is available. The main goal of this work is to develop a conceptual framework and mathematical model for resource allocation using Shuffled Frog-Leap Algorithm (SFLA). Thus, a modified SFLA is introduced and integrated in Orthogonal Frequency Division Multiplexing (OFDM) system. Then SFLA generated random population of solutions (power, bit), the fitness of each solution is calculated and improved for each subcarrier and user. The solution is numerically validated and verified by simulation-based powerline channel. The system performance was compared to similar research works in terms of the system’s capacity, scalability, allocated rate/power, and convergence. The resources allocated are constantly optimized and the capacity obtained is constantly higher as compared to Root-finding, Linear, and Hybrid evolutionary algorithms. The proposed algorithm managed to offer fastest convergence given that the number of iterations required to get to the 0.001% error of the global optimum is 75 compared to 92 in the conventional techniques. Finally, joint allocation models for selection of optima resource values are introduced; adaptive power and bit allocators in OFDM system-based Powerline and using modified SFLA-based TLBO and PSO are propose

Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations

In recent years, a great variety of nature- and bio-inspired algorithms has been reported in the literature. This algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field.Comment: 76 pages, 6 figure

Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the `Rush to Heuristics'

In the power and energy systems area, a progressive increase of literature contributions that contain applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods that are based on weak comparisons. This ‘rush to heuristics’ does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems and aims at providing a comprehensive view of the main issues that concern the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls that are found in literature contributions are identified, and specific guidelines are provided regarding how to prepare sound contributions on the application of metaheuristic algorithms to specific problems

The Application of Nature-inspired Metaheuristic Methods for Optimising Renewable Energy Problems and the Design of Water Distribution Networks

This work explores the technical challenges that emerge when applying bio-inspired optimisation methods to real-world engineering problems. A number of new heuristic algorithms were proposed and tested to deal with these challenges. The work is divided into three main dimensions: i) One of the most significant industrial optimisation problems is optimising renewable energy systems. Ocean wave energy is a promising technology for helping to meet future growth in global energy demand. However, the current technologies of wave energy converters (WECs) are not fully developed because of technical engineering and design challenges. This work proposes new hybrid heuristics consisting of cooperative coevolutionary frameworks and neuro-surrogate optimisation methods for optimising WECs problem in three domains, including position, control parameters, and geometric parameters. Our problem-specific algorithms perform better than existing approaches in terms of higher quality results and the speed of convergence. ii) The second part applies search methods to the optimization of energy output in wind farms. Wind energy has key advantages in terms of technological maturity, cost, and life-cycle greenhouse gas emissions. However, designing an accurate local wind speed and power prediction is challenging. We propose two models for wind speed and power forecasting for two wind farms located in Sweden and the Baltic Sea by a combination of recurrent neural networks and evolutionary search algorithms. The proposed models are superior to other applied machine learning methods. iii) Finally, we investigate the design of water distribution systems (WDS) as another challenging real-world optimisation problem. WDS optimisation is demanding because it has a high-dimensional discrete search space and complex constraints. A hybrid evolutionary algorithm is suggested for minimising the cost of various water distribution networks and for speeding up the convergence rate of search.Thesis (Ph.D.) -- University of Adelaide, School of Computer Science, 202

A Methodological Approach to Knowledge-Based Engineering Systems for Manufacturing

A survey of implementations of the knowledge-based engineering approach in different technological sectors is presented. The main objectives and techniques of examined applications are pointed out to illustrate the trends and peculiarities for a number of manufacturing field. Existing methods for the development of these engineering systems are then examined in order to identify critical aspects when applied to manufacturing. A new methodological approach is proposed to overcome some specific limitations that emerged from the above-mentioned survey. The aim is to provide an innovative method for the implementation of knowledge-based engineering applications in the field of industrial production. As a starting point, the field of application of the system is defined using a spatial representation. The conceptual design phase is carried out with the aid of a matrix structure containing the most relevant elements of the system and their relations. In particular, objectives, descriptors, inputs and actions are defined and qualified using categorical attributes. The proposed method is then applied to three case studies with different locations in the applicability space. All the relevant elements of the detailed implementation of these systems are described. The relations with assumptions made during the design are highlighted to validate the effectiveness of the proposed method. The adoption of case studies with notably different applications also reveals the versatility in the application of the method

Diseño óptimo de sistemas de distribución de agua mediante Agent Swarm Optimization

La necesidad de hacer eficientes y económicamente viables las grandes inversiones relacionadas con la construcción y el mantenimiento de las redes de abastecimiento de agua, hace que se preste especial atención al diseño de este tipo de redes. Concebir soluciones económicamente optimizadas y que garanticen un adecuado funcionamiento de los sistemas de distribución de agua (SDA), tomando en cuenta la fiabilidad de la red para ofrecer sus servicios, incluso ante posibles condiciones de fallo, es uno de los grandes retos que han tenido desde hace muchos años varios hombres y mujeres de ciencias que han trabajado el tema. Se impone obtener los mayores beneficios con los menores costes. En el diseño óptimo de sistemas de distribución de agua, como muchos otros problemas de optimización, los objetivos a optimizar están frecuentemente en conflicto unos con otros. Ante este hecho, más conveniente que encontrar una única solución, es elaborar un conjunto de soluciones que representen el mejor compromiso posible entre todos los objetivos involucrados. En los últimos 15 años, varios investigadores se han desviado de las técnicas tradicionales de optimización basadas en la programación lineal y no lineal, para dirigirse hacia la implementación de Algoritmos Evolutivos. En esta investigación se proponen soluciones para el diseño óptimo de SDA basadas en el empleo de una generalización del algoritmo Particle Swarm Optimization (PSO) orientada a la inteligencia artificial distribuida tomando como base a los sistemas multi-agente (MA). El algoritmo final propuesto recibió la denominación de Agent Swarm Optimization (ASO) El algoritmo ASO se aprovecha de las ventajas de la computación paralela y distribuida para hacer interactuar diversas poblaciones de agentes que pueden tener comportamientos diferentes. Su versatilidad da origen a su principal fortaleza: la introducción de agentes con reglas de comportamiento específicas para la mejor solución de un problema, que problema, que trabajan de manera conjunta con algoritmos evolutivos de carácter general como PSO, Algoritmos Genéticos, Ant Colony Optimization, etcétera.Montalvo Arango, I. (2011). Diseño óptimo de sistemas de distribución de agua mediante Agent Swarm Optimization [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/14858Palanci

Simulated Annealing

The book contains 15 chapters presenting recent contributions of top researchers working with Simulated Annealing (SA). Although it represents a small sample of the research activity on SA, the book will certainly serve as a valuable tool for researchers interested in getting involved in this multidisciplinary field. In fact, one of the salient features is that the book is highly multidisciplinary in terms of application areas since it assembles experts from the fields of Biology, Telecommunications, Geology, Electronics and Medicine

From metaheuristics to learnheuristics: Applications to logistics, finance, and computing

Un gran nombre de processos de presa de decisions en sectors estratègics com el transport i la producció representen problemes NP-difícils. Sovint, aquests processos es caracteritzen per alts nivells d'incertesa i dinamisme. Les metaheurístiques són mètodes populars per a resoldre problemes d'optimització difícils en temps de càlcul raonables. No obstant això, sovint assumeixen que els inputs, les funcions objectiu, i les restriccions són deterministes i conegudes. Aquests constitueixen supòsits forts que obliguen a treballar amb problemes simplificats. Com a conseqüència, les solucions poden conduir a resultats pobres. Les simheurístiques integren la simulació a les metaheurístiques per resoldre problemes estocàstics d'una manera natural. Anàlogament, les learnheurístiques combinen l'estadística amb les metaheurístiques per fer front a problemes en entorns dinàmics, en què els inputs poden dependre de l'estructura de la solució. En aquest context, les principals contribucions d'aquesta tesi són: el disseny de les learnheurístiques, una classificació dels treballs que combinen l'estadística / l'aprenentatge automàtic i les metaheurístiques, i diverses aplicacions en transport, producció, finances i computació.Un gran número de procesos de toma de decisiones en sectores estratégicos como el transporte y la producción representan problemas NP-difíciles. Frecuentemente, estos problemas se caracterizan por altos niveles de incertidumbre y dinamismo. Las metaheurísticas son métodos populares para resolver problemas difíciles de optimización de manera rápida. Sin embargo, suelen asumir que los inputs, las funciones objetivo y las restricciones son deterministas y se conocen de antemano. Estas fuertes suposiciones conducen a trabajar con problemas simplificados. Como consecuencia, las soluciones obtenidas pueden tener un pobre rendimiento. Las simheurísticas integran simulación en metaheurísticas para resolver problemas estocásticos de una manera natural. De manera similar, las learnheurísticas combinan aprendizaje estadístico y metaheurísticas para abordar problemas en entornos dinámicos, donde los inputs pueden depender de la estructura de la solución. En este contexto, las principales aportaciones de esta tesis son: el diseño de las learnheurísticas, una clasificación de trabajos que combinan estadística / aprendizaje automático y metaheurísticas, y varias aplicaciones en transporte, producción, finanzas y computación.A large number of decision-making processes in strategic sectors such as transport and production involve NP-hard problems, which are frequently characterized by high levels of uncertainty and dynamism. Metaheuristics have become the predominant method for solving challenging optimization problems in reasonable computing times. However, they frequently assume that inputs, objective functions and constraints are deterministic and known in advance. These strong assumptions lead to work on oversimplified problems, and the solutions may demonstrate poor performance when implemented. Simheuristics, in turn, integrate simulation into metaheuristics as a way to naturally solve stochastic problems, and, in a similar fashion, learnheuristics combine statistical learning and metaheuristics to tackle problems in dynamic environments, where inputs may depend on the structure of the solution. The main contributions of this thesis include (i) a design for learnheuristics; (ii) a classification of works that hybridize statistical and machine learning and metaheuristics; and (iii) several applications for the fields of transport, production, finance and computing