Un algoritmo basado en células T para resolver problemas de despacho de energía económico y dinámico

This paper presents the artificial immune system IA DED (Immune Algorithm Dynamic Economic Dispatch) to solve the Dynamic Economic Dispatch (DED) problem and the Dynamic Economic Emission Dispatch (DEED) problem. Our approach considers these as dynamic problems whose constraints change over time. IA DED is inspired on the activation process that T cells suffer in order to find partial solutions. The proposed approach is validated using several DED problems taken from specialized literature and one DEED problem. The latter is addressed by transforming a multi-objective problem into a single-objective problem by using a linear aggregating function that combines the (weighted) values of the objectives into a single scalar value. Our results are compared with respect to those obtained by other approaches taken from the specialized literature. We also provide some statistical analysis in order to determine the sensitivity of the performance of our proposed approach to its parameters. Part of this work was presented at the XXV Argentine Congress of Computer Science (CACIC), 2019.Facultad de Informátic

Un algoritmo basado en células T para resolver problemas de despacho de energía económico y dinámico

This paper presents the artificial immune system IA DED (Immune Algorithm Dynamic Economic Dispatch) to solve the Dynamic Economic Dispatch (DED) problem and the Dynamic Economic Emission Dispatch (DEED) problem. Our approach considers these as dynamic problems whose constraints change over time. IA DED is inspired on the activation process that T cells suffer in order to find partial solutions. The proposed approach is validated using several DED problems taken from specialized literature and one DEED problem. The latter is addressed by transforming a multi-objective problem into a single-objective problem by using a linear aggregating function that combines the (weighted) values of the objectives into a single scalar value. Our results are compared with respect to those obtained by other approaches taken from the specialized literature. We also provide some statistical analysis in order to determine the sensitivity of the performance of our proposed approach to its parameters. Part of this work was presented at the XXV Argentine Congress of Computer Science (CACIC), 2019.Facultad de Informátic

Un algoritmo basado en células T para resolver problemas de despacho de energía económico y dinámico

This paper presents the artificial immune system IA DED (Immune Algorithm Dynamic Economic Dispatch) to solve the Dynamic Economic Dispatch (DED) problem and the Dynamic Economic Emission Dispatch (DEED) problem. Our approach considers these as dynamic problems whose constraints change over time. IA DED is inspired on the activation process that T cells suffer in order to find partial solutions. The proposed approach is validated using several DED problems taken from specialized literature and one DEED problem. The latter is addressed by transforming a multi-objective problem into a single-objective problem by using a linear aggregating function that combines the (weighted) values of the objectives into a single scalar value. Our results are compared with respect to those obtained by other approaches taken from the specialized literature. We also provide some statistical analysis in order to determine the sensitivity of the performance of our proposed approach to its parameters. Part of this work was presented at the XXV Argentine Congress of Computer Science (CACIC), 2019.Facultad de Informátic

Process Knowledge-guided Autonomous Evolutionary Optimization for Constrained Multiobjective Problems

Various real-world problems can be attributed to constrained multi-objective optimization problems. Although there are various solution methods, it is still very challenging to automatically select efficient solving strategies for constrained multi-objective optimization problems. Given this, a process knowledge-guided constrained multi-objective autonomous evolutionary optimization method is proposed. Firstly, the effects of different solving strategies on population states are evaluated in the early evolutionary stage. Then, the mapping model of population states and solving strategies is established. Finally, the model recommends subsequent solving strategies based on the current population state. This method can be embedded into existing evolutionary algorithms, which can improve their performances to different degrees. The proposed method is applied to 41 benchmarks and 30 dispatch optimization problems of the integrated coal mine energy system. Experimental results verify the effectiveness and superiority of the proposed method in solving constrained multi-objective optimization problems.The National Key R&D Program of China, the National Natural Science Foundation of China, Shandong Provincial Natural Science Foundation, Fundamental Research Funds for the Central Universities and the Open Research Project of The Hubei Key Laboratory of Intelligent Geo-Information Processing.http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235hj2023Electrical, Electronic and Computer Engineerin

Flower pollination algorithm parameters tuning

The flower pollination algorithm (FPA) is a highly efficient metaheuristic optimization algorithm that is inspired by the pollination process of flowering species. FPA is characterised by simplicity in its formulation and high computational performance. Previous studies on FPA assume fixed parameter values based on empirical observations or experimental comparisons of limited scale and scope. In this study, a comprehensive effort is made to identify appropriate values of the FPA parameters that maximize its computational performance. To serve this goal, a simple non-iterative, single-stage sampling tuning method is employed, oriented towards practical applications of FPA. The tuning method is applied to the set of 28 functions specified in IEEE-CEC'13 for real-parameter single-objective optimization problems. It is found that the optimal FPA parameters depend significantly on the objective functions, the problem dimensions and affordable computational cost. Furthermore, it is found that the FPA parameters that minimize mean prediction errors do not always offer the most robust predictions. At the end of this study, recommendations are made for setting the optimal FPA parameters as a function of problem dimensions and affordable computational cost. [Abstract copyright: © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021.

Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling

Existing multi-objective Generator Maintenance Scheduling (GMS) models have considered unit commitment problem together with unit maintenance problem based on a periodic maintenance strategy. These models are inefficient because unit commitment does not undergo maintenance and periodic strategy cannot be applied on different types of generators. Present graph models cannot generate schedule for the multi-objective GMS models while existing Pareto Ant Colony System (PACS) algorithms were not able to consider the two problems separately. A multi-objective PACS algorithm based on sequential strategy which considers unit commitment and GMS problem separately is proposed to obtain solution for a proposed GMS model. A graph model is developed to generate the units’ maintenance schedule. The Taguchi and Grey Relational Analysis methods are proposed to tune the PACS’s parameters. The IEEE RTS 26, 32 and 36-unit dataset systems were used in the performance evaluation of the PACS algorithm. The performance of PACS algorithm was compared against four benchmark multi-objective algorithms including the Nondominated Sorting Genetic, Strength Pareto Evolutionary, Simulated Annealing, and Particle Swarm Optimization using the metrics grey relational grade (GRG), coverage, distance to Pareto front, Pareto spread, and number of non-dominated solutions. Friedman test was performed to determine the significance of the results. The multiobjective GMS model is superior than the benchmark model in producing the GMS schedule in terms of reliability, and violation objective functions with an average improvement between 2.68% and 92.44%. Friedman test using GRG metric shows significant better performance (p-values<0.05) for PACS algorithm compared to benchmark algorithms. The proposed models and algorithm can be used to solve the multi-objective GMS problem while the new parameters’ values can be used to obtain optimal or near optimal maintenance scheduling of generators. The proposed models and algorithm can be applied on different types of generating units to minimize the interruptions of energy and extend their lifespan

Intelligent energy management system - techniques and methods

ABSTRACT Our environment is an asset to be managed carefully and is not an expendable resource to be taken for granted. The main original contribution of this thesis is in formulating intelligent techniques and simulating case studies to demonstrate the significance of the present approach for achieving a low carbon economy. Energy boosts crop production, drives industry and increases employment. Wise energy use is the first step to ensuring sustainable energy for present and future generations. Energy services are essential for meeting internationally agreed development goals. Energy management system lies at the heart of all infrastructures from communications, economy, and society’s transportation to the society. This has made the system more complex and more interdependent. The increasing number of disturbances occurring in the system has raised the priority of energy management system infrastructure which has been improved with the aid of technology and investment; suitable methods have been presented to optimize the system in this thesis. Since the current system is facing various problems from increasing disturbances, the system is operating on the limit, aging equipments, load change etc, therefore an improvement is essential to minimize these problems. To enhance the current system and resolve the issues that it is facing, smart grid has been proposed as a solution to resolve power problems and to prevent future failures. This thesis argues that smart grid consists of computational intelligence and smart meters to improve the reliability, stability and security of power. In comparison with the current system, it is more intelligent, reliable, stable and secure, and will reduce the number of blackouts and other failures that occur on the power grid system. Also, the thesis has reported that smart metering is technically feasible to improve energy efficiency. In the thesis, a new technique using wavelet transforms, floating point genetic algorithm and artificial neural network based hybrid model for gaining accurate prediction of short-term load forecast has been developed. Adopting the new model is more accuracy than radial basis function network. Actual data has been used to test the proposed new method and it has been demonstrated that this integrated intelligent technique is very effective for the load forecast. Choosing the appropriate algorithm is important to implement the optimization during the daily task in the power system. The potential for application of swarm intelligence to Optimal Reactive Power Dispatch (ORPD) has been shown in this thesis. After making the comparison of the results derived from swarm intelligence, improved genetic algorithm and a conventional gradient-based optimization method, it was concluded that swam intelligence is better in terms of performance and precision in solving optimal reactive power dispatch problems

A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings

Memetic algorithms are a class of well-studied metaheuristics which combine evolutionary algorithms and local search techniques. A meme represents contagious piece of information in an adaptive information sharing system. The canonical memetic algorithm uses a fixed meme, denoting a hill climbing operator, to improve each solution in a population during the evolutionary search process. Given global parameters and multiple parametrised operators, adaptation often becomes a crucial constituent in the design of MAs. In this study, a self-adaptive self-configuring steady-state multimeme memetic algorithm (SSMMA) variant is proposed. Along with the individuals (solutions), SSMMA co-evolves memes, encoding the utility score for each algorithmic component choice and relevant parameter setting option. An individual uses tournament selection to decide which operator and parameter setting to employ at a given step. The performance of the proposed algorithm is evaluated on six combinatorial optimisation problems from a cross-domain heuristic search benchmark. The results indicate the success of SSMMA when compared to the static Mas as well as widely used self-adaptive Multimeme Memetic Algorithm from the scientific literature

Improving the Response Time of M-Learning and Cloud Computing Environments Using a Dominant Firefly Approach

© 2013 IEEE. Mobile learning (m-learning) is a relatively new technology that helps students learn and gain knowledge using the Internet and Cloud computing technologies. Cloud computing is one of the recent advancements in the computing field that makes Internet access easy to end users. Many Cloud services rely on Cloud users for mapping Cloud software using virtualization techniques. Usually, the Cloud users' requests from various terminals will cause heavy traffic or unbalanced loads at the Cloud data centers and associated Cloud servers. Thus, a Cloud load balancer that uses an efficient load balancing technique is needed in all the cloud servers. We propose a new meta-heuristic algorithm, named the dominant firefly algorithm, which optimizes load balancing of tasks among the multiple virtual machines in the Cloud server, thereby improving the response efficiency of Cloud servers that concomitantly enhances the accuracy of m-learning systems. Our methods and findings used to solve load imbalance issues in Cloud servers, which will enhance the experiences of m-learning users. Specifically, our findings such as Cloud-Structured Query Language (SQL), querying mechanism in mobile devices will ensure users receive their m-learning content without delay; additionally, our method will demonstrate that by applying an effective load balancing technique would improve the throughput and the response time in mobile and cloud environments