Multi-population-based differential evolution algorithm for optimization problems

A differential evolution (DE) algorithm is an evolutionary algorithm for optimization problems over a continuous domain. To solve high dimensional global optimization problems, this work investigates the performance of differential evolution algorithms under a multi-population strategy. The original DE algorithm generates an initial set of suitable solutions. The multi-population strategy divides the set into several subsets. These subsets evolve independently and connect with each other according to the DE algorithm. This helps in preserving the diversity of the initial set. Furthermore, a comparison of combination of different mutation techniques on several optimization algorithms is studied to verify their performance. Finally, the computational results on the arbitrarily generated experiments, reveal some interesting relationship between the number of subpopulations and performance of the DE. Centralized charging of electric vehicles (EVs) based on battery swapping is a promising strategy for their large-scale utilization in power systems. In this problem, the above algorithm is designed to minimize total charging cost, as well as to reduce power loss and voltage deviation of power networks. The resulting algorithm and several others are executed on an IEEE 30-bus test system, and the results suggest that the proposed algorithm is one of effective and promising methods for optimal EV centralized charging

Economic load dispatch solutions considering multiple fuels for thermal units and generation cost of wind turbines

In this paper, economic load dispatch (ELD) problem is solved by applying a suggested improved particle swarm optimization (IPSO) for reaching the lowest total power generation cost from wind farms (WFs) and thermal units (TUs). The suggested IPSO is the modified version of Particle swarm optimization (PSO) by changing velocity and position updates. The five best solutions are employed to replace the so-far best position of each particle in velocity update mechanism and the five best solutions are used to replace previous position of each particle in position update. In addition, constriction factor is also used in the suggested IPSO. PSO, constriction factor-based PSO (CFPSO) and bat optimization algorithm (BOA) are also run for comparisons. Two systems are used to run the four methods. The first system is comprised of nine TUs with multiple fuels and one wind farm. The second system is comprised of eight TUs with multiple fuels and two WFs. From the comparisons of results, IPSO is much more powerful than three others and it can find optimal power generation with the lowest total power generation cost

A Survey on Adaptation Strategies for Mutation and Crossover Rates of Differential Evolution Algorithm

Differential Evolution (DE), the well-known optimization algorithm, is a tool under the roof of Evolutionary Algorithms (EAs) for solving non-linear and non-differential optimization problems. DE has many qualities in its hand, which are attributing to its popularity. DE also is known for its simplicity in solving the given problem with few control parameters: the population size (NP), the mutation rate (F) and the crossover rate (Cr). To avoid the difficulty involved in setting of suitable values for NP, F and Cr many parameter adaptation strategies are proposed in the literature. This paper is to present the working principle of the parameter adaptation strategies of F and Cr. The adaptation strategies are categorized based on the logic used by the authors, and clear insights about all the categories are presented

Study and analysis of the use of flexibility in local electricity markets

In this work an introduction to Local Electricity Markets (LEM) was done and afterwards evolutionary algorithms (EAs) such as Differential Evolution (DE), HybridAdaptive Differential Evolution (HyDE), Hybrid-Adaptive Differential Evolution with Decay Function (HyDE-DF) and Vortex Search (VS) were applied to a market model in order to test its efficiency and scalability. Then, the market model was expanded adding a network model from the BISITE laboratory and again tests using the evolutionary algorithms were performed. In more detail, first a literature review is done about distributed generation, load flexibility, LEM and EAs. Then a cost optimization problem in Local Electricity Markets is analyzed considering fixed-term flexibility contracts between the distribution system operator (DSO) and aggregators. In this market structure, the DSO procures flexibility while aggregators of different types (e.g., conventional demand response or thermo-load aggregators) offer the service. Its then solved the proposed model using evolutionary algorithms based on the well-known differential evolution (DE). First, a parameter-tuning analysis is done to assess the impact of the DE parameters on the quality of solutions to the problem. Later, after finding the best set of parameters for the “tuned” DE strategies, we compare their performance with other self-adaptive parameter algorithms, namely the HyDE, HyDE-DF, and VS. Overall, the algorithms are able to find near-optimal solutions to the problem and can be considered an alternative solver for more complex instances of the model. After this a network model, from BISITE laboratory, is added to the problem and new analyses are performed using evolutionary algorithms along with MATPOWER power flow algorithms. Results show that evolutionary algorithms support from simple to complex problems, that is, it is a scalable algorithm, and with these results it is possible to perform analyses of the proposed market model.Neste trabalho foi feita uma introdução aos Mercados Locais de Eletricidade (MLE) e posteriormente foram aplicados algoritmos evolutivos (AEs) como Differential Evolution (DE), Hybrid-Adaptive Differential Evolution (HyDE), Hybrid-Adaptive Differential Evolution with Decay Function (HyDE-DF) e Vortex Search (VS) a um modelo de mercado a fim de testar a sua eficiência e escalabilidade. O modelo de mercado foi expandido adicionando uma rede do laboratório BISITE e novamente foram realizados testes usando os algoritmos evolutivos. Em mais detalhe, no trabalho primeiro foi feita uma revisão bibliográfica sobre geração distribuída, flexibilidade de carga, MLE e AEs. É analisado um problema de optimização de custos nos MLE, considerando contratos de flexibilidade a prazo fixo entre os agentes. O distribuidor adquire flexibilidade enquanto que os agregadores de diferentes tipos (por exemplo, os agregadores convencionais de resposta à procura ou de carga térmica) oferecem o serviço. Resolve-se depois o modelo proposto utilizando AEs baseados na conhecida DE. É feita uma análise de afinação de parâmetros para avaliar o impacto dos parâmetros DE na qualidade das soluções para o problema. Após encontrarmos o melhor conjunto de parâmetros para as estratégias DE "afinadas", comparamos o seu desempenho com outros algoritmos de parâmetros autoadaptáveis, nomeadamente o HyDE, HyDE-DF, e VS. Globalmente, os algoritmos são capazes de encontrar soluções quase óptimas para o problema e podem ser considerados um solucionador alternativo para instâncias mais complexas do modelo. Então um modelo de rede, do laboratório BISITE, é acrescentado ao problema e novas análises são realizadas utilizando algoritmos evolutivos juntamente com algoritmos de fluxo de potência MATPOWER. Os resultados mostram que os algoritmos evolutivos suportam desde problemas simples a complexos, ou seja, é um algoritmo escalável, e com estes resultados é possível realizar análises do modelo de mercado proposto

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field